2013
DOI: 10.1109/tro.2013.2244785
|View full text |Cite
|
Sign up to set email alerts
|

Grasp Optimization Under Specific Contact Constraints

Abstract: Abstract-This paper presents a procedure to synthesize highquality grasps for objects that need to be held and manipulated in a specific way, characterized by a pre-specified set of contact constraints to be satisfied. Due to the multi-modal nature of typical grasp quality measures, approaches that resort to local optimization methods are likely to get trapped into local extrema on such problem. An additional difficulty of the problem is that the set of feasible grasps is a highly-dimensional manifold, implici… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
3
3

Relationship

3
3

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 40 publications
0
8
0
Order By: Relevance
“…In this case, the atlas construction takes 0.1 seconds on a standard desktop computer, while the isolation of the same space using branch-and-prune techniques Left: The configuration of the hand-object system must satisfy a number of contact constraints. An initial feasible grasp is computed using the branchand-prune methods [25] and is used as the initial configuration from which to construct an atlas of the relevant C-space subset [24]. Right: The chart centers of this atlas can be evaluated according to a performance criterion in order to select the optimal grasp.…”
Section: Continuation Methodsmentioning
confidence: 99%
“…In this case, the atlas construction takes 0.1 seconds on a standard desktop computer, while the isolation of the same space using branch-and-prune techniques Left: The configuration of the hand-object system must satisfy a number of contact constraints. An initial feasible grasp is computed using the branchand-prune methods [25] and is used as the initial configuration from which to construct an atlas of the relevant C-space subset [24]. Right: The chart centers of this atlas can be evaluated according to a performance criterion in order to select the optimal grasp.…”
Section: Continuation Methodsmentioning
confidence: 99%
“…Red polygons represent the charts to be extended in subsequent iterations. of a whole atlas is typically fast in 1-or 2-dimensional C-spaces, which allows tackling difficult optimization problems involving large multibody systems [19].…”
Section: Continuation Methodsmentioning
confidence: 99%
“…15) the configuration space becomes a null-measure manifold embedded in the ambient space formed by the joint variables [24]. Actually, kinematic loops appears in many relevant problems such as complex manipulation problems [51], parallel robot path generation [28], grasp planning [48], or surgery planning [2]. Fig.…”
Section: Path Planningmentioning
confidence: 99%