UAV Task Assignment with Timing Constraints
AIR FORCE RESEARCH LAB WRIGHT-PATTERSON AFB OH AIR VEHICLES DIRECTORATE
Pagination or Media Count:
This paper addresses the problem of task allocation for wide area search munitions. The munitions are required to search for, classify, attack, and verify the destruction of potential targets. We assume that target field information is communicated between all elements of the swarm. We generate a tour of optimal assignments for each vehicle using a Mixed Integer Linear Program, or MILP format. MILP can assign tasks that look infeasible, due to timing, by adding time to a UAVs path, and vehicle paths are then recalculated to match the required arrival times. The MILP formulation with variable arrival times provides an optimal solution to multiple-assignment problems for groups of UAVs with coupled tasks involving timing and task order constraints.
- Pilotless Aircraft
- Air Navigation and Guidance
- Operations Research
- Target Direction, Range and Position Finding