Probabilistic Completeness of Randomized Possibility Graphs Applied to Bipedal Walking in Semi-unstructured Environments

We present a theoretical analysis of a recent whole body motion planning method, the Randomized Possibility Graph, which uses a high-level decomposition of the feasibility constraint manifold in order to rapidly find routes that may lead to a solution. These routes are then examined by lower-level planners to determine feasibility. In this paper, we show that this approach is probabilistically complete for bipedal robots performing quasi-static walking in "semi-unstructured" environments. Furthermore, we show that the decomposition into higher and lower level planners allows for a considerably higher rate of convergence in the probability of finding a solution when one exists. We illustrate this improved convergence with a series of simulated scenarios.

[1]  J. Chestnutt,et al.  Planning Biped Navigation Strategies in Complex Environments , 2003 .

[2]  Robin Deits,et al.  Footstep planning on uneven terrain with mixed-integer convex optimization , 2014, 2014 IEEE-RAS International Conference on Humanoid Robots.

[3]  Siddhartha S. Srinivasa,et al.  A framework for extreme locomotion planning , 2012, 2012 IEEE International Conference on Robotics and Automation.

[4]  Masayuki Inaba,et al.  Footstep planning among obstacles for biped robots , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[5]  David Hsu,et al.  Narrow passage sampling for probabilistic roadmap planning , 2005, IEEE Transactions on Robotics.

[6]  Aaron D. Ames,et al.  Algorithmic Foundations of Realizing Multi-Contact Locomotion on the Humanoid Robot DURUS , 2016, WAFR.

[7]  Siddhartha S. Srinivasa,et al.  Probabilistically complete planning with end-effector pose constraints , 2010, 2010 IEEE International Conference on Robotics and Automation.

[8]  Timothy Bretl,et al.  Motion Planning for Legged Robots on Varied Terrain , 2008, Int. J. Robotics Res..

[9]  Chonhyon Park,et al.  A Reachability-Based Planner for Sequences of Acyclic Contacts in Cluttered Environments , 2015, ISRR.

[10]  James J. Kuffner,et al.  Effective sampling and distance metrics for 3D rigid body path planning , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

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

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

[13]  Victor Ng-Thow-Hing,et al.  Randomized multi-modal motion planning for a humanoid robot manipulation task , 2011, Int. J. Robotics Res..

[14]  Ruzena Bajcsy,et al.  Human-data based cost of bipedal robotic walking , 2011, HSCC '11.

[15]  Satoshi Kagami,et al.  An adaptive action model for legged navigation planning , 2007, 2007 7th IEEE-RAS International Conference on Humanoid Robots.

[16]  Siddhartha S. Srinivasa,et al.  Task Space Regions , 2011, Int. J. Robotics Res..

[17]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1998, IEEE Trans. Robotics Autom..

[18]  Jean-Claude Latombe,et al.  Multi-modal Motion Planning in Non-expansive Spaces , 2010, Int. J. Robotics Res..