让机械臂沿预定路径运动时可实时调整,兼顾规划效率与灵活性。
Dynamic Programming-Based Offline Redundancy Resolution of Redundant Manipulators Along Prescribed Paths with Real-Time Adjustment
- 基于动态规划计算调整系数的最大变化范围
- 相邻路径点间系数变化不超过阈值即可实时更新关节角
- 融合离线规划与在线调整,适合高精度轨迹控制场景
传统冗余机械臂离线冗余度求解在笛卡尔空间路径上计算逆运动学解,但无法实现实时调整。在线冗余度求解虽支持实时调整,却无法预判后续路径点,可能导致因关节约束而中途停机。为此,本文提出一种基于动态规划的离线冗余度求解方法,可在指定路径上实现沿法向的实时调整。通过动态规划计算调整系数变化的全局最大值,只要相邻采样路径点间的系数变化不超过该上限,算法即可根据当前关节角求解下一路径点的关节角,使末端执行器达到调整后的笛卡尔位姿。核心创新在于将传统离线最优规划与实时调整能力结合,实现离线与在线规划的融合。
原文摘要 · Abstract (English)
Traditional offline redundancy resolution of trajectories for redundant manipulators involves computing inverse kinematic solutions for Cartesian space paths, constraining the manipulator to a fixed path without real-time adjustments. Online redundancy resolution can achieve real-time adjustment of paths, but it cannot consider subsequent path points, leading to the possibility of the manipulator being forced to stop mid-motion due to joint constraints. To address this, this paper introduces a dynamic programming-based offline redundancy resolution for redundant manipulators along prescribed paths with real-time adjustment. The proposed method allows the manipulator to move along a prescribed path while implementing real-time adjustment along the normal to the path. Using Dynamic Programming, the proposed approach computes a global maximum for the variation of adjustment coefficients. As long as the coefficient variation between adjacent sampling path points does not exceed this limit, the algorithm provides the next path point's joint angles based on the current joint angles, enabling the end-effector to achieve the adjusted Cartesian pose. The main innovation of this paper lies in augmenting traditional offline optimal planning with real-time adjustment capabilities, achieving a fusion of offline planning and online planning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。