...
首页> 外文期刊>IEEE Transactions on Robotics >Computation of Force-Closure Grasps: An Iterative Algorithm
【24h】

Computation of Force-Closure Grasps: An Iterative Algorithm

机译:强制闭包的计算:一种迭代算法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Computation of grasps with form/force closure is one of the fundamental problems in the study of multifingered grasping and dextrous manipulation. Based on the geometric condition of the closure property, this paper presents a numerical test to quantify how far a grasp is from losing form/force closure. With the polyhedral approximation of the friction cone, the proposed numerical test can be formulated as a single linear program. An iterative algorithm for computing optimal force-closure grasps, which is implemented by minimizing the proposed numerical test in the grasp configuration space, is also developed. The algorithm is computationally efficient and generally applicable. It can be used for computing form/force-closure grasps on 3-D objects with curved surfaces, and with any number of contact points. Simulation examples are given to show the effectiveness and computational efficiency of the proposed algorithm.
机译:具有形状/力闭合的抓握计算是多指抓握和灵巧操纵研究中的基本问题之一。基于闭合特性的几何条件,本文提出了一个数值测试,以量化抓握距离失去形式/力闭合的距离。利用摩擦锥的多面体近似,可以将所提出的数值测试公式化为单个线性程序。还开发了一种用于计算最佳力闭合抓地力的迭代算法,该算法通过最小化抓地力配置空间中的拟议数值测试来实现。该算法在计算上是有效的并且普遍适用。它可用于计算具有曲面和任意数量接触点的3-D对象的形状/力闭合抓紧力。仿真算例表明了该算法的有效性和计算效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号