This paper presents an algorithm for determining the minimum dwell time constraint for switched linear H fault detection filters. When applying switched systems, ensuring the stability is a crucial part, which can be guaranteed, when we switch slowly enough between the subsystems, more precisely the intervals between two consecutive switching, called dwell time, are large enough. The problem formulation is based on multiple Lyapunov functions and is expressed through a special form of linear matrix inequities (LMIs), which include a nonlinear term with the dwell time. This represents a multivariable time dependent optimization problem. To solve this special formulated LMIs, we propose an algorithm, called T -iteration, which is a combination of the procedure of interval halving with an LMI solver. The results of the illustrative example suggest further benefits.
W artykule zaprezentowano algorytm do określania minium czasowego miedzy kolejnymi przełączeniami liniowego filtru do detekcji błędu H. Sformułowanie problemu bazuje na wielokrotnej funkcji Lapunva. Do rozwiązania tego problmu zaproponowano algorytm T -iteration który jest kombinacją procedury połówkowania intwerwału z wykorzystanie solvera LMI.
Financed by the National Centre for Research and Development under grant No. SP/I/1/77065/10 by the strategic scientific research and experimental development program:
SYNAT - “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.