#### Abstract

This paper deals with the finite-time stabilization problem for discrete-time Markov jump nonlinear systems with time delays and norm-bounded exogenous disturbance. The nonlinearities in different jump modes are parameterized by neural networks. Subsequently, a linear difference inclusion state space representation for a class of neural networks is established. Based on this, sufficient conditions are derived in terms of linear matrix inequalities to guarantee stochastic finite-time boundedness and stochastic finite-time stabilization of the closed-loop system. A numerical example is illustrated to verify the efficiency of the proposed technique.

#### 1. Introduction

Markov jump systems (MJSs) are an important class of stochastic dynamic systems, which are popular when modeling an abrupt change in the system structure and parameters, such as component failures or repairs, changing subsystem interconnections and environmental disturbance. This family of systems has great practical potential in a variety of fields, such as solar thermal central receivers systems, economic systems, communication systems, manufacturing systems, and networked control systems [1–4]. MJSs have been extensively studied since the pioneering work on quadratic control of MJSs [5], and many achievements have been made on Lyapunov stochastic stability and stabilization in the last three decades [6–18].

However, it is worth noting that the Lyapunov stochastically stable systems may not possess good or expected transient characteristics over a finite-time horizon. In many practical problems, it is of interest to investigate the stability of a system over a finite interval of time. For example, referring to aircraft control, it requests that, during the execution of a certain task, the state variables should not exceed some threshold under all admissible pilot inputs and in the presence of wind disturbances. Classical control theory does not directly address this requirement, because it focuses mainly on the asymptotic behavior of the system (over an infinite-time interval) and does not usually specify bounds on the trajectories. Therefore, it is necessary to limit the state in an acceptable region and consider finite-time stability (FTS) given by Dorato [19].

The concept of FTS has been further extended into finite-time boundness (FTB) [20, 21], when system possesses bounded exogenous disturbance. A linear matrix inequality (LMI) framework has been established to distinguish FTS and Lyapunov asymptotical stability [22–24]. Compared with Lyapunov stochastically stable condition, FTS relaxes the condition by allowing that the Lyapunov-like function can increase at every sampling time instant. That is why FTS is so attractive and widely used in practical engineering.

As MJSs are considered, a number of results on stochastic FTS or stochastic FTB have been developed [25–28], and recently, the obtained results have been extended to continuous-time MJSs with nonlinearities via fuzzy or neural network approach [24, 29, 30]. In order to make the stochastic systems more manageable and satisfy the requirements for finite-time behavior of a system in engineering fields, it motivates us to investigate the finite-time stability and stabilization problems for a class of MJSs. Furthermore, time delay is a common phenomenon and is inevitable in practice systems [31–33]. Due to the interaction among system dynamics, stochastic jumps, and time delays, the dynamics of MJSs with time delay become more complex than MJSs without time delay and time delay systems without jumps. So far, in comparison with the literatures available for continuous-time nonlinear MJSs with time delays, the corresponding FTS or FTB results for discrete-time nonlinear systems have been relatively few.

It is, therefore, the main purpose of this paper to shorten such a gap by investigating the finite-time stabilization problem for discrete-time nonlinear MJSs with time delays. With neural networks, the nonlinearities of MJSs are approximated firstly by linear difference inclusion under state-space representation. Then, a mode-dependent finite-time controller is developed to make the nonlinear MJSs stochastic finite-time stabilizable for all admissible approximation errors of the neural networks and the norm-bounded external disturbances. The controller gains could be derived by solving a set of LMIs. An attractive feature of the proposed scheme is that the coupling relationship between time delay and given finite-time horizon is explored by obtaining delay-independent conditions.

Notations in this paper are fairly standard. and denote -dimensional Euclidean space and the set of all the real matrices, respectively; (or ) and denote the transpose of the matrix (or the vector ) and the inverse of the matrix , respectively. and denote, respectively, the maximal and minimal eigenvalues of a real matrix , denotes the Euclidean norm of matrix , denotes the mathematics statistical expectation of the stochastic process or vector, is the space of summable infinite sequence over , stands for a positive-definite matrix, is the unit matrix with appropriate dimensions, and “” means the symmetric terms in a symmetric matrix.

#### 2. System Description and Problem Formulation

We consider a nonlinear discrete-time MJS, which can be described by the following mathematical model: where is the vector of state variables, is the controlled input, is a discrete nonlinear mapping with but not assumed to be known a prior, and is the exogenous disturbances satisfying For each possible value of , we denote where is a discrete-state Markov chain taking values in with transition probabilities where is the transition probabilities from mode to mode that satisfies For each mode , nonlinear function is to be parameterized by neural networks. Such parameterization makes sense because any nonlinear function can be approximated arbitrarily well on a compact interval by a neural network. Let the -layered perceptrons be suitably trained to approximate the nonlinear term , which is described in matrix-vector notation as where all the weight matrices , , from the th layer to the th layer will be determined via back propagation (BP) procedure [24]; the activation function vector of th layer is defined as , where indicates the neurons of th layer and let The maximum and minimum derivatives of activation function are defined as follows: For th layer of neural network, activation function can be rewritten as the following min-max form: where , , are a set of positive real numbers associated with satisfying and .

According to the approximation theorem, for given accuracy , there exist ideal constant weight matrices defined as where is a compact set , such that For each mode , denote a set of dimensional index vectors of the th layer as where is used as a binary indicator. Obviously, the th layer with neurons has combinations of binary indicator with , and the elements of index vectors for all layers neural network have combinations in the set By using (8) and adopting the compact representation [34], the multilayer neural network (6) can be expressed as follows:

