Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
Theoretical Computer Science
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)
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments
Algorithmic Aspects of Wireless Sensor Networks
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
Remembering without memory: Tree exploration by asynchronous oblivious robots
Theoretical Computer Science
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
Theoretical Computer Science
On the computational power of oblivious robots: forming a series of geometric patterns
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Pattern formation through optimum matching by oblivious CORDA robots
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Consensus in networked multi-agent systems with adversaries
Proceedings of the 14th international conference on Hybrid systems: computation and control
How many oblivious robots can explore a line
Information Processing Letters
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Brief announcement: the BG-simulation for Byzantine mobile robots
DISC'11 Proceedings of the 25th international conference on Distributed computing
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
Self-stabilizing gathering with strong multiplicity detection
Theoretical Computer Science
Gathering asynchronous oblivious mobile robots in a ring
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Mobile robots gathering algorithm with local weak multiplicity in rings
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Consensus of multi-agent networks in the presence of adversaries using only local information
Proceedings of the 1st international conference on High Confidence Networked Systems
Collaborative search on the plane without communication
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
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
Brief announcement: wait-free gathering of mobile robots
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Resilient synchronization in robust networked multi-agent systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
How to meet asynchronously at polynomial cost
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Deterministic polynomial approach in the plane
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
Theoretical Computer Science
Price of asynchrony in mobile agents computing
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. In a failure-prone system, a gathering algorithm is required to successfully gather the nonfaulty robots, independently of the behavior of the faulty ones. Both crash and Byzantine faults are considered. 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 observed that all known algorithms fail to operate correctly in a system prone to Byzantine faults, even in the presence of a single fault. Moreover, it is shown that in an asynchronous environment it is impossible to perform a successful gathering in a $3$-robot system, even if at most one of them might fail in a Byzantine manner. Thus, the problem is studied in a fully synchronous system. An algorithm is provided in this model for gathering $N \geq 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 \geq 3f+1$.