Accession Number:

ADA445144

Title:

Time-Dependent Cooperative Assignment

Descriptive Note:

Corporate Author:

BRIGHAM YOUNG UNIV PROVO UT DEPT OF ELECTRICAL AND COMPUTER ENGINEERING

Personal Author(s):

• Kingston, Derek B.
• Schumacher, Corey J.

Report Date:

2005-06-01

Pagination or Media Count:

7.0

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 subtasks 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 trackingtarget prosecution scenario is presented to illustrate the assignment method.

Descriptors:

• *TIME DEPENDENCE
• *COMPUTER PROGRAMMING
• *MOVING TARGETS
• *DRONES
• COMPUTATIONS
• INTERVALS
• LINEAR PROGRAMMING
• TRACKING
• COSTS
• ALLOCATIONS

Subject Categories:

• Pilotless Aircraft
• Operations Research
• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE