2026-07-23T05:44:32Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:24873 2026-02-09T07:42:15Z ddc:004 open_access

Brief Announcement: The Virtue of Self-Consistency Frei, Fabian Wada, Koichi Autonomous Mobile Robots Distinct Gathering Round Robin Disorientation Self-Consistency We show that self-consistency can be a crucial property for autonomous mobile robots. Specifically, we consider the task of gathering three robots, placed adversarially in distinct locations in the Euclidean plane, in a single point. We assume the natural scheduler RoundRobin, which activates the robots in turns. An activated robot perceives all robot locations in an adversarially scaled, rotated, and mirrored Cartesian coordinate system with itself at the origin and then moves wherever it wants. We show that this task cannot be solved in the default robot model (without any consistency guarantees and no multiplicity detection) but becomes feasible if we assume self-consistency (i.e., no changes between the different activations of the same robot) of either the unit length (i.e., no scaling) or the compass (i.e., no rotating) by providing explicit algorithms. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Fabian Frei and Koichi Wada 2025 Is Part Of LIPIcs, Volume 356, 39th International Symposium on Distributed Computing (DISC 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2025.57 urn:nbn:de:0030-drops-248737 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2025.57 eng https://creativecommons.org/licenses/by/4.0/legalcode