Research Article  Open Access
FiniteTime Fault Detection for LargeScale Networked Systems with Randomly Occurring Nonlinearity and Fault
Abstract
The finitetime fault detection problem is investigated for a class of nonlinear quantized largescale networked systems with randomly occurring nonlinearities and faults. A nonlinear Markovian jump system model with partially unknown transition probabilities is employed to describe this Makov data assignment pattern. Based on obtained model, in finitetime stable framework, the desired modedependent fault detection filters are constructed such that the augmented error systems are finitetime stochastically stable with attenuation level. Especially, the sufficient conclusions provide quantitative relationship between network characteristic, quantization level, and finitetime system parameter with finitetime fault detection performance. The effectiveness of the proposed methods is demonstrated by simulation examples.
1. Introduction
The past decade has witnessed an ever increasing research interest in networked systems (NSs) due to their advantages in many aspects such as low cost, simple installation and maintenance, increased system agility, reduced system wiring, and high reliability. For largescale NSs, multiple sensors and actuators are connected to the central control and fault detection station through communication medium. Actually, the introduction of communication network inevitably brings communication constraints to the systems analysis and synthesis. Especially, networkinduced delay, packet dropout, and signal quantization have significant effect on the performance and stability, even fault of NSs [1–9].
Fault detection has been an active research field over the past decades because of the ever increasing demand for higher performance, higher safety, and reliability standard [10–12]. Recently, there are increasing interests on fault detection (FD) of networked systems. However, compared with the rich results in control and stability analysis of networked systems, only a limited number of contributions about FD have been found [13]. To deal with the FD of nonlinear networked systems (NCSs), [14] study TS fuzzy model based fault detection for NCSs with stochastic mixed time delays and successive packet dropouts. In [15], an FD framework for a class of nonlinear NCSs via a shared communication medium has been proposed. In addition, the robust fault detection problem is studied in [16] for a class of NSs with unknown input, multiple state delays, and data missing. [17] study robust fault detection of NSs with delay distribution characterization.
For networked systems, stability analysis may be one of the most important research attention. Even almost all existing stability results are Lyapunov stability, actually, finitetime stability (FTS) [18] is a more practical concept which is utilized to study the behavior of the system within a finite time interval. Markovian jump systems (MJSs) are said to be stochastically finitetime stable if once we fix a finitetime interval, its state remains within prescribed bounds during this time interval. Obviously, MJSs may be not Lyapunov stochastically stable but finitetime stable. For largescale networked systems, the nonlinear may be random due to stochastic change from networkinduced phenomenon, which give rise to the socalled randomly occurring nonlinearities (RONs) [19]. Actually, compared to deterministic fault of networked systems [13–17], faults may also occur in a probabilistic way and they arerandomly changeable in terms of their types and/or intensity. To the best of the authors’ knowledge, up to now, almost no attention has been paid to the study of finitetime fault detection for nonlinear multiple channels data transmission networked systems with RONs and randomly occurring faults (ROFs); the main purpose of this paper is to shorten such a gap.
The main contributions of this paper are summarized as follows. A Markovian jump system model with partially unknown transition probabilities is proposed to describe the multiple channels data transmission networked systems with channeldependent measurement quantization; based on the obtained model, by utilizing observerbased fault detection filter as residual generator, finitetime fault detection of largescale networked systems is formulated as nonlinear finitetime attenuation problem; and by means of linear matrix inequalities (LMIs) method, sufficient conditions of finitetime stochastic stability are obtained and attenuation level is guaranteed, and the explicit expression of the desired modedependent fault detection filters is also derived, which establish the quantitative relationship between quantization level and finitetime system parameters with fault detection performance. Especially, fault detection of traditional Markovian jump systems (known transition probability) and switched systems (unknown transition probability) with Lyapunov asymptotic stability (assuming finitetime system parameter ) can be contained as its special case. Numerical simulations are utilized to demonstrate the effectiveness of the presented methods.
Notation. Throughout the paper, the superscripts “−1” and “” stand for the inverse and transpose of a matrix, respectively. denotes the dimensional Euclidean space and refers to Euclidean norm for vectors. means that is a real symmetric positive definite (semidefinite) matrix. is the expectation of the stochastic variable . means the occurrence probability of event “”. and 0 represent identity matrix and zero matrix; we utilize asterisk () to represent a term that is induced by symmetry and stands for a block diagonal matrix.
2. Problem Formulation
Consider the discretetime NSs with the following nonlinear system model: where is the state vector, is the measurement output, is the disturbance input vector, and is the fault vector to be detected. , , , , and are known real matrices with appropriate dimension. The nonlinear function satisfies and the following condition: where is the bounding parameters on the nonlinear function ; is known real constant matrix.
Random variables and are utilized to account for the phenomena of randomly occurred nonlinearities and faults, which are assumed to be independent from each other and take values of 0 and 1 with where and are known constants. For largescale complex networked systems, the nonlinearities and faults may be subject to random changes in environmental circumstances, for instance, networkinduced random failures and repairs of components, sudden environmental disturbances, and so forth. Therefore, both the nonlinearities and faults may occur in a probabilistic way with certain types and intensity, which is particularly true in a networked environment.
In this paper, before accessing the observer, output signal will be quantized by quantizer and quantized signal can be expressed as
If quantizer is assumed to be logarithmic type, the set of quantization levels is described by , , . Each quantization level corresponds to a segment such that the quantizer maps the whole segment to this quantization level. In addition, these segments form a partition of ; that is, they are disjoint and their union equals . The logarithmic quantizer is defined as where . Similar to [20], we have the expression of with . Defining , the measurements after quantization have the following form:
Actually, the quantized effect can be transformed into sector bound uncertainties. By defining and , we obtain an unknown realvalued timevarying matrix satisfying .
In this paper, twovalued function is used to describe the th channels transmission status in sampling time , where 1 means successful data transmission and 0 means data loss. Specifically, only corresponding data packet access the communication medium, that is, , the quantized output to observer of th channels is available. Otherwise, when , the output of th channels will be zero by the observer and will be ignored due to its being unavailable. If we regard as the th channels signal received by the observer, we describe the transmission dynamics of th channels as:
In the need of investigation, we define transmission matrix as , and matrix can be expressed in the following form:
According to above discussion, we achieve the quantized output dynamics as where . Let be a Markov chain taking values in a finite state space with transition probability matrix given by where , , , and . It is suitable that we assume that Markov chain is independent of the stochastic variables and .
In this paper, the following modedependent observerbased fault detection filter is constructed as a residual generator: where and represent the state and output estimation vectors, respectively. is the residual signal. FDF parameters are the observer gain matrices and residual weighting matrices . Observer with above structure is assumed to jump synchronously with the modes in (9), which is hereby modedependent.
Let the estimation error be , then error systems can be obtained by combining (1), (9), and (11):
By setting , , , and integrating (1) and (12), we obtain the following augmented error systems: where , , , , , and ; is the residual error which contains the stochastic fault information of occurrence time and location. In addition, the transition probabilities of jumping process are assumed to be partly accessed; that is, some elements are unknown. For notation clarity, we denote with and .
Now, to present the main objective of this paper more precisely, we need the following finitetime stochastic stability definition for augmented error systems (13), which are essential for the later development.
Definition 1. Augmented error systems (13) are said to be finitetime stochastically stable with respect to for and every initial condition , where are positive define matrix, and , if
The purpose of this paper is to design modedependent observerbased fault detection parameters and such that augmented error systems (13) are finitetime stochastically stable; under zeroinitial condition, for any nonzero , we have
In order to detect the faults, the widely adopted approach is to choose an appropriate threshold and residual evolution function as
where denotes the initial evaluation time instant and denotes the evaluation time steps.
Based on the threshold, the occurrence of fault can be detected by comparing and according to the following test:
3. Main Results
The following theorem provides a sufficient condition under which the augmented error systems (13) are finitetime stochastically stable and the residual estimation error satisfies the criterion (15) under zeroinitial condition.
Theorem 2. Augmented error systems (13) are finitetime stochastically stable with respect to and satisfy performance level (15), if there exist positive define matrices , scalars , , and such that the following matrix inequalities hold: where
Proof. For augmented error systems (13) with , we construct stochastic Lyapunov function as
where . If we denote , then is . So, along the solution of (13), we obtain
For any scalar , it follows readily from (2) that
Combining (13) and (22)(23) and denoting lead to
where
By Schur complement, (18) implies and , which means that
Applying above inequality interactively, we obtain
Now, letting and using the fact that , we have
Furthermore, according to the following fact,
Putting (27) and (29) together may yield
Thus, augmented error systems (13) are finitetime stochastically stable from Definition 1.
On the other hand, under zero initial condition, for in (13), we consider the following performance index:
Let , we have
where
By Schur complement, (18) is equivalent to , which implies , that is (15), so the proof is completed.
Remark 3. As [18] pointed out, Lyapunov asymptotic stability (LAS) is independent on finitetime stability (FTS); that is, a system which is FTS may not be LAS; conversely a LAS system could not be FTS. In this paper, we investigate more practical fault detection of networked systems in finitetime stochastic stability (FTSS) framework rather than in Lyapunov stochastic stability (LSS) framework [1–9, 13–17]. Especially, if we let , Theorem 2 will degenerate to fault detection in FTSS framework, in view of this, our conclusion is more general.
Next, sufficient conditions on the existence of modedependent observerbased finitetime fault detection filters would be given, the slack matrix will be constructed with a special structure to eliminate the cross coupling between system matrices and Lyapunov matrices among different operation modes, which allows us to obtain a solution within strict linear matrix inequalities framework for the proposed systems.
Theorem 4. Augmented error system (13) is finitetime stochastically stable with respect to and satisfies performance level (15) if there exist matrices , , , , , , , , scalars , , and such that (19) and the following linear matrix inequalities hold:
where
Then, there exists modedependent observerbased finitetime fault detection filters such that the augmented error systems (13) with partly unknown transition probabilities are finitetime stochastically stable with performance level (15). Moreover, if LMIs (34) have feasible solution, the desired finitetime fault detection filters can be given by
Proof. For an arbitrary matrix , assuming that is inverse, we have the following fact:
Then, we have ; performing a congruence transformation to (18) by , we obtain
where and .
Define matrices variables and , noting thatwhere
Then (38) can be rewritten as
where
From Schur Complement, for any scalars , we get
Now, partition as ; then define matrics . If we replace and into (43), we readily obtain (34). From Theorem 2, augmented error systems (13) will be finitetime stochastically stable with performance level (15). Meanwhile, if the solution of (34) exists, the admissible finitetime fault detection filters are given by (36). The proof is completed.
From a viewpoint of computation, it should be noted that the conditions in Theorem 4 are still not standard linear matrix inequalities (LMIs) conditions due to (18). Actually, conditions (18) can also be guaranteed by LMIs conditions once the values of is set. For given positive scalar , it is easy to check that condition (18) is guaranteed by imposing condition and
Then, inequality (18) can be converted into the following LMI by using Schur Complement:
Thus, once is fixed, the feasibility of (18) in Theorem 4 can be translated into LMIbased conditions (44) and (46). Theorem 4 can be solved by Matlab’s LMI toolbox [21].
Remark 5. As the special cases of partly unknown transition probabilities, when all the transition probabilities are completely accessible and completely inaccessible , the underlying systems are the traditional Markovian jump systems and the switched systems under arbitrary switching, respectively. Correspondingly, the fault detection results can be found in some existing references, [10] investigated linear discretetime Markovian jump systems (completely accessible), [11] studied linear discretetime switched systems (completely inaccessible), [22] considered transition probabilities with polytopic uncertainties which require the knowledge of uncertainties structure and it can still be viewed as accessible. Therefore, finitetime fault detection with partly unknown transition probabilities is a more natural assumption to the Markovian jump systems and hence covers the existing ones. Furthermore, when and , then augmented error systems (13) with RON and ROF are the usually nonlinear system [19] and fault detection system [10–17]; from this view, (13) is also a more comprehensive networked systems model.
4. Numerical Example and Simulation
Consider the nonlinear networked systems (1) with the following parameters:
Attention is focused on the design of modedependent observerbased finitetime fault detection filters, which make the augmented error systems (13) finitetime stochastically stable with performance level (15). If we consider two channels data transmission networked systems, according to the transmission pattern presented in Section 2, the transmission matrices are constructed as
With above data transmission pattern, from Remark 5, we consider the Case II with partly unknown transition probabilities in Table 1, where “” means that element is unknown. As the special cases of Case II, corresponding results of traditional Markovian jump systems (Case I) and switched systems (Case III) can be included in our theorems. By Theorem 4, for the given , , and , the suboptimal finitetime fault detection performance level is obtained in Table 2. From Table 2, it can be easily seen that finitetime fault detection performance level is dependent on ROFs probability and RONs probability , finitetime stability index , quantization level , and the information of transition probability matrices, which show the effectiveness of our discussion.


Assuming that the parameters are given by , , , , , , , and , by applying (34), (36), (44), and (46) of Theorem 4, modedependent observerbased finitetime fault detection filter matrices and can be obtained as follows:
To demonstrate the effectiveness of designed finitetime fault detection filter, for , unknown disturbance input is assumed to be bandlimited white noise with power of 0.05, and the fault signal is simulated as a square wave of 0.1 amplitude that occurred from 8 to 14 steps and the nonlinear function is given by . Under Cases I, II, and III, the initial state of augmented error systems (13) is assumed as , corresponding evolution of residual estimation error signal and residual evaluation function are shown in Figures 1, 2, and 3, respectively. For given and , the threshold can be determined by utilizing 300 Monte Carlo simulations in Table 3; from Table 3, we observe that, when , , for the first time, which means that the fault can be detected as soon as its occurrence, respectively, so the effectiveness of proposed finite time fault detection problem is illustrated.
