SIAM Journal on Control and Optimization
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Deterministic Rendezvous in Graphs
Algorithmica
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
Gathering two stateless mobile robots using very inaccurate compasses in finite time
Proceedings of the 1st international conference on Robot communication and coordination
Randomized Gathering of Mobile Robots with Local-Multiplicity Detection
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Remembering without memory: Tree exploration by asynchronous oblivious robots
Theoretical Computer Science
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
Theoretical Computer Science
How to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Rendezvous of mobile agents without agreement on local orientation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Almost optimal asynchronous rendezvous in infinite multidimensional grids
DISC'10 Proceedings of the 24th international conference on Distributed computing
Exclusive perpetual ring exploration without chirality
DISC'10 Proceedings of the 24th international conference on Distributed computing
A tight runtime bound for synchronous gathering of autonomous robots with limited visibility
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
A new approach for analyzing convergence algorithms for mobile robots
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Gathering of six robots on anonymous symmetric rings
SIROCCO'11 Proceedings of the 18th 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
Gathering of robots on anonymous grids without multiplicity detection
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Price of asynchrony in mobile agents computing
Theoretical Computer Science
| Hi-index | 0.00 |
A set of robots arbitrarily placed on different nodes of an anonymous ring have to meet at one common node and remain in there. This problem is known in the literature as the gathering. Anonymous and oblivious robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), decides whether to stay idle or to move to one of its neighbors (Compute), and in the latter case makes the computed move instantaneously (Move). Cycles are asynchronous among robots. Moreover, each robot is empowered by the so called multiplicity detection capability, that is, it is able to detect during its Look operation whether a node is empty, or occupied by one robot, or occupied by an undefined number of robots greater than one. The described problem has been extensively studied during the last years. However, the known solutions work only for specific initial configurations and leave some open cases. In this paper, we provide an algorithm which solves the general problem, and is able to detect all the ungatherable configurations. It is worth noting that our new algorithm makes use of a unified and general strategy for any initial configuration, even those left open by previous works.