By Topic

On Computing Reliable Optimal Grasping Forces

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

3 Author(s)
Yu Zheng ; Department of Computer Science , University of North Carolina at Chapel Hill, Chapel Hill, USA ; Ming C. Lin ; Dinesh Manocha

This paper presents algorithms for optimal grasping forces. The previous work reveals that contact forces with minimal sum or maximum of normal force components can be written as positive combinations of primitive contact forces, to which the corresponding primitive contact wrenches express the required resultant wrench as their positive combination with minimum coefficients in terms of the L1 or L metric. On this basis, we first propose an algorithm to compute such a set of primitive contact forces and the minimum contact forces. Moreover, considering the uncertainty in the actual friction coefficient, we develop another algorithm to determine the minimum required friction coefficient and the corresponding minimum contact forces within a given limit on their magnitude so that such contact forces are more reliable in practice. As our algorithms do not rely on any general optimization technique, they are very efficient and easy to implement. These algorithms can also be used in grasp quality evaluation and optimal grasp planning.

Published in:

IEEE Transactions on Robotics  (Volume:28 ,  Issue: 3 )