Gathering of asynchronous robots with limited visibility
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
Circle formation of weak mobile robots
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Using eventually consistent compasses to gather memory-less mobile robots with limited visibility
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
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
Byzantine-Resilient Convergence in Oblivious Robot Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
SIROCCO'09 Proceedings of the 16th 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
Optimal grid exploration by asynchronous oblivious robots
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
In [4], the authors look at probabilistic bounds and solutions for the exploration of anonymous unoriented rings of any size by a cohort of robots. Considering identical, oblivious, and probabilistic robots, they show that at least four of them are necessary to solve the problem. Moreover, they give a randomized protocol for four robots working in any ring of size more than eight. Here we close the question of optimal (w.r.t. the cohort size) ring exploration by probabilistic robots. Indeed, we propose a protocol for four robots working in any ring of size less or equal to eight. Composing this protocol with the one in [4], we obtain a protocol for any ring-size.