Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Selected writings on computing: a personal perspective
Selected writings on computing: a personal perspective
Multiresolution Signal Decomposition: Transforms, Subbands, and Wavelets
Multiresolution Signal Decomposition: Transforms, Subbands, and Wavelets
Circle formation for oblivious anonymous mobile robots with no common sense of orientation
Proceedings of the second ACM international workshop on Principles of mobile computing
Cooperative Mobile Robotics: Antecedents and Directions
Autonomous Robots
Experiments in Realising Cooperation between Autonomous Mobile Robots
Proceedings of the 5th International Symposium on Experimental Robotics V
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Interaction and intelligent behavior
Interaction and intelligent behavior
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Local spreading algorithms for autonomous robot systems
Theoretical Computer Science
Self-deployment of mobile sensors on a ring
Theoretical Computer Science
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments
Algorithmic Aspects of Wireless Sensor Networks
A geometric approach to deploying robot swarms
Annals of Mathematics and Artificial Intelligence
Characterizing geometric patterns formable by oblivious anonymous mobile robots
Theoretical Computer Science
Convergence with limited visibility by asynchronous mobile robots
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Self-deployment algorithms for mobile sensors on a ring
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Distributed algorithms for barrier coverage using relocatable sensors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
This paper studies local algorithms for autonomous robot systems, namely, algorithms that use only information of the positions of a bounded number of their nearest neighbors. The paper focuses on the spreading problem. It defines measures for the quality of spreading, presents a local algorithm for the one-dimensional spreading problem, prove its convergence to the equally spaced configuration and discusses its convergence rate in the synchronous and semi-synchronous settings. It then presents a local algorithm achieving the exact equally spaced configuration in finite time in the synchronous setting, and proves it is time optimal for local algorithms. Finally, the paper also proposes an algorithm for the two-dimensional case and presents simulation results of its effectiveness