Abstract
In prior work, we extended the well-known form closure grasp framework for rigid parts to a class of deformable parts, modeled as frictionless polygons with a finite element mesh and given stiffness matrix. We define the D-space (deformationspace) of a part as the C-space of all its mesh nodes and deform closure in terms of the work needed to release the part from a set of finger contacts.
In the present paper, we define a measure of grasp quality for two-point deformclosure grasps. This metric is based on balancing the potential energy needed to release the part against the potential energy that would result in plastic deformation. Given two jaw contacts at the perimeter nodes, we give a numerical algorithm to determine the optimal jaw separation based on this metric. For a part with n mesh nodes and p perimeter nodes, the algorithm computes an approximation to the optimal separation in time O(n3 p2 + ( p2 /ε) log p).
This work was supported in part by the Ford Motor Company URP 2000-403R and NSF Award DMI-0010069. For more information, please contact goldberg@ieor.berkeley.edu or gopal@ieor.berkeley.edu.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Gopalakrishnan, K.“., Goldberg, K. Computing Deform Closure Grasps. In: Erdmann, M., Overmars, M., Hsu, D., van der Stappen, F. (eds) Algorithmic Foundations of Robotics VI. Springer Tracts in Advanced Robotics, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10991541_15
Download citation
DOI: https://doi.org/10.1007/10991541_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25728-8
Online ISBN: 978-3-540-31506-3
eBook Packages: EngineeringEngineering (R0)