Constrained Navigation with Mandatory Waypoints in Uncertain Environment

This paper presents a hybrid solving method for vehicle path planning problems. As part of the vehicle system architecture (vetronic), planning is dynamic and has to be activated on-line, which requires response times to be compatible with mission execution. The proposed approach combines constraint solving techniques with an Ant Colony Optimization (ACO). The hybridization relies on a static probing technique which builds up a search strategy using a distance information between problem variables and a heuristic solution. Various forms of this approach are compared and evaluated on real world scenarios. Preliminary results exhibit response times close to vehicle control requirements, on realistic problem instances.

[1]  Adi Botea,et al.  Near Optimal Hierarchical Path-Finding , 2004, J. Game Dev..

[2]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[3]  Mark Abramson,et al.  Executing Reactive, Model-based Programs through Graph-based Temporal Planning , 2001, IJCAI.

[4]  Christian Plaunt,et al.  Emergency Landing Planning for Damaged Aircraft , 2008 .

[5]  Pascal Van Hentenryck,et al.  An Efficient Arc Consistency Algorithm for a Class of CSP Problems , 1991, IJCAI.

[6]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

[7]  Mark Wallace,et al.  Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.

[8]  Stuart J. Russell.  Efficient Memory-Bounded Search Methods , 1992, ECAI.

[9]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[10]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[11]  Maria Fox,et al.  Automatic Synthesis and Use of Generic Types in Planning , 2000, AIPS.

[12]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[13]  Michel Minoux,et al.  Graphes et algorithmes , 1995 .

[14]  Robert P. Goldman,et al.  MACBeth: A Multi-Agent Constraint-Based Planner , 2000 .

[15]  Malik Ghallab,et al.  Planning with Sharable Resource Constraints , 1995, IJCAI.

[16]  Nicola Muscettola,et al.  HSTS: Integrating Planning and Scheduling , 1993 .

[17]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[18]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[19]  Rob Sherwood,et al.  Casper: Space Exploration through Continuous Planning , 2001, IEEE Intell. Syst..

[20]  Michela Milano,et al.  Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces, 27) , 2003 .

[21]  Alexander Reinefeld,et al.  Enhanced Iterative-Deepening Search , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Sven Koenig,et al.  Dynamic fringe-saving A* , 2009, AAMAS.

[23]  Tony White,et al.  Revisiting Elitism in Ant Colony Optimization , 2003, GECCO.

[24]  Eric A. Hansen,et al.  Anytime Heuristic Search , 2011, J. Artif. Intell. Res..

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