Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Self-stabilization
Distributed Algorithms
Information and Computation
Fault-tolerant gathering algorithms for autonomous mobile robots
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots
Theory of Computing Systems
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Coupling and self-stabilization
Distributed Computing - Special issue: DISC 04
Convergence of autonomous mobile robots with inaccurate sensors and movements
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
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
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)
Fault-Tolerant Flocking in a k-Bounded Asynchronous System
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 Byzantine Resilient Convergence in Asynchronous Robots Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
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
Byzantine Convergence in Robot Networks: The Price of Asynchrony
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
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
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
The cost of probabilistic agreement in oblivious robot networks
Information Processing Letters
Optimal Byzantine-resilient convergence in uni-dimensional robot networks
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
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
Brief announcement: the BG-simulation for Byzantine mobile robots
DISC'11 Proceedings of the 25th international conference on Distributed computing
Gathering asynchronous mobile robots with inaccurate compasses
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing gathering with strong multiplicity detection
Theoretical Computer Science
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
Gathering autonomous mobile robots with dynamic compasses: an optimal result
DISC'07 Proceedings of the 21st 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
Hi-index | 0.01 |
Gathering is a fundamental coordination problem in cooperative mobile robotics. In short, given a set of robots with arbitrary initial location and no initial agreement on a global coordinate system, gathering requires that all robots, following their algorithm, reach the exact same but not predetermined location. Gathering is particularly challenging in networks where robots are oblivious (i.e., stateless) and the direct communication is replaced by observations on their respective locations. Interestingly any algorithm that solves gathering with oblivious robots is inherently self-stabilizing. In this paper, we significantly extend the studies of deterministic gathering feasibility under different assumptions related to synchrony and faults (crash and Byzantine). Unlike prior work, we consider a larger set of scheduling strategies, such as bounded schedulers, and derive interesting lower bounds on these schedulers. In addition, we extend our study to the feasibility of probabilistic gathering in both fault-free and fault-prone environments. To the best of our knowledge our work is the first to address the gathering from a probabilistic point of view.