By Topic

An Efficient Algorithm for Grasp Synthesis and Fixture Layout Design in Discrete Domain

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiangyang Zhu ; Robotics Inst., Shanghai Jiaotong Univ. ; Han Ding

This paper presents an efficient algorithm for grasp synthesis and fixture layout design in discrete domain. Given N candidate contact points on the surface of a 3-D object, the algorithm determines a minimal subset from the candidate points so that they construct a grasp or a fixture with the form-closure property. The proposed algorithm is implemented by solving a single linear program. It has been shown that a minimal subset of the contact points that achieves form-closure can be directly identified from the optimal basic solution vector of the linear program, provided that the solution vector is nondegenerate. The proposed algorithm has a straightforward geometric interpretation, which has also been described in the paper. The primary advantage of the proposed algorithm is its computational simplicity, of which the overall complexity is O(N). Numerical examples have been presented to verify the effectiveness and efficiency of the algorithm, which show that the computational time cost of the algorithm is much less than the existing techniques described in the literature

Published in:

IEEE Transactions on Robotics  (Volume:23 ,  Issue: 1 )