Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Circle formation for oblivious anonymous mobile robots with no common sense of orientation
Proceedings of the second ACM international workshop on Principles of mobile computing
Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots
Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996]
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
SIAM Journal on Computing
Impossibility of gathering by a set of autonomous mobile robots
Theoretical Computer Science
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
Using eventually consistent compasses to gather memory-less mobile robots with limited visibility
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
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
Self-stabilizing Deterministic Gathering
Algorithmic Aspects of Wireless Sensor Networks
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The cost of probabilistic agreement in oblivious robot networks
Information Processing Letters
Fault-tolerant and self-stabilizing mobile robots gathering
DISC'06 Proceedings of the 20th international conference on Distributed Computing
| Hi-index | 5.23 |
In this paper, we investigate the possibility to deterministically solve the gathering problem starting from an arbitrary configuration with weak robots, i.e., anonymous, autonomous, disoriented, oblivious, and devoid of means of communication. By starting from an arbitrary configuration, we mean that robots are not required to be located at distinct positions in the initial configuration. We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a deterministic algorithm solving the gathering problem starting from an arbitrary configuration for n robots if, and only if, n is odd.