Computation of fingertip positions for a form-closure grasp

Dan Ding, Yun Hui Liu, Jianwei Zhang, Alois Knoll

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

Abstract

This paper proposes a simple and efficient algorithm for computing a form-closure grasp on a 3D polyhedral object. This algorithm searches for a form-closure grasp from a "good" initial grasp in a promising search direction that pulls the convex hull of the primitive contact wrenches towards the origin of the wrench space. The "good" initial grasp is a set of contact points that minimizes the distance between the origin and the centroid of the primitive contact wrenches, and can be calculated by the quadratic programming. The local promising search direction at every step is readily determined by the ray-shooting based qualitative test algorithm developed in our early work. By using the "good" initial grasp, the iteration times of search can be significantly reduced so that a form-closure grasp can be found more efficiently. Since the algorithm adopts a local search strategy, its computational cost is less dependent on the complexity of the object surface. Finally, the algor ithm has been implemented and its efficiency has been ascertained by three examples.

Original languageEnglish
Pages (from-to)2217-2222
Number of pages6
JournalProceedings - IEEE International Conference on Robotics and Automation
Volume3
DOIs
StatePublished - 2001
Externally publishedYes

Fingerprint

Dive into the research topics of 'Computation of fingertip positions for a form-closure grasp'. Together they form a unique fingerprint.

Cite this