Modelling the mobile target covering problem using flying drones

摘要

This paper addresses the mobile targets covering problem by using unmanned aerial vehicles (UAVs). It is assumed that each UAV has a limited initial energy and the energy consumption is related to the UAV's altitude. Indeed, the higher the altitude, the larger the monitored area and the higher the energy consumption. When an UAV runs out of battery, it is replaced by a new one. The aim is to locate UAVs in order to cover the piece of plane in which the target moves by using a minimum number of UAVs. Each target has to be monitored for each instant time. The problem under consideration is mathematically represented by defining mixed integer non-linear optimization models. Heuristic procedures are defined and they are based on restricted mixed integer programming (MIP) formulation of the problem. A computational study is carried out to assess the behaviour of the proposed models and MIP-based heuristics. A comparison in terms of efficiency and effectiveness among models and heuristics is carried out.