arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2506.08856cs.RO
收藏

快速估计全局最优独立接触区域,用于鲁棒抓取与操作

Fast Estimation of Globally Optimal Independent Contact Regions for Robust Grasping and Manipulation

The Robotics Institute, Carnegie Mellon University(卡内基梅隆大学机器人研究所)

Jonathan P. King, Harnoor Ahluwalia, Michael Zhang, Nancy S. Pollard

AI总结:

本文提出基于增量n维Delaunay三角剖分的分治任意时间算法,快速计算具有有界次优性的全局最优平面接触ICRs,速度较现有方法提升百倍以上。

摘要:

本工作提出了一种快速的任意时间算法,用于计算全局最优的独立接触区域(ICRs)。ICRs是这样的区域:每个区域内的一个接触点即可构成有效抓取。ICRs的位置能够为抓取与操作规划、学习以及策略迁移提供指导。然而,面向现代应用的ICRs仍很少被探索,部分原因在于其计算代价高昂,因为它们具有随接触点数量呈指数增长的搜索空间。我们提出了一种基于增量式n维Delaunay三角剖分的分治算法,能够在足以满足实时规划的时间内生成具有有界次优性的结果。本文介绍了适用于接触点位于同一平面内的抓取的基础算法。实验表明,与相互竞争的抓取质量指标相比,该方法具有显著优势;相较于计算ICRs的其他竞争方法,其加速达到100倍甚至更高。我们还探索了由ICRs引导的策略的鲁棒性,并概述了通向通用3D实现的路径。代码将在论文发表后发布,以促进进一步开发与应用。

英文摘要:

This work presents a fast anytime algorithm for computing globally optimal independent contact regions (ICRs). ICRs are regions such that one contact within each region enables a valid grasp. Locations of ICRs can provide guidance for grasp and manipulation planning, learning, and policy transfer. However, ICRs for modern applications have been little explored, in part due to the expense of computing them, as they have a search space exponential in the number of contacts. We present a divide and conquer algorithm based on incremental n-dimensional Delaunay triangulation that produces results with bounded suboptimality in times sufficient for real-time planning. This paper presents the base algorithm for grasps where contacts lie within a plane. Our experiments show substantial benefits over competing grasp quality metrics and speedups of 100X and more for competing approaches to computing ICRs. We explore robustness of a policy guided by ICRs and outline a path to general 3D implementation. Code will be released on publication to facilitate further development and applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