Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Deterministic Rendezvous in Graphs
Algorithmica
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
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
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Exclusive perpetual ring exploration without chirality
DISC'10 Proceedings of the 24th international conference on Distributed computing
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the feasibility of gathering by autonomous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Gathering asynchronous oblivious mobile robots in a ring
ISAAC'06 Proceedings of the 17th 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
Mobile robots gathering algorithm with local weak multiplicity in rings
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Optimal deterministic ring exploration with oblivious asynchronous robots
SIROCCO'10 Proceedings of the 17th 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
Gathering of robots on anonymous grids without multiplicity detection
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Gathering an even number of robots in an odd ring without global multiplicity detection
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
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
How to gather asynchronous oblivious robots on anonymous rings
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
Theoretical Computer Science
Hi-index | 0.00 |
We consider a set of k autonomous robots that are endowed with visibility sensors (but that are otherwise unable to communicate) and motion actuators. Those robots must collaborate to reach a single vertex that is unknown beforehand, and to remain there hereafter. Previous works on gathering in ringshaped networks suggest that there exists a tradeoff between the size of the set of potential initial configurations, and the power of the sensing capabilities of the robots (i.e. the larger the initial configuration set, the most powerful the sensor needs to be). We prove that there is no such trade off. We propose a gathering protocol for an odd number of robots in a ring-shaped network that allows symmetric but not periodic configurations as initial configurations, yet uses only local weak multiplicity detection. Robots are assumed to be anonymous and oblivious, and the execution model is the non-atomic CORDA model with asynchronous fair scheduling. Our protocol allows the largest set of initial configurations (with respect to impossibility results) yet uses the weakest multiplicity detector to date. The time complexity of our protocol is O(n2), where n denotes the size of the ring. Compared to previous work that also uses local weak multiplicity detection, we do not have the constraint that k n/2 (here, we simply have 2 k n-3).