We consider a Persistent Intelligence, Surveillance and Reconnaissance (PISR) routing problem, which includes collecting data from a set of specified task locations and delivering that data to a control station. Each task is assigned a refresh rate based on its priority, where higher priority tasks require higher refresh rates. The UAV team's objective is to minimize the maximum of the delivery times of all the tasks' data to the control station, while simultaneously, satisfying each task's revisit period constraint. The centralized path planning problem for this PISR routing problem is formulated using mixed integer linear programming and solved using a branch-and-cut algorithm. Heuristics are presented to find suboptimal feasible solutions that require much less computation time. The algorithms are tested on several instances and their performance is compared with respect to the optimal cost and computation time.
Multi-UAV routing for persistent intelligence surveillance & reconnaissance missions
2017-06-01
268025 byte
Conference paper
Electronic Resource
English
Routing Problems for Reconnaissance Patrolling Missions
IEEE | 2019
|Control of formations of UAVs for surveillance and reconnaissance missions
Tema Archive | 2008
|Active Learning in Persistent Surveillance UAV Missions
AIAA | 2009
|Active Learning in Persistent Surveillance UAV Missions
British Library Conference Proceedings | 2009
|