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

Learning control for polynomial systems using sum of squares relaxations

Abstract: This paper considers the problem of learning control laws for nonlinear polynomial systems directly from data, which are input-output measurements collected in an experiment over a finite time period. Without explicitly identifying the system dynamics, stabilizing laws are directly designed for nonlinear polynomial systems by solving sum of square problems that depend on the experimental data alone. Moreover, the stabilizing state-dependent control gains can be constructed by data-based linear programming.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(9 citation statements)
references
References 24 publications
(30 reference statements)
0
9
0
Order By: Relevance
“…dissipativity properties using noisy data. Similarly, the recent papers Guo et al (2020a) and Guo et al (2020b) extend the results in De Persis and Tesi (2019); van Waarde et al (2020) to design stabilizing controllers for unknown polynomial systems based on noisy data. Notably, these papers consider continuous-time systems and develop SOS feasibility criteria for controller design.…”
Section: Introductionmentioning
confidence: 61%
“…dissipativity properties using noisy data. Similarly, the recent papers Guo et al (2020a) and Guo et al (2020b) extend the results in De Persis and Tesi (2019); van Waarde et al (2020) to design stabilizing controllers for unknown polynomial systems based on noisy data. Notably, these papers consider continuous-time systems and develop SOS feasibility criteria for controller design.…”
Section: Introductionmentioning
confidence: 61%
“…and let us show that such E satisfies (23) to complete the proof. Since α ≥ 0 and E j ≥ 0 for each j ∈ N V S by ( 18), we have from ( 29)…”
Section: A Proof Of Theoremmentioning
confidence: 95%
“…The =⇒ -direction is trivial by using Lemma 2 for x = x j ∈ S with j ∈ N V S . The ⇐=-direction is proven if for E j with j ∈ N V S satisfying (18) and an arbitrary x ∈ S, we find E that can depend on x and satisfies (23). This is done by exploiting that for a bounded S as in (17), an arbitrary x ∈ S can always be written in terms of a convex combination of the vertices of S as x = V S j=1 α j x j through coefficients α j (j ∈ N V S ) that satisfy 1 α = 1 and α ≥ 0.…”
Section: A Proof Of Theoremmentioning
confidence: 99%
See 1 more Smart Citation
“…time horizon of unknown nonlinear systems with polynomial dynamics. Contrary to [12], we consider polynomial systems in discrete time and measurements in presence of noise. By characterizing this noise by two distinct descriptions, we propose two data-based set-membership representations of the ground-truth system which constitute two frameworks to deduce computationally attractive conditions for verifying dissipativity properties using SOS optimization.…”
Section: Introductionmentioning
confidence: 99%