Algorithms for Routing an Unmanned Aerial Vehicle in the Presence of Refueling Depots

We consider a single Unmanned Aerial Vehicle (UAV) routing problem where there are multiple depots and the vehicle is allowed to refuel at any depot. The objective of the problem is to find a path for the UAV such that each target is visited at least once by the vehicle, the fuel constraint is never violated along the path for the UAV, and the total fuel required by the UAV is a minimum. We develop an approximation algorithm for the problem, and propose fast construction and improvement heuristics to solve the same. Computational results show that solutions whose costs are on an average within 1.4% of the optimum can be obtained relatively fast for the problem involving five depots and 25 targets.

[1]  Markus Bläser,et al.  A new approximation algorithm for the asymmetric TSP with triangle inequality , 2003, TALG.

[2]  G. Laporte,et al.  Discrete Optimization The multi-depot vehicle routing problem with inter-depot routes , 2007 .

[3]  W. A. Malik,et al.  A Lagrangian-Based Algorithm for a Multiple Depot, Multiple Travelling Salesmen Problem , 2007, 2007 American Control Conference.

[4]  Debasish Ghose,et al.  Two-agent cooperative search using game models with endurance-time constraints , 2010 .

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

[6]  Samir Khuller,et al.  To fill or not to fill: The gas station problem , 2007, TALG.

[7]  Eric W. Frew,et al.  Networking Issues for Small Unmanned Aircraft Systems , 2009, J. Intell. Robotic Syst..

[8]  Michel Gendreau,et al.  Vehicle Routeing with Multiple Use of Vehicles , 1996 .

[9]  Moshe Lewenstein,et al.  Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs , 2005, JACM.

[10]  M. V. Ramana,et al.  Capturing vertical profiles of aerosols and black carbon over the Indian Ocean using autonomous unmanned aerial vehicles , 2007 .

[11]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[12]  Richard F. Hartl,et al.  A variable neighborhood search for the capacitated arc routing problem with intermediate facilities , 2008, J. Heuristics.

[13]  L. Wolsey,et al.  Chapter 9 Optimal trees , 1995 .

[14]  Roberto Musmanno,et al.  Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions , 2004, J. Math. Model. Algorithms.

[15]  Gregory L Feitshans,et al.  Vigilant Spirit Control Station (VSCS) "The Face of COUNTER" , 2008 .

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

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[18]  G. Holland,et al.  Applications of Aerosondes in the Arctic , 2004 .

[19]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..

[20]  Shieu-Hong Lin,et al.  Finding Optimal Refueling Policies in Transportation Networks , 2008, AAIM.

[21]  Peter Eades,et al.  On Optimal Trees , 1981, J. Algorithms.

[22]  Johannes O. Royset,et al.  Routing Military Aircraft with a Constrained Shortest-Path Algorithm , 2009 .

[23]  Alan M. Frieze,et al.  On the worst-case performance of some algorithms for the asymmetric traveling salesman problem , 1982, Networks.