A considering lane information and obstacle-avoidance motion planning approach

We present an improved RRT* to blend lane information and avoid obstacles in this paper. Unlike most of other improved RRT*, this paper attach great importance to the convergent goal of RRT*. We consider the condition that there exists a reference path, maybe not the shortest path, but the environment requires the vehicle to follow, such as a lane center. Compared with standard RRT* applied to differential situation, we first add a TesttoGoal procedure to improve the convergent speed and also make sure the path can reach the goal pose but not the goal region to promise the safety of autonomous vehicle. One of the key characteristic of our improved algorithm is to employ a fast clothoid fitting method into RRT* to enable us to control the curvature. Another important modification is the heuristic sampling method that makes our algorithm can converge to lane center. We evaluate our algorithm with a real lane to demonstrate the effect of our modifications.

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

[2]  Dan Halperin,et al.  Asymptotically near-optimal RRT for fast, high-quality, motion planning , 2014, ICRA.

[3]  Doran Wilde Computing clothoid segments for trajectory generation , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[4]  Leslie Pack Kaelbling,et al.  LQR-RRT*: Optimal sampling-based motion planning with automatically derived extension heuristics , 2012, 2012 IEEE International Conference on Robotics and Automation.

[5]  Abraham Sánchez López,et al.  Non-holonomic path planning using a quasi-random PRM approach , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[6]  M. Brezak,et al.  Path Smoothing Using Clothoids for Differential Drive Mobile Robots , 2011 .

[7]  H. Okabe,et al.  A motion planning method for an AUV , 1996, Proceedings of Symposium on Autonomous Underwater Vehicle Technology.

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

[9]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[10]  John Canny,et al.  The complexity of robot motion planning , 1988 .

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

[12]  Panagiotis Tsiotras,et al.  Use of relaxation methods in sampling-based algorithms for optimal motion planning , 2013, 2013 IEEE International Conference on Robotics and Automation.

[13]  Enrico Bertolazzi,et al.  Fast and accurate $G^1$ fitting of clothoid curves , 2013, 1305.6644.

[14]  Jonathan P. How,et al.  Real-Time Motion Planning With Applications to Autonomous Urban Driving , 2009, IEEE Transactions on Control Systems Technology.

[15]  Emilio Frazzoli,et al.  Optimal kinodynamic motion planning using incremental sampling-based methods , 2010, 49th IEEE Conference on Decision and Control (CDC).

[16]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[17]  Dan Halperin,et al.  Asymptotically near-optimal RRT for fast, high-quality, motion planning , 2013, 2014 IEEE International Conference on Robotics and Automation (ICRA).

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