Convex optimization approaches to robust L1 fixed-order filtering for polytopic systems with multiple delays

Abstract

This paper investigates the robust L1 fixed-order filtering problem for continuous polytopic systems with multiple state delays. Attention is focused on the design of robust full-order and reduced-order filters that guarantee the filtering error system to be asymptotically stable and satisfy the worst case peak-to-peak gain of the filtering error system for all admissible uncertainties and time delays. In particular, we concentrate on the delay-dependent case, and the peak-to-peak performance criterion is first established for polytopic systems with multiple state delays. Two different convex optimization approaches are proposed to solve this problem. One is the parameter-dependent Lyapunov approach in which the filter is not only dependent on the parameters (residing in a polytope), but also the Lyapunov matrices are different over the entire polytope domain. The other is the quadratic stability approach which obtains an admissible filter in the quadratic framework. Computational algorithms in terms of linear matrix inequalities (LMIs) are provided. It is shown that the parameter-dependent Lyapunov approach turns out to be less conservative than the quadratic stability approach, but the quadratic stability approach is computationally less demanding. Two numerical examples are presented to illustrate the proposed theory. © Birkhäuser Boston 2008.