Flight Trajectory Path Planning

The paper describes an application of the A* algorithm for flight path planning for airplanes with defined motion dynamics operating in a continuous three-dimensional space constrained by existing physical obstacles. The presented A* algorithm modification provides significant acceleration (reduction of the state space) of the path planning process. The described algorithm is able to find a path through small gaps between obstacles using a pre-defined searching precision. The paper documents a set of path planning benchmarks where the solution quality and internal algorithm properties are compared against the A* algorithm for flight trajectory path planning.

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

[2]  Howie Choset,et al.  Composition of local potential functions for global robot control and navigation , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

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

[4]  Stefano Carpin,et al.  Robot motion planning using adaptive random walks , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

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

[6]  Stefano Carpin,et al.  Merging the adaptive random walks planner with the randomized potential field planner , 2005, Proceedings of the Fifth International Workshop on Robot Motion and Control, 2005. RoMoCo '05..

[7]  S. LaValle,et al.  Smoothly Blending Vector Fields for Global Robot Navigation , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[8]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[9]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[10]  Philippe Souères,et al.  Optimal trajectories for nonholonomic mobile robots , 1998 .

[11]  Anthony Stentz,et al.  3D Field D: Improved Path Planning and Replanning in Three Dimensions , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.