Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
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
Gathering asynchronous mobile robots with inaccurate compasses
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
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
Self-deployment of mobile sensors on a ring
Theoretical Computer Science
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
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
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
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
Characterizing geometric patterns formable by oblivious anonymous mobile robots
Theoretical Computer Science
Pattern formation through optimum matching by oblivious CORDA robots
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Convergence of mobile robots with uniformly-inaccurate sensors
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
The optimal tolerance of uniform observation error for mobile robot convergence
Theoretical Computer Science
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
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
SIAM Journal on Computing
Gathering autonomous mobile robots with dynamic compasses: an optimal result
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Hi-index | 0.00 |
This paper studies a gathering problem for a system of asynchronous autonomous mobile robots that can move freely in a two-dimensional plane. We consider robots equipped with inaccurate (incorrect) compasses which may point a different direction from other robots' compasses. A gathering problem is that the robots are required to eventually gather at a single point which is not given in advance from any initial configuration. In this paper, we propose several inaccurate compass models and give two algorithms which solve the gathering problem on these models. One algorithm is the first result dealing with the compasses whose indicated direction may change in every beginning of execution cycles of robots. It solves the problem when compasses point different at most π/8 from the (absolute) north. The other one solves the problem when the compasses never change its pointed direction and their difference is at most π/3 among robots.