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
CMM. The cursed language that never really took off.
0dev.to Watercooler

I built a GitHub Action that scores pull requests and never auto-closes them
0dev.to GitHub
I built a Windows app to track Instagram follower and profile changes over time
0dev.to GitHub

Designing a Splash-Zone Ambient Lamp: What IP44 Actually Means in Practice
0dev.to Design
A Canva alternative for Instagram posts, stories and carousels with your brand applied in one click
0dev.to Design
What Might the Next Generation of AI Look Like?
0dev.to Discuss