The algebraic degree of geometric optimization problems
Discrete & Computational Geometry
Designing emergent behaviors: from local interactions to collective intelligence
Proceedings of the second international conference on From animals to animats 2 : simulation of adaptive behavior: simulation of adaptive 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
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Fault-tolerant gathering algorithms for autonomous mobile robots
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science
Impossibility of gathering by a set of autonomous mobile robots
Theoretical Computer Science
How to meet in anonymous network
Theoretical Computer Science
Local spreading algorithms for autonomous robot systems
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
Models and algorithmic approaches for cooperative multi-robot systems: thesis abstract
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: doctoral mentoring program
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
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
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
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)
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
The projection median of a set of points
Computational Geometry: Theory and Applications
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
Separation of Circulating Tokens
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
Deaf, Dumb, and Chatting Asynchronous Robots
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Positional consensus in multi-agent systems using a broadcast control mechanism
ACC'09 Proceedings of the 2009 conference on American Control 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
Robots and demons: the code of the origins
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Swing words to make circle formation quiescent
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
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
Characterizing geometric patterns formable by oblivious anonymous mobile robots
Theoretical Computer Science
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
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
Network exploration by silent and oblivious robots
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
RoboCast: asynchronous communication in robot networks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
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
How many oblivious robots can explore a line
Information Processing Letters
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 oblivious agents with local vision in regular bipartite graphs
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science
DISC 2011 invited lecture: deterministic rendezvous in networks: survey of models and results
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
Gathering few fat mobile robots in the plane
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
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
Local algorithms for autonomous robot systems
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
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
Efficient algorithms for detecting regular point configurations
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Gathering asynchronous transparent fat robots
ICDCIT'10 Proceedings of the 6th international conference on Distributed Computing and Internet Technology
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
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
Convergence of mobile robots with uniformly-inaccurate sensors
SIROCCO'09 Proceedings of the 16th 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
Mobile robots gathering algorithm with local weak multiplicity in rings
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
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Gathering of fat robots with limited visibility and without global navigation
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
The optimal tolerance of uniform observation error for mobile robot convergence
Theoretical Computer Science
Time vs. space trade-offs for rendezvous in trees
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
SIAM Journal on Computing
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
Observe and remain silent (communication-less agent location discovery)
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Gathering autonomous mobile robots with dynamic compasses: an optimal result
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Collecting information by power-aware mobile agents
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Asynchronous pattern formation by anonymous oblivious mobile robots
DISC'12 Proceedings of the 26th international conference on Distributed Computing
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
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 |
Consider a set of n 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct communication, no memory of the past, deterministic) moving freely in the plane and able to sense the positions of the other robots. We study the primitive task of gathering them at a point not fixed in advance (GATHERING PROBLEM). In the literature, most contributions are simulation-validated heuristics. The existing algorithmic contributions for such robots are limited to solutions for n ≤ 4 or for restricted sets of initial configurations of the robots. In this paper, we present the first algorithm that solves the GATHERING PROBLEM for any initial configuration of the robots.