LMIs in Control/Stability Analysis/Discrete Time/DiscreteTimeStrongStabilizability

From testwiki
Revision as of 00:33, 19 December 2020 by imported>1234qwer1234qwer4 (Added {{BookCat}} using BookCat.js)
(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 (Ad,Bd,Cd,0)

x˙(k)=Adx(k)+Bdu(k),y(k)=Cdx(k),

where Adn×n, Bdn×m, Cdp×n, and it and it is assumed that (Ad,Bd),is stabilizable, (Ad,Cd) is detectable, and the transfer matrix G(s)=Cd(s1Ad)1)Bd has no poles on the imaginary axis.

The Data

The matrices Ad,Bd,Cd.

The Optimization Problem

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

[AdTPAdPAdTZCdCdTZTAdCdTZT*P**γI]<0[N11(Ad+BdF)TZXBdCdTZT*γI0ZT**γI0***P]<0

Conclusion:

where N11=(Ad+BdF)TP(Ad+BdF)P+(Ad+BdF)TZCdTZT(Ad+BdF),F=BdTX,X=Y and XSn , X0 is the solution to the discrete-time Lyapunov equation given by

AdXAdT+XBdBdTX=0

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

x˙c,k+1=(Ad+BdF+P1ZCd)xkP1Zukyc,k=BdTXxk

Implementation

  • [1]-example code

Template:BookCat