The paper considers variants of the gathering problem of oblivious and asynchronous robots
moving in the plane. When n> 2 n> 2 robots are free to gather anywhere in the plane, the …

We consider distributed computations, by identical autonomous mobile entities, that solve
the Point Convergence problem: given an arbitrary initial configuration of entities, disposed …

In this Chapter, we focus on the Gathering problem: that is, the problem of having the robots,
initially located in arbitrary distinct points of the plane, gather in the exact same location. In …

Abstract We study the Uniform Circle Formation (UCF) problem for a distributed system of n
robots which are required to displace on the vertices of a regular n-gon. We consider a well …

We consider the distributed setting of N autonomous mobile robots that operate in Look-
Compute-Move cycles and communicate with other robots using colored lights (the robots …

In swarm robotics, research mainly follows a theoretical approach that considers robot
systems in the abstract, where the complexity and capabilities of the underlying model are …

We study the Gathering problem for mobile robots in presence of faults. In classical
gathering, robots gather at a point not known a priori in finite time. In this paper, we focus on …

We consider the distributed setting of N autonomous mobile robots that operate in Look-
Compute-Move (LCM) cycles and use colored lights (the robots with lights model). We …

Given a set of n≥ 1 unit disk robots in the Euclidean plane, we consider the fundamental
problem of providing mutual visibility to them: the robots must reposition themselves to reach …

Abstract A distributed algorithm\({\mathcal {A}}\) solves the Point Convergence task if an
arbitrarily large collection of entities, starting in an arbitrary configuration, move under the …