4 citations · 6 across the 22 of their papers we have counts for
6 papers · 1 filter
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.…
An optimal algorithm for geodesic mutual visibility on hexagonal grids
Sahar Badri, Serafino Cicerone, Alessia Di Fonso +1
For a set of robots (or agents) moving in a graph, two properties are highly desirable: confidentiality (i.e., a message between two agents must not pass through any intermediate a…
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…
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +1
Given a set R of robots, each one located at different vertices of an infinite regular tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem. Given a…
A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Following the wide investigation in distributed computing issues by mobile entities of the last two decades, we consider the need of a structured methodology to tackle the arisen p…
Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach
Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
Given any multiset F of points in the Euclidean plane and a set R of robots such that |R|=|F|, the Arbitrary Pattern Formation (APF) problem asks for a distributed algorithm that m…