A path planning method based on improved RRT

An improved Rapidly-exploring Random Tree* (RRT*) algorithm was given, which focused on the problem of UAV path planning in 3-D dynamic environment. By considering the constraint of the UAV, the frequency of collision checking in the searching stage was reduced. And this could save searching time. D* Lite algorithm was introduced to RRT* to solve the dynamic path planning problem. The information of the length and the collision checking results on the route segments was saved to construct a road map. By using the road map, D* Lite algorithm could be more efficient. The simulation results show that the improved RRT* algorithm can find the result more quickly, and when a sudden threat arise, the algorithm can find a substituted route fast.

[1]  Emilio Frazzoli,et al.  Anytime Motion Planning using the RRT* , 2011, 2011 IEEE International Conference on Robotics and Automation.

[2]  Emilio Frazzoli,et al.  Incremental Sampling-based Algorithms for Optimal Motion Planning , 2010, Robotics: Science and Systems.

[3]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[4]  Kwangjin Yang.  An efficient Spline-based RRT path planner for non-holonomic robots in cluttered environments , 2013, 2013 International Conference on Unmanned Aircraft Systems (ICUAS).

[5]  F. Islam,et al.  RRT∗-Smart: Rapid convergence implementation of RRT∗ towards optimal solution , 2012, 2012 IEEE International Conference on Mechatronics and Automation.

[6]  He Han-gen,et al.  An Improved RRT Path Planning Algorithm , 2010 .

[7]  Emilio Frazzoli,et al.  Bounds on tracking error using closed-loop rapidly-exploring random trees , 2010, Proceedings of the 2010 American Control Conference.

[8]  Emilio Frazzoli,et al.  Anytime computation of time-optimal off-road vehicle maneuvers using the RRT* , 2011, IEEE Conference on Decision and Control and European Control Conference.