Recently there have been a number of efforts to study issues related to coordination and
control algorithms for systems of multiple autonomous mobile robots (also known as robot …

The study of what can be computed by a team of autonomous mobile robots, originally
started in robotics and AI, has become increasingly popular in theoretical computer science …

In this paper we study the problem of gathering a collection of identical oblivious mobile
robots in the same location of the plane. Previous investigations have focused mostly on the …

This paper studies fault-tolerant algorithms for the problem of gathering N autonomous
mobile robots. A gathering algorithm, executed independently by each robot, must ensure …

Consider a set of n>2 identical mobile computational entities in the plane, called robots,
operating in Look-Compute-Move cycles, without any means of direct communication. The …

This paper considers the convergence problem in autonomous mobile robot systems. A
natural algorithm for the problem requires the robots to move towards their center of gravity …

Consider a set of n> 2 simple autonomous mobile robots (decentralized, asynchronous, no
common coordinate system, no identities, no central coordination, no direct communication …

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 …

Anonymous mobile robots are often classified into synchronous, semi-synchronous, and
asynchronous robots when discussing the pattern formation problem. For semi-synchronous …

Given any multiset F of points in the Euclidean plane and a set R of robots such that| R|=| F||
R|=| F|, the Arbitrary Pattern Formation (APF) problem asks for a distributed algorithm that …