Skip to content
Preprint

Projection-Regularized Indirect Data-Driven Predictive Control

Jul 2026 · 0 citations · 44 references
Engineering Computer Science

TL;DR

This paper introduces Projection-Regularized Predictive Control (PRPC), retaining the fundamental-lemma weight vector via a regularized projection analytically condensed into an efficient, fixed-dimension covariance update.

Abstract

Indirect data-driven predictive control methods often suffer under process noise and data scarcity. This paper introduces Projection-Regularized Predictive Control (PRPC), retaining the fundamental-lemma weight vector via a regularized projection analytically condensed into an efficient, fixed-dimension covariance update. A rigorous bias--variance analysis proves PRPC strictly reduces prediction error under process noise (errors-in-variables) and structural rank deficiencies compared to unregularized subspace methods. We leverage these properties to develop an adaptive sliding-window controller for linear time-varying (LTV) systems. To guarantee safety despite closed-loop data correlations, we derive a uniform-in-time, finite-sample confidence bound on the empirical predictor using vector-valued martingale concentration inequalities. Embedding this statistical uncertainty radius into a dynamically tightened constraint set rigorously ensures robust recursive feasibility and Input-to-State practical Stability (ISpS) with high probability. Simulations on LTI and LTV benchmarks demonstrate real-time tractability and strict constraint satisfaction.

View source

Similar papers

Preprint Jul 2026

Data-driven Kernel-based Predictive Control with Stability and Robustness Guarantees

A theoretical analysis of the closed-loop properties of a data-driven kernel-based predictive control (DDKPC) scheme developed solely from input-output data proves that the DDKPC scheme guarantees recursive feasibility and closed-loop stability.

Wenjie Liu, Yifei Li, Gang Wang et al. · 0 citations
Preprint Jul 2026

A subspace approach to data-driven predictive control for linear parameter-varying systems

This paper presents a subspace data-driven predictive control method for linear parameter-varying (LPV) systems. Starting from an affine LPV state-space model in innovation form, we derive a multi-step predictor that separates the effects of past data, future inputs, scheduling trajectories, and innovations. By projecting this representation onto the row span of lifted input-output-scheduling data, we obtain an asymptotically unbiased data-driven predictor that can be embedded directly in a receding-horizon control problem, without explicitly identifying an LPV model. To make the resulting LPV data-driven predictive control (DDPC) formulation tractable, we introduce an LPV extension of $\gamma$-DDPC based on an LQ factorization. This formulation fixes the number of online decision variables independently of the length of the dataset. A reduced-order predictor is then proposed to curb the exponential growth of scheduling-dependent regressors, which also relaxes the persistence-of-excitation condition. Simulation studies, including an unbalanced-disk example, show that the proposed controller achieves good tracking performance and, compared to existing LPV DDPC schemes, achieves better robustness to measurement noise and reduced computational cost, making multi-step LPV DDPC practically deployable, even with longer past horizons.

Federico Porcari, C. Verhoek, V. Breschi et al. · 0 citations
Preprint Jul 2026

Data-driven predictive control of nonlinear systems using weighted regularization

This work proposes a data-driven predictive control framework for nonlinear systems that incorporates data column preferences according to their proximity to the current operating point through a weighted norm regularization, thereby localizing the predictor without discarding any data.

F. Engeln, S. Zieglmeier, Marta A. Zagorowska et al. · 0 citations
Preprint Jul 2026

Direct Data Driven Natural Gradient Descent for Control

This paper proposes two data-driven NGD formulations that incorporate the closed-loop covariance matrix through the Fisher Information Matrix (FIM), allowing gradient updates to be preconditioned according to the system's intrinsic uncertainty.

Ramin Esmzad, F. Yaghmaie, Bahare Kiumarsi et al. · 0 citations
Preprint Jul 2026

Residual-Conservative Model Predictive Path Integral Control

Sampling-based model predictive control methods handle nonlinear dynamics and complex cost landscapes through Monte Carlo rollouts, yet typically employ fixed constraint penalties that do not adapt to model-plant mismatch. This paper proposes Residual-Conservative Model Predictive Path Integral Control (RC-MPPI), a sampling-based MPC framework that modulates safety conservatism online using the prediction-execution residual. RC-MPPI combines three coupled mechanisms: residual-dependent constraint tightening, adaptive safety-cost shaping, and residual-adaptive sampling modulation through exploration contraction and temperature relaxation. The temperature adaptation reflects a key insight: when the model is inaccurate, rollout cost evaluations become unreliable, and increasing temperature reduces overcommitment to apparent cost rankings. Under Lipschitz dynamics and sub-Gaussian disturbances, we derive probabilistic bounds on constraint violation and show that the joint effect of the adaptive mechanisms reduces violation probability as the residual grows. A rollout-cost uncertainty analysis further shows that model-plant mismatch perturbs MPPI importance weights in proportion to residual magnitude and inversely with temperature, providing theoretical justification for residual-adaptive temperature relaxation. Simulations on an LTI point-mass system and a planar 2R manipulator show improved safety margin, success rate, and control efficiency compared with vanilla MPPI under significant model-plant mismatch.

Hyung-Jin Yoon, Hunmin Kim · 0 citations
2026

Errors-in-Variables Data-Driven Receding-Horizon LQR

This letter addresses the data-driven linear quadratic regulator (LQR) problem with input constraints under process noise and errors-in-variables measurement errors. Using noisy state and input measurements, we design controllers that ensure closed-loop stability, minimize a quadratic cost, and respect input bounds without identifying the system dynamics. The problem is formulated as a robust polynomial optimization over all models consistent with the data and noise bounds. By applying the theorem of alternatives and sum-of-squares techniques, we derive tractable certificates that eliminate the measurement-error variables, reducing the complexity of the resulting relaxations. Two formulations are proposed: a matrix-valued formulation based on Scherer’s Positivstellensatz and a scalarized alternative enabling Putinar-type certificates.

Jian Zheng, M. Sznaier · 0 citations