RTR+C*CS: An effective geometric planner for car-like robots

The need for intelligent autonomous vehicles is increasing in industrial and everyday life as well. Path planning among obstacles is one of the challenging problems to be solved to achieve autonomous navigation. In this paper we present a global geometric path planning method for car-like robots, which proved to be effective especially in cluttered environments, containing narrow passages. Navigation in such scenarios usually requires non-obvious manoeuvring with many reversals, which is challenging even for a human driver. We also present a comparative analysis of our method with possible alternatives from the literature to illustrate its effectiveness regarding computation time and path quality.

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

[2]  S. LaValle.  Planning Algorithms: Sampling-Based Motion Planning , 2006 .

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

[4]  Akos Nagy,et al.  Path planning and control of differential and car-like robots in narrow environments , 2015, 2015 IEEE 13th International Symposium on Applied Machine Intelligence and Informatics (SAMI).

[5]  Thierry Siméon,et al.  Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[6]  Abraham Sánchez López,et al.  Sampling-Based Motion Planning: A Survey , 2008, Computación y Sistemas.

[7]  Gabor Tevesz,et al.  A steering method for the kinematic car using C*CS paths , 2014, Proceedings of the 2014 15th International Carpathian Control Conference (ICCC).

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

[9]  Richard M. Murray,et al.  A motion planner for nonholonomic mobile robots , 1994, IEEE Trans. Robotics Autom..

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

[11]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[12]  Jean-Paul Laumond,et al.  Guidelines in nonholonomic motion planning for mobile robots , 1998 .

[13]  Marilena Vendittelli,et al.  Nonholonomic distance to polygonal obstacles for a car-like robot of polygonal shape , 2006, IEEE Transactions on Robotics.

[14]  Sepanta Sekhavat,et al.  Nonholonomic deformation of a potential field for motion planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).