DocumentCode
3551172
Title
Time-dependent cooperative assignment
Author
Kingston, Derek B. ; Schumacher, Corey J.
Author_Institution
Dept. of Electr. & Comput. Eng., Brigham Young Univ., Provo, UT, USA
fYear
2005
fDate
8-10 June 2005
Firstpage
4084
Abstract
The problem of assigning multiple agents to time-dependent cooperative tasks is addressed using a mixed-integer linear program. A time-dependent cooperative task is a task requiring multiple agents to perform separate sub tasks simultaneously or within some predetermined margin where agent availability to perform a subtask is limited to specific intervals in time. By separating the underlying calculation of agent availability and cost from the mechanism of assignment, a method to solve complex cooperative assignment problems can be formulated. A cooperative UAV target tracking/target prosecution scenario is presented to illustrate the assignment method.
Keywords
aerospace control; integer programming; linear programming; multi-agent systems; remotely operated vehicles; target tracking; agent availability; cooperative UAV; mixed-integer linear program; multiple agents; target prosecution; target tracking; time-dependent cooperative assignment; time-dependent cooperative task; Automotive engineering; Availability; Costs; Euclidean distance; Laboratories; Military computing; Target tracking; Timing; Unmanned aerial vehicles; Vehicle dynamics;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference, 2005. Proceedings of the 2005
ISSN
0743-1619
Print_ISBN
0-7803-9098-9
Electronic_ISBN
0743-1619
Type
conf
DOI
10.1109/ACC.2005.1470617
Filename
1470617
Link To Document