MILP optimal path planning for real-time applications

This paper presents several efficient solution techniques specific to the optimal path planning of an autonomous vehicle. Mixed-integer linear programming (MILP) is the underlying problem formulation, from which an optimal solution can be obtained through the use of a commercially available MILP solver such as CPLEX. The solution obtained is optimal in terms of the cost function specified in terms of fuel, time, altitude, etc. Several techniques are introduced to reduce the complexity of the underlying mathematical problems as to help make the path planning approach suitable for running in a mission-critical real-time environment. Some of these techniques may be applicable to other optimal path planning approaches

[1]  B. Moor,et al.  Mixed integer programming for multi-vehicle path planning , 2001, 2001 European Control Conference (ECC).

[2]  E. Feron,et al.  Safe receding horizon path planning for autonomous vehicles , 2002 .

[3]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[4]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[5]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[6]  Mark B. Milam,et al.  Real-Time Optimal Trajectory Generation for Constrained Dynamical Systems , 2003 .

[7]  Jonathan P. How,et al.  Receding horizon control of autonomous aerial vehicles , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).