Sampling-based path planning with goal oriented sampling

Path planning in complicated environments is a time consuming and computationally expensive task. Especially in high-dimensional configuration spaces with complex obstacles, searching for a proper path while avoiding collisions is still challenging. This paper presents an improved sampling-based algorithm, called the Goal Oriented sampling method (GO sampling) that quickly generates an initial solution overcoming these problems. GO sampling extends the sampling method of the Rapidly-exploring Random Tree (RRT) algorithm. GO sampling is able to identify the initial solution in a shorter time than that of the RRT algorithm and shows significant improvement in computational efficiency. The algorithm is evaluated with simulations in 2D and 3D space.

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

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

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

[4]  Siddhartha S. Srinivasa,et al.  Randomized path planning for redundant manipulators without inverse kinematics , 2007, 2007 7th IEEE-RAS International Conference on Humanoid Robots.

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

[6]  Emilio Frazzoli,et al.  Asymptotically-optimal path planning for manipulation using incremental sampling-based algorithms , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

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

[9]  T. Hasegawa,et al.  Grasp planning algorithm for a multifingered hand-arm robot , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[10]  Milan Simic,et al.  Sampling-Based Robot Motion Planning: A Review , 2014, IEEE Access.

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

[12]  Siddhartha S. Srinivasa,et al.  Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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