2021
DOI: 10.1109/tac.2020.3038359
|View full text |Cite
|
Sign up to set email alerts
|

An LMI-Based Algorithm to Compute Robust Stabilizing Feedback Gains Directly as Optimization Variables

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 18 publications
(6 citation statements)
references
References 24 publications
0
6
0
Order By: Relevance
“…Therefore, the results provided by Theorem 1 may be conservative, unless some golden rule could be used to define those input matrices. Instead, inspired by the method presented in Reference 23, the stability conditions can be relaxed in such a way that a given choice for trueY$$ \overline{Y} $$ always guarantees the existence of a feasible solution and, therefore, an iterative algorithm can be constructed.…”
Section: Resultsmentioning
confidence: 99%
“…Therefore, the results provided by Theorem 1 may be conservative, unless some golden rule could be used to define those input matrices. Instead, inspired by the method presented in Reference 23, the stability conditions can be relaxed in such a way that a given choice for trueY$$ \overline{Y} $$ always guarantees the existence of a feasible solution and, therefore, an iterative algorithm can be constructed.…”
Section: Resultsmentioning
confidence: 99%
“…The advantages of this approach are: i) it does not need to solve a state feedback control problem in a first stage, as it is common in the field, ii) in many cases it can be solved in a non-iterative manner, iii) no restriction on the output matrix is considered. Moreover, future work envisages the development of an iterative approach, to deal with the cases that we do not achieve ∆ 0, and also a detailed comparison with strategies already known in the literature as Felipe and Oliveira (2020); Agulhari et al (2012); Shu and Lam (2009); Dong and Yang (2007). Finally, future works will also consider parameter dependent Lyapunov functions in order to decrease conservatism of conditions.…”
Section: Discussionmentioning
confidence: 99%
“…To circumvent this problem, a relaxation is proposed. Unfortunately, the relaxation proposed in Reference 36 (for continuous‐time systems) is not useful because it only works for time‐invariant parameters, where the concept of eigenvalue is representative. A new relaxation is proposed in the sequence as another contribution of the article, capable to cope with LPV systems.…”
Section: Relaxationmentioning
confidence: 99%
“…Differently from the current mainstream of the control design strategies, where potential sources of conservativeness, such as constrained (in terms of structure and parameter‐dependency) optimization variables and matrices of the system, are the standard techniques employed to provide synthesis conditions in terms of LMIs, 28‐31,33,34 the proposed approach diverges significantly. Inspired by the strategy in Reference 36, the synthesis conditions are formulated such that the Lyapunov matrix and the control gains appear affinely. This fact provides a more general method since state‐ and output‐feedback and decentralized control can be handled indistinctly.…”
Section: Introductionmentioning
confidence: 99%