2021
DOI: 10.1515/auto-2021-0024
|View full text |Cite
|
Sign up to set email alerts
|

Data-driven model predictive control: closed-loop guarantees and experimental results

Abstract: We provide a comprehensive review and practical implementation of a recently developed model predictive control (MPC) framework for controlling unknown systems using only measured data and no explicit model knowledge. Our approach relies on an implicit system parametrization from behavioral systems theory based on one measured input-output trajectory. The presented MPC schemes guarantee closed-loop stability for unknown linear time-invariant (LTI) systems, even if the data are affected by noise. Further, we ex… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
24
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 37 publications
(24 citation statements)
references
References 24 publications
0
24
0
Order By: Relevance
“…The result shows that the nominal MPC scheme based on repeatedly solving Problem ( 16) with σ = 0 in an nstep fashion (compare Algorithm 1) practically exponentially stabilizes the optimal reachable equilibrium ξ sr in closed loop in the presence of input disturbances. To be precise, the decay bound (39) in combination with the lower and upper bounds in (38) implies that the closed loop converges to a neighborhood of ξ sr , the size of which shrinks if the disturbance bound (denoted by ε with a slight abuse of notation) is small. The guaranteed region of attraction is then given by V (ξ 0 ) ≤ V ROA and, in particular, for a larger size V ROA the maximal disturbance bound ε ensuring the closed-loop properties decreases.…”
Section: Closed-loop Guaranteesmentioning
confidence: 99%
See 4 more Smart Citations
“…The result shows that the nominal MPC scheme based on repeatedly solving Problem ( 16) with σ = 0 in an nstep fashion (compare Algorithm 1) practically exponentially stabilizes the optimal reachable equilibrium ξ sr in closed loop in the presence of input disturbances. To be precise, the decay bound (39) in combination with the lower and upper bounds in (38) implies that the closed loop converges to a neighborhood of ξ sr , the size of which shrinks if the disturbance bound (denoted by ε with a slight abuse of notation) is small. The guaranteed region of attraction is then given by V (ξ 0 ) ≤ V ROA and, in particular, for a larger size V ROA the maximal disturbance bound ε ensuring the closed-loop properties decreases.…”
Section: Closed-loop Guaranteesmentioning
confidence: 99%
“…For simplicity, we assume w.l.o.g. that N n ∈ I ≥0 , i.e., N is divisible by n. Note that ξN lies in the set {ξ | V (ξ , D N ) ≤ V ROA }, which is compact due to the lower bound (38) and Assumption 5, i.e., compactness of the (linearized) steadystate manifold [20, Assumption 5]. Similar to the proof of [20, Proposition 2], Lipschitz continuity of the dynamics (41) and compactness of U imply that the union of the N -step reachable sets of the linearized and the nonlinear dynamics (compare [51]) starting in {ξ | V (ξ , D N ) ≤ V ROA }, which we denote by X, is compact.…”
Section: E Closed-loop Guaranteesmentioning
confidence: 99%
See 3 more Smart Citations