首页> 外文会议>International Conference on Robotics and Automation >Planning Optimal Independent Contact Regions for Two-Fingered Force-Closure Grasp of a Polygon
【24h】

Planning Optimal Independent Contact Regions for Two-Fingered Force-Closure Grasp of a Polygon

机译:规划最佳独立的接触区域,用于多边形的双指力闭合

获取原文

摘要

This paper addresses the problem of optimizing the maximal independent contact region for two-fingered force-closure grasp of a rigid object in 2D. Existing methods for optimizing this criterion considered only independent graspable regions on a given pair of edges. We propose an algorithm that takes nearby edges into consideration so that larger independent contact regions can be obtained. Our method takes the input polygons, computes graspable regions for each pair of edges, merge all adjacent regions together, and then find the best independent contact region inscribed in those regions. Two different criteria to define the best independent contact region are studied. The first criterion maximizes area of the axis-parallel rectangle in the configuration space, while the other criterion maximizes the smaller side's length of the rectangle. For a given object with n vertices, the first criterion can be optimized using the algorithm from Karen Daniels et al. in O(n{sup}2 (log n){sup}2) time, while the other criterion can be optimized using the algorithm from Evanthia Papadopoulou and D. T. Lee in O(n{sup}2 log n) time.
机译:本文地址优化极大独立的接触区域对2D的刚性物体的两指力封闭把握的问题。用于优化该标准的现有方法在给定的一对边缘认为仅独立可抓握区域。我们提出了一种算法,需要在附近的边缘考虑,这样可以得到更大的独立的接触区域。我们的方法接受输入多边形,计算可抓握区域的每对边缘的,所有的相邻区域合并到一起,然后找到在这些区域内切的最好的独立的接触区域。两个不同的标准来定义的最佳独立的接触区域进行了研究。第一标准最大化在配置空间中的轴平行的矩形的区域,而其它标准最大化的矩形的短边的长度。对于具有n个顶点的给定对象,所述第一准则可以使用来自克伦Daniels等人的算法进行优化。在O(N {SUP} 2(log n)的{} SUP 2)时间,而其他标准可以使用从Evanthia帕帕佐普洛卢夫和D. T.李在O算法(N {SUP} 2 log n)的时间进行优化。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号