Searcharxiv⌕ Search

arXiv · 2611.22138

RoboTeam: Benchmarking Vision-Based Multi-Agent Control of Many Robot Arms in Real Time

Abstract

Multimodal agents can now control robot arms by calling tools and writing code. Existing benchmarks fall short in three ways: most test one or two arms on short tasks, many pause the world while the agent thinks, and many give it ground-truth object positions. We present RoboTeam, a simulated benchmark where agents control 4 to 16 robot arms in real time from camera images alone. Its 36 tasks are long jobs that the arms must do together, such as passing timbers or building a picture from hundreds of cubes. We start from the most flexible agent system, the adaptive system, where one agent decides when to fork delegates. With it, gpt-6.1-sol and opus-5.5 complete 28 and 27 tasks, and four other models at most 3. But at a high price: a typical task takes gpt-6.1-sol 3.5 hours and 218 million input tokens, and a third of its steps fail at least once and must be retried. We then compare it with three fixed systems: single-agent, hierarchical, and decentralized. All four complete a similar number of tasks but differ in time and tokens. The hierarchical and decentralized systems are faster but use up to 1.9 times the tokens, and the single agent uses fewer tokens but takes 1.6 times as long, so the adaptive system lies between them. Even so, no model or system is yet fast, cheap, and reliable at once. RoboTeam measures these limits where earlier benchmarks cannot: long multi-arm jobs, camera images only, and a world that never pauses.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Changxuan Fan, Zhongwei Xie, Boyi Zhang, Shaoli Hu, Chang Xu, Xiyu Ren, Yufei Li, Qiao Xiao, Huihao Jing, Kawai Chung, Wenbin Hu, Hongyu Luo, Lingyun Xie, Yisen Gao, Chunyang Li, Haoyu Huang, Wuganjing Song, Yuxuan Liu, Chiu Yeung Tang, Fangneng Zhan, Xi Yang. 2026-11-17. RoboTeam: Benchmarking Vision-Based Multi-Agent Control of Many Robot Arms in Real Time. https://searcharxiv.com/abs/2611.22138

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Human-like Semantic Navigation for Autonomous Driving using Knowledge Representation and Large Language Models

Achieving full automation in self-driving vehicles remains a challenge, especially in dynamic urban environments where navigation requires real-time adaptability. Existing systems struggle to handle navigation plans when faced with unpredictable changes in road layouts, spontaneous detours, or missing map data, due to their heavy reliance on predefined cartographic information. In this work, we explore the use of Large Language Models to generate Answer Set Programming rules by translating informal navigation instructions into structured, logic-based reasoning. ASP provides non-monotonic reasoning, allowing autonomous vehicles to adapt to evolving scenarios without relying on predefined maps. We present an experimental evaluation in which LLMs generate ASP constraints that encode real-world urban driving logic into a formal knowledge representation. By automating the translation of informal navigation instructions into logical rules, our method improves adaptability and explainability in autonomous navigation. Results show that LLM-driven ASP rule generation supports semantic-based decision-making, offering an explainable framework for dynamic navigation planning that aligns closely with how humans communicate navigational intent.

cs.RO↗

InFeR: Informed Failure Resilience in Learned Visual Navigation Control

While imitation learning (IL) has enabled successful visual navigation in many common environments, IL policies are prone to unpredictable failures under out-of-distribution (OOD) scenarios. This necessitates failure-resilient policies, which not only detect failures, but also recognise their sources and recover from them autonomously. We propose InFeR, a general framework for building IL policies with informed failure resilience without failure or recovery demonstrations. Given an IL policy's architecture and training dataset, InFeR retrains a new OOD-aware policy with a latent space structured for OOD failure detection, with a modified objective based on the Variational Information Bottleneck. It applies a visual explainability technique, Grad-CAM, to attribute failures to specific image regions and inform a heuristic policy for recovery. All these are achieved without requiring additional training data. Real-world experiments show that InFeR enables informed failure recovery across two different policy architectures, supporting long-range navigation in complex environments.

cs.RO↗

Delay-Aware Distributed Multi-Robot Motion Planning

This paper examines why distributed optimization degrades when multi-robot systems coordinate under realistic communication delays. Using consensus ADMM as a representative framework for generating collision-free, dynamically feasible motion plans in both trajectory optimization and receding-horizon control settings, we show that delay degrades performance structurally: the consensus and dual updates weight stale and current information identically, so staleness enters the optimizer disguised as genuine disagreement and accumulates through the multipliers. Delay-agnostic adaptation (e.g. residual balancing) inherits this contamination and can perform worse than a fixed penalty. We introduce a Delay-Aware ADMM (DA-ADMM) variant that adapts penalty parameters to real-time delay statistics and re-derives the global consensus update as a delay-weighted average, down-weighting stale information in favor of recent updates. Simulations in 2D and 3D show that DA-ADMM improves robustness, success rate, and solution quality over fixed-parameter, residual-balancing, lower-bound, and fixed-constraint baselines. Degradation is therefore governed not by delay length or frequency, but by the optimizer's ability to reason over the age of the information it receives.

cs.RO↗