arXiv:2505.02323cs.ROcs.SY2025-05中稿 · Robotics: Science …被引 10

基于李群的轨迹优化方法,让机器人运动更高效且无奇点。

Riemannian Direct Trajectory Optimization of Rigid Bodies on Matrix Lie Groups

  • 在矩阵李群上构建刚体动力学离散模型,保持旋转结构正确性。
  • 计算一阶与二阶黎曼导数,优化过程复杂度线性增长。
  • 适用于复杂机器人任务,比传统方法快一个数量级。

为刚体设计动态可行轨迹是机器人领域的基础问题。尽管直接轨迹优化被广泛应用,但不当的动力学参数化常导致收敛慢且违反旋转群的内在拓扑结构。本文提出一种基于黎曼优化的刚体直接轨迹优化框架。首先利用李群变分积分器在矩阵李群上构建离散刚体动力学模型;随后推导出动力学的一阶与二阶闭式黎曼导数;最后采用线搜索黎曼内点法(RIPM)在一般非线性约束下进行轨迹优化。由于优化在矩阵李群上执行,因此天然保证了旋转群的拓扑结构,避免奇点。实验表明,该方法在求解导数和牛顿步时,其复杂度随规划时长与系统自由度呈线性关系。仿真结果表明,在复杂机器人任务中,该方法比传统方法快一个数量级。

原文摘要 · Abstract (English)

Designing dynamically feasible trajectories for rigid bodies is a fundamental problem in robotics. Although direct trajectory optimization is widely applied to solve this problem, inappropriate parameterizations of rigid body dynamics often result in slow convergence and violations of the intrinsic topological structure of the rotation group. This paper introduces a Riemannian optimization framework for direct trajectory optimization of rigid bodies. We first use the Lie Group Variational Integrator to formulate the discrete rigid body dynamics on matrix Lie groups. We then derive the closed-form first- and second-order Riemannian derivatives of the dynamics. Finally, this work applies a line-search Riemannian Interior Point Method (RIPM) to perform trajectory optimization with general nonlinear constraints. As the optimization is performed on matrix Lie groups, it is correct-by-construction to respect the topological structure of the rotation group and be free of singularities. The paper demonstrates that both the derivative evaluations and Newton steps required to solve the RIPM exhibit linear complexity with respect to the planning horizon and system degrees of freedom. Simulation results illustrate that the proposed method is faster than conventional methods by an order of magnitude in challenging robotics tasks.

轨迹优化李群机器人黎曼优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。