Helly-type theorems and geometric transversals
Handbook of discrete and computational geometry
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
The freeze-tag problem: how to wake up a swarm of robots
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Cooperative Mobile Robotics: Antecedents and Directions
Autonomous Robots
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots
Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996]
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Impossibility of gathering by a set of autonomous mobile robots
Theoretical Computer Science
Self-deployment of mobile sensors on a ring
Theoretical Computer Science
Distributed Models and Algorithms for Mobile Robot Systems
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Gathering few fat mobile robots in the plane
Theoretical Computer Science
Distributed algorithms for partitioning a swarm of autonomous mobile robots
Theoretical Computer Science
Byzantine-Resilient Convergence in Oblivious Robot Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
On the Inability of Gathering by Asynchronous Mobile Robots with Initial Movements
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
Theoretical Computer Science
Optimal Byzantine Resilient Convergence in Asynchronous Robots Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Byzantine Convergence in Robot Networks: The Price of Asynchrony
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
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
Distributed algorithms for partitioning a swarm of autonomous mobile robots
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Dynamic compass models and gathering algorithms for autonomous mobile robots
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
On the self-stabilization of mobile robots in graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Stabilizing flocking via leader election in robot networks
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
A local O(n2) gathering algorithm
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Optimal Byzantine-resilient convergence in uni-dimensional robot networks
Theoretical Computer Science
Computers in Human Behavior
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
Robot networks with homonyms: the case of patterns formation
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Gathering asynchronous mobile robots with inaccurate compasses
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Gathering few fat mobile robots in the plane
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
Distributed coordination algorithms for mobile robot swarms: new directions and challenges
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Fault-tolerant and self-stabilizing mobile robots gathering
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Biangular circle formation by asynchronous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
On the feasibility of gathering by autonomous mobile robots
SIROCCO'05 Proceedings of the 12th 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
Survey: A survey on relay placement with runtime and approximation guarantees
Computer Science Review
A distributed algorithm for gathering many fat mobile robots in the plane
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Energy-efficient strategies for building short chains of mobile robots locally
Theoretical Computer Science
| Hi-index | 0.01 |
This paper studies fault tolerant algorithms for the problem of gathering N autonomous mobile robots. A gathering algorithm, executed independently by each robot, must ensure that all robots are gathered at one point within finite time. It is first observed that most existing algorithms fail to operate correctly in a setting allowing crash failures. Subsequently, an algorithm tolerant against one crash-faulty robot in a system of three or more robots is presented. It is then shown that in an asynchronous environment it is impossible to perform a successful gathering in a 3-robot system with one Byzantine failure. Finally, in a fully synchronous system, an algorithm is provided for gathering N ≥ 3 robots with at most a single faulty robot, and a more general gathering algorithm is given in an N-robot system with up to f faults, where N ≥ 3 f +1.