Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
Gathering asynchronous oblivious mobile robots in 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
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Theoretical Computer Science
Circle formation of weak mobile robots
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Asynchronous exclusive perpetual grid exploration without sense of direction
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
On the self-stabilization of mobile oblivious robots in uniform rings
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Optimal grid exploration by asynchronous oblivious robots
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
Theoretical Computer Science
Price of asynchrony in mobile agents computing
Theoretical Computer Science
Hi-index | 0.00 |
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the ability to sense their environment and take decisions based on their local view. Previous works in this weak scenario prove that k must not divide n for a deterministic solution to exist. Also, it is known that the minimum number of robots (either deterministic or probabilistic) to explore a ring of size n is 4. An upper bound of 17 robots holds in the deterministic case while 4 probabilistic robots are sufficient. In this paper, we close the complexity gap in the deterministic setting, by proving that no deterministic exploration is feasible with less than five robots, and that five robots are sufficient for any n that is coprime with five. Our protocol completes exploration in O(n) robot moves, which is also optimal.