Advanced Search
DSpace@MIT

Consensus-based auctions for decentralized task assignment

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor Jonathan P. How. en_US
dc.contributor.author Brunet, Luc (Luc P. V.) en_US
dc.contributor.other Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics. en_US
dc.date.accessioned 2009-03-20T19:32:41Z
dc.date.available 2009-03-20T19:32:41Z
dc.date.copyright 2008 en_US
dc.date.issued 2008 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/44926
dc.description Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2008. en_US
dc.description This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. en_US
dc.description Includes bibliographical references (p. 137-147). en_US
dc.description.abstract This thesis addresses the decentralized task assignment problem in cooperative autonomous search and track missions by presenting the Consensus-Based class of assignment algorithms. These algorithm make use of information consensus routines to converge on the assignment rather than the situational awareness of the fleet. A market-based approach is used as the mechanism for task selection, while the novel consensus stage of the algorithms allow for fast distributed conflict resolution. Three separate algorithms belonging to the Consensus-Based class of assignment strategies will be presented. The first is the Consensus-Based Auction Algorithm (CBAA), which is a single assignment auction strategy that is shown to be bounded within 50% of the optimal solution, while an upper-bound on convergence is presented. Two multi-assignment algorithms are then presented as extensions of the CBAA. The iterative CBAA executes the single assignment algorithm multiple times in order to build an assignment with multiple tasks. The second algorithm is the more general Consensus-Based Bundle Algorithm (CBBA) in which agents build a candidate bundle of tasks and bid on each task individually based on the improvement in score achieved by adding it to the bundle. Both algorithms are shown to be lower bounded by 50% optimality, while convergence bounds are derived based on the network topology. Numerical results show that the bundle algorithm performs much better than the iterative approach while providing faster convergence times. It is also compared with the Prim Allocation (PA) auction algorithm where it is shown to exhibit much faster convergence times and give better assignments. The CBBA is also implemented in the CSAT simulation test-bed developed by Aurora Flight Sciences in conjunction with MIT, and shown to produce faster response times and better tracking performance than the currently used RDTA algorithm. en_US
dc.description.statementofresponsibility by Luc Brunet. en_US
dc.format.extent 147 p. en_US
dc.language.iso eng en_US
dc.publisher Massachusetts Institute of Technology en_US
dc.rights M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. en_US
dc.rights.uri http://dspace.mit.edu/handle/1721.1/7582 en_US
dc.subject Aeronautics and Astronautics. en_US
dc.title Consensus-based auctions for decentralized task assignment en_US
dc.type Thesis en_US
dc.description.degree S.M. en_US
dc.contributor.department Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics. en_US
dc.identifier.oclc 309315799 en_US


Files in this item

Name Size Format Description
309315799-MIT.pdf 2.478Mb PDF Full printable version

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage