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 …

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 …

Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite,
unknown connected graph or in an unknown connected terrain in the plane. Agents are …

One of the recently considered models of robot-based computing makes use of identical,
memoryless mobile units placed in nodes of an anonymous graph. The robots operate in …

The gathering (or multi-agent rendezvous) problem requires a set of mobile agents,
arbitrarily positioned at different nodes of a network to group within finite time at the same …

We consider the problem of exploring an anonymous unoriented ring by a team of k
identical, oblivious, asynchronous mobile robots that can view the environment but cannot …

Two anonymous mobile agents (robots) moving in an asynchronous manner have to meet in
an infinite grid of dimension δ> 0, starting from two arbitrary positions at distance at most d …

Distributed Computing with Mobile Robots: An Introductory Survey Page 1 Distributed Computing
with Mobile Robots: an Introductory Survey Maria Potop-Butucaru* Michel Raynal†,‡ Sébastien …

The paper studies the gathering problem on grid and tree networks. A team of robots placed
at different nodes of the input graph, has to meet at some node and remain there. Robots …

In an effort to understand the algorithmic limitations of computing by a swarm of robots, the
research has focused on the minimal capabilities that allow a problem to be solved. The …