English

Computing Solutions to the Polynomial-Polynomial Regulator Problem

Optimization and Control 2024-10-30 v1

Abstract

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=129n=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.

Keywords

Cite

@article{arxiv.2410.22291,
  title  = {Computing Solutions to the Polynomial-Polynomial Regulator Problem},
  author = {Nicholas A. Corbin and Boris Kramer},
  journal= {arXiv preprint arXiv:2410.22291},
  year   = {2024}
}

Comments

8 pages, 4 figures; accepted to 63rd IEEE Conference on Decision and Control

R2 v1 2026-06-28T19:40:00.911Z