# Byzantine Resilience of Robot Gathering under Round-Robin Scheduling

DevFeed: [Byzantine Resilience of Robot Gathering under Round-Robin Scheduling](<https://devfeed.tech/articles/byzantine-resilience-of-robot-gathering-under-round-robin-scheduling-140389.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.22631>)

Author: Fabian Frei, Yuichi Sudo, Koichi Wada

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [distributed algorithm](<https://devfeed.tech/topics/distributed-algorithm.md>), [round robin](<https://devfeed.tech/topics/round-robin.md>), [Resilience](<https://devfeed.tech/topics/resilience.md>)

Tags: [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [gathering](<https://devfeed.tech/tags/gathering.md>), [resilience](<https://devfeed.tech/tags/resilience.md>), [robot](<https://devfeed.tech/tags/robot.md>), [round-robin](<https://devfeed.tech/tags/round-robin.md>), [scheduling](<https://devfeed.tech/tags/scheduling.md>)

## AI overview

For deterministic gathering of anonymous, oblivious robots under round-robin scheduling, ToMax guarantees that all correct robots gather permanently when the number of Byzantine robots f is at most ⌊√n/2⌋. Each robot moves to a position with maximum multiplicity and stays put only when its current position is the unique maximum. The result assumes rigid movement and allows local coordinate systems to change adversarially between activations; it establishes an Ω(√n) lower bound on achievable Byzantine resilience.

## Source excerpt

arXiv:2611.22631v1 Announce Type: new 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 $\Omega(\sqrt{n})$ lower bound on the achievable Byzantine resilience.