Linear-quadratic-Gaussian control

Linear-quadratic-Gaussian control

In control theory, the linear-quadratic-Gaussian (LQG) control problem is one of the most fundamental optimal control problems. It concerns uncertain linear systems disturbed by additive white Gaussian noise, having incomplete state information (i.e. not all the state variables are measured and available for feedback) and undergoing control subject to quadratic costs. Moreover the solution is unique and constitutes a linear dynamic feedback control law that is easily computed and implemented. Finally the LQG controller is also fundamental to the optimal perturbation control of non-linear systems[1].

The LQG controller is simply the combination of a Kalman filter i.e. a linear-quadratic estimator (LQE) with a linear-quadratic regulator (LQR). The separation principle guarantees that these can be designed and computed independently. LQG control applies to both linear time-invariant systems as well as linear time-varying systems. The application to linear time-invariant systems is well known. The application to linear time-varying systems enables the design of linear feedback controllers for non-linear uncertain systems.

The LQG controller itself is a dynamic system like the system it controls. Both systems have the same state dimension. Therefore implementing the LQG controller may be problematic if the dimension of the system state is large. The reduced-order LQG problem (fixed-order LQG problem) overcomes this by fixing a-priori the number of states of the LQG controller. This problem is more difficult to solve because it is no longer separable. Also the solution is no longer unique. Despite these facts numerical algorithms are available[2][3][4][5] to solve the associated optimal projection equations[6][7] which constitute necessary and sufficient conditions for a locally optimal reduced-order LQG controller[2].

Finally, a word of caution. LQG optimality does not automatically ensure good robustness properties.[8] The robust stability of the closed loop system must be checked separately after the LQG controller has been designed. To promote robustness some of the system parameters may be assumed stochastic instead of deterministic. The associated more difficult control problem leads to a similar optimal controller of which only the controller parameters are different[3].


Mathematical description of the problem and solution

Continuous time

Consider the linear dynamic system,

\dot{\mathbf{x}}(t) = A(t) \mathbf{x}(t) + B(t) \mathbf{u}(t) +  \mathbf{v}(t)
\mathbf{y}(t) = C(t) \mathbf{x}(t) + \mathbf{w}(t),

