A hybrid genetic algorithm for rescue path planning in uncertain adversarial environment

Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key assumptions and heuristic procedures to reduce problem complexity. In this paper, a new model and a hybrid genetic algorithm are proposed to solve the rescue path planning problem for a single vehicle navigating in uncertain adversarial environment. We present a simplified mathematical linear programming formulation aimed at minimizing traveled distance and threat exposure. As an approximation to the basic problem, the user-defined model allows to specify a lower bound on the optimal solution for some particular survivability conditions. Hard problem instances are then solved using a novel hybrid genetic algorithm relaxing some of the common assumptions considered by previous path construction methods. The algorithm evolves a population of solution combining genetic operators with a new stochastic path generation technique, providing guided local search, while improving solution quality. The value of the problem-solving approach is shown for simple cases and compared to an alternate heuristic.

[1]  Simon X. Yang,et al.  A knowledge based genetic algorithm for path planning of a mobile robot , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[2]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[3]  K. Klamroth,et al.  Path Planning for UAVs in the Presence of Threat Zones Using Probabilistic Modeling , 2005 .

[4]  Atilla Dogan.  Probabilistic approach in path planning for UAVs , 2003, Proceedings of the 2003 IEEE International Symposium on Intelligent Control.

[5]  Timothy W. McLain,et al.  Cooperative control of UAV rendezvous , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[6]  S. Uryasev,et al.  Aircraft routing under the risk of detection , 2006 .

[7]  Samy Bengio,et al.  The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..

[8]  Christina Hallam,et al.  A Multiobjective Optimal Path Algorithm , 2001, Digit. Signal Process..

[9]  Timothy W. McLain,et al.  Real-time dynamic trajectory smoothing for unmanned air vehicles , 2005, IEEE Transactions on Control Systems Technology.

[10]  Rolf H. Möhring,et al.  Acceleration of Shortest Path and Constrained Shortest Path Computation , 2005, WEA.

[11]  Raffaello D'Andrea,et al.  Path Planning for Unmanned Aerial Vehicles in Uncertain and Adversarial Environments , 2003 .

[12]  J.P. Hespanha,et al.  Probabilistic map building for aircraft-tracking radars , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[13]  Joseph S. B. Mitchell,et al.  The weighted region problem: finding shortest paths through a weighted planar subdivision , 1991, JACM.

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

[15]  Fuchun Sun,et al.  Evolutionary route planner for unmanned air vehicles , 2005, IEEE Transactions on Robotics.

[16]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.

[17]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[18]  Scott A. Bortoff,et al.  Path planning for UAVs , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).