Auction-Consensus Algorithm with Learned Bidding Scheme for Multi-Robot Systems
Jose Rodriguez, Constantine Tarawneh, Sven Koenig, Wenjie Dong, Qi Lu

TL;DR
This paper introduces a reinforcement learning-enhanced auction-consensus algorithm for multi-robot task allocation, improving solution quality while maintaining decentralized coordination.
Contribution
It replaces hand-crafted bidding functions in CBBA with neural policies trained via reinforcement learning, enhancing task allocation performance.
Findings
Learned bidding policies outperform classical CBBA in solution quality.
Neural architectures like LSTM and Set Transformer are effective for bidding.
The approach maintains decentralized execution with improved results.
Abstract
Multi-Robot Task Allocation (MRTA) is a central challenge in decentralized multi-agent systems, where teams of robots must cooperatively assign and execute tasks under limited communication while optimizing global performance objectives. Auction-consensus algorithms, such as the Consensus-Based Bundle Algorithm (CBBA), provide scalable decentralized coordination with provable convergence, but rely on hand-crafted greedy scoring functions that often lead to suboptimal task allocations. This paper proposes a learning-enhanced auction-consensus framework in which CBBA's deterministic bidding mechanism is replaced by a neural bidding policy trained using reinforcement learning. Under a centralized training and decentralized execution paradigm, agents learn to compute task bids from partial local observations while retaining the standard auction and consensus phases for decentralized…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
