2007
DOI: 10.1049/iet-cta:20050334
|View full text |Cite
|
Sign up to set email alerts
|

ℋ2 and ℋ∞ε-guaranteed cost computation of uncertain linear systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0
1

Year Published

2007
2007
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 21 publications
(11 citation statements)
references
References 14 publications
0
10
0
1
Order By: Relevance
“…In order to verify the controller computed in the first step, in the second step an analysis procedure based on a combination of a branch-and-bound algorithm and LMI formulations is applied (Gonc¸alves, Palhares Takahashi, and Mesquita 2007). This analysis procedure is capable of finding the coordinates 2 of the maximum values of kEk 1 , kT cd k 1 and kT un k 2 , if the closed-loop system is robustly stable, or a coordinate 2 of an unstable system, if the system is not robustly stable.…”
Section: Multi-objective Robust Control Synthesis Proceduresmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to verify the controller computed in the first step, in the second step an analysis procedure based on a combination of a branch-and-bound algorithm and LMI formulations is applied (Gonc¸alves, Palhares Takahashi, and Mesquita 2007). This analysis procedure is capable of finding the coordinates 2 of the maximum values of kEk 1 , kT cd k 1 and kT un k 2 , if the closed-loop system is robustly stable, or a coordinate 2 of an unstable system, if the system is not robustly stable.…”
Section: Multi-objective Robust Control Synthesis Proceduresmentioning
confidence: 99%
“…This algorithm ends when the difference between the bounding functions is smaller than the prescribed relative accuracy. The algorithm is implemented considering as lower bound function the maximum H 1 (or H 2 )-norm computed in the vertices and as upper bound function the worst case of H 1 (or H 2 ) guaranteed cost computed by means of LMI formulations, both functions calculated for subdivisions of the original polytope (Gonc¸alves et al 2007). In this article, for continuous-time systems, the guaranteed cost computations are based on: Lemma 1 presented in de Oliveira, Oliveira, Leite, Montagner, and Peres (2004a) for H 1 guaranteed cost and combination of Lemmas 1 and 2 presented in de Oliveira, Oliveira, Leite, Montagner, and Peres (2004b) for H 2 guaranteed cost.…”
Section: Multi-objective Robust Control Synthesis Proceduresmentioning
confidence: 99%
“…Let (19) According to the Lemma 4, it is equivalent that there exists a positive scalar ES > 0 satisfying…”
Section: B Regional Pole Assignment Conditionmentioning
confidence: 99%
“…As pointed in [13] that LMI is a powerful formulation for a wide variety of control problems. With the presence of the interior point algorithm of the convex Optimization [14][15][16][17], the LMls technique has been applied in more and more fields [18][19][20][21][22][23]. In addition, solving the LMI problems are available on commercial software, such as MATLAB, so the analysis and design problems formulated by LMls can be efficiently solved.…”
mentioning
confidence: 99%
“…For this controller, and considering the whole polytope, [18] presents the following values for the H 2 and H 1 norms computed via a different approach described in [22,21]:…”
Section: Norm Computation For Uncertain Systemsmentioning
confidence: 99%