Robust and efficient data-driven predictive control☆

doi:10.1016/j.automatica.2026.113108

Robust and efficient data-driven predictive control☆

2026-06-01

0

PRE

AI

DOI：10.1016/j.automatica.2026.113108

Original

Original request for help

Save

Abstract

En 中文

We propose a robust and efficient data-driven predictive control (eDDPC) scheme which is more sample efficient (requires less offline data) compared to existing schemes, and is also computationally efficient. This scheme employs a recently proposed data-based representation of linear time-invariant (LTI) systems as a predictor. Such a representation serves as an alternative to Hankel-based predictors obtained from, e.g., the so-called fundamental lemma, and can be derived by exploiting the kernel structure of shallow Hankel matrices of data. This allows for application of our proposed scheme using very short (and potentially irregularly measured) noisy input-output data, the amount of which is independent of the prediction horizon. To account for measurement noise, we provide a novel result that quantifies the uncertainty between the true (unknown) restricted behavior of the system and the estimated one from noisy data. Furthermore, we show that the robust eDDPC scheme is recursively feasible and that the resulting closed-loop system is practically exponentially stable. Finally, we compare the performance of this scheme to existing ones on a case study of a four tank system. (c) 2026 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

Keywords:

Robust data-driven predictive control

Behavioral approach

Uncertainty quantification

SVD perturbations

Robust and efficient data-driven predictive control☆

Abstract

Journal

Organization

Cited Papers