2009
DOI: 10.1109/tro.2009.2022423
|View full text |Cite
|
Sign up to set email alerts
|

Consensus-Based Decentralized Auctions for Robust Task Allocation

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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
77
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 746 publications
(128 citation statements)
references
References 58 publications
0
77
0
Order By: Relevance
“…In the controls community, many researchers have developed algorithms for task assignment among teams of vehicles under the name of cooperative plan-ning [Alighanbari, 2004, Alighanbari et al, 2003, Beard et al, 2002, Berman et al, 2009, Cassandras and Li, 2002, Castanon and Wohletz, 2009, Choi et al, 2009, Ryan et al, 2004, Saligrama and Castañón, 2006, Wang et al, 2007. As the name suggests, these methods use an existing world model for planning vehicles task assignment.…”
Section: Related Workmentioning
confidence: 99%
See 4 more Smart Citations
“…In the controls community, many researchers have developed algorithms for task assignment among teams of vehicles under the name of cooperative plan-ning [Alighanbari, 2004, Alighanbari et al, 2003, Beard et al, 2002, Berman et al, 2009, Cassandras and Li, 2002, Castanon and Wohletz, 2009, Choi et al, 2009, Ryan et al, 2004, Saligrama and Castañón, 2006, Wang et al, 2007. As the name suggests, these methods use an existing world model for planning vehicles task assignment.…”
Section: Related Workmentioning
confidence: 99%
“…Their approach addresses the problem of maintaining a predefined distribution of robots on a set of locations, yet does not support time varying distributions. Choi et al [2009] used a distributed auction-based approach for task assignment among agents. They bounded the sub-optimality of their solution, yet extending their work to stochastic models is still an open problem.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations