LMIs in Control/pages/Nonconvex Multi-Criterion Quadratic Problems

From testwiki
Revision as of 20:47, 12 December 2019 by imported>Rezajamesahmed (Implementation)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

LMIs in Control/pages/Nonconvex Multi-Criterion Quadratic Problems


The Non-Concex Multi-Criterion Quadratic linear matrix inequality will allow one to form an optimized controller, similar to that in an LQR framework, for a non-convex state space system based on several different criterions defined in the Q and R matrices, that are optimized as a part of the arbitrary cost function. Just like traditional LQR, the cost matrices must be tuned in much a similar fashion as traditional gains in classical control. In the LQR and LQG framework however, the gains are more intuitive as each correlates directly to a state or an input.


The System

The system for this LMI is a linear time invariant system that can be represented in state space as shown below:

x˙=Ax+Bw,x(0)=x0

where the system is assumed to be controllable.

where xRn represents the state vector, respectively, wRp is the disturbance vector, and A,B are the system matrices of appropriate dimension. To further define: x is Rn and is the state vector, A is Rn*n and is the state matrix, B is Rn*r and is the input matrix, w is Rr and is the exogenous input.


for any input, we define a set p+1 cost indices J0,...,JP by


Ji(u)=0[xTuT][QiCiCiTRi][xu]dt,i=0,...,p

Here the symmetric matrices,

[QiCiCiTRi],i=0,...,p,

are not necessarily positive-definite.

The Data

The matrices A,B,C.

The Optimization Problem

The constrained optimal control problem is:

max:J0,

subject to

Jiγi,i=1,...,p,x0,t

The LMI: Nonconvex Multi-Criterion Quadratic Problems

The solution to this problem proceeds as follows: We first define

Q=Q0+i=1pτiQi,R=R0+i=1pτiRi,C=C0+i=1pτiCi,

where τi0 and for every τi, we define

S=J0+i=1pτiJii=1pτiγi

then, the solution can be found by:

max:x(0)TPx(0)i=1pτiγi

subject to

[ATP+PA+QPQ+CTBTP+CR]0τi0

Conclusion:

If the solution exists, then K is the optimal controller and can be solved for via an EVP in P.

Implementation

This implementation requires Yalmip and Sedumi.

https://github.com/rezajamesahmed/LMImatlabcode/blob/master/multicriterionquadraticproblems.m

  1. Multi-Criterion LQG
  2. Inverse Problem of Optimal Control
  3. Nonconvex Multi-Criterion Quadratic Problems
  4. Static-State Feedback Problem

A list of references documenting and validating the LMI.


Return to Main Page:

Template:BookCat