Fault-tolerant gathering algorithms for autonomous mobile robots
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
SIAM Journal on Computing
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Deterministic Rendezvous in Graphs
Algorithmica
Impossibility of gathering by a set of autonomous mobile robots
Theoretical Computer Science
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
Gathering few fat mobile robots in the plane
Theoretical Computer Science
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
Theoretical Computer Science
Practical multiagent rendezvous through modified circumcenter algorithms
Automatica (Journal of IFAC)
Gathering asynchronous mobile robots with inaccurate compasses
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
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
Gathering autonomous mobile robots with dynamic compasses: an optimal result
DISC'07 Proceedings of the 21st international conference on Distributed Computing
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 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
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
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
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
Local, self-organizing strategies for robotic formation problems
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Gathering of fat robots with limited visibility and without global navigation
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Survey: A survey on relay placement with runtime and approximation guarantees
Computer Science Review
Continuous local strategies for robotic formation problems
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Time of anonymous rendezvous in trees: determinism vs. randomization
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Energy-efficient strategies for building short chains of mobile robots locally
Theoretical Computer Science
| Hi-index | 0.00 |
The gathering problem, where $n$ autonomous robots with restricted capabilities are required to meet in a single point of the plane, is widely studied. We consider the case that robots are limited to see only robots within a bounded vicinity and present an algorithm achieving gathering in O(n2) rounds in expectation. A round consists of a movement of all robots, in random order. All previous algorithms with a proven time bound assume global view on the configuration of all robots.