Rapidly-Exploring Quotient-Space Trees: Motion Planning using Sequential Simplifications

Motion planning problems can be simplified by admissible projections of the configuration space to sequences of lower-dimensional quotient-spaces, called sequential simplifications. To exploit sequential simplifications, we present the Quotient-space Rapidly-exploring Random Trees (QRRT) algorithm. QRRT takes as input a start and a goal configuration, and a sequence of quotient-spaces. The algorithm grows trees on the quotient-spaces both sequentially and simultaneously to guarantee a dense coverage. QRRT is shown to be (1) probabilistically complete, and (2) can reduce the runtime by at least one order of magnitude. However, we show in experiments that the runtime varies substantially between different quotient-space sequences. To find out why, we perform an additional experiment, showing that the more narrow an environment, the more a quotient-space sequence can reduce runtime.

[1]  Maxim Likhachev,et al.  Planning with adaptive dimensionality for mobile manipulation , 2012, 2012 IEEE International Conference on Robotics and Automation.

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

[3]  Jérôme Barraquand,et al.  A method of progressive constraints for manipulation planning , 1997, IEEE Trans. Robotics Autom..

[4]  Oliver Brock,et al.  Balancing Exploration and Exploitation in Sampling-Based Motion Planning , 2014, IEEE Transactions on Robotics.

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

[6]  P. Svestka.  On probabilistic completeness and expected complexity for probabilistic path planning , 1996 .

[7]  Chonhyon Park,et al.  An Efficient Acyclic Contact Planner for Multiped Robots , 2018, IEEE Transactions on Robotics.

[8]  Eiichi Yoshida,et al.  Quotient-Space Motion Planning , 2018, 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[9]  Aaron D. Ames,et al.  Footstep and motion planning in semi-unstructured environments using randomized possibility graphs , 2016, 2017 IEEE International Conference on Robotics and Automation (ICRA).

[10]  Olivier Stasse,et al.  Motion Planning in Irreducible Path Spaces , 2018, Robotics Auton. Syst..

[11]  Nancy M. Amato,et al.  Iterative relaxation of constraints: a framework for improving automated motion planning , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[13]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[14]  Lydia E. Kavraki,et al.  Kinodynamic Motion Planning by Interior-Exterior Cell Exploration , 2008, WAFR.

[15]  Dinesh Manocha,et al.  Motion planning of human-like robots using constrained coordination , 2009, 2009 9th IEEE-RAS International Conference on Humanoid Robots.

[16]  Yu-Chi Chang,et al.  Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction Method , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Bo Zhang,et al.  The Quotient Space Theory of Problem Solving , 2003, Fundam. Informaticae.

[18]  Boris Baginski,et al.  Local motion planning for manipulators based on shrinking and growing geometry models , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

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