arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.10682cs.ROcs.SYeess.SY
收藏

基于视觉约束的逆运动学

Inverse Kinematics with Vision-Based Constraints

Boston University(波士顿大学)

Liangting Wu, Roberto Tron

AI总结:

本文提出视觉逆运动学问题(VIK),通过引入虚拟运动链将视场约束转化为关节角约束,并结合半定规划与秩最小化算法求解,仿真验证了方法的有效性。

摘要:

本文引入了视觉逆运动学问题(VIK),以填补机器人逆运动学(IK)与视觉伺服控制之间的空白。与IK问题不同,VIK问题旨在除运动学约束外,还寻求满足基于视觉约束的机器人构型。在本工作中,我们建立了带有视场(FoV)约束的VIK问题形式化描述,以强制机器人上的相机对物体的可见性。我们提出的解决方案基于添加一条连接物理机器人与物体的虚拟运动链的思想;FoV约束因此等价于一个关节角运动学约束。在此过程中,我们引入了多种基于视觉的代价函数以实现不同的目标。我们使用一种涉及半定规划(SDP)约束并随后进行秩最小化算法的方法来求解该VIK问题的形式化描述。该方法求解VIK问题的性能通过仿真得到了验证。

英文摘要:

This paper introduces the Visual Inverse Kinematics problem (VIK) to fill the gap between robot Inverse Kinematics (IK) and visual servo control. Different from the IK problem, the VIK problem seeks to find robot configurations subject to vision-based constraints, in addition to kinematic constraints. In this work, we develop a formulation of the VIK problem with a Field of View (FoV) constraint, enforcing the visibility of an object from a camera on the robot. Our proposed solution is based on the idea of adding a virtual kinematic chain connecting the physical robot and the object; the FoV constraint is then equivalent to a joint angle kinematic constraint. Along the way, we introduce multiple vision-based cost functions to fulfill different objectives. We solve this formulation of the VIK problem using a method that involves a semidefinite program (SDP) constraint followed by a rank minimization algorithm. The performance of this method for solving the VIK problem is validated through simulations.

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

↑