2026-08-21T18:34:58Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:27403 2026-08-21T14:42:38Z ddc:004 open_access

Computational Power of Energy-Constrained Autonomous Robots Under Sequential Schedulers Feletti, Caterina Flocchini, Paola Santoro, Nicola Autonomous mobile robots Look-Compute-Move Computational power Sequential schedulers Energy-constrained We consider the distributed framework of swarms of mobile robots. A swarm is a set of computational, anonymous, indistinguishable, homogeneous, and autonomous entities that operate in the Euclidean plane through infinite sequences of Look-Compute-Move cycles. The goal of a swarm is to collaborate to solve a given problem. The ability to solve a problem depends on the swarm features and its setting X^S, where X ∈ {OBLOT, FSTA, FCOM, LUMI} denotes the memory/communication model and S denotes the class of schedulers (e.g., fully-synchronous, sequential, asynchronous) that activate the robots. Given a pool of settings, prior research has characterized the relations (dominance, equivalence, or orthogonality) among their computational powers, recently extending this analysis to the class of sequential schedulers (i.e., activating only one robot per round), and of the restricted ones (i.e., never activating a robot twice consecutively). In this paper, we extend the study on sequential schedulers (SEQ, PERM, and RROBIN) by defining two classes of sequential restricted schedulers R-SEQ and R-PERM. In particular, we analyze how the computational power of each model OBLOT, LUMI, and FCOM is affected by considering both sequential schedulers and their restricted variants; for FSTA, we only provide the relation between RROBIN and R-PERM. We establish both equivalence and dominance results: some settings are computationally equivalent, while others can be separated by problems solvable in one setting but not in the other. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Caterina Feletti and Paola Flocchini and Nicola Santoro 2026 Is Part Of LIPIcs, Volume 386, 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2026.22 urn:nbn:de:0030-drops-274038 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2026.22 eng https://creativecommons.org/licenses/by/4.0/legalcode