4 citations · 5 across the 12 of their papers we have counts for
15 papers
Gathering in Vertex- and Edge-Transitive Graphs without Multiplicity Detection under Round Robin
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
In the field of swarm robotics, one of the most studied problem is Gathering. It asks for a distributed algorithm that brings the robots to a common location, not known in advance.…
Gathering in Non-Vertex-Transitive Graphs Under Round Robin
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
The Gathering problem for a swarm of robots asks for a distributed algorithm that brings such entities to a common place, not known in advance. We consider the well-known OBLOT mod…
On the impact of unlimited computational power in OBLOT: consequences for synchronous robots on graphs
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
The OBLOT model has been extensively studied in theoretical swarm robotics. It assumes weak capabilities for the involved mobile robots, such as they are anonymous, disoriented, no…
Mutual visibility in hypercube-like graphs
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +2
Let be a graph and . Then, vertices and of are -visible if there exists a shortest -path where no internal vertices belong to . The set…
Time-optimal geodesic mutual visibility of robots on grids within minimum area
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
The \textsc{Mutual Visibility} is a well-known problem in the context of mobile robots. For a set of robots disposed in the Euclidean plane, it asks for moving the robots witho…
Asynchronous Silent Programmable Matter: Line Formation
Alfredo Navarra, Francesco Piselli
Programmable Matter (PM) has been widely investigated in recent years. It refers to some kind of matter with the ability to change its physical properties (e.g., shape or color) in…