The OBLOT model in swarm robotics assumes robots are anonymous, disoriented, oblivious, and silent. Their only means of (implicit) communication is transferred to their positioning. These constraints make distributed algorithm design difficult, and prior research has mainly focused on task feasibility, measuring cost in movements or rounds while neglecting computational power. This paper shows that for synchronous robots on finite graphs, unlimited computational power (within finite time) is impactful, enabling a definitive resolution algorithm that solves a broad class of problems with minimal moves and rounds.
Brief Announcement: On the Impact of Unlimited Computational Power in OBLOT: Consequences for Synchronous Robots on Graphs
Navarra A.
2025
Abstract
The OBLOT model in swarm robotics assumes robots are anonymous, disoriented, oblivious, and silent. Their only means of (implicit) communication is transferred to their positioning. These constraints make distributed algorithm design difficult, and prior research has mainly focused on task feasibility, measuring cost in movements or rounds while neglecting computational power. This paper shows that for synchronous robots on finite graphs, unlimited computational power (within finite time) is impactful, enabling a definitive resolution algorithm that solves a broad class of problems with minimal moves and rounds.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
