HOME

TheInfoList



OR:

''H'' (i.e. "''H''-infinity") methods are used in
control theory Control theory is a field of control engineering and applied mathematics that deals with the control system, control of dynamical systems in engineered processes and machines. The objective is to develop a model or algorithm governing the applic ...
to synthesize controllers to achieve stabilization with guaranteed performance. To use ''H'' methods, a control designer expresses the control problem as a
mathematical optimization Mathematical optimization (alternatively spelled ''optimisation'') or mathematical programming is the selection of a best element, with regard to some criteria, from some set of available alternatives. It is generally divided into two subfiel ...
problem and then finds the controller that solves this optimization. ''H'' techniques have the advantage over classical control techniques in that ''H'' techniques are readily applicable to problems involving multivariate systems with cross-coupling between channels; disadvantages of ''H'' techniques include the level of mathematical understanding needed to apply them successfully and the need for a reasonably good model of the system to be controlled. It is important to keep in mind that the resulting controller is only optimal with respect to the prescribed cost function and does not necessarily represent the best controller in terms of the usual performance measures used to evaluate controllers such as settling time, energy expended, etc. Also, non-linear constraints such as saturation are generally not well-handled. These methods were introduced into control theory in the late 1970s-early 1980s by George Zames (sensitivity minimization), J. William Helton (broadband matching), and Allen Tannenbaum (gain margin optimization). The phrase ''H'' ''control'' comes from the name of the mathematical space over which the optimization takes place: ''H'' is the '' Hardy space'' of
matrix Matrix (: matrices or matrixes) or MATRIX may refer to: Science and mathematics * Matrix (mathematics), a rectangular array of numbers, symbols or expressions * Matrix (logic), part of a formula in prenex normal form * Matrix (biology), the m ...
-valued functions that are analytic and bounded in the open right-half of the
complex plane In mathematics, the complex plane is the plane (geometry), plane formed by the complex numbers, with a Cartesian coordinate system such that the horizontal -axis, called the real axis, is formed by the real numbers, and the vertical -axis, call ...
defined by Re(''s'') > 0; the ''H'' norm is the
supremum In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, ...
singular value of the matrix over that space. In the case of a scalar-valued function, the elements of the Hardy space that extend continuously to the boundary and are continuous at infinity is the disk algebra. For a matrix-valued function, the norm can be interpreted as a maximum gain in any direction and at any frequency; for SISO systems, this is effectively the maximum magnitude of the frequency response. ''H'' techniques can be used to minimize the closed loop impact of a perturbation: depending on the problem formulation, the impact will either be measured in terms of stabilization or performance. Simultaneously optimizing robust performance and robust stabilization is difficult. One method that comes close to achieving this is ''H'' loop-shaping, which allows the control designer to apply classical loop-shaping concepts to the multivariable frequency response to get good robust performance, and then optimizes the response near the system bandwidth to achieve good robust stabilization. Commercial software is available to support ''H'' controller synthesis.


Problem formulation

First, the process has to be represented according to the following standard configuration: The plant ''P'' has two inputs, the exogenous input ''w'', that includes reference signal and disturbances, and the manipulated variables ''u''. There are two outputs, the error signals ''z'' that we want to minimize, and the measured variables ''v'', that we use to control the system. ''v'' is used in ''K'' to calculate the manipulated variables ''u''. Notice that all these are generally vectors, whereas P and K are matrices. In formulae, the system is: :\begin z\\ v \end = \mathbf(s)\, \begin w\\ u\end = \beginP_(s) & P_(s)\\P_(s) & P_(s)\end \, \begin w\\ u\end :u = \mathbf(s) \, v It is therefore possible to express the dependency of ''z'' on ''w'' as: :z=F_\ell(\mathbf,\mathbf)\,w Called the ''lower
linear fractional transformation In mathematics, a linear fractional transformation is, roughly speaking, an inverse function, invertible transformation of the form : z \mapsto \frac . The precise definition depends on the nature of , and . In other words, a linear fractional t ...
'', F_\ell is defined (the subscript comes from ''lower''): :F_\ell(\mathbf,\mathbf) = P_ + P_\,\mathbf\,(I-P_\,\mathbf)^\,P_ Therefore, the objective of \mathcal_\infty control design is to find a controller \mathbf such that F_\ell(\mathbf,\mathbf) is minimised according to the \mathcal_\infty norm. The same definition applies to \mathcal_2 control design. The infinity norm of the transfer function matrix F_\ell(\mathbf,\mathbf) is defined as: :, , F_\ell(\mathbf,\mathbf), , _\infty = \sup_\omega \bar(F_\ell(\mathbf,\mathbf)(j\omega)) where \bar is the maximum singular value of the matrix F_\ell(\mathbf,\mathbf)(j\omega). The achievable ''H'' norm of the closed loop system is mainly given through the matrix ''D''11 (when the system ''P'' is given in the form (''A'', ''B''1, ''B''2, ''C''1, ''C''2, ''D''11, ''D''12, ''D''22, ''D''21)). There are several ways to come to an ''H'' controller: * A Youla-Kucera parametrization of the closed loop often leads to very high-order controller. * Riccati-based approaches solve two
Riccati equation In mathematics, a Riccati equation in the narrowest sense is any first-order ordinary differential equation that is quadratic in the unknown function. In other words, it is an equation of the form y'(x) = q_0(x) + q_1(x) \, y(x) + q_2(x) \, y^2( ...
s to find the controller, but require several simplifying assumptions. * An optimization-based reformulation of the Riccati equation uses linear matrix inequalities and requires fewer assumptions.


See also

* Blaschke product * Hardy space * H square * H-infinity loop-shaping * Linear-quadratic-Gaussian control (LQG) * Rosenbrock system matrix


References


Bibliography

*. *. *. *. *. *. {{refend Control theory Hardy spaces