LMIs in Control/Robustness/Continuous Time/DKIteration

From testwiki
Jump to navigation Jump to search

This methods uses LMI techniques iteratively to obtain the result.

The System

Given a state-space representation of a system G(s) and an initial estimate of reduced order model G^(s).

 G(s)=C(sIA)B+D, G^(s)=C^(sIA^)B^+D^,

Where An×n,Bn×m,Cp×n,Dp×m,A^k×k,B^k×m,C^p×k and D^p×m.

The Data

The full order state matrices A,B1,B2,C1,C2,D11,D12,D21.

The Optimization Problem

Alternate fixing K,Θ in an iterative process to estimate a solution for Dynamic Output Feedback Synthesis with Structured Norm-Bounded Uncertainty.

The LMI: D-K Iteration

Objective: minγ.

Subject to:: Initialize: Θ=I\\ Define:\\

 G^Θ(s)=[ A|B1Θ1/2B2 Θ1/2C1|Θ1/2D11Θ1/2Θ1/2D12 C2|D12Θ1/20]

Step 1:

Fix: Θ and solve:

infkS_(GΘ,K)H


Step 2:

Fix K and minimize γ such that there exists Θ𝐏Θ and X>0 such that

[ AclTX+XAxlXBcl BclTXΘ]+γ2[ CclT DclT]Θ[ CclDcl] >0 where Acl,Bcl,Ccl,Dcl define infkS_(GΘ,K)H (Bisection)


Step 3: Go to Step 1

Conclusion:

This is less of an LMI and more of a heuristic that allows us to solve for time-invariant scalings Θ and controller K. However, there are no guarantees that this process will return an globally optimized result.

Implementation

A list of references documenting and validating the LMI.

Return to Main Page:

Template:BookCat