DocumentCode
2385035
Title
Multiple UAV coalition formation
Author
Sujit, P.B. ; George, J.M. ; Beard, R.W.
Author_Institution
Dept. of Electr. & Comput. Eng., Brigham Young Univ., Provo, UT
fYear
2008
fDate
11-13 June 2008
Firstpage
2010
Lastpage
2015
Abstract
Unmanned aerial vehicles (UAVs) have the potential to carry munitions in support of battlefield operations, however they have limited sensor range and can carry only small quantities of resources. Often, to fully prosecute a target, a variety of assets may be required, and it may be necessary to deliver these assets simultaneously. Therefore, a team of UAVs that satisfies the target resource requirement needs to be assigned to a single target, and this team is called a coalition. Other desired requirements for the coalition are (i) minimize the target prosecution delay and (ii) minimize the size of the coalition. In this paper, we propose a two-stage optimal coalition formation algorithm that assigns appropriate numbers of UAVs satisfying the desired requirements. We developed a Dubins curves based simultaneous strike scheme. Simulation results are presented to show that the two-stage coalition formation algorithm has low computational overhead and can be applied in real-time.
Keywords
aerospace robotics; multi-robot systems; remotely operated vehicles; telerobotics; battlefield operations; multiple UAV coalition formation; target prosecution delay; target resource requirement; unmanned aerial vehicles; Computational modeling; Delay; Heuristic algorithms; Military computing; Robustness; Surveillance; Taxonomy; Unmanned aerial vehicles; Vehicle dynamics; Weapons;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference, 2008
Conference_Location
Seattle, WA
ISSN
0743-1619
Print_ISBN
978-1-4244-2078-0
Electronic_ISBN
0743-1619
Type
conf
DOI
10.1109/ACC.2008.4586788
Filename
4586788
Link To Document