トレース制約付き半正定値計画によるロボティクスにおける証明可能に最適な推定とキャリブレーション
Certifiably Optimal Estimation and Calibration in Robotics via Trace-Constrained Semi-Definite Programming
トレース制約付き半正定値計画(TCSDP)を用いて、ロボティクスにおける非凸問題を大域最適解に緩和し、勾配ベースの精緻化でランク1解に近づける手法を提案。PnP推定、ハンドアイキャリブレーション、デュアルロボットシステムのキャリブレーションで有効性を実証。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Liangting Wu, Roberto Tron
分類: cs.RO
原文アブストラクト
Many nonconvex problems in robotics can be relaxed into convex formulations via Semi-Definite Programming (SDP) that can be solved to global optimality. The practical quality of these solutions, however, critically depends on rounding them to rank-1 matrices, a condition that can be challenging to achieve. In this work, we focus on trace-constrained SDPs (TCSDPs), where the decision variables are Positive Semi-Definite (PSD) matrices with fixed trace values. We show that the latter can be used to design a gradient-based refinement procedure that projects relaxed SDP solutions toward rank-1, low-cost candidates. We also provide fixed-trace SDP relaxations for common robotic quantities, such as rotations and translations, and a modular virtual robot abstraction that simplifies modeling across different problem settings. We demonstrate that our trace-constrained SDP framework can be applied to many robotics tasks, and we showcase its effectiveness through simulations in Perspective-n-Point (PnP) estimation, hand-eye calibration, and dual-robot system calibration.
