ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
SIAM Journal on Computing
Impossibility of gathering by a set of autonomous mobile robots
Theoretical Computer Science
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
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
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
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 | 0.00 |
Gathering of multiple robots is a well known and challenging research problem. Most of the existing works consider the robot to be dimensionless (point). Algorithm for Gatheringfat robots (unit disc robots) has been reported for 3 and 4 robots. This paper proposes a distributed algorithm for Gatheringn (n≥5) autonomous, oblivious, homogeneous, asynchronous, fat robots. The robots are assumed to be transparent and they have full visibility.