DocumentCode
3104782
Title
Planning force-closure grasps on 3-D objects
Author
Zhu, XiangYang ; Ding, Han
Author_Institution
Robotics Inst., Shanghai Jiao Tong Univ., China
Volume
2
fYear
2004
fDate
April 26-May 1, 2004
Firstpage
1258
Abstract
Computation of grasps with form/force-closure is one of the fundamental problems in the study of multifingered grasping and dexterous manipulation. Based on the geometric condition of the closure property, this paper presents a numerical test to quantify how far a grasp is from losing form/force-closure. With the polyhedral approximation of the friction cone, the proposed numerical test can be formulated as a single linear program. An iterative algorithm for computing optimal force-closure grasps, which is implemented by minimizing the proposed numerical test in the grasp configuration space, is also developed. The algorithm is computationally efficient and generally applicable. It can be used for computing form/force-closure grasps on 3D objects with curved surfaces, and with any number of contact points. Several simulation examples are given to show the effectiveness and computational efficiency of the proposed algorithm.
Keywords
computational geometry; dexterous manipulators; iterative methods; linear programming; path planning; 3Dobjects; computational geometry; dexterous manipulation; force closure grasp planning; grasp configuration space; iterative algorithm; linear programming; multifingered grasping; optimal force closure grasps; polyhedral approximation; Algorithm design and analysis; Computational efficiency; Computational modeling; Erbium; Fingers; Friction; Grasping; Iterative algorithms; Robots; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Automation, 2004. Proceedings. ICRA '04. 2004 IEEE International Conference on
ISSN
1050-4729
Print_ISBN
0-7803-8232-3
Type
conf
DOI
10.1109/ROBOT.2004.1307997
Filename
1307997
Link To Document