602 citations · 678 across the 8 of their papers we have counts for
9 papers · 1 filter
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…
Black Hole Search by Scattered Agents in Dynamic Rings
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe +1
In this paper, we address the challenge of locating a black hole within a dynamic graph using a set of scattered agents, which start from arbitrary positions in the graph. A black…
Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility
David Kirkpatrick, Irina Kostitsyna, Alfredo Navarra +2
Among fundamental problems in the context of distributed computing by autonomous mobile entities, one of the most representative and well studied is {\sc Point Convergence}: given…
Tight Bounds for Black Hole Search in Dynamic Rings
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe +1
In this paper, we start the investigation of distributed computing by mobile agents in dangerous dynamic networks. The danger is posed by the presence in the network of a black hol…
Line-Recovery by Programmable Particles
Giuseppe Di Luna, Paola Flocchini, Giuseppe Prencipe +2
Shape formation has been recently studied in distributed systems of programmable particles. In this paper we consider the shape recovery problem of restoring the shape when of…