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 …

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

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 …

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 …

A set of robots arbitrarily placed on different nodes of an anonymous ring have to meet at
one common node and there remain. This problem is known in the literature as the …

Consider a set of mobile robots placed on distinct nodes of a discrete, anonymous, and
bidirectional ring. Asynchronously, each robot takes a snapshot of the ring, determining the …

The paper presents general results about the gathering problem on graphs. A team of robots
placed at the vertices of a graph, have to meet at some vertex and remain there. Robots …

We study the impact that persistent memory has on the classical rendezvous problem of two
mobile computational entities, called robots, in the plane. It is well known that, without …

We consider deterministic terminating exploration of a grid by a team of asynchronous
oblivious robots. We first consider the semi-synchronous atomic model ATOM. In this model …