Planning motion compliant to complex contact states

In robotic tasks and in mechanism design, planning motion compliant to contacts is often desired, but planning such motion poses special challenges not present in collision-free motion planning. One challenge is how to achieve exactness, i.e., how to make sure that a planned path is exactly compliant to a desired contact state, especially when the configuration manifold of such a contact state is hard to describe analytically due to high geometrical complexity and/or high dimensionality. We tackle the problem with a hybrid approach of direct computation to exploit contact constraints and randomized planning. We describe such a planner for planning motion compliant to a contact formation between two arbitrary polyhedra and present results of implementation.

[1]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[2]  Joris De Schutter,et al.  Estimating First-Order Geometric Parameters and Monitoring Contact Transitions during Force-Controlled Compliant Motion , 1999, Int. J. Robotics Res..

[3]  Raimund Seidel,et al.  A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons , 1991, Comput. Geom..

[4]  Jean-Daniel Boissonnat,et al.  A practical exact motion planning algorithm for polygonal object amidst polygonal obstacles , 1988, Geometry and Robotics.

[5]  Russell H. Taylor,et al.  Interference-Free Insertion of a Solid Body Into a Cavity: An Algorithm and a Medical Application , 1996, Int. J. Robotics Res..

[6]  Jing Xiao,et al.  Automatic determination of topological contacts in the presence of sensing uncertainties , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[7]  Jean-Daniel Boissonnat,et al.  A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[8]  Dinesh Manocha,et al.  Fast algorithms for penetration and contact determination between non-convex polyhedral models , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[9]  Bruce Randall Donald,et al.  On motion planning with six degrees of freedom: Solving the intersection problems in configuration space , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[10]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[11]  Jing Xiao,et al.  Towards random sampling with contact constraints , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[12]  Jing Xiao,et al.  A divide-and-merge approach to automatic generation of contact states and planning of contact motion , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[13]  Randy C. Brost,et al.  Computing metric and topological properties of configuration-space obstacles , 1989, Proceedings, 1989 International Conference on Robotics and Automation.