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
Cooperative Mobile Robotics: Antecedents and Directions
Autonomous Robots
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
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the feasibility of gathering by autonomous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
A local O(n2) gathering algorithm
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
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
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
Review: Of robot ants and elephants: A computational comparison
Theoretical Computer Science
A continuous, local strategy for constructing a short chain of mobile robots
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Local, self-organizing strategies for robotic formation problems
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Circle formation by asynchronous fat robots with limited visibility
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Gathering of fat robots with limited visibility and without global navigation
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Continuous local strategies for robotic formation problems
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Distributed algorithms for barrier coverage using relocatable sensors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
A distributed algorithm for gathering many fat mobile robots in the plane
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 5.24 |
Autonomous identical robots represented by unit discs move deterministically in the plane. They do not have any common coordinate system, do not communicate, do not have memory of the past and are totally asynchronous. Gathering such robots means forming a configuration for which the union of all discs representing them is connected. We solve the gathering problem for at most four robots. This is the first algorithmic result on gathering robots represented by two-dimensional figures rather than points in the plain: we call such robots fat.