Proceedings of the 48h IEEE Conference on Decision and Control (CDC) Held Jointly With 2009 28th Chinese Control Conference 2009
DOI: 10.1109/cdc.2009.5399961
|View full text |Cite
|
Sign up to set email alerts
|

Stable LPV realization of parametric transfer functions and its application to gain-scheduling control design

Abstract: The paper deals with the LPV stabilizability problem for linear plants whose parameters vary with time in a compact set. First, necessary and sufficient conditions for the existence of a linear gain-scheduled stabilizing compensator are given. Next, it is shown that, if these conditions are satisfied, any compensator transfer function depending on the plant parameters and internally stabilizing the closed-loop control system when the plant parameters are constant, can be realized in such a way that the closed-… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 8 publications
(18 citation statements)
references
References 37 publications
0
18
0
Order By: Relevance
“…The following result establishes a separation principle for gain-scheduling design [BCMV10]. Consider the LPV systeṁ…”
Section: Separation Principle In Gain-scheduling and Robust Lpv Controlmentioning
confidence: 89%
See 1 more Smart Citation
“…The following result establishes a separation principle for gain-scheduling design [BCMV10]. Consider the LPV systeṁ…”
Section: Separation Principle In Gain-scheduling and Robust Lpv Controlmentioning
confidence: 89%
“…7.4. It is also known that state feedback control and observer design are dual problems [BM03,BCMV10].…”
Section: X(t) = A(w(t))x(t) + B(w(t))u(t) Y(t) = C(w(t))x(t) (753) Amentioning
confidence: 99%
“…In order to derive a solvable condition and reduce the conservativeness meanwhile, we develop a new parameterized linear matrix inequalities (PLMI) condition in the following. Similar to the introduction of the convexification method used in and , a finite dimensional PLMI condition that depends on the vertices of the polytope is presented in the following theorem, which can be efficiently solved by using standard numerical software. □Theorem Considering the system described in (1)–(2).…”
Section: Gain‐scheduled Mixed‐objective Controller Synthesismentioning
confidence: 99%
“…, (k, l) ∈  andR k andQ k are given by (16). Then S k = Y k − X −1 k > 0 and with the following coefficient matrices the closed-loop system (7)-(8) is exponentially stable and its L 2 -gain from w to z less than :…”
Section: Computation Of Lti Controllers and Reset Lawsmentioning
confidence: 99%
“…An alternating algorithm that solves a nonconvex inequality is proposed for synthesis of state-feedback gain-scheduled controllers [18]. Blanchini et al [16] showed a parameterization of stabilizing LPV controllers for LPV systems and applied it to gain-scheduled control with pole location. There are several papers that provide a method of interpolation of given or previously synthesized LTI controllers for finite points in the scheduling parameter [14,15,20].…”
Section: Introductionmentioning
confidence: 99%