2005
DOI: 10.3182/20050703-6-cz-1902.01003
|View full text |Cite
|
Sign up to set email alerts
|

Parameter Dependent H∞ Controller Design by Finite Dimensional Lmi Optimization: Application to Trade-Off Dependent Control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
37
0

Year Published

2005
2005
2018
2018

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 17 publications
(37 citation statements)
references
References 10 publications
0
37
0
Order By: Relevance
“…A parameter-dependent algebraic Riccati equation (PDRE) often arises in the design of controllers such as gain scheduling control (Apkarian et al, 1995), (Stilwell et al, 1999), saturated system control (Megretski, 1996), and trade-off dependent control (Dinh et al, 2003), (Dinh et al, 2005).…”
Section: Introductionmentioning
confidence: 99%
“…A parameter-dependent algebraic Riccati equation (PDRE) often arises in the design of controllers such as gain scheduling control (Apkarian et al, 1995), (Stilwell et al, 1999), saturated system control (Megretski, 1996), and trade-off dependent control (Dinh et al, 2003), (Dinh et al, 2005).…”
Section: Introductionmentioning
confidence: 99%
“…To reduce conservatism in the derivation of the bound, the reasoning relies on a framework based upon explicitly rational parameter dependent Lyapunov functions [28]. Indeed, to achieve our goal, we take benefit of a quadratic D u -stability condition recently introduced in [17], we rewrite it as a parameter-dependent L M I conditions and transform it, using the S-procedure (see [24], [29] and the references therein), into a parameter-independent optimization problem that can be efficiently solved.…”
Section: Introductionmentioning
confidence: 99%
“…Following [5], the LMI approach to gain-scheduling relies on converting the underlying control problem into a set of H ∞ control problems parametrized by the scheduling parameter and then converting these problems into an infinite array of LMIs. To overcome the infinite dimensionality of the resulting LMI problem, relaxation techniques are considered [4]; to achieve relaxation of the LMIs to a finite dimensional problem, an LFT dependency structure of the system on the scheduling parameters [6], polynomial representations [7] or rational approximations [8] are often needed. The technical assumption of convexity of the set of models is another essential requirement of this approach [6], [7], [9], which may result in more conservative performance.…”
Section: Introductionmentioning
confidence: 99%
“…Unlike the mentioned references using the direct LMI approach, the scheduling algorithm developed in [10] uses the interpolation approach to gainscheduling originated from [11]. This approach has an advantage that the scheduling parameters are not required to be polytopic/polynomial/rational dependent; this allows to avoid the restrictions in [6], [7], [8], [9], e.g., overbounding of the underlying set of system models by a convex set.…”
Section: Introductionmentioning
confidence: 99%