LMIs in Control/Stability Analysis/Continuous Time/Strong Stabilizability

From testwiki
Revision as of 00:32, 19 December 2020 by imported>1234qwer1234qwer4 (The Optimization Problem: \times, fmt)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

The System

Consider the continous-time LTI system, G:L2eL2e with state-space realization (A,B,C,0)

x˙(t)=Ax(t)+Bu(t),y(t)=Cx(t),

where An×n, Bn×m, Cp×n, and it and it is assumed that (A, B) is stabilizable, (A, C) is detectable, and the transfer matrix G(s)=C(s1A1)B has no poles on the imaginary axis.

The Data

The matrices A,B,C.


The Optimization Problem

The system G is strongly stabilizable if there exist P𝕊n, Zn×p, and γ>0, where P>0, such that

PA+AT+ZC+CTZT<0[P(A+BF)+(A+BF)TP+ZC+CTZTZXB*γI0**γI]<0

Conclusion:

where F=BTX and XSn , X0 is the solution to the Lyapunov equation given by

XA+ATXXBBTX=0

Moreover, a controller that strongly stabilizes G is given by the state-space realization

x˙c=(A+BF+P1ZC)x(t)P1Zu(t)yC=BTXx(t)

Implementation

  • [1] Example Code

Template:BookCat