By Topic

Output-Sensitive Computation of Force-Closure Grasps of a Semi-Algebraic Object

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)
Jae-Sook Cheong ; Creative and Challenging Research Division, Electronics and Telecommunications Research Institute, Daejon, South Korea ; Heinrich Kruger ; A. Frank van der Stappen

We propose a technique which significantly simplifies the computation of frictionless force-closure grasps of a curved planar part P. We use a colored projection scheme from the three-dimensional wrench space to two-dimensional screens, which allows us to reduce the problem of identifying combinations of arcs and concave vertices of P that admit frictionless force-closure grasps, to colored intersection searching problems in the screens. We show how to combine this technique with existing intersection searching algorithms to obtain efficient, output-sensitive algorithms to compute all force-closure grasps of P, where at most four hard, frictionless point contacts exert exactly four wrenches on P. If the boundary of P consists of n algebraic arcs of constant complexity and m concave vertices, we show how to compute all force-closure grasps with: (1) four contacts along four arcs in O(n8/3log1/3n+K) time; (2) four contacts along three arcs in O(n5/2+ε + K) time; (3) one contact at a concave vertex and two contacts along two arcs in O(n2m1/2+ε + K) time; (4) one contact at a concave vertex and two contacts along a single arc in O(nm) or O(n3/2+ε + K) time (depending on the size of m); where ε is an arbitrarily small positive constant and K is the output size-that is, the number of combinations of arcs and vertices of each type, that actually admit frictionless force-closure grasps.

Published in:

IEEE Transactions on Automation Science and Engineering  (Volume:8 ,  Issue: 3 )