Planning Motions Compliant to Complex Contact States
Authors:
- 1 June 2001
- journal article
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 20 (6) , 446-465
Abstract
Many robotic tasks require compliant motions, but planning such motions poses special challenges not present in collision-free motion planning. One challenge is how to achieve exactness, that is, 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. The authors tackle the problem with a hybrid approach of direct exploitation of contact constraints and randomized planning. They particularly focus on planning motion that maintains certain contact state or contact formation (CF), called a CF-compliant motion, because a general compliant motion is a sequence of such CF-compliant motions with respect to different CFs. This paper describes a randomized planner for planning CF-compliant motion between two arbitrary polyhedral solids, extending the probabilistic roadmap paradigm for planning collision-free motion to the space of contact configurations. Key to this approach is a novel sampling strategy to generate random CF-compliant configurations. The authors also present and discuss examples of sampling and planning results.Keywords
This publication has 16 references indexed in Scilit:
- Computing metric and topological properties of configuration-space obstacles2003
- A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles2003
- Automatic Generation of High-Level Contact State SpaceThe International Journal of Robotics Research, 2001
- Estimating First-Order Geometric Parameters and Monitoring Contact Transitions during Force-Controlled Compliant MotionThe International Journal of Robotics Research, 1999
- Contact constraint analysis and determination of geometrically valid contact formations from possible contact primitivesIEEE Transactions on Robotics and Automation, 1997
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996
- Interference-Free Insertion of a Solid Body Into a Cavity: An Algorithm and a Medical ApplicationThe International Journal of Robotics Research, 1996
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygonsComputational Geometry, 1991
- A search algorithm for motion planning with six degrees of freedomArtificial Intelligence, 1987
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983