where {\mathbf{x}} represents the vector of state variables of the system, {\mathbf{u}} the vector of control inputs and {\mathbf{y}} the vector of measured outputs available for feedback. Both additive white Gaussian system noise \mathbf{v}(t) and additive white Gaussian measurement noise \mathbf{w}(t) affect the system. Given this system the objective is to find the control input history {\mathbf{u}}(t) which at every time {\mathbf{}}t may depend only on the past measurements {\mathbf{y}}(t'), 0 \leq t' < t such that the following cost function is minimized,

 J = E\left({\mathbf{x'}}(T)F{\mathbf{x}}(T)+ \int_{0}^{T} {\mathbf{x'}}(t)Q(t){\mathbf{x}}(t) + {\mathbf{u'}}(t)R(t){\mathbf{u}}(t)\,dt \right),
 F \ge 0,\quad Q(t) \ge 0,\quad R(t) > 0,

where {\mathbf{}}E denotes the expected value. The final time (horizon) {\mathbf{}}T may be either finite or infinite. If the horizon tends to infinity the first term {\mathbf{x}}'(T)F{\mathbf{x}}(T) of the cost function becomes negligible and irrelevant to the problem. Also to keep the costs finite the cost function has to be taken to be {\mathbf{}}J/T.

The LQG controller that solves the LQG control problem is specified by the following equations,

 \dot{\hat{\mathbf{x}}}(t) = A(t)\hat{\mathbf{x}}(t) + B(t){\mathbf{u}}(t)+K(t) \left( {\mathbf{y}}(t)-C(t)\hat{\mathbf{x}}(t) \right),  \hat{\mathbf{x}}(0) = E \left( {\mathbf{x}}(0) \right)
 {\mathbf{u}}(t)= -L(t) \hat{\mathbf{x}}(t).

The matrix {\mathbf{}}K(t) is called the Kalman gain of the associated Kalman filter represented by the first equation. At each time {\mathbf{}}t this filter generates estimates \hat{\mathbf{x}}(t) of the state {\mathbf{x}}(t) using the past measurements and inputs. The Kalman gain {\mathbf{}}K(t) is computed from the matrices {\mathbf{}}A(t), C(t), the two intensity matrices \mathbf{}V(t), \mathbf{}W(t) associated to the white Gaussian noises \mathbf{v}(t) and \mathbf{w}(t) and finally E\left({\mathbf{x}}(0){\mathbf{x}}'(0) \right). These five matrices determine the Kalman gain through the following associated matrix Riccati differential equation,

 \dot{P}(t) = A(t)P(t)+P(t)A'(t)-P(t)C'(t){\mathbf{}}W^{-1}(t)
 P(0)= E \left({\mathbf{x}}(0){\mathbf{x}}'(0) \right).

Given the solution P(t), 0 \leq t \leq T the Kalman gain equals,

 {\mathbf{}}K(t) = P(t)C'(t)W^{-1}(t)

The matrix {\mathbf{}}L(t) is called the feedback gain matrix. This matrix is determined by the matrices {\mathbf{}}A(t), B(t), Q(t), R(t) and {\mathbf{}}F through the following associated matrix Riccati differential equation,

 -\dot{S}(t) = A'(t)S(t)+S(t)A(t)-S(t)B(t)R^{-1}(t)B'(t)S(t)+Q(t),
  {\mathbf{}}S(T) = F.

Given the solution {\mathbf{}}S(t), 0 \leq t \leq T the feedback gain equals,

 {\mathbf{}}L(t) = R^{-1}(t)B'(t)S(t).

Observe the similarity of the two matrix Riccati differential equations, the first one running forward in time, the second one running backward in time. This similarity is called duality. The first matrix Riccati differential equation solves the linear-quadratic estimation problem (LQE). The second matrix Riccati differential equation solves the linear-quadratic regulator problem (LQR). These problems are dual and together they solve the linear-quadratic-Gaussian control problem (LQG). So the LQG problem separates into the LQE and LQR problem that can be solved independently. Therefore the LQG problem is called separable.

When {\mathbf{}}A(t), B(t), C(t), Q(t), R(t) and the noise intensity matrices \mathbf{}V(t), \mathbf{}W(t) do not depend on {\mathbf{}}t and when {\mathbf{}}T tends to infinity the LQG controller becomes a time-invariant dynamic system. In that case both matrix Riccati differential equations may be replaced by the two associated algebraic Riccati equations.

Discrete time

Since the discrete-time LQG control problem is similar to the one in continuous-time the description below focuses on the mathematical equations.

Discrete-time linear system equations:

{\mathbf{x}}_{i+1} = A_i\mathbf{x}_i + B_i \mathbf{u}_i +  \mathbf{v}_i
\mathbf{y}_{i} = C_{i} \mathbf{x}_i + \mathbf{w}_i

Here \mathbf{}i represents the discrete time index and \mathbf{v}_{i}, \mathbf{w}_{i} represent discrete-time Gaussian white noise processes with covariance matrices \mathbf{}V_{i}, W_{i} respectively.

The quadratic cost function to be minimized:

 J = E\left({\mathbf{x'}}_{N}F{\mathbf{x}}_{N}+ \sum_{i=0}^{N-1} \mathbf{x}_i 'Q_i \mathbf{x}_i + \mathbf{u'}_i R_i \mathbf{u}_i \right),
 F \ge 0, Q_i \ge 0, R_i > 0. \,

The discrete-time LQG controller:

\hat{\mathbf{x}}_{i+1}=A_i\hat{\mathbf{x}}_i+B_i{\mathbf{u}}_i+K_i \left({\mathbf{y}}_i-C_i{\hat{\mathbf{x}}}_i \right), \hat{\mathbf{x}}_0=E({\mathbf{x}}_0),
 \mathbf{u}_i=-L_i\hat{\mathbf{x}}_i. \,

The Kalman gain equals,

 {\mathbf{}}K_i = A_iP_iC'_i(C_iP_iC'_i + W_i)^{-1},

where {\mathbf{}}P_i is determined by the following matrix Riccati difference equation that runs forward in time,

 P_{i+1} = A_i \left( P_i - P_i C'_i \left( C_i P_i C'_i+W_i \right)^{-1} C_i P_i \right) A'_i+V_i, P_0=E \left( {\mathbf{x}}_0{\mathbf{x'}}_0 \right).

The feedback gain matrix equals,

 {\mathbf{}}L_i = (B'_iS_{i+1}B_i + R_i)^{-1}B'_iS_{i+1}A_i.

where {\mathbf{}}S_i is determined by the following matrix Riccati difference equation that runs backward in time,

 S_i = A'_i \left( S_{i+1} - S_{i+1}B_i \left( B'_iS_{i+1}B_i+R_i \right)^{-1} B'_i S_{i+1} \right) A_i+Q_i, S_N=F.

If all the matrices in the problem formulation are time-invariant and if the horizon {\mathbf{}}N tends to infinity the discrete-time LQG controller becomes time-invariant. In that case the matrix Riccati difference equations may be replaced by their associated discrete-time algebraic Riccati equations. These determine the time-invarant linear-quadratic estimator and the time-invariant linear-quadratic regulator in discrete-time. To keep the costs finite instead of {\mathbf{}}J one has to consider {\mathbf{}}J/N in this case.

See also


  1. ^ Athans M. (1971). "The role and use of the stochastic Linear-Quadratic-Gaussian problem in control system design". IEEE Transaction on Automatic Control AC-16 (6): 529–552. doi:10.1109/TAC.1971.1099818. 
  2. ^ a b Van Willigenburg L.G., De Koning W.L. (2000). "Numerical algorithms and issues concerning the discrete-time optimal projection equations". European Journal of Control 6 (1): 93–100.  Associated software download from Matlab Central.
  3. ^ a b Van Willigenburg L.G., De Koning W.L. (1999). "Optimal reduced-order compensators for time-varying discrete-time systems with deterministic and white parameters". Automatica 35: 129–138. doi:10.1016/S0005-1098(98)00138-1.  Associated software download from Matlab Central.
  4. ^ Zigic D., Watson L.T., Collins E.G., Haddad W.M., Ying S. (1996). "Homotopy methods for solving the optimal projection equations for the H2 reduced order model problem". International Journal of Control 56 (1): 173–191. doi:10.1080/00207179208934308. 
  5. ^ Collins Jr. E.G, Haddad W.M., Ying S. (1996). "A homotopy algorithm for reduced-order dynamic compensation using the Hyland-Bernstein optimal projection equations". Journal of Guidance Control & Dynamics 19 (2): 407–417. doi:10.2514/3.21633. 
  6. ^ Hyland D.C, Bernstein D.S. (1984). "The optimal projection equations for fixed order dynamic compensation". IEEE Transaction on Automatic Control AC-29 (11): 1034–1037. doi:10.1109/TAC.1984.1103418. 
  7. ^ Bernstein D.S., Davis L.D., Hyland D.C. (1986). "The optimal projection equations for reduced-order discrete-time modeling estimation and control". Journal of Guidance Control and Dynamics 9 (3): 288–293. doi:10.2514/3.20105. 
  8. ^ Green, Limebeer: Linear Robust Control, p. 27

Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Control theory — For control theory in psychology and sociology, see control theory (sociology) and Perceptual Control Theory. The concept of the feedback loop to control the dynamic behavior of the system: this is negative feedback, because the sensed value is… …   Wikipedia

  • H-infinity methods in control theory — H ∞ (i.e. H infinity ) methods are used in control theory to synthesize controllers achieving robust performance or stabilization. To use H ∞ methods, a control designer expresses the control problem as a mathematical optimization problem and… …   Wikipedia

  • Stochastic control — is a subfield of control theory which deals with the existence of uncertainty in the data. The designer assumes, in a Bayesian probability driven fashion, that a random noise with known probability distribution affects the state evolution and the …   Wikipedia

  • Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… …   Wikipedia

  • Gaussian adaptation — Articleissues citations missing = July 2008 COI = y expert = Mathematics notability = July 2008 jargon = July 2008 OR = September 2007 primarysources = July 2008 technical = July 2008Gaussian adaptation (GA) is an evolutionary algorithm designed… …   Wikipedia

  • Kalman filter — Roles of the variables in the Kalman filter. (Larger image here) In statistics, the Kalman filter is a mathematical method named after Rudolf E. Kálmán. Its purpose is to use measurements observed over time, containing noise (random variations)… …   Wikipedia

  • List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… …   Wikipedia

  • Matrix difference equation — A matrix difference equation[1][2] is a difference equation in which the value of a vector (or sometimes, a matrix) of variables at one point in time is related to its own value at one or more previous points in time, using matrices. Occasionally …   Wikipedia

  • Separation principle — In control theory, a Separation principle (more formally known as a Principle of separation of estimation and control ) states that under some assumptions the problem of designing an optimal feedback controller for a stochastic system can be… …   Wikipedia

  • Линейно-квадратичное гауссовское управление — (англ. Linear quadratic Gaussian control, LQG control)  набор методов и математического аппарата теории управления для синтеза систем управления с отрицательной обратной связью для линейных систем с аддитивным гауссовским шумом. Синтез… …   Википедия

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”