4 papers
Oblivious Robots Under Round Robin: Gathering on Rings
Alfredo Navarra, Francesco Piselli
Robots with very limited capabilities are placed on the vertices of a graph and are required to move toward a single, common vertex, where they remain stationary once they arrive.…
Universal Pattern Formation by Oblivious Robots Under Sequential Schedulers
Paola Flocchini, Alfredo Navarra, Debasish Pattanayak +2
We study the computational power that oblivious robots operating in the plane have under sequential schedulers. We show that this power is much stronger than the obvious capacity t…
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…
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…