Automatica, Vol.44, No.4, 937-948, 2008
H-2 robust filter design with performance certificate via convex programming
In this paper a new approach to H-2 robust filter design is proposed. Both continuous- and discrete-time invariant systems subject to polytopic parameter uncertainty are considered. After a brief discussion on some of the most expressive methods available for H-2 robust filter design, a new one based on a performance certificate calculation is presented. The performance certificate is given in terms of the gap produced by the robust filter between lower and upper bounds of a minimax programming problem where the H-2 norm of the estimation error is maximized with respect to the feasible uncertainties and minimized with respect to all linear, rational and causal filters. The calculations are performed through convex programming methods developed to deal with linear matrix inequality (LMI). Many examples borrowed from the literature to date are solved and it is shown that the proposed method outperforms all other designs. (c) 2007 Elsevier Ltd. All rights reserved.
Keywords:robust H-2 filtering;convex programming;Kalman filter;filter design;linear matrix inequalities (LMIs)