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

We consider the fundamental problem of arranging a set of n autonomous robots (points) on
a real plane according to an arbitrary given pattern. Each robot operates in a, largely …

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

Within distributed computing, the study of distributed systems of identical mobile
computational entities, called robots, operating in a Euclidean space is rather extensive …

Abstract The Uniform Circle Formation problem requires a swarm of mobile agents,
arbitrarily positioned onto the plane, to move on the vertices of a regular polygon. Each …

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

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 a distributed system of n ≥ 3 opaque robots deployed in the Euclidean plane. If
three robots lie on a line, the middle robot obstructs the visions of the two other robots. The …

For a team of autonomous opaque point robots on the plane, the Mutual Visibility problem
asks for a distributed algorithm that allows the robots to reposition themselves, without …

In the field of robotics, a lot of theoretical models have been settled to formalize multi-agent
systems and design distributed algorithms for autonomous robots. Among the most …