arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.09160cs.RO
收藏

面向优先级机器人控制与规划的高效字典序优化

Efficient Lexicographic Optimization for Prioritized Robot Control and Planning

Interactive Digital Human, University of Montpellier(蒙彼利埃大学交互数字人类研究机构)

Kai Pfeiffer, Abderrahmane Kheddar

AI总结:

本文提出高效顺序分层最小二乘规划工具及求解器$\mathcal{N}$ADM$_2$,通过阈值自适应切换和零空间投影加速机器人控制与规划的字典序优化,并利用低精度解热启动非线性求解器提升精度。

摘要:

本文提出了几种用于高效顺序分层最小二乘规划(S-HLSP)的工具,该规划专为机器人控制与规划中的字典序优化而设计。作为其主要步骤,S-HLSP 依赖于通过分层牛顿法或分层高斯-牛顿算法将原始非线性分层最小二乘规划(NL-HLSP)近似为分层最小二乘规划(HLSP)。我们提出了一种阈值自适应策略,用于在两者之间进行适当的切换。这确保了不可行约束的最优性,促进了求解 HLSP 时的数值稳定性,并通过避免正则化局部最小值来增强较低优先级层次的最优性。我们引入了求解器 $\mathcal{N}$ADM$_2$,这是一种基于活动约束零空间投影的 HLSP 交替方向乘子法。活动约束零空间所需的基由一种计算高效的 turnback 算法提供,该算法适用于通过欧拉方法离散化的系统动力学。它基于线性化约束矩阵内线性独立列子集带宽的上界。重要的是,无需昂贵的初始秩揭示矩阵分解。我们展示了在完全驱动情况下基的高度稀疏性如何在欠驱动情况下得以保留。$\mathcal{N}$ADM$_2$ 在由测试函数和全驱及欠驱机器人系统的全身轨迹优化组成的 NL-HLSP 上,始终比现成的竞争求解器计算速度更快。我们展示了交替方向乘子法固有的较低精度解如何用于热启动非线性求解器,以高效计算非线性分层最小二乘规划的高精度解。

英文摘要:

In this work, we present several tools for efficient sequential hierarchical least-squares programming (S-HLSP) for lexicographical optimization tailored to robot control and planning. As its main step, S-HLSP relies on approximations of the original non-linear hierarchical least-squares programming (NL-HLSP) to a hierarchical least-squares programming (HLSP) by the hierarchical Newton's method or the hierarchical Gauss-Newton algorithm. We present a threshold adaptation strategy for appropriate switches between the two. This ensures optimality of infeasible constraints, promotes numerical stability when solving the HLSP's and enhances optimality of lower priority levels by avoiding regularized local minima. We introduce the solver $\mathcal{N}$ADM$_2$, an alternating direction method of multipliers for HLSP based on nullspace projections of active constraints. The required basis of nullspace of the active constraints is provided by a computationally efficient turnback algorithm for system dynamics discretized by the Euler method. It is based on an upper bound on the bandwidth of linearly independent column subsets within the linearized constraint matrices. Importantly, an expensive initial rank-revealing matrix factorization is unnecessary. We show how the high sparsity of the basis in the fully-actuated case can be preserved in the under-actuated case. $\mathcal{N}$ADM$_2$ consistently shows faster computations times than competing off-the-shelf solvers on NL-HLSP composed of test-functions and whole-body trajectory optimization for fully-actuated and under-actuated robotic systems. We demonstrate how the inherently lower accuracy solutions of the alternating direction method of multipliers can be used to warm-start the non-linear solver for efficient computation of high accuracy solutions to non-linear hierarchical least-squares programs.

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

↑