mlsanityData to 14 Oct 2026

Computing Solutions to the Polynomial-Polynomial Regulator Problem

arXiv 2410.22291 ↗First posted 29 Oct 2024math.OCcited by 1

Not on the map. Why?

Abstract (arXiv)

We consider the optimal regulation problem for nonlinear control-affine dynamical systems. Whereas the linear-quadratic regulator (LQR) considers optimal control of a linear system with quadratic cost function, we study polynomial systems with polynomial cost functions; we call this problem the polynomial-polynomial regulator (PPR). The resulting polynomial feedback laws provide two potential improvements over linear feedback laws: 1) they more accurately approximate the optimal control law, resulting in lower control costs, and 2) for some problems they can provide a larger region of stabilization. We derive explicit formulas -- and a scalable, general purpose software implementation -- for computing the polynomial approximation to the value function that solves the optimal control problem. The method is illustrated first on a low-dimensional aircraft stall stabilization example, for which PPR control recovers the aircraft from more severe stall conditions than LQR control. Then we demonstrate the scalability of the approach on a semidiscretization of dimension n=129 of a partial differential equation, for which the PPR control reduces the control cost by approximately 75% compared to LQR for the initial condition of interest.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 29 Oct 2024.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.