Manipulation planning on constraint manifolds

We present the Constrained Bi-directional Rapidly-Exploring Random Tree (CBiRRT) algorithm for planning paths in configuration spaces with multiple constraints. This algorithm provides a general framework for handling a variety of constraints in manipulation planning including torque limits, constraints on the pose of an object held by a robot, and constraints for following workspace surfaces. CBiRRT extends the Bi-directional RRT (BiRRT) algorithm by using projection techniques to explore the configuration space manifolds that correspond to constraints and to find bridges between them. Consequently, CBiRRT can solve many problems that the BiRRT cannot, and only requires one additional parameter: the allowable error for meeting a constraint. We demonstrate the CBiRRT on a 7DOF WAM arm with a 4DOF Barrett hand on a mobile base. The planner allows this robot to perform household tasks, solve puzzles, and lift heavy objects.

[1]  Lydia E. Kavraki,et al.  A probabilistic roadmap approach for systems with closed kinematic chains , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[2]  Katsu Yamane,et al.  Synthesizing animations of human manipulation tasks , 2004, ACM Trans. Graph..

[3]  Giuseppe Oriolo,et al.  Motion Planning for Mobile Manipulators along Given End-effector Paths , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[4]  Matthew T. Mason,et al.  Compliance and Force Control for Computer Controlled Manipulators , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Mike Stilman,et al.  Task constrained motion planning in robot joint space , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[6]  Marilena Vendittelli,et al.  Probabilistic motion planning for redundant robots along given end-effector paths , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Yong K. Hwang,et al.  SANDROS: a dynamic graph search algorithm for motion planning , 1998, IEEE Trans. Robotics Autom..

[8]  David E. Orin,et al.  Efficient Dynamic Computer Simulation of Robotic Mechanisms , 1982 .

[9]  Jean-Claude Latombe,et al.  Planning motions with intentions , 1994, SIGGRAPH.

[10]  John T. Wen,et al.  A global approach to path planning for redundant manipulators , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[11]  Michael M. Curtiss,et al.  RRTs for nonlinear, discrete, and hybrid planning and control , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[12]  Oussama Khatib,et al.  Synthesis of Whole-Body Behaviors through Hierarchical Control of Behavioral Primitives , 2005, Int. J. Humanoid Robotics.

[13]  L. Siciliano.  Modelling and Control of Robot Manipulators , 2000 .

[14]  Kamal K. Gupta,et al.  Path planning with general end-effector constraints: using task space to guide configuration space search , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[15]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

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

[17]  Bruno Siciliano,et al.  Modeling and Control of Robot Manipulators , 1995 .