By Topic

Easily computable optimum grasps in 2-D and 3-D

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)
B. Mirtich ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA ; J. Canny

We consider the problem of finding optimum force closure grasps of two and three-dimensional objects. Our focus is on grasps which are useful in practice, namely grasps with a small number of fingers, with friction at the contacts. Assuming frictional contact and rounded finger tips-very mild assumptions in practice-we give new upper (and lower) bounds on the number of fingers necessary to achieve force closure grasps of 2-D and 3-D objects. We develop an optimality criterion based on the notion of decoupled wrenches, and use this criterion to derive optimum two and three finger grasps of 2-D objects, and optimum three finger grasps for 2-D objects. We present a simple O(n) algorithm for computing these optimum grasps for convex polygons, a O(n log n) algorithm for nonconvex polygons, and an O(n3) algorithm for polyhedra. In studying these optimum grasps, we derive several interesting theoretical results concerning grasp geometry

Published in:

Robotics and Automation, 1994. Proceedings., 1994 IEEE International Conference on

Date of Conference:

8-13 May 1994