Data collection planning with non-zero sensing distance for a budget and curvature constrained unmanned aerial vehicle

Data collection missions are one of the many effective use cases of unmanned aerial vehicles (UAVs), where the UAV is required to visit a predefined set of target locations to retrieve data. However, the flight time of a real UAV is time constrained, and therefore only a limited number of target locations can typically be visited within the mission. In this paper, we address the data collection planning problem called the Dubins Orienteering Problem with Neighborhoods (DOPN), which sets out to determine the sequence of visits to the most rewarding subset of target locations, each with an associated reward, within a given travel budget. The objective of the DOPN is thus to maximize the sum of the rewards collected from the visited target locations using a budget constrained path between predefined starting and ending locations. The variant of the orienteering problem addressed here uses curvature-constrained Dubins vehicle model for planning the data collection missions for UAV. Moreover, in the DOPN, it is also assumed that the data, and thus the reward, may be collected from a close neighborhood sensing distance around the target locations, e.g., taking a snapshot by an onboard camera with a wide field of view, or using a sensor with a long range. We propose a novel approach based on the Variable Neighborhood Search (VNS) metaheuristic for the DOPN, in which combinatorial optimization of the sequence for visiting the target locations is simultaneously addressed with continuous optimization for finding Dubins vehicle waypoints inside the neighborhoods of the visited targets. The proposed VNS-based DOPN algorithm is evaluated in numerous benchmark instances, and the results show that it significantly outperforms the existing methods in both solution quality and computational time. The practical deployability of the proposed approach is experimentally verified in a data collection scenario with a real hexarotor UAV.

[1]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[2]  David M. Lane,et al.  DCOP: Dubins Correlated Orienteering Problem Optimizing Sensing Missions of a Nonholonomic Vehicle Under Budget Constraints , 2018, IEEE Robotics and Automation Letters.

[3]  Jan Faigl,et al.  Surveillance Planning With Bézier Curves , 2018, IEEE Robotics and Automation Letters.

[4]  Geoffrey A. Hollinger,et al.  Autonomous Data Collection Using a Self-Organizing Map , 2018, IEEE Transactions on Neural Networks and Learning Systems.

[5]  Emilio Frazzoli,et al.  On the Dubins Traveling Salesman Problem , 2012, IEEE Transactions on Automatic Control.

[6]  Marco Pavone,et al.  The Team Surviving Orienteers problem: routing teams of robots in uncertain environments with survival constraints , 2018, Auton. Robots.

[7]  Emilio Frazzoli,et al.  The curvature-constrained traveling salesman problem for high point densities , 2007, 2007 46th IEEE Conference on Decision and Control.

[8]  Mac Schwager,et al.  Correlated Orienteering Problem and its Application to Persistent Monitoring Tasks , 2014, IEEE Transactions on Robotics.

[9]  Rogelio Lozano,et al.  Dubins path generation for a fixed wing UAV , 2014, 2014 International Conference on Unmanned Aircraft Systems (ICUAS).

[10]  Jan Faigl,et al.  Online planning for multi-robot active perception with self-organising maps , 2018, Auton. Robots.

[11]  Mark H. Karwan,et al.  An Optimal Algorithm for the Orienteering Tour Problem , 1992, INFORMS J. Comput..

[12]  Jan Faigl,et al.  On close enough orienteering problem with Dubins vehicle , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[13]  Richard F. Hartl,et al.  Metaheuristics for the bi-objective orienteering problem , 2009, Swarm Intelligence.

[14]  Martin Saska,et al.  Dubins orienteering problem with neighborhoods , 2017, 2017 International Conference on Unmanned Aircraft Systems (ICUAS).

[15]  Jan Faigl,et al.  Self-organizing map-based solution for the Orienteering problem with neighborhoods , 2016, 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC).

[16]  Mirjana Cangalovic,et al.  General variable neighborhood search for the continuous optimization , 2006, Eur. J. Oper. Res..

