Energy-Constrained Multi-UAV Coverage Path Planning for an Aerial Imagery Mission Using Column Generation

This paper presents a new Coverage Path Planning (CPP) method for an aerial imaging mission with multiple Unmanned Aerial Vehicles (UAVs). In order to solve a CPP problem with multicopters, a typical mission profile can be defined with five mission segments: takeoff, cruise, hovering, turning, and landing. The traditional arc-based optimization approaches for the CPP problem cannot accurately estimate actual energy consumption to complete a given mission because they cannot account for turning phases in their model, which may cause non-feasible routes. To solve the limitation of the traditional approaches, this paper introduces a new route-based optimization model with column generation that can trace the amount of energy required for all different mission phases. This paper executes numerical simulations to demonstrate the effectiveness of the proposed method for both a single UAV and multiple UAV scenarios for CPP problems.

[1]  Imdat Kara.  Arc based integer programming formulations for the Distance Constrained Vehicle Routing problem , 2011, 3rd IEEE International Symposium on Logistics and Industrial Informatics.

[2]  Hoang Huu Viet,et al.  BA*: an online complete coverage algorithm for cleaning robots , 2012, Applied Intelligence.

[3]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[4]  Dimitri N. Mavris,et al.  Coverage Path Planning for a UAS Imagery Mission using Column Generation with a Turn Penalty , 2018, 2018 International Conference on Unmanned Aircraft Systems (ICUAS).

[5]  A. Ollero,et al.  Multiple UAV cooperative searching operation using polygon area decomposition and efficient coverage algorithms , 2004, DARS.

[6]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[7]  Jamal Arkat,et al.  Complete Coverage Path Planning for a Multi-UAV Response System in Post-Earthquake Assessment , 2016, Robotics.

[8]  Guilherme A. S. Pereira,et al.  Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum Time , 2015, Sensors.

[9]  Dimitri N. Mavris,et al.  Three-dimensional UAS Trajectory Optimization for Remote Sensing in an Irregular Terrain Environment , 2018, 2018 International Conference on Unmanned Aircraft Systems (ICUAS).

[10]  Howie Choset,et al.  Coverage Path Planning: The Boustrophedon Cellular Decomposition , 1998 .

[11]  José L. Verdegay,et al.  Coverage path planning with unmanned aerial vehicles for 3D terrain reconstruction , 2016, Expert Syst. Appl..

[12]  Vijay Kumar,et al.  A column generation approach for optimized routing and coordination of a UAV fleet , 2016, 2016 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR).

[13]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[14]  M. Er,et al.  Coverage path planning for UAVs based on enhanced exact cellular decomposition method , 2011 .

[15]  Giorgio C. Buttazzo,et al.  Coverage Path Planning for UAVs Photogrammetry with Energy and Resolution Constraints , 2016, J. Intell. Robotic Syst..

[16]  Jian Jin,et al.  Optimal Coverage Path Planning for Arable Farming on 2D Surfaces , 2010 .

[17]  Alexander Zelinsky,et al.  Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot , 2007 .

[18]  Arto Visala,et al.  Coverage path planning algorithms for agricultural field machines , 2009 .

[19]  Howie Choset,et al.  Uniform Coverage of Automotive Surface Patches , 2005, Int. J. Robotics Res..

[20]  Wesley H. Huang.  Optimal line-sweep-based decompositions for coverage algorithms , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[21]  Antonio Barrientos,et al.  Near-optimal coverage trajectories for image mosaicing using a mini quad-rotor over irregular-shaped fields , 2012, Precision Agriculture.

[22]  M. Jünger,et al.  50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art , 2010 .

[23]  Howie Choset,et al.  Morse Decompositions for Coverage Tasks , 2002, Int. J. Robotics Res..

[24]  Antonio Barrientos,et al.  Aerial remote sensing in agriculture: A practical approach to area coverage and path planning for fleets of mini aerial robots , 2011, J. Field Robotics.

[25]  Dimitri N. Mavris,et al.  Two-layer obstacle collision avoidance with machine learning for more energy-efficient unmanned aircraft trajectories , 2017, Robotics Auton. Syst..

[26]  Marc Carreras,et al.  A survey on coverage path planning for robotics , 2013, Robotics Auton. Syst..

[27]  Martin Desrochers,et al.  A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[28]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[29]  Amna Khan,et al.  On Complete Coverage Path Planning Algorithms for Non-holonomic Mobile Robots: Survey and Challenges , 2017, J. Inf. Sci. Eng..

[30]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[31]  Rakesh Nagi,et al.  Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans , 2012, Comput. Oper. Res..

[32]  Jianfeng Xu,et al.  An approach for coverage path planning for UAVs , 2016, 2016 IEEE 14th International Workshop on Advanced Motion Control (AMC).

[33]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[34]  Jaewoo Jung,et al.  Wind Tunnel and Hover Performance Test Results for Multicopter UAS Vehicles , 2016 .

[35]  Ernest L. Hall,et al.  Region filling operations with random obstacle avoidance for mobile robots , 1988, J. Field Robotics.