Abstract

This paper is concerned with the reliable finite frequency filter design for networked control systems (NCSs) subject to quantization and data missing. Taking into account quantization, possible data missing and sensor stuck faults, NCSs are modeled in the framework of discrete time-delay switched systems, and the finite frequency l2 gain is adopted for the filter design of discrete time-delay switched systems, which is converted into a set of linear matrix inequality (LMI) conditions. By the virtues of the derived conditions, a procedure of reliable filter synthesis is presented. Further, the filter gains are characterized in terms of solutions to a convex optimization problem which can be solved by using the semi-definite programme method. Finally, an example is given to illustrate the effectiveness of the proposed method.

Highlights

  • There has been a growing interest in networked control systems (NCSs), which is a class of systems in which sensors, controllers and plants are connected over the network media [1,2,3,4]

  • It is natural that the reliable filtering problem in presence of possible sensor faults has recently obtained much attention and there have been many results investigating this important issue

  • The reliable filtering problem proposed in the above section will be investigated

Read more

Summary

Introduction

There has been a growing interest in networked control systems (NCSs), which is a class of systems in which sensors, controllers and plants are connected over the network media [1,2,3,4]. To the best of the authors’ knowledge, reliable filtering problems for NCSs subject to packet loss and quantization have not been fully investigated, especially in finite frequency domain where faults occur frequently. This motivates the investigation of this work. In response to the above discussions, in this paper, the reliable finite frequency filtering problem for NCSs subject to packet loss and quantization is investigated in finite frequency domain against sensor stuck faults. In block symmetric matrices or long matrix expressions, we use ∗ to represent a term that is induced by symmetry; The sum of a square matrix A and its transposition AT is denoted by He(A) := A + AT

System Model and Problem Formulation
Main Results
Stability Condition
Algorithm
Example
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call