Feasible RRT-based path planning using seventh order Bézier curves

This paper presents a methodology based on a variation of the Rapidly-exploring Random Trees (RRTs) that generates feasible trajectories for autonomous vehicles with holonomic constraints in environments with obstacles. Our approach is based on seventh order Bézier curves to connect vertexes of the tree, generating paths that do not violate the main kinematic constraints of the vehicle. The methodology also does not require complex kinematic and dynamic models of the vehicle. The smoothness of the acceleration profile of the entire path is directly guaranteed by controlling the curvature values at the extreme points of each Bézier that composes the tree. The proposed algorithm provides fast convergence to the final result with several other advantages, such as the reduction in the number of vertexes of the tree because the method enable connections between vertexes of the tree with unlimited range. In an environment with few obstacles, a very small quantity of vertexes (sometimes only two) is sufficient to take the robot between two points. The properties of the seventh order Bézier formulation are also used to avoid collisions with static obstacles in the environment.

[1]  Scott A. Bortoff,et al.  Path planning for UAVs , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[2]  T. Sakkalis,et al.  Pythagorean hodographs , 1990 .

[3]  Yoshiaki Kuwata,et al.  Robust Constrained Receding Horizon Control for Trajectory Planning , 2005 .

[4]  Atilla Dogan,et al.  Probabilistic Path Planning for UAVs , 2003 .

[5]  C. A. Neff,et al.  Hermite interpolation by Pythagorean hodograph quintics , 1995 .

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

[7]  P. Cheng,et al.  RRT-based trajectory design for autonomous automobiles and spacecraft , 2001 .

[8]  A. Tsourdos,et al.  A solution to simultaneous arrival of multiple UAVs using Pythagorean hodograph curves , 2006, 2006 American Control Conference.

[9]  Timothy W. McLain,et al.  Maximizing miniature aerial vehicles , 2006, IEEE Robotics & Automation Magazine.

[10]  Mario Fernando Montenegro Campos,et al.  On the Generation of Trajectories for Multiple UAVs in Environments with Obstacles , 2010, J. Intell. Robotic Syst..

[11]  Kwangjin Yang,et al.  Real-time continuous curvature path planning of UAVS in cluttered environments , 2008, 2008 5th International Symposium on Mechatronics and Its Applications.

[12]  Vladimir J. Lumelsky,et al.  Classification of the Dubins set , 2001, Robotics Auton. Syst..

[13]  Patrick Doherty,et al.  Reconfigurable Path Planning for an Autonomous Unmanned Aerial Vehicle , 2006, 2006 International Conference on Hybrid Information Technology.

[14]  Rida T. Farouki,et al.  The elastic bending energy of Pythagorean-hodograph curves , 1996, Comput. Aided Geom. Des..

[15]  Fujio Yamaguchi,et al.  Computer-Aided Geometric Design , 2002, Springer Japan.

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