where Thus by means of multilayer neural network, the nonlinear MJS (1) is translated into a group of LDIs with error bounds, in which the different inclusion is powered by stochastic Markov process; that is, where denotes the approximation errors of networks.

*Remark 1. *The detailed structure and quantitative size of error dynamics are not needed, but only norm-bounded assumption is required. This condition is easily satisfied in practical cases, such as bioinformatics system, medical diagnosis, fault diagnosis, and image and pattern recognition. Actually, the approximation error between the target function and the closest neural network function of a given network family can be made as small as desired by increasing the number of nodes [35]. Also the bounds of norm may vary according to different nonlinearities in different modes.

#### 3. Main Results

Based on the LDI model (16) of networks, we consider the following discrete-time state feedback control law for nonlinear stochastic MJS (1): The resulting closed-loop system can be obtained as follows: where The aim of this paper is to find some sufficient conditions which guarantee stochastic finite-time boundness and stochastic finite-time stabilization of the closed-loop system (19). The general idea of finite-time control can be formalized through the following definitions over a finite-time interval for some given initial conditions.

*Definition 2 (stochastic finite-time stability). * A discrete-time nonlinear MJS (1) (setting and ) is said to be, stochastic finite-time stability (FTS) with respect to given (), where and , if , whenever .

*Definition 3 (stochastic finite-time boundness). *A discrete-time nonlinear MJS (1) (setting ) is said to be of stochastic finite-time boundness (FTB) with respect to () with and , if , whenever .

Before proceeding further, we introduce the following lemmas which will be needed for the derivation of our main results.

Lemma 4. *The closed-loop system (19) is stochastic FTB with respect to the given () and scalar , if there exist mode-dependent symmetric positive-definite matrix and symmetric positive-definite matrices and such that
**
where , , , and , indicate the maximal and minimal eigenvalues of the augment, respectively. *

*Proof. *For the closed-loop system (19), choose a stochastic Lyapunov function candidate as
Simple calculation shows that
where
Conditions (21) and (24) imply that
Noting that , we can obtain from (26) that
Note that
According to (27)-(28), one has

Condition (19) implies that, for , . This completes the proof.

Now, we direct our attention to present a solution to the problem of finite-time stabilizing controller design. Such controller is provided by the following theorem.

Theorem 5. *The closed-loop system (19) is stochastic finite-time stabilizable via state feedback with respect to the given () and scalar , if there exist matrices , , , and and scalars such that
*

*Proof. *By using Schur complement, from condition (21) in Lemma 4, it follows that
where
Performing matrix elementary transformation to the above inequality, we have
Performing a congruence to the above condition by , using Schur complement, and letting and , we get
where
By using Schur complement to (36) and letting , we obtain the linear matrix inequality (30) in Theorem 5.

On the other hand, we consider
Condition (22) follows that
It is easy to check that the above inequality is guaranteed by imposing the following conditions
which are equivalent to conditions (31)-(32). This completes the proof.

*Remark 6. *It is worth pointing out that Theorem 5 is not a delay-dependent sufficient criterion, which is conservative when the delay is small. Delay-dependent result can be developed in the same way by choosing a Lyapunov functional that includes more entries, as was done in [36], or delay fractioning approach that can be employed as was done in [31–33].

*Remark 7. *The coupling relationship between time delay and given finite-time horizon of the underlying system is obtained through a finite-time stable constraint (32) in Theorem 5. From condition (32), it can be seen that, in given finite-time horizon, if the time delay is larger, constraint (32) is more difficult to be satisfied, which means that the existence of time delay increases the instability of system.

#### 4. Numerical Example

Consider discrete-time Markov jump nonlinear system (1) with three operation modes and the following data: Now, a single hidden layer neural network with 2 hidden neurons was chosen to approximate the nonlinear functions . All parameters of activation functions associated with the hidden layer were chosen to be and . For these activation functions, we have and . The connection weights are trained offline by using BP algorithm. The initial weights and state vector are placed by uniformly distributed random numbers in . After 1000 training steps, the optimal approximation weights are as follows: The upper bound of approximation error is estimated as . Obviously, in this case, we have . According to (15), can be obtained as follows: The initial state and initial mode are taken as and , respectively. The iterative step is taken as . The mode path from time step 0 to time step 7 is generated randomly and it is shown in Figure 1. Let , , , , , , and . By solving the matrix inequalities in Theorem 5, we have the following controller gains: The state trajectories of the free and controlled MJLS (16) are drawn in Figures 2 and 3, respectively. It could be seen that the free MJLS (16) is not stochastic FTB because the trajectory exceeds the given bound . However, the trajectory is limited between the two ellipsoids regions by employing the proposed control move which satisfactorily justify that the closed-loop MJLS (16) is stochastic FTB.

It should be pointed out that, in the simulation example, as long as the choice of initial condition is satisfied with , then the system is robustly finite-time stabilizable; that is, system trajectories stay within a given bound.

#### 5. Conclusions

The finite-time stabilization problem for discrete-time Markovian jump nonlinear system with time delay and norm-bounded exogenous disturbance is investigated in this paper. The nonlinearities are parameterized by multilayer neural network and the relationship between time delay and given finite-time horizon is explored with delay-independent conditions. The proposed framework is versatile and can accommodate a number of challenging design problems including finite-time control and filtering of discrete-time or continuous-time nonlinear MJS with parameter uncertainties, time delays, and so on. The future work can consider some delay-dependent approaches or delay fractioning approaches to reduce the conservativeness introduced by time delay.

#### Acknowledgments

This work was partially supported by the National Natural Science Foundation of China (Grant no. 61104121) and the 111 Project (Grant no. B12018), and the third author would also like to thank the Alexander-von-Humboldt Foundation for providing the support to this research.