Optimal Partitioning of a Surveillance Space for Persistent Coverage Using Multiple Autonomous Unmanned Aerial Vehicles: An Integer Programming Approach.

摘要

Unmanned aerial vehicles (UAVs) are an essential tool for the battle eld commander in part because they represent an attractive intelligence gathering platform that can quickly identify targets and track movements of individuals within areas of interest. In order to provide meaningful intelligence in near-real time during a mission, it makes sense to operate multiple UAVs with some measure of autonomy to survey the entire area persistently over the mission timeline. This research considers a space where intelligence has identi ed a number of locations and their surroundings that need to be monitored for a period of time. An integer program is formulated and solved to partition this surveillance space into the minimum number of subregions such that these locations fall outside of each partitioned subregion for e cient, persistent surveillance of the locations and their surroundings. Partitioning is followed by a UAV-to-partitioned subspace matching algorithm so that each subregion of the partitioned surveillance space is assigned exactly one UAV. Because the size of the partition is minimized, the number of UAVs used is also minimized.