Oct 2026· Journal of Computational Physics· Vol 569, pp. 115476· 0 citations· 57 references
Mathematics
TL;DR
This work proposes an acceleration to compute the expensive higher-order terms in a reduced space, mitigating the curse of dimensionality, and permits computing approximations to polynomial feedback laws based on Al'brekht's method in hundreds of thousands of states.
Abstract
We consider the problem of computing Taylor approximations to the optimal feedback law and value function for infinite-horizon finite-dimensional nonlinear optimal control problem---also known as Al'brekht's method. The scalability of existing Al'brekht-based approaches to computing approximate solutions to the Hamilton-Jacobi-Bellman equation associated with the optimal control problem has been severely limited by computational resources. The computational time issue has been partially mitigated by recent works leveraging tensor-structure to develop efficient numerical methods. However, RAM requirements still have remained a major hindrance to scaling beyond state dimensions of a few hundred or low thousands. We propose an acceleration to compute the expensive higher-order terms in a reduced space, mitigating the curse of dimensionality. A fast and scalable \textsc{Matlab} implementation is provided open-source for general purpose use, with the ability to accommodate arbitrary polynomial nonlinearities in the control-affine state equation, as well as polynomial state-dependence in the cost function, and the ability to handle systems in generalized form with a non-identity mass matrix, such as finite element models. Combined with the exploitation of sparsity and modern low-rank Riccati solvers, this permits computing approximations to polynomial feedback laws based on Al'brekht's method in hundreds of thousands of states.
We consider the open-loop optimal control of a dynamical system whose state is described by a time-dependent matrix $X(t)\in\mathbb{R}^{m\times n}$. Gradient-based optimization methods may incur substantial computational and memory costs, particularly for large-scale systems and fine temporal discretizations. To allevi...
The curse of dimensionality associated with solving the Hamilton-Jacobi-Bellman equation for the value function remains a key obstacle for real-time optimal feedback control of high-dimensional nonlinear dynamical systems. This is especially severe in aerospace applications such as relaminarizing unsteady turbulent flo...
We develop a Newton--Kleinman iteration for linear-quadratic optimal control of infinite-dimensional systems with possibly unbounded control and observation operators. In this setting, the classical algebraic Riccati equation need not be meaningful and therefore cannot serve as the basis of the iteration. We instead li...
We study the data-driven approximation of control-affine systems, where the drift and each control vector field exhibit a low-dimensional structure. While the ANOVA (ANalysis Of VAriance) decomposition is tailored to low-dimensional structures, a straightforward implementation does not exploit control affinity, renderi...
M. Kircheis, D. Potts, M. Schaller et al.· 0 citations
This work proposes a cascaded physics-informed neural network (PINN) framework to approximately solve partial differential equations (PDEs) and demonstrates that this approach can computationally discover effective feedback-linearizing representations of nonlinear systems for control tasks.
Pavlos Kallinikidis, Feng-Jun Yang, David Snyder et al.· arXiv.org· 0 citations
Transfer functions of Partial Differential Equations (PDEs) are irrational and difficult to obtain. Unlike for rational transfer functions, only a few methods are available for the control and analysis of irrational transfer functions. Thus, for robust analysis and control of PDEs, we need to use a rational approximati...
Aleksandr Talitckii, Matthew M. Peet· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.