A Primal-Dual Heuristic for a Heterogeneous Unmanned Vehicle Path Planning Problem

We consider a path planning problem where a team of Unmanned Vehicles (UVs) is required to visit a given set of targets. The UVs are assumed to carry different sensors, and as a result, there are vehicle-target constraints that require each UV to visit a distinct subset of targets. The objective of the path planning problem is to find a path for each UV such that each target is visited at least once by some vehicle, the vehicle-target constraints are satisfied and the total distance travelled by the vehicles is a minimum. This path planning problem is a generalization of the Hamiltonian path problem and is NP-Hard. We develop a primal-dual heuristic and incorporate the heuristic in a Lagrangian relaxation procedure to find good, feasible solutions and lower bounds for the path planning problem. Computational results show that solutions whose costs are on an average within 14% of the optimum can be obtained relatively quickly for the path planning problem involving five UVs and 40 targets.

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

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

[3]  Bruce L. Golden,et al.  A Computational Study Of A New Heuristic For The Site-Dependent Vehicle Routing Problem , 1999 .

[4]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[5]  Sivakumar Rathinam,et al.  An Approximation Algorithm for a Heterogeneous Traveling Salesman Problem , 2011 .

[6]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[8]  Swaroop Darbha,et al.  A Lagrangian-Based Algorithm for a Multiple Depot, Multiple Travelling Salesmen Problem , 2007, ACC.

[9]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[10]  M. Pachter,et al.  Research issues in autonomous control of tactical UAVs , 1998, Proceedings of the 1998 American Control Conference. ACC (IEEE Cat. No.98CH36207).

[11]  S. Darbha,et al.  Approximation algorithms for a heterogeneous Multiple Depot Hamiltonian Path Problem , 2011, Proceedings of the 2011 American Control Conference.

[12]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

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

[14]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[15]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[16]  Swaroop Darbha,et al.  Approximation algorithms and heuristics for a 2‐depot, heterogeneous Hamiltonian path problem , 2011 .

[17]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[18]  I-Ming Chao,et al.  A New Tabu Search Heuristic for the Site-Dependent Vehicle Routing Problem , 2005 .

[19]  Susanne Timsjo,et al.  An Application of Lagrangian Relaxation to the Traveling Salesman Problem , 1999 .

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

[21]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[22]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..