Model Predictive Static Programming for Discrete-Time Optimal Control on Lie Groups
Akhil B Krishna, Mangal Kothari

TL;DR
This paper extends the MPSP framework to Lie groups for nonlinear systems, enabling efficient real-time optimal control without solving TPBVPs, demonstrated on complex mechanical systems.
Contribution
The paper introduces a Lie-group MPSP approach that reformulates optimal control as static quadratic programs, avoiding TPBVPs and enabling real-time implementation on Lie group systems.
Findings
The Lie-group MPSP method achieves real-time control for complex mechanical systems.
Numerical simulations show close agreement with TPBVP solutions.
Compared with iLQR, the method offers competitive performance and computational efficiency.
Abstract
This paper extends the Model Predictive Static Programming (MPSP) framework for nonlinear systems evolving on Euclidean spaces to simple mechanical systems evolving on Lie groups. Classical optimal control approaches based on Pontryagin's Maximum Principle (PMP) lead to nonlinear two-point boundary value problems (TPBVPs), whose numerical solution becomes particularly challenging on nonlinear configuration spaces. To overcome this difficulty, the proposed Lie-group MPSP framework reformulates the finite-horizon optimal control problem as a sequence of static quadratic programs that admit closed-form control updates, thereby avoiding the need to solve TPBVPs directly. The development relies on left-trivialized variations, intrinsic linearization on Lie groups, and a recursive computation of terminal sensitivity matrices, which together enable computationally efficient real-time…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
