arXiv · 2611.22631
Byzantine Resilience of Robot Gathering under Round-Robin Scheduling
Abstract
We study deterministic gathering of $n$ anonymous, oblivious mobile robots in the plane under round-robin scheduling with rigid movement, in the presence of $f$ Byzantine robots. Robots observe all robot positions with their multiplicities, while their local coordinate systems may change adversarially between activations. The goal is for all correct robots to gather at a single point in finite time and remain there forever. We analyze ToMax, a simple algorithm that moves to a point of maximum multiplicity and stays still if and only if its current position is the unique maximum. We prove that ToMax achieves gathering whenever $f\le\lfloor\sqrt{n}/2\rfloor$, establishing an $Ω(\sqrt{n})$ lower bound on the achievable Byzantine resilience.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Fabian Frei, Yuichi Sudo, Koichi Wada. 2026-11-17. Byzantine Resilience of Robot Gathering under Round-Robin Scheduling. https://searcharxiv.com/abs/2611.22631
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.