Pairwise Approximation Can Select the Wrong Multi-Robot Plan

arXiv:2609.29929 · cs.RO, cs.MA · Submitted 2026-09-24 · Read on arXiv

cs.RO, cs.MA

Submitted: 2026-09-24

Updated: 2026-09-24

Comments: 6 pages, 4 figures, 1 table. Accepted at the IROS 2026 Workshop on Intelligent Information Gathering. Code: https://github.com/williamteo/pairwise-regret

Code: https://github.com/williamteo/pairwise-regret

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Regret — 47× in this paper · explained in 3 episodes
• Benchmark — 15× in this paper · explained in 2 episodes
• Reconstruction Error — 8× in this paper · explained in 2 episodes
• Alternation — 1× in this paper · explained in 1 episode
• Consistency — 1× in this paper · explained in 3 episodes
• Core — 1× in this paper · explained in 2 episodes
• Multi-Agent System — 1× in this paper · explained in 6 episodes
• Steering — 1× in this paper · explained in 2 episodes

Sources

• PRoID: Predicted Rate of Information Delivery in Multi-Robot Exploration and Relaying

Related papers

• FMT x: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning
• MPCFormer: A physics-informed data-driven approach for explainable socially-aware autonomous driving
• RoboLab: A High-Fidelity Simulation Benchmark for Analysis of Task Generalist Policies
• ARC: A Reasoning Recipe for Robot Foundation Models
• HRDexDB: A 4D Dexterous Grasping Dataset Across Human and Multiple Robot Embodiments
• APT: Action Expert Pretraining Improves Instruction Generalization of Vision-Language-Action Policies