MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Consensus-Based Decentralized Auctions for Robust Task Allocation

Author(s)
Choi, Han-Lim; Brunet, Luc; How, Jonathan P.
Thumbnail
DownloadChoi_Consensus-Based-Decentralized.pdf (594.5Kb)
PUBLISHER_POLICY

Publisher Policy

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.

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.
Metadata
Show full item record
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.
Date issued
2009-06
URI
http://hdl.handle.net/1721.1/52330
Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
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
ISSN
1552-3098
Keywords
Distributed robot systems, networked robots, task allocation for multiple mobile robots

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.