Local Path Planning for Autonomous Land Vehicle Based on Navigation Function

To address the local path planning problem for autonomous land vehicle in unstructured environments, a novel method combining navigation function and A* search is proposed. The computed navigation function in this paper embodies different constraints of vehicle, so in fact to be a near-feasible trajectory. Next the navigation function and sensed obstacles is used to construct the heuristic function, which is useful for the A* search of a local path from the initial state to the goal state in real time. Experiment results show that the proposed method can well solve the problem of local path planning for autonomous land vehicle in unstructured environments.

[1]  Alonzo Kelly,et al.  State space sampling of feasible motions for high‐performance mobile robot navigation in complex environments , 2008, J. Field Robotics.

[2]  E. Feron,et al.  Real-time motion planning for agile autonomous vehicles , 2000, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[3]  Mark H. Overmars,et al.  A probabilistic learning approach to motion planning , 1995 .

[4]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[5]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[6]  Sven Koenig,et al.  Incremental A* , 2001, NIPS.

[7]  Anthony Stentz,et al.  DD* Lite: Efficient Incremental Search with State Dominance , 2006, AAAI.

[8]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[9]  S. Thrun,et al.  Anytime Dynamic A * : The Proofs , 2005 .

[10]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.