2021
DOI: 10.48550/arxiv.2103.02892
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Data-Based System Analysis and Control of Flat Nonlinear Systems

Abstract: Willems et al. showed that all input-output trajectories of a discrete-time linear time-invariant system can be obtained using linear combinations of time shifts of a single, persistently exciting, input-output trajectory of that system. In this paper, we extend this result to the class of discrete-time single-input single-output flat nonlinear systems. We propose a data-based parametrization of all trajectories using only inputoutput data. Further, we use this parametrization to solve the data-based simulati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 8 publications
(17 citation statements)
references
References 24 publications
0
17
0
Order By: Relevance
“…In Part (ii).c, we exploit that the optimal solution of Problem ( 16) depends in a piecewise affine fashion on σ and thus, the difference between the optimal input for σ = 0 (i.e., ǔ * (t)) and σ = σε (i.e., ũ(t)) is bounded in terms of ε, which then implies that ū * (t) and ǔ * (t) are close, cf. (18). In Proposition 2 (see Appendix C), we show that a result analogous to Proposition 1 holds in the presence of additional input disturbances affecting the initial conditions.…”
Section: B Proposed Mpc Schemementioning
confidence: 55%
See 2 more Smart Citations
“…In Part (ii).c, we exploit that the optimal solution of Problem ( 16) depends in a piecewise affine fashion on σ and thus, the difference between the optimal input for σ = 0 (i.e., ǔ * (t)) and σ = σε (i.e., ũ(t)) is bounded in terms of ε, which then implies that ū * (t) and ǔ * (t) are close, cf. (18). In Proposition 2 (see Appendix C), we show that a result analogous to Proposition 1 holds in the presence of additional input disturbances affecting the initial conditions.…”
Section: B Proposed Mpc Schemementioning
confidence: 55%
“…Thus, Problem ( 12) is strongly convex in ū[0,L−n−1] (t) u s (t) and hence, using (18) trivially holds over the first n time steps and therefore, we focus on k ∈ I [0,L] in the following.…”
Section: B Proposed Mpc Schemementioning
confidence: 99%
See 1 more Smart Citation
“…This means that both the state x k and input u k at time step k can be determined from a finite number of future values of the output y k [18]. The key concept of discrete-time flatness is that the trajectory of the (flat) output in a certain finite window uniquely determines the state and input at any time step [19].…”
Section: B Discrete-time Flatnessmentioning
confidence: 99%
“…The success of the Fundamental Lemma is evident from the number of data-based applications for LTI systems that followed from it, such as extensions for databased simulation and control [3], data-driven state-feedback control [4], [5], data-based dissipativity analysis [6], [7] and data-driven predictive control [8]. There exists preliminary work that aims to extend the Fundamental Lemma towards nonlinear (NL) [9] and Linear Time-Varying (LTV) [10] systems. However, these results impose heavy restrictions on the systems as they leverage model transformations and linearisations.…”
Section: Introductionmentioning
confidence: 99%