Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum Time

Abstract

This paper presents a solution for the problem of minimum time coverage of ground areas using a group of unmanned air vehicles (UAVs) equipped with image sensors. The solution is divided into two parts: (i) the task modeling as a graph whose vertices are geographic coordinates determined in such a way that a single UAV would cover the area in minimum time; and (ii) the solution of a mixed integer linear programming problem, formulated according to the graph variables defined in the first part, to route the team of UAVs over the area. The main contribution of the proposed methodology, when compared with the traditional vehicle routing problem’s (VRP) solutions, is the fact that our method solves some practical problems only encountered during the execution of the task with actual UAVs. In this line, one of the main contributions of the paper is that the number of UAVs used to cover the area is automatically selected by solving the optimization problem. The number of UAVs is influenced by the vehicles’ maximum flight time and by the setup time, which is the time needed to prepare and launch a UAV. To illustrate the methodology, the paper presents experimental results obtained with two hand-launched, fixed-wing UAVs.

Robots in Agriculture: State of Art and Practical Experiences

“…Using a fleet of UAVs instead of a single UAV for collecting data in large areas is common, and there are multiple techniques for area distribution and path planning [98]. For instance, a team of small UAVs with low-cost cameras can be applied to control the exploitation and management of water [99], obtaining the same results than a single UAV equipped with a better camera and providing the operation with more robustness.…”

Survey on Computer Vision for UAVs: Current Developments and Trends

“…Two exploration algorithms have been tested, a follow the river in stable flight modification of Sparse Tangential Network, and secondly maximize the river length that is covered during mission with experimental evaluations. In [151] coverage algorithm for ground areas from fixed wing UAVs has been proposed. The novelty of this work stands in the consideration of practical problems in the coverage mission.…”

Autonomous Aeromagnetic Surveys Using a Fluxgate Magnetometer

“…In [25] it is proposed an algorithm which does not consider the environment segmentation. Initially, a collection of waypoints is assigned to the boundary of the region of interest, next it is created a graph composed by these waypoints, finally the original problem is formulated as the Vehicle Routing Problem (VRP) [26].…”