Consensus-Based Decentralized Auctions for Robust Task Allocation
Name
Choi_Consensus-Based-Decentralized.pdf
Size
594.5 KB
Format
Adobe PDF
Checksum (MD5)
8934e675c3cc8a41e07b78f8888717c2
Author(s)
Choi, Han-Lim
Brunet, Luc
How, Jonathan P.
Date Issued
June 2009
Journal
IEEE Transactions on Robotics
Publisher
Institute of Electrical and Electronics Engineers
Citation
Han-Lim Choi, L. Brunet, and J.P. How. “Consensus-Based Decentralized Auctions for Robust Task Allocation.” Robotics, IEEE Transactions on 25.4 (2009): 912-926. © 2009 Institute of Electrical and Electronics Engineers
Version
Final published version
Abstract
This paper addresses task allocation to coordinate a fleet of autonomous vehicles by presenting two decentralized algorithms: the consensus-based auction algorithm (CBAA) and its generalization to the multi-assignment problem, i.e., the consensus-based bundle algorithm (CBBA). These algorithms utilize a market-based decision strategy as the mechanism for decentralized task selection and use a consensus routine based on local communication as the conflict resolution mechanism to achieve agreement on the winning bid values. Under reasonable assumptions on the scoring scheme, both of the proposed algorithms are proven to guarantee convergence to a conflict-free assignment, and it is shown that the converged solutions exhibit provable worst-case performance. It is also demonstrated that CBAA and CBBA produce conflict-free feasible solutions that are robust to both inconsistencies in the situational awareness across the fleet and variations in the communication network topology. Numerical experiments confirm superior convergence properties and performance when compared with existing auction-based task-allocation algorithms.
Subjects
Distributed robot systems
networked robots
task allocation for multiple mobile robots
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1109/tro.2009.2022423
