AI & ML
Byzantine Resilience of Robot Gathering under Round-Robin Scheduling
arXiv cs.DC0 views
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.
Source:https://arxiv.org/abs/2611.22631PreviousCheckCo: Checkpoint-Coordinated Load Balancingfor Skewed Event Streams at ScaleNextSLED: Sensor SLicing from Edge to Datacenter
Related posts

‘It’s a risk’: How Rockstar built the most detailed (and romantic) GTA yet
0The Verge
China dominates battery graphite, but this startup could break the monopoly
0TechCrunch
AI visibility: mentions, recommendations and citations need separate checks
0dev.to
Background AI Makes Inference a Scheduling Problem
0dev.to

DeepSeek vs Claude vs Kimi vs Codex vs Gemini: A 70-Call AI Ethics Test
0dev.to
Fluent English is not evidence of ASL understanding: lessons from building a video translator
0dev.to