Hybrid RRT: A Semi-Dual-Tree RRT-Based Motion Planner

Rapidly-exploring Random Trees (RRTs) have been widely used for motion planning problems due to their ability to efficiently find solutions. Informed RRT* is an optimized version of RRT, which not only implements the rewiring process to optimize the tree but also limits the search area to a subset of the state space to return near-optimal solutions faster. However, limiting the state space is a function of the obtained shortest path so that before a solution is found, the planner cannot limit the state space to a subset. Moreover, unidirectional RRTs such as Informed RRT* take more time to find initial solutions in comparison to the bidirectional RRTs. In this paper, we propose Hybrid RRT, which divides the planning process into three parts: finding initial solutions by a dual-tree search, combining two trees into one, and optimizing the solution. In order to obtain an initial solution, Hybrid RRT implements a dual-tree search, which helps it find solutions faster than unidirectional searches. Then, it combines the start tree and the goal tree of the dual-tree search into one so as to implement informed sampling for a single tree to optimize the current solution. The simulation carried out in Open Motion Planning Library (OMPL), which shows that Hybrid RRT achieved outstanding improvement over RRT* and Informed RRT*.

[1]  Lydia E. Kavraki,et al.  The Open Motion Planning Library , 2012, IEEE Robotics & Automation Magazine.

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

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

[4]  T. Barfoot,et al.  The Probability Density Function of a Transformation-based Hyperellipsoid Sampling Technique , 2014, 1404.1347.

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

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

[7]  Siddhartha S. Srinivasa,et al.  Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs , 2014, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[8]  M. Farooq,et al.  Note on the generation of random points uniformly distributed in hyper-ellipsoids , 2002, Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997).

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

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

[11]  Stefano Di Cairano,et al.  Continuous curvature path planning for semi-autonomous vehicle maneuvers using RRT , 2015, 2015 European Control Conference (ECC).

[12]  Siddhartha S. Srinivasa,et al.  Informed Sampling for Asymptotically Optimal Path Planning , 2018, IEEE Transactions on Robotics.

[13]  G. Wahba A Least Squares Estimate of Satellite Attitude , 1965 .

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

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

[16]  David González,et al.  A Review of Motion Planning Techniques for Automated Vehicles , 2016, IEEE Transactions on Intelligent Transportation Systems.

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

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

[19]  Christian Laugier,et al.  Probabilistic navigation in dynamic environment using Rapidly-exploring Random Trees and Gaussian processes , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[20]  Emilio Frazzoli,et al.  A Survey of Motion Planning and Control Techniques for Self-Driving Urban Vehicles , 2016, IEEE Transactions on Intelligent Vehicles.

[21]  Max Q.-H. Meng,et al.  Finding a High-Quality Initial Solution for the RRTs Algorithms in 2D Environments , 2019, Robotica.

[22]  Max Q.-H. Meng,et al.  Tropistic RRT*: An Efficient Planning Algorithm via Adaptive Restricted Sampling Space , 2018, 2018 IEEE International Conference on Information and Automation (ICIA).

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

[24]  E. van Kampen,et al.  Comparison between A* and RRT Algorithms for UAV Path Planning , 2018 .