Collisionless gathering of robots with an extent
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
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
Energy-efficient strategies for building short chains of mobile robots locally
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Self-stabilizing gathering with strong multiplicity detection
Theoretical Computer Science
A continuous, local strategy for constructing a short chain of mobile robots
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Survey: A survey on relay placement with runtime and approximation guarantees
Computer Science Review
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
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
Brief announcement: wait-free gathering of mobile robots
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, oblivious, deaf, and dumb). 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 self-stabilizing algorithm solving GP for n robots if, and only if, n is odd.