ACM Computing Surveys (CSUR)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Self-stabilization
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Fault-tolerant gathering algorithms for autonomous mobile robots
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Using eventually consistent compasses to gather oblivious mobile robots with limited visibility
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Convergence of autonomous mobile robots with inaccurate sensors and movements
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Fault-tolerant and self-stabilizing mobile robots gathering
DISC'06 Proceedings of the 20th international conference on Distributed Computing
On the feasibility of gathering by autonomous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Gathering two stateless mobile robots using very inaccurate compasses in finite time
Proceedings of the 1st international conference on Robot communication and coordination
Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Gathering Multiple Robotic Agents with Crude Distance Sensing Capabilities
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Theoretical Computer Science
Using eventually consistent compasses to gather memory-less mobile robots with limited visibility
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Distributed algorithms for partitioning a swarm of autonomous mobile robots
Theoretical Computer Science
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
Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision
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
Dynamic compass models and gathering algorithms for autonomous mobile robots
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Characterizing geometric patterns formable by oblivious anonymous mobile robots
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
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
Convergence of mobile robots with uniformly-inaccurate sensors
SIROCCO'09 Proceedings of the 16th 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
The optimal tolerance of uniform observation error for mobile robot convergence
Theoretical Computer Science
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
Gathering autonomous mobile robots with dynamic compasses: an optimal result
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Energy-efficient strategies for building short chains of mobile robots locally
Theoretical Computer Science
Hi-index | 0.01 |
This paper considers a system of asynchronous autonomous mobile robots that can move freely in a two-dimensional plane with no agreement on a common coordinate system. Starting from any initial configuration, the robots are required to eventually gather at a single point, not fixed in advance (gathering problem). Prior work has shown that gathering oblivious (i.e., stateless) robots cannot be achieved deterministically without additional assumptions. In particular, if robots can detect multiplicity (i.e., count robots that share the same location) gathering is possible for three or more robots. Similarly, gathering of any number of robots is possible if they share a common direction, as given by compasses, with no errors. Our work is motivated by the pragmatic standpoint that (1) compasses are error-prone devices in reality, and (2) multiplicity detection, while being easy to achieve, allows for gathering in situations with more than two robots. Consequently, this paper focusses on gathering two asynchronous mobile robots equipped with inaccurate compasses. In particular, we provide a self-stabilizing algorithm to gather, in a finite time, two oblivious robots equipped with compasses that can differ by as much as π/4.