Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Gathering of Asynchronous Oblivious Robots with Limited Visibility
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
Theoretical Computer Science
Gathering two stateless mobile robots using very inaccurate compasses in finite time
Proceedings of the 1st international conference on Robot communication and coordination
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 Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
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
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
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
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 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
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Optimal Byzantine-resilient convergence in uni-dimensional robot networks
Theoretical Computer Science
RoboCast: asynchronous communication in robot networks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Convergence with limited visibility by asynchronous mobile robots
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
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
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
Gathering asynchronous oblivious mobile robots in a ring
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
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 |
Given a set of n autonomous mobile robots that can freely move on a two dimensional plane, they are required to gather in a position of the plane not fixed in advance (Gathering Problem). The main research question we address in this paper is: under which conditions this task can be accomplished by the robots? The studied robots are quite simple: they are anonymous, totally asynchronous, they do not have any memory of past computations, they cannot explicitly communicate among each other. We show that this simple task cannot be in general accomplished by the considered system of robots.