Robust Constraint Satisfaction in Data-Driven MPC
We propose a purely data-driven model predictive control (MPC) scheme to control unknown linear time-invariant systems with guarantees on stability and constraint satisfaction in the presence of noisy data. The scheme predicts future trajectories based on data-dependent Hankel matrices, which span the full system behavior if the input is persistently exciting. This paper extends previous work on data-driven MPC by including a suitable constraint tightening which ensures that the closed-loop trajectory satisfies desired pointwise-in-time output constraints. Furthermore, we provide estimation procedures to compute system constants related to controllability and observability, which are required to implement the constraint tightening. The practicality of the proposed approach is illustrated via a numerical example.
Code (0)
등록된 구현이 없습니다.
Tasks
Model Predictive ControlSimilar Papers 제목 키워드 기반
Stochastic Data-Driven Predictive Control: Chance-Constraint Satisfaction with Identified Multi-step Predictors
We propose a novel data-driven stochastic model predictive control framework for uncertain linear systems with noisy output measurements. Our approach leverages multi-step predictors to efficiently propagate uncertainty,…
Model Predictive ControlStochastic Data-Driven Predictive Control: Regularization, Estimation, and Constraint Tightening
Data-driven predictive control methods based on the Willems' fundamental lemma have shown great success in recent years. These approaches use receding horizon predictive control with nonparametric data-driven predictors …
LEMMAData-Driven Min-Max MPC for Linear Systems
Designing data-driven controllers in the presence of noise is an important research problem, in particular when guarantees on stability, robustness, and constraint satisfaction are desired. In this paper, we propose a da…
Model Predictive ControlTeaching the Old Dog New Tricks: Supervised Learning with Constraints
Adding constraint support in Machine Learning has the potential to address outstanding issues in data-driven AI systems, such as safety and fairness. Existing approaches typically apply constrained optimization technique…
FairnessSAD-Flower: Flow Matching for Safe, Admissible, and Dynamically Consistent Planning
Flow matching (FM) has shown promising results in data-driven planning. However, it inherently lacks formal guarantees for ensuring state and action constraints, whose satisfaction is a fundamental and crucial requiremen…