[17]  J. C. Bean,et al.  An efficient transformation of the generalized traveling salesman problem , 1993 .

[18]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[19]  F. Bullo,et al.  On the point-to-point and traveling salesperson problems for Dubins' vehicle , 2005, Proceedings of the 2005, American Control Conference, 2005..

[20]  Tal Shima,et al.  Discretization-Based and Look-Ahead Algorithms for the Dubins Traveling Salesperson Problem , 2017, IEEE Transactions on Automation Science and Engineering.

[21]  Jan Faigl,et al.  Unsupervised learning for surveillance planning with team of aerial vehicles , 2017, 2017 International Joint Conference on Neural Networks (IJCNN).

[22]  L. Dubins On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[23]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[24]  Kemal Leblebicioglu,et al.  3D Path Planning for Multiple UAVs for Maximum Information Collection , 2014, J. Intell. Robotic Syst..

[25]  Jameela Al-Jaroodi,et al.  A Framework for Using Unmanned Aerial Vehicles for Data Collection in Linear Wireless Sensor Networks , 2014, J. Intell. Robotic Syst..

[26]  Pratap Tokekar,et al.  Energy-optimal trajectory planning for car-like robots , 2014, Auton. Robots.

[27]  Joao P. Hespanha,et al.  Algorithms for the traveling Salesman Problem with Neighborhoods involving a dubins vehicle , 2011, Proceedings of the 2011 American Control Conference.

[28]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[29]  S. Darbha,et al.  Sampling-Based Roadmap Methods for a Visual Reconnaissance UAV ∗ , 2010 .

[30]  Martin Saska,et al.  Dubins Orienteering Problem , 2017, IEEE Robotics and Automation Letters.

[31]  Aise Zülal Sevkli,et al.  Variable Neighborhood Search for the Orienteering Problem , 2006, ISCIS.

[32]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[33]  Geoffrey A. Hollinger,et al.  Unifying multi-goal path planning for autonomous data collection , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[34]  Hoong Chuin Lau,et al.  Orienteering Problem: A survey of recent variants, solution approaches and applications , 2016, Eur. J. Oper. Res..

[35]  Marc Pollefeys,et al.  PIXHAWK: A micro aerial vehicle design for autonomous flight using onboard computer vision , 2012, Auton. Robots.

[36]  Nicholas R. J. Lawrance,et al.  Real-time path planning for long-term information gathering with an aerial glider , 2016, Auton. Robots.

[37]  Vijay Kumar,et al.  Planning for opportunistic surveillance with multiple robots , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[38]  Martin Saska,et al.  Embedded model predictive control of unmanned micro aerial vehicles , 2016, 2016 21st International Conference on Methods and Models in Automation and Robotics (MMAR).

[39]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[40]  Ram Ramesh,et al.  An efficient four-phase heuristic for the generalized orienteering problem , 1991, Comput. Oper. Res..

[41]  Swaroop Darbha,et al.  Today's Traveling Salesman Problem , 2010, IEEE Robotics & Automation Magazine.

[42]  Sajal K. Das,et al.  Efficient Aerial Data Collection with UAV in Large-Scale Wireless Sensor Networks , 2015, Int. J. Distributed Sens. Networks.

[43]  Jan Faigl,et al.  Multi-robot path planning for budgeted active perception with self-organising maps , 2016, 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[44]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .

[45]  K. Obermeyer Path Planning for a UAV Performing Reconnaissance of Static Ground Targets in Terrain , 2009 .

[46]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[47]  Martin Saska,et al.  On solution of the Dubins touring problem , 2017, 2017 European Conference on Mobile Robots (ECMR).

[48]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[49]  Jan Faigl,et al.  On self-organizing maps for orienteering problems , 2017, 2017 International Joint Conference on Neural Networks (IJCNN).

[50]  Jan Faigl,et al.  Optimal Solution of the Generalized Dubins Interval Problem , 2018, Robotics: Science and Systems.