Towards reactive whole-body motion planning in cluttered environments by precomputing feasible motion spaces

To solve complex whole-body motion planning problems in near real-time, we think it essentials to precompute as much information as possible, including our intended movements and how they affect the geometrical reasoning process. In this paper, we focus on the precomputation of the feasibility of contact transitions in the context of discrete contact planning. Our contribution is two-fold: First, we introduce the contact transition and object (CTO) space, a joint space of contact states and geometrical information. Second, we develop an algorithm to precompute the decision boundary between feasible and non-feasible spaces in the CTO space. This boundary is used for online-planning in classical contact-transition spaces to quickly prune the number of possible future states. By using a classical planning setup of A* together with a l2-norm heuristic, we demonstrate how the prior knowledge about object geometries can achieve near real-time performance in highly-cluttered environments, thereby not only outperforming the state-of-the-art algorithm, but also having a significantly lower model sparsity.

[1]  Christopher M. Bishop,et al.  Pattern Recognition and Machine Learning (Information Science and Statistics) , 2006 .

[2]  Sylvain Miossec,et al.  Planning contact points for humanoid robots , 2013, Robotics Auton. Syst..

[3]  Olivier Stasse,et al.  Fast Humanoid Robot Collision-Free Footstep Planning Using Swept Volume Approximations , 2012, IEEE Transactions on Robotics.

[4]  Carme Torras,et al.  Collision detection algorithms for motion planning , 1998 .

[5]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[6]  Marc Toussaint,et al.  Robot trajectory optimization using approximate inference , 2009, ICML '09.

[7]  Takeo Kanade,et al.  Footstep Planning for the Honda ASIMO Humanoid , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[8]  Dinesh Manocha,et al.  Fast Proximity Queries with Swept Sphere Volumes , 1999 .

[9]  Jun Nakanishi,et al.  Dynamical Movement Primitives: Learning Attractor Models for Motor Behaviors , 2013, Neural Computation.

[10]  Daniel Maier,et al.  Search-Based Footstep Planning , 2013 .

[11]  Radford M. Neal MCMC Using Hamiltonian Dynamics , 2011, 1206.1901.

[12]  Oussama Khatib,et al.  A Unified Approach to Integrate Unilateral Constraints in the Stack of Tasks , 2009, IEEE Transactions on Robotics.

[13]  Timothy Bretl,et al.  Using Motion Primitives in Probabilistic Sample-Based Planning for Humanoid Robots , 2008, WAFR.

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

[15]  Barr,et al.  Superquadrics and Angle-Preserving Transformations , 1981, IEEE Computer Graphics and Applications.

[16]  Joel E. Chestnutt,et al.  Navigation and Gait Planning , 2010 .