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
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Local strategies for maintaining a chain of relay stations between an explorer and a base station
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
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
A local O(n2) gathering algorithm
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
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
Convergence with limited visibility by asynchronous mobile robots
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
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
| Hi-index | 0.00 |
We consider a scenario with a set of autonomous mobile robots having initial positions in the plane. Their goal is to move in such a way that they eventually reach a prescribed formation. Such a formation may be a straight line between two given endpoints (Robot Chain Problem), a circle or any other geometric pattern, or just one point (Gathering Problem). In this survey, we assume that there is no central control that guides the robot's decisions, thus the robots have to self-organize in order to accomplish global tasks like the above-mentioned formation problems. Moreover, we restrict them to simple local strategies: the robots are limited to "see" only robots within a bounded viewing range; their decisions where to move next are solely based on the relative positions of robots within this range. We survey recent results on local strategies for short robot chains and gathering, among them the first that come with upper and lower bounds on the number of rounds needed and the maximum distance traveled. Finally we present a continuous local strategy for short robot chains, and present a bound for the "price of locality": for every configuration of initial robot positions, the maximum distance traveled by the robots is at most by a logarithmic (in the number of robots) factor away from the maximum distance of the initial robot positions to the straight line.