Combinatorial optimization for hierarchical contact-level grasping

19Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We address the problem of generating force-closed point contact grasps on complex surfaces and model it as a combinatorial optimization problem. Using a multilevel refinement metaheuristic, we maximize the quality of a grasp subject to a reachability constraint by recursively forming a hierarchy of increasingly coarser optimization problems. A grasp is initialized at the top of the hierarchy and then locally refined until convergence at each level. Our approach efficiently addresses the high dimensional problem of synthesizing stable point contact grasps while resulting in stable grasps from arbitrary initial configurations. Compared to a sampling-based approach, our method yields grasps with higher grasp quality. Empirical results are presented for a set of different objects. We investigate the number of levels in the hierarchy, the computational complexity, and the performance relative to a random sampling baseline approach.

Cite

CITATION STYLE

APA

Hang, K., Stork, J. A., Pokorny, F. T., & Kragic, D. (2014). Combinatorial optimization for hierarchical contact-level grasping. In Proceedings - IEEE International Conference on Robotics and Automation (pp. 381–388). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/ICRA.2014.6906885

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free