4 papers
Safe Exploration of Arbitrary Dynamic Dangerous Networks
Caterina Feletti, Paola Flocchini, Giuseppe Prencipe +1
Given a team of agents on the nodes of a graph-based network, the exploration problem requires each node to be visited by at least one agent. In the classical distributed setting o…
Universal Dancing by Luminous Robots under Sequential Schedulers
Caterina Feletti, Paola Flocchini, Debasish Pattanayak +2
The Dancing problem requires a swarm of autonomous mobile robots to form a sequence of patterns, aka perform a choreography. Existing work has proven that some crucial restrict…
Optimal Uniform Circle Formation by Asynchronous Luminous Robots
Caterina Feletti, Debasish Pattanayak, Gokarna Sharma
We study the {\sc Uniform Circle Formation} ({\sc UCF}) problem for a swarm of autonomous mobile robots operating in \emph{Look-Compute-Move} (LCM) cycles on the Euclidean plan…
Computational Power of Opaque Robots
Caterina Feletti, Lucia Mambretti, Carlo Mereghetti +1
In the field of distributed computing by robot swarms, the research comprehends manifold models where robots operate in the Euclidean plane through a sequence of look-compute-move…