2 papers
cs.DC2025
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.…
cs.DC2020
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…