DocumentCode
3165591
Title
Distributed Sequential Auctions for Multiple UAV Task Allocation
Author
Sujit, P.B. ; Beard, Randy
Author_Institution
Brigham Young Univ., Provo
fYear
2007
fDate
9-13 July 2007
Firstpage
3955
Lastpage
3960
Abstract
Allocating tasks efficiently to multiple UAVs with limited sensor and communication ranges is a difficult problem. In this paper, we present a distributed sequential auction scheme that takes the UAV limitations into account and provides a systematic procedure for the auction process. The task allocation scheme first validates the targets using neighbor´s knowledge and then, depending on the decisions obtained from neighbors, an agent decides to auction or forfeit the target. The targets detected within a sensor range are validated and auctioned sequentially. A simulation study was conducted for different sensor and communication ranges to evaluate the performance of the sequential auction scheme which was compared with a greedy strategy and a simple distributed auction scheme. The results show that the sequential auction scheme performs better than the simple distributed auction and greedy strategy.
Keywords
aerospace robotics; greedy algorithms; mobile robots; multi-robot systems; telerobotics; distributed sequential auction scheme; distributed sequential auctions; greedy strategy; multiple UAV task allocation; performance evaluation; task allocation; Broadcasting; Cities and towns; Communication system control; Computational complexity; Computer architecture; Decision making; Linear programming; Optimization methods; Strontium; Unmanned aerial vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference, 2007. ACC '07
Conference_Location
New York, NY
ISSN
0743-1619
Print_ISBN
1-4244-0988-8
Electronic_ISBN
0743-1619
Type
conf
DOI
10.1109/ACC.2007.4282558
Filename
4282558
Link To Document