aiqbench analysis
This research advances decentralized multi-robot coordination by leveraging Labeled Multi-Bernoulli filtering to eliminate the need for explicit inter-agent communication. The approach demonstrates robust task allocation under partial observations, offering a scalable solution for autonomous systems operating in bandwidth-constrained or adversarial environments. By relying solely on local state estimation and greedy auction strategies, the framework achieves cooperative efficiency without centralized control overhead.
Communication-Free Distributed Multi-Robot Task Allocation under Partial Observations Using Labeled Multi-Bernoulli Filtering
arXiv:2609.39416v1 Announce Type: new Abstract: This paper proposes a communication-free multi-robot task allocation framework based solely on local observations. In this study, tasks are defined as reaching target locations. Each robot estimates the positions of neighboring robots using a Labeled Multi-Bernoulli (LMB) filter and independently assigns tasks through a greedy auction-based strategy. By continuously updating state estimates and reallocating tasks during execution, the proposed method enables decentralized coordination without explicit communication. Monte Carlo simulations demonstrate that the proposed method enables effective cooperative task allocation without inter-robot communication while remaining robust to measurement clutter and observation uncertainty.
Abstract:This paper proposes a communication-free multi-robot task allocation framework based solely on local observations. In this study, tasks are defined as reaching target locations. Each robot estimates the positions of neighboring robots using a Labeled Multi-Bernoulli (LMB) filter and independently assigns tasks through a greedy auction-based strategy. By continuously updating state estimates and reallocating tasks during execution, the proposed method enables decentralized coordination without explicit communication. Monte Carlo simulations demonstrate that the proposed method enables effective cooperative task allocation without inter-robot communication while remaining robust to measurement clutter and observation uncertainty.
Robotics (cs.RO); Systems and Control (eess.SY)
arXiv:2609.39416 [cs.RO]
(or arXiv:2609.39416v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2609.39416 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 188 words
Related coverage

News
Quantum Computing Report · Jun 7, 2026
News Archive 2026
Quantum Computing Report · Jul 25, 2026

Amazon Research Awards recipients announced
Amazon Science · May 27, 2026
Communication-Aware Heterogeneous Graph Learning for Decentralized Multi-Human Multi-Robot Task Allocation
arXiv · Sep 29, 2026