Autonomous Vehicle Path Planning Considering Dwarf or Negative Obstacles

Autonomous vehicle path planning involves finding a collision-free and kinematic-feasible path from the start to the goal. Evidently, collision-free and kinematic-feasible are the two most important parts of the path planning process. In this paper, we propose a collision checking method that considers dwarf or negative obstacles, which can improve the traversabil-ity and stability under the promise of ensuring collision-free, and we use a kind of motion primitives which considering non-holonomic constraints for path planning to generate a kinematic-feasible path. Specifically, some existing approaches of collision checking deal with lofty and dwarf obstacles, or wide and narrow, negative obstacles in the same manner that require the entire vehicle body to steer awayfrom them. However, some dwarf obstacles are shorter than the chassis of the vehicle while some negative obstacles are narrower than the vehicle track. In those cases, overstriding maneuvers will prove much more efficient and reasonable. Moreover, dealing with these obstacles in the same wayas lofty obstacles can dramatically reduce the flexibility and disturb the stability of path planning under clustered environments, especially when the vehicle moves at higher speed. This paper proposes a double layer collision checking (DLCC) method that deals with lofty and dwarf obstacles, or wide and narrow, negative obstacles separately, effectively increasing the flexibility under the complex scenarios where dwarf and narrow negative obstacles exist.

[1]  Jin-Woo Lee,et al.  Tunable and stable real-time trajectory planning for urban autonomous driving , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[2]  Martin Buss,et al.  Efficient Evaluation of Collisions and Costs on Grid Maps for Autonomous Vehicle Motion Planning , 2014, IEEE Transactions on Intelligent Transportation Systems.

[3]  Alonzo Kelly,et al.  Reactive Nonholonomic Trajectory Generation via Parametric Optimal Control , 2003, Int. J. Robotics Res..

[4]  Benoit M. Macq,et al.  Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods , 1999, Comput. Vis. Image Underst..

[5]  Mitul Saha,et al.  Exact Collision Checking of Robot Paths , 2002, WAFR.

[6]  Karl Popp,et al.  Ground Vehicle Dynamics , 2010 .

[7]  David González,et al.  Continuous curvature planning with obstacle avoidance capabilities in urban scenarios , 2014, 17th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[8]  Alberto Elfes,et al.  Using occupancy grids for mobile robot perception and navigation , 1989, Computer.

[9]  Maxim Likhachev,et al.  Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles , 2008, Int. J. Robotics Res..

[10]  Fawzi Nashashibi,et al.  Real-time dynamic trajectory planning for highly automated driving in highways , 2010, 13th International IEEE Conference on Intelligent Transportation Systems.

[11]  Qi Wang,et al.  Voronoi-Based Heuristic for Nonholonomic Search-Based Path Planning , 2014, IAS.

[12]  Maxim Likhachev,et al.  Efficient cost computation in cost map planning for non-circular robots , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[13]  Julius Ziegler,et al.  Fast collision checking for intelligent vehicle motion planning , 2010, 2010 IEEE Intelligent Vehicles Symposium.

[14]  Ross A. Knepper,et al.  Differentially constrained mobile robot motion planning in state lattices , 2009, J. Field Robotics.

[15]  Masayoshi Tomizuka,et al.  Fast lane changing computations using polynomials , 2003, Proceedings of the 2003 American Control Conference, 2003..

[16]  Sebastian Thrun,et al.  Path Planning for Autonomous Vehicles in Unknown Semi-structured Environments , 2010, Int. J. Robotics Res..