Premium
Finite‐time asynchronous ℋ ∞ filtering for discrete‐time Markov jump systems over a lossy network
Author(s) -
Shen Hao,
Li Feng,
Wu ZhengGuang,
Park Ju H.
Publication year - 2016
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.3537
Subject(s) - control theory (sociology) , asynchronous communication , filtering problem , lossy compression , filter (signal processing) , discrete time and continuous time , computer science , network packet , mathematics , nonlinear system , markov chain , filter design , telecommunications , computer network , statistics , physics , control (management) , quantum mechanics , artificial intelligence , machine learning , computer vision
Summary This paper is concerned with the problem of finite‐time asynchronousℋ ∞filtering for a class of discrete‐time Markov jump systems. The communication links between the system and filter are assumed to be unreliable, which lead to the simultaneous occurrences of packet dropouts, time delays, sensor nonlinearity and nonsynchronous modes. The objective is to design a filter that ensures not only the mean‐square stochastic finite‐time bounded but also a prescribed level ofℋ ∞performance for the underlying error system over a lossy network. With the help of the Lyapunov–Krasovskii approach and stochastic analysis theory, sufficient conditions are established for the existence of an admissible filter. By using a novel simple matrix decoupling approach, a desired asynchronous filter can be constructed. Finally, a numerical example is presented and a pulse‐width‐modulation‐driven boost converter model is employed to demonstrate the effectiveness of the proposed approach. Copyright © 2016 John Wiley & Sons, Ltd.