Two or more mobile entities, called agents or robots, starting at distinct initial positions, have
to meet. This task is known in the literature as rendezvous. Among many alternative …

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 …

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 presents a solution to the problem of self-organized aggregation of embodied
robots that requires no arithmetic computation. The robots have no memory and are …

This paper is concerned with the collective behavior of a group of n>1 mobile autonomous
agents, labelled 1 through n, which can all move in the plane. Each agent is able to …

Wie bestimmt man in einer Menge von Punkten am schnellsten zu jedem Punkt seinen
nächsten Nachbarn? Wie läßt sich der Durchschnitt von zwei Polygonen effizient …

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 …