Answers are grounded in this paper and cite their sources.
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≤√n/2, establishing an Ω(√n) lower bound on the achievable Byzantine resilience.
No takes yet. Share an insight, caveat, or question.
Frei et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: