Gathering of Asynchronous Oblivious Robots with Limited Visibility

Authors:
Paola Flocchini;Giuseppe Prencipe;Nicola Santoro;Peter Widmayer
Affiliations:
-;-;-;-
Venue:
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2001

Citing 4
Cited 37

Interaction and intelligent behavior

Interaction and intelligent behavior
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

SIAM Journal on Computing
Experiments in Realising Cooperation between Autonomous Mobile Robots

Proceedings of the 5th International Symposium on Experimental Robotics V
Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation

Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Set of Autonomous Mobile Robots

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Distributed Computations by Autonomous Mobile Robots

SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Decomposition of Fundamental Problems for Cooperative Autonomous Mobile Systems

ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Gathering Multiple Robotic Agents with Crude Distance Sensing Capabilities

ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Deterministic Rendezvous in Trees with Little Memory

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Asynchronous Deterministic Rendezvous on the Line

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
How to meet when you forget: log-space rendezvous in arbitrary graphs

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
How to meet asynchronously (almost) everywhere

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Tell me where i am so i can meet you sooner: asynchronous rendezvous with location information

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Almost optimal asynchronous rendezvous in infinite multidimensional grids

DISC'10 Proceedings of the 24th international conference on Distributed computing
Convergence with limited visibility by asynchronous mobile robots

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Gathering few fat mobile robots in the plane

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Gathering despite mischief

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Convergence of autonomous mobile robots with inaccurate sensors and movements

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
How to meet in anonymous network

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distributed coordination algorithms for mobile robot swarms: new directions and challenges

IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Asynchronous deterministic rendezvous in graphs

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Polynomial deterministic rendezvous in arbitrary graphs

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Asynchronous cyclic pursuit

SAB'06 Proceedings of the 9th international conference on From Animals to Animats: simulation of Adaptive Behavior
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
Asynchronous deterministic rendezvous in bounded terrains

SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Asynchronous rendezvous of anonymous agents in arbitrary graphs

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Circle formation by asynchronous fat robots with limited visibility

ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
A probabilistic model for distributed merging of mobile agents

VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Deterministic rendezvous in networks: A comprehensive survey

Networks
Decidability classes for mobile agents computing

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Time vs. space trade-offs for rendezvous in trees

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
How to meet asynchronously (almost) everywhere

ACM Transactions on Algorithms (TALG)
The kissing problem: how to end a gathering when everyone kisses everyone else goodbye

FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Time of anonymous rendezvous in trees: determinism vs. randomization

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Delays Induce an Exponential Memory Gap for Rendezvous in Trees

ACM Transactions on Algorithms (TALG)
How to meet asynchronously at polynomial cost

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Distributed algorithms for barrier coverage using relocatable sensors

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
Price of asynchrony in mobile agents computing

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a collection of robots which are identical (anonymous), have limited visibility of the environment, and no memory of the past (oblivious); furthermore, they are totally asynchronous in their actions, computations, and movements. We show that, even in such a totally asynchronous setting, it is possible for the robots to gather in the same location in finite time, provided they have a compass.