Linear Matrix Inequalities in Control
Linear Matrix Inequalities in Control
Linear Matrix Inequalities in Control
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Basic LMI tools for control (8)<br />
Bounded real lemma<br />
The system def<strong>in</strong>ition<br />
x Ax Bu<br />
G(<br />
s)<br />
sup ( G(<br />
s))<br />
sup ( G(<br />
j ))<br />
Re( s)<br />
0<br />
R<br />
y Cx Du<br />
x(0)<br />
0<br />
G(<br />
s)<br />
1<br />
C(<br />
sI A)<br />
B<br />
M<strong>in</strong>imize γ 2 subject to:<br />
T<br />
T<br />
T<br />
A P PA C C PB C D<br />
T T<br />
T 2<br />
B P D C D D I<br />
D<br />
F<strong>in</strong>d (the upper bound)<br />
0; P<br />
P<br />
T<br />
0<br />
KSO materiały do wykładu 2008/09 37<br />
Basic LMI tools for control (9)<br />
S-procedure (simplified)<br />
If there exist symmetric matrices T 0 ,...,T p and nonnegative<br />
numbers<br />
1<br />
0,...,<br />
p<br />
0 such that<br />
T<br />
0<br />
i<br />
p<br />
1<br />
iT i<br />
0<br />
T<br />
T<br />
then x T0 x 0; x 0if<br />
x Ti<br />
x 0; i 1, ,<br />
p.<br />
For p=1 the reverse is true.<br />
KSO materiały do wykładu 2008/09 38<br />
Basic LMI tools for control (10)<br />
S-procedure example<br />
There are two condtions given for P<br />
P<br />
T<br />
0,<br />
0 and any<br />
T<br />
T<br />
A P PA<br />
T<br />
B P<br />
PB<br />
0<br />
0<br />
T C T C<br />
T<br />
A P<br />
PA<br />
T<br />
B P<br />
T<br />
C C<br />
PB<br />
I<br />
0; P<br />
P<br />
T<br />
T .<br />
Us<strong>in</strong>g S-procedure one can obta<strong>in</strong> LMIs:<br />
0;<br />
0<br />
KSO materiały do wykładu 2008/09 39<br />
13