This self-contained introduction to the distributed control of robotic networks offers a
distinctive blend of computer science and control theory. The book presents a broad set of …

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 …

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 …

From an engineering point of view, the problem of coordinating a set of autonomous, mobile
robots for the purpose of cooperatively performing a task has been studied extensively over …

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 …

Given a set of n autonomous mobile robots that can freely move on a two dimensional plane,
they are required to gather in a position on the plane not fixed in advance (Gathering …

This paper proposes a distributed algorithm by which a collection of mobile robots roaming
on a plane move to form a circle. The algorithm operates under the premises that robots (1) …