Abstract
Assuming that grasp points of n-1 fingers on a polyhedral object are given and the n-1 fingers do not achieve a form-closure grasp, this paper proposes an efficient algorithm for computing all grasp points on the object for the n-th finger to achieve a form-closure grasp with other n-1 fingers. A sufficient and necessary condition is developed for forming the form-closure grasp. Based on the sufficient and necessary condition, we transform the grasp computation to a problem of: 1) computing the convex cone of the primitive contact wrenches of the n-1 fingers; and 2) checking the intersection between a circular region and a convex polygon in a 2D space. We have implemented the algorithm and confirmed its usefulness by an example.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
