Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Gathering of Asynchronous Oblivious Robots with Limited Visibility
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
SIAM Journal on Computing
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Theoretical Computer Science
On the Inability of Gathering by Asynchronous Mobile Robots with Initial Movements
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Fault-Tolerant Flocking of Mobile Robots with Whole Formation Rotation
AINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Swing words to make circle formation quiescent
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Convergence with limited visibility by asynchronous mobile robots
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Local algorithms for autonomous robot systems
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Biangular circle formation by asynchronous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
On the feasibility of gathering by autonomous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Convergence with limited visibility by asynchronous mobile robots
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Local, self-organizing strategies for robotic formation problems
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Continuous local strategies for robotic formation problems
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Getting close without touching
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Energy-efficient strategies for building short chains of mobile robots locally
Theoretical Computer Science
| Hi-index | 0.00 |
Consider a community of simple autonomous robots freely moving in the plane. The robots are decentralized, asynchronous, deterministic without the common coordination system, identities, direct communication, memory of the past, but with the ability to sense the positions of the other robots. This paper presents a distributed algorithm for the convergence problem with limited visibility in 1-bounded asynchrony. The presented algorithm also solves the convergence problem with unlimited visibility in full asynchrony without the need for the multiplicity detection.