arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2312.05034cs.ROcs.AIcs.LGcs.NE
收藏

作为双线性矩阵不等式问题的抓取力优化:一种深度学习方法

Grasp Force Optimization as a Bilinear Matrix Inequality Problem: A Deep Learning Approach

IIT Guwahati(印度理工学院古瓦哈提分校);University of Edinburgh(爱丁堡大学)

Hirakjyoti Basumatary, Daksh Adhar, Riddhiman Shaw, Shyamanta M. Hazarika

AI总结:

本文将多指机器人手的抓取力优化建模为BMI问题,并提出深度学习求解方法,以在未知物体上高效生成最优质量的力封闭抓取。

摘要:

抓取力综合是一个涉及双线性约束的非凸优化问题。解决该问题的传统方法包括通用的基于梯度的非线性优化和半定规划。为了处理姿态协同以及非光滑但凸的半正定约束,我们将目光投向基于梯度的优化之外。本文的重点是将多指机器人手的仿生抓取分析作为一个双线性矩阵不等式(BMI)问题来开展。我们的分析旨在利用深度学习方法求解该问题,使算法能够在未训练/未见过的物体上高效生成具有最优抓取质量的力封闭抓取。

英文摘要:

Grasp force synthesis is a non-convex optimization problem involving constraints that are bilinear. Traditional approaches to this problem involve general-purpose gradient-based nonlinear optimization and semi-definite programming. With a view towards dealing with postural synergies and non-smooth but convex positive semidefinite constraints, we look beyond gradient-based optimization. The focus of this paper is to undertake a grasp analysis of biomimetic grasping in multi-fingered robotic hands as a bilinear matrix inequality (BMI) problem. Our analysis is to solve it using a deep learning approach to make the algorithm efficiently generate force closure grasps with optimal grasp quality on untrained/unseen objects.

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

↑