2019
DOI: 10.1016/j.automatica.2018.12.020
|View full text |Cite
|
Sign up to set email alerts
|

Computation of low-complexity control-invariant sets for systems with uncertain parameter dependence

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
38
0
3

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 19 publications
(41 citation statements)
references
References 20 publications
0
38
0
3
Order By: Relevance
“…We allow the sets 𝒳, 𝒰 and 𝒲 to be non‐symmetric, unlike References 10,11,17,18 where some or all the sets are assumed to be symmetric. The affine parameter dependence of the system, as considered in for example, References 11,18, is just a special case that corresponds to D p = 0 in (8).…”
Section: Problem Statementmentioning
confidence: 99%
See 4 more Smart Citations
“…We allow the sets 𝒳, 𝒰 and 𝒲 to be non‐symmetric, unlike References 10,11,17,18 where some or all the sets are assumed to be symmetric. The affine parameter dependence of the system, as considered in for example, References 11,18, is just a special case that corresponds to D p = 0 in (8).…”
Section: Problem Statementmentioning
confidence: 99%
“…Depending upon the choice of the initial set, the result of such a recursive method is the arbitrarily close outer/inner approximation of the maximal RCI set 8,9 . Although effective, the geometric approach does not guarantee finite time termination of the procedure, and also the obtained set may have a very high representational complexity 2,4,8‐11 . For polytopic systems, the computational complexity grows exponentially with each additional vertex and system dimension 1 …”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations