Frequency‐dependent fault detection for networked systems under uniform quantization and try‐once‐discard protocol

Abstract

Summary This paper is concerned with the frequency‐dependent fault detection scheme for networked systems under uniform quantization and try‐once‐discard protocol scheduling. By considering the communication constraint and the data node scheduling, a switched system is firstly modeled to characterize the dynamic features of the whole system. The switching function of the derived system is determined by the try‐once‐discard protocol. For this class of system, a sufficient condition to ensure the exponentially ultimately boundedness is established. With the aid of some novel analysis processes, sufficient conditions to characterize the desired finite frequency performances, which transform the frequency‐domain restrictions into time‐domain conditions, are subsequently developed. Then, the fault detection filters corresponding to the transmission nodes are synthesized by solving an optimization problem. Finally, an application to VTOL aircraft is presented to illustrate the effectiveness of the proposed fault detection strategy.

Quantized fault‐tolerant consensus for multiple Lagrangian systems subject to switching networks

“…To address the FTC problem with S-MJNs, time-varying delays, and unknown control directions, we develop the quantized FTC algorithm structured in Table 3 with control law (18), adaptation laws (19a)-(19e), (19g), and (23).…”

“…Wang and Yang 16,17 developed FTC protocols for linear multiagent systems with actuator faults and time-varying networks. Additionally, Long et al 18 modeled frequency-dependent fault detectors for networked systems with uniform quantization and try-once-discard protocol scheduling. Yao et al 19 proposed a FTC approach for high-speed trains over stochastic jump systems.…”

$$H_\infty $$ State Estimation for Round-Robin Protocol-Based Markovian Jumping Neural Networks with Mixed Time Delays

“…In contrast with those traditional approaches without protocol scheduling, the introduction of communication protocol would cause some fundamental challenges to dynamic analysis. Up to now, there have been some elementary results about the MJNNs constrained by communication protocols including Round-Robin protocol (RRP), stochastic communication protocol (SCP) and weight try-once-discard protocol (WTOD protocol), see [22,23,24,25,26,27,28,29,30,31]. As such, the WTOD protocol is a kind of quadratic protocols, which differs from the periodic allocation of RRP.…”

Robust finite frequency H∞ distributed memory filter design for networked control systems with polytopic uncertainty

“…The most common strategy is introducing more slack variables into synthesis conditions and searching the optimal scalar parameters imposed on the introduced slack variables [13,14]. Besides, Gao and Li [15,16] take it into consideration that the energy of most disturbances only concentrates in some finite frequency ranges [17,18] and design the filters in some finite frequency domains to avoid overdesign. Results in Lee and Joo [19] and Frezzatto et al [20] show that a higher order filter can also essentially reduce the conservatism.…”