Efficient Sampling-Based Motion Planning for On-Road Autonomous Driving

This paper introduces an efficient motion planning method for on-road driving of the autonomous vehicles, which is based on the rapidly exploring random tree (RRT) algorithm. RRT is an incremental sampling-based algorithm and is widely used to solve the planning problem of mobile robots. However, due to the meandering path, the inaccurate terminal state, and the slow exploration, it is often inefficient in many applications such as autonomous vehicles. To address these issues and considering the realistic context of on-road autonomous driving, we propose a fast RRT algorithm that introduces a rule-template set based on the traffic scenes and an aggressive extension strategy of search tree. Both improvements lead to a faster and more accurate RRT toward the goal state compared with the basic RRT algorithm. Meanwhile, a model-based prediction postprocess approach is adopted, by which the generated trajectory can be further smoothed and a feasible control sequence for the vehicle would be obtained. Furthermore, in the environments with dynamic obstacles, an integrated approach of the fast RRT algorithm and the configuration-time space can be used to improve the quality of the planned trajectory and the replanning. A large number of experimental results illustrate that our method is fast and efficient in solving planning queries of on-road autonomous driving and demonstrate its superior performances over previous approaches.

[1]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[2]  Nancy M. Amato,et al.  Adapting RRT growth for heterogeneous environments , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[4]  J.L. Martins de Carvalho,et al.  Towards the development of intelligent transportation systems , 2001, ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585).

[5]  Sebastian Thrun,et al.  Anytime Dynamic A*: An Anytime, Replanning Algorithm , 2005, ICAPS.

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

[7]  Junghwan Lee,et al.  Cloud RRT∗: Sampling Cloud based RRT∗ , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[8]  Myoungho Sunwoo,et al.  Local Path Planning for Off-Road Autonomous Driving With Avoidance of Static Obstacles , 2012, IEEE Transactions on Intelligent Transportation Systems.

[9]  Sebastian Thrun,et al.  Stanley: The robot that won the DARPA Grand Challenge , 2006, J. Field Robotics.

[10]  Ross A. Knepper,et al.  Model-Predictive Motion Planning: Several Key Developments for Autonomous Mobile Robots , 2014, IEEE Robotics & Automation Magazine.

[11]  Nidhi Kalra,et al.  Replanning with RRTs , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[12]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[13]  Maxim Likhachev,et al.  D*lite , 2002, AAAI/IAAI.

[14]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[15]  Seiichi Mita,et al.  Unified path planner for parking an autonomous vehicle based on RRT , 2011, 2011 IEEE International Conference on Robotics and Automation.

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

[17]  Jonathan P. How,et al.  Motion Planning in Complex Environments using Closed-loop Prediction , 2008 .

[18]  Sebastian Thrun,et al.  Junior: The Stanford entry in the Urban Challenge , 2008, J. Field Robotics.

[19]  Jean-Claude Latombe,et al.  Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts , 1999, Int. J. Robotics Res..

[20]  Hong Cheng.  Autonomous Intelligent Vehicles - Theory, Algorithms, and Implementation , 2011, Advances in Computer Vision and Pattern Recognition.

[21]  Nancy M. Amato,et al.  An obstacle-based rapidly-exploring random tree , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[22]  Jun Miura,et al.  3D time-space path planning algorithm in dynamic environment utilizing Arrival Time Field and Heuristically Randomized Tree , 2012, 2012 IEEE International Conference on Robotics and Automation.

[23]  Reid G. Simmons,et al.  Approaches for heuristically biasing RRT growth , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[24]  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).

[25]  Nanning Zheng,et al.  A path generation method for automated vehicles based on Bezier curve , 2013, 2013 IEEE/ASME International Conference on Advanced Intelligent Mechatronics.

[26]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[27]  Tao Mei,et al.  An improved RRT-based motion planner for autonomous vehicle in cluttered environments , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[28]  Maxim Likhachev,et al.  Motion planning in urban environments , 2008, J. Field Robotics.

[29]  Reid G. Simmons,et al.  Particle RRT for Path Planning with Uncertainty , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[30]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[31]  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.

[32]  Robert Platt,et al.  Optimal sampling-based planning for linear-quadratic kinodynamic systems , 2013, 2013 IEEE International Conference on Robotics and Automation.

[33]  Manuela M. Veloso,et al.  Real-time randomized path planning for robot navigation , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[34]  Emilio Frazzoli,et al.  Sampling-based optimal motion planning for non-holonomic dynamical systems , 2013, 2013 IEEE International Conference on Robotics and Automation.

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

[36]  Nanning Zheng,et al.  A fast RRT algorithm for motion planning of autonomous road vehicles , 2014, 17th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[37]  Anthony Stentz.  Optimal and Efficient Path Planning for Unknown and Dynamic Environments , 1993 .

[38]  James J. Kuffner,et al.  Multipartite RRTs for Rapid Replanning in Dynamic Environments , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.