By restructuring the product-kernel Gram matrix, the authors derive a computationally efficient nonlinear data-enabled predictive controller that runs much faster than stacked-kernel baselines.
Koopman Data-Driven Predictive Control with Robust Stability and Recursive Feasibility Guarantees
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper, we consider the design of data-driven predictive controllers for nonlinear systems from input-output data via linear-in-control input Koopman lifted models. Instead of identifying and simulating a Koopman model to predict future outputs, we design a subspace predictive controller in the Koopman space. This allows us to learn the observables minimizing the multi-step output prediction error of the Koopman subspace predictor, preventing the propagation of prediction errors. To avoid losing feasibility of our predictive control scheme due to prediction errors, we compute a terminal cost and terminal set in the Koopman space and we obtain recursive feasibility guarantees through an interpolated initial state. As a third contribution, we introduce a novel regularization cost yielding input-to-state stability guarantees with respect to the prediction error for the resulting closed-loop system. The performance of the developed Koopman data-driven predictive control methodology is illustrated on a nonlinear benchmark example from the literature.
citation-role summary
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Kernelized Operator Approach to Nonlinear Data-Enabled Predictive Control
By restructuring the product-kernel Gram matrix, the authors derive a computationally efficient nonlinear data-enabled predictive controller that runs much faster than stacked-kernel baselines.