DocumentCode
3486917
Title
Distributed chance-constrained task allocation for autonomous multi-agent teams
Author
Ponda, Sameera S. ; Johnson, Luke B. ; How, Jonathan P.
Author_Institution
Dept. of Aeronaut. & Astronaut., MIT, Cambridge, MA, USA
fYear
2012
fDate
27-29 June 2012
Firstpage
4528
Lastpage
4533
Abstract
This research presents a distributed chance-constrained task allocation framework that can be used to plan for multi-agent networked teams operating in stochastic and dynamic environments. The algorithm employs an approximation strategy to convert centralized problem formulations into distributable sub-problems that can be solved by individual agents. A key component of the distributed approximation is a risk adjustment method that allocates individual agent risks based on a global risk threshold. The results show large improvements in distributed stochastic environments by explicitly accounting for uncertainty propagation during the task allocation process.
Keywords
approximation theory; multi-agent systems; multi-robot systems; stochastic systems; approximation strategy; autonomous multi-agent teams; distributed chance-constrained task allocation; dynamic environments; multi-agent networked teams; stochastic environments; Approximation algorithms; Approximation methods; Planning; Resource management; Robustness; Stochastic processes; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference (ACC), 2012
Conference_Location
Montreal, QC
ISSN
0743-1619
Print_ISBN
978-1-4577-1095-7
Electronic_ISBN
0743-1619
Type
conf
DOI
10.1109/ACC.2012.6315626
Filename
6315626
Link To Document