Multiple-criterion shortest path algorithms for global path planning of unmanned combat vehicles

Abstract We consider a multiple-criterion shortest path problem with resource constraints, in which one needs to find paths between two points in a terrain for the movement of an unmanned combat vehicle (UCV). In the path planning problem considered here, cumulative traverse time of the UCV, risk level, and (communication) jamming level associated with the paths are limited to be less than or equal to given limits. We propose a modified label-correcting algorithm with a new label-selection strategy to find Pareto-optimal solutions for the multiple objectives of minimizing the traverse time, risk level, and jamming level related to the paths. In addition, we develop a path planning algorithm based on the label-correcting method to solve problems with a single objective within a reasonably short time. For evaluation of the performance of the proposed algorithms, computational experiments are performed on a number of instances, and results show that the proposed algorithms perform better than existing methods in terms of a computation time.

[1]  Bruce L. Golden,et al.  Solvingk-shortest and constrained shortest path problems efficiently , 1989 .

[2]  I. Murthy,et al.  A parametric approach to solving bicriterion shortest path problems , 1991 .

[3]  Jared L. Cohon,et al.  Multiobjective programming and planning , 2004 .

[4]  Anna Sciomachen,et al.  A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks , 1998, Eur. J. Oper. Res..

[5]  P. Subbaraj,et al.  A nondominated sorting genetic algorithm solution for shortest path routing problem in computer networks , 2012, Expert Syst. Appl..

[6]  Francesca Guerriero,et al.  The interactive analysis of the multicriteria shortest path problem by the reference point method , 2003, Eur. J. Oper. Res..

[7]  David Pisinger,et al.  Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..

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

[9]  R. Musmanno,et al.  Label Correcting Methods to Solve Multicriteria Shortest Path Problems , 2001 .

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

[11]  Jared L. Cohon,et al.  An interactive approach to identify the best compromise solution for two objective shortest path problems , 1990, Comput. Oper. Res..

[12]  I. Murthy,et al.  An interactive procedure using domination cones for bicriterion shortest path problems , 1994 .

[13]  D. Rathbun,et al.  An evolution based path planning algorithm for autonomous motion of a UAV through uncertain environments , 2002, Proceedings. The 21st Digital Avionics Systems Conference.

[14]  E. Martins.  On a multicriteria shortest path problem , 1984 .

[15]  Douglas R. Shier,et al.  Label-Correcting Shortest Path Algorithms Revisited , 2006 .

[16]  Feng Zhou,et al.  Dynamic Modeling and Soil Mechanics for Path Planning of the Mars Exploration Rovers , 2011 .

[17]  Lei Shu,et al.  Planning Paths with Fewer Turns on Grid Maps , 2013, SOCS.

[18]  Jin-Seob Choi,et al.  Collision-Free Path Planning for Articulated Robots , 1996 .

[19]  Jun-Hee Han,et al.  Finding a risk-constrained shortest path for an unmanned combat vehicle , 2015, Comput. Ind. Eng..

[20]  Pierre Hansen.  An O(tm log D) Algorithm for shortest paths , 1980, Discret. Appl. Math..

[21]  Tal Shima,et al.  Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms , 2011, Comput. Oper. Res..

[22]  Patricio V. Poblete,et al.  An O(mlog logD) algorithm for shortest paths , 1983, Discret. Appl. Math..

[23]  H. Moskowitz,et al.  Generalized dynamic programming for multicriteria optimization , 1990 .

[24]  Roberto Roberti,et al.  Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints , 2012, Eur. J. Oper. Res..

[25]  Matthias Ehrgott,et al.  A comparison of solution strategies for biobjective shortest path problems , 2009, Comput. Oper. Res..

[26]  Randy S. Roberts,et al.  An adaptive path planning algorithm for cooperating unmanned air vehicles , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[27]  Dimitri P. Bertsekas,et al.  A simple and fast label correcting algorithm for shortest paths , 1993, Networks.

[28]  Claudio M. Rocco Sanseverino,et al.  A bi-objective approach for shortest-path network interdiction , 2010, Comput. Ind. Eng..

[29]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[30]  Piet Demeester,et al.  Speeding up Martins’ algorithm for multiple objective shortest path problems , 2013, 4OR.

[31]  U. Pape,et al.  Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[32]  Nenad Mladenovic,et al.  New exact method for large asymmetric distance-constrained vehicle routing problem , 2013, Eur. J. Oper. Res..

[33]  Roberto Roberti,et al.  New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..

[34]  Jong-Tae Rhee,et al.  Collision-Free Path Planning for Robot Manipulator using SOM , 1996 .

[35]  Rakesh Nagi,et al.  Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles , 2008, Comput. Oper. Res..

[36]  João C. N. Clímaco,et al.  Multicriteria path and tree problems: discussion on exact algorithms and applications , 2012, Int. Trans. Oper. Res..

[37]  Brian Kallehauge,et al.  Formulations and exact algorithms for the vehicle routing problem with time windows , 2008, Comput. Oper. Res..

[38]  Kim Allan Andersen,et al.  A label correcting approach for solving bicriterion shortest-path problems , 2000, Comput. Oper. Res..

[39]  Chung-Ho Wang,et al.  Optimization of an established multi-objective delivering problem by an improved hybrid algorithm , 2009, 2009 International Conference on Computers & Industrial Engineering.

[40]  Jian Ma,et al.  A subjective and objective integrated approach to determine attribute weights , 1999, Eur. J. Oper. Res..

[41]  Yeong-Dae Kim,et al.  Heuristics for determining a patrol path of an unmanned combat vehicle , 2012, Comput. Ind. Eng..

[42]  Kazuya Yoshida,et al.  Path Planning for Planetary Exploration Rovers and Its Evaluation based on Wheel Slip Dynamics , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[43]  Paolo Serafini,et al.  Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems , 1987 .

[44]  Howie Choset,et al.  Path Planning for Robotic Demining: Robust Sensor-Based Coverage of Unstructured Environments and Probabilistic Methods , 2003, Int. J. Robotics Res..

[45]  Juan José Salazar González,et al.  A column generation approach for a school bus routing problem with resource constraints , 2013, Comput. Oper. Res..