← 研踪 PaperTrailarXiv:2611.22631 · v1
Byzantine Resilience of Robot Gathering under Round-Robin Scheduling
首次提交 2026-11-17 19:48
版本更新 2026-11-17 19:48
雷达观测 2026-11-18 11:33
摘要
We study deterministic gathering of anonymous, oblivious mobile robots in the plane under round-robin scheduling with rigid movement, in the presence of 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 , establishing an lower bound on the achievable Byzantine resilience.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-17 19:48 · 最新观测版本
Byzantine Resilience of Robot Gathering under Round-Robin Scheduling
We study deterministic gathering of anonymous, oblivious mobile robots in the plane under round-robin scheduling with rigid movement, in the presence of 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 , establishing an lower bound on the achievable Byzantine resilience.
查看此版本解读 →查看此版本原文 ↗