Hippo: 汎用制約付き軌道最適化のための高性能内点法・射影法ソルバー
Hippo: High-performance Interior-Point and Projection-based Solver for Generic Constrained Trajectory Optimization
ロボットの軌道最適化問題を解くための新しいソルバーHippoを提案。不等式制約には適応バリア更新を伴う内点法、等式制約には射影法や内点法を用い、既存手法より高速で堅牢に高品質な解を得られる。
詳しい要約
1. どんなもの？
2. 先行研究と比べてどこがすごい？
3. 技術・手法の肝は？
4. どうやって有効だと検証した？
5. 議論はある？
6. 次に読むべき論文は？
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Haizhou Zhao, Ludovic Righetti, Majid Khadiv
分類: cs.RO
原文アブストラクト
Trajectory optimization is the core of modern model-based robotic control and motion planning. Existing trajectory optimizers, based on sequential quadratic programming (SQP) or differential dynamic programming (DDP), are often limited by their slow computation efficiency, low modeling flexibility, and poor convergence for complex tasks requiring hard constraints. In this paper, we introduce Hippo, a solver that can handle inequality constraints using the interior-point method (IPM) with an adaptive barrier update strategy and hard equality constraints via projection or IPM. Through extensive numerical benchmarks, we show that Hippo is a robust and efficient alternative to existing state-of-the-art solvers for difficult robotic trajectory optimization problems requiring high-quality solutions, such as locomotion and manipulation.
