By Topic

A Dynamic RRT Path Planning Algorithm Based on B-Spline

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Enzhong Shan ; Sch. of Mechatron. Eng. & Autom., Nat. Univ. of Defense Technol., Changsha, China ; Bin Dai ; Jinze Song ; Zhenping Sun

For the application of ALV (automatic land vehicle) running in a dynamic environment, an improved dynamic RRT (rapidly exploring random trees) path planning algorithm is proposed. The algorithm combines the noholonomic constraints of the vehicle with double extend RRTs, and the three order B-spline basic functions are used to approach and create a new smooth route which suits for the vehicle to follow. The algorithm not only improves the efficiency of searching but also guarantees the feasibility of the path at the same time. Based on the idea of rolling optimization, the algorithm is improved for real-time path planning in a dynamic environment. The simulation outcomes and field tests verify the effectiveness of the method proposed.

Published in:

Computational Intelligence and Design, 2009. ISCID '09. Second International Symposium on  (Volume:2 )

Date of Conference:

12-14 Dec. 2009