A novel full-order and reduced-order fault detection filters design method for continuous-time singular Markov jump systems with complexity transition rates

Abstract

This work is concerned with the problem of full-order and reduced-order fault detection filters (FDFs) design in a convex optimization frame for continuous-time singular Markov jump systems (CTSMJSs) with complexity transition rates (TRs). A novel Lyapunov function construct approach is utilized to cope with the stochastic admissibility problem for CTSMJSs with complexity TRs. In order to obtain effective full-order and reduced-order FDFs, we decoupled the inequality using the presupposed Lyapunov matrix. Owing to the use of Lyapunov stochastic admissibility theory and a novel decoupling method based on convex polyhedron technique, some sufficient conditions are obtained to guarantee that the resulting full-order and reduced-order FDFs are suitable for CTSMJSs with complexity TRs. In particular, the reduced-order FDF has the advantages of small storage space and fast detection speed compared with the full order FDF. Four illustrative examples are given to explain the effectiveness of the proposed full-order and reduced-order FDFs design method.