Open Access

Finite-time H control of a switched discrete-time system with average dwell time

Advances in Difference Equations20132013:191

https://doi.org/10.1186/1687-1847-2013-191

Received: 3 March 2013

Accepted: 14 June 2013

Published: 28 June 2013

Abstract

For switched discrete-time systems, switching behavior always affects the finite-time stability property, which was neglected by most previous research. This paper investigates the problem of H control for a switched discrete-time system with average dwell time. Based on the results on finite-time boundned and average dwell time, sufficient conditions for finite-time bounded and finite-time H control under arbitrary switching are derived, and the closed-loop system trajectory stays within a prescribed bound. Finally, an example is given to illustrate the efficiency of the proposed method.

Keywords

H finite-time stabilityswitched discrete-time systemLyapunov-Krasovskii function H control

1 Introduction

During the last few decades, the problem of H control for continuous time systems with time delays has been extensively investigated [1, 2]. In the discrete-time context, there is rapidly growing interest in H control for a discrete-time system due to its being frequently encountered in many practical engineering systems such as chemical, electronics, process control systems and networked control systems [35]. Furthermore, in the state feedback case, the augmentation approach generally leads to a static output feedback control problem, which is non-convex [6]. Control of stochastic systems is a research topic of both practical and theoretical importance, which has received much attention [7, 8]. Many results related to stochastic systems have been reported in the literature. For instance, an optimal stochastic linear-quadratic control problem was investigated by a stochastic algebraic Riccati equation approach in infinite-time horizon in [9], where the diffusion term in dynamics depends on both the state and the control variables. It is important to invest H control problem.

In recent years, there has been increasing interest in the analysis of hybrid and switched systems due to their significance both in theory and applications. Switched linear control systems, as an important class of hybrid systems, comprise a collection of linear subsystems described by differential/difference equations and a switching law to specify the switching among these subsystems. A switched system is a type of a hybrid system which is a combination of discrete and continuous dynamical systems. These systems arise as models for phenomena which cannot be described by exclusively continuous or exclusively discrete processes. Moreover, control design remains open for the switched systems that exhibit switching jumps and subsystem models. Most recently, on the basis of Lyapunov functions and other analysis tools, the control design for linear switched systems has been further investigated and many valuable results have been obtained; for a recent survey on this topic and related questions one can refer to [1025].

It well known that most of the existing literature has focused on Lyapunov asymptotic stability for switched systems, the behavior of which is over an infinite time interval. On the other hand, many concerned problems are the practical ones which described system state which does not exceed some bound over a time interval. To deal with the above problem, in 1961, Dorato proposed the concept of finite-time stability in [26].

Over the years, many research efforts have been devoted to the study of finite-time stability (FTS) of systems. In the study of the transient behavior of systems, FTS concerns the stability of a system over a finite interval of time and plays an important role. It is worth pointing out that finite-time stability and Lyapunov asymptotic stability are different concepts, and they are independent of each other. Therefore, it is important to emphasize the distinction between classical Lyapunov stability and finite-time stability. The problem of finite-time stability has been accordingly studied in the literature [2640].

Recently, some papers related to finite-time stability for switched systems can be found. For example, based on the average dwell time technique, the problem of finite-time boundedness for a switched linear system with time-delay was investigated in [17], and [39] discussed the static-state feedback and dynamic output feedback finite-time stabilization. But to the best of our knowledge, the finite-time H control problems for switched discrete-time systems with average dwell time have not been studied, and this motivates us to consider this interesting and challenging problem.

The main contribution of this paper lies in that we present a novel approach to finite-time stability of a switched system. Moreover, several sufficient conditions ensuring finite-time stability and boundness are proposed with different information from what we know about the switching signal. It is shown that less conservative results can be derived when more information about the switching signal is available. By selecting the appropriate Lyapunov-Krasovskii functional, the sufficient conditions are derived to guarantee finite-time boundness of the systems. The finite-time boundness (FTB) criteria can be tackled in the form of LMIs. Finally, an example is used to illustrate the effectiveness of the developed techniques.

Notations: Throughout this paper, we let P > 0 ( P 0 , P < 0 , P 0 ) denote a symmetric positive definite matrix P (positive-semi definite, negative definite and negative-semi definite). For any symmetric matrix P, λ max ( P ) and λ min ( P ) denote the maximum and minimum eigenvalues of matrix P, respectively. R n denotes the n-dimensional Euclidean space and R n × m refers to the set of all n × m real matrices. The identity matrix of order n is denoted as I n . represents the elements below the main diagonal of a symmetric matrix. The superscripts and −1 stand for matrix transposition and matrix inverse, respectively.

2 Preliminaries

In this section, we give a mathematical description of the problem under the study, followed by a definition of the average dwell time for a discrete switched system.

Consider the following switched discrete-time system:
{ x ( k + 1 ) = A σ ( k ) x ( k ) + B σ ( k ) u ( k ) + C σ ( k ) ω ( k ) , z ( k ) = L σ ( k ) x ( k ) + D σ ( k ) u ( k ) ,
(1)
where x ( k ) R n is the discrete state vector of the system, u ( k ) R l is the control input, z ( k ) R m is the controlled output, ω ( k ) R q is the noise signal which satisfies
k = 0 N ω ( k ) ω ( k ) < d .
(2)

σ ( k ) : Z + N = { 1 , 2 , , N } is called a switching law or switching signal, which is a piecewise constant function of discrete-time k and takes its values in the finite set . N > 0 is the number of subsystems. For simplicity, at any arbitrary discrete-time k Z + , the switching signal σ ( k ) is denoted by σ. Matrices A σ ( k ) , B σ ( k ) , C σ ( k ) , D σ ( k ) and L σ ( k ) are constant real matrices with appropriate dimensions for all σ ( k ) = i N . We denote the matrices associated with A σ ( k ) = A i , B σ ( k ) = B i , C σ ( k ) = C i , D σ ( k ) = D i and L σ ( k ) = L i .

Definition 2.1 [17]

For any k k 0 and any switching signal σ ( l ) , k 0 l < k , let N σ ( k 0 , k ) denote the number of switchings of σ ( k ) . If
N σ ( k 0 , k ) N 0 + k k 0 T a
(3)

holds for N 0 0 and T a > 0 , then T a is called the average dwell time and N 0 is the chatter bound.

Remark 1 The concept of average dwell time has been modified to fit the discrete-time ones in some existing literature [2631]. The definition of average dwell time in Definition 2.1 is borrowed from these existing results. For simplicity, but without loss of generality, we choose N 0 = 0 in what follows.

Definition 2.2 [27]

The discrete-time linear system
x ( k + 1 ) = A x ( k ) , k N ,

is said to be finite-time stable (FTS) with respect to ( c 1 , c 2 , R , N ) , where R > 0 is a positive definite matrix, 0 < c 1 < c 2 and N N , if x ( 0 ) R x ( 0 ) c 1 x ( k ) R x ( k ) < c 2 , k { 1 , 2 , , N } .

Definition 2.3 [27]

The discrete-time linear system
x ( k + 1 ) = A x ( k ) + G ω ( k ) , k N ,

subject to an exogenous disturbance ω ( k ) satisfying (2), is said to be finite-time bounded (FTB) with respect to ( c 1 , c 2 , R , d , N ) , where R > 0 is a positive definite matrix, 0 < c 1 < c 2 and N N , if x ( 0 ) R x ( 0 ) c 1 x ( k ) R x ( k ) < c 2 , k { 1 , 2 , , N } .

Definition 2.4 [4]

For γ > 0 , 0 c 1 < c 2 , R is a positive definite matrix, system (4) is said to be H finite-time bounded with respect to ( c 1 , c 2 , d , γ , R , N ) , the following condition should be satisfied:
k = 0 N z ( k ) z ( k ) < γ 2 k = 0 N ω ( k ) ω ( k ) .
(4)

Under zero initial condition, it holds for all nonzero ω: k = 0 N ω ( k ) ω ( k ) < d .

In this paper, applying state feedback control u ( k ) = K σ ( k ) x ( k ) to (1), we get
{ x ( k + 1 ) = ( A σ ( k ) + B σ ( k ) K σ ( k ) ) x ( k ) + C σ ( k ) ω ( k ) , z ( k ) = ( L σ ( k ) + D σ ( k ) K σ ( k ) ) x ( k ) .
(5)

3 Finite-time stability analysis

Theorem 3.1 Consider switched system (5) for given positive scalars c 1 and c 2 with c 1 < c 2 , μ > 0 , τ a > 0 , α > 0 . Let P i = R 1 2 P ¯ i R 1 2 for all admissible ω ( k ) subject to condition (2), if there exist symmetric positive definite matrices P i , Q i , 1 i N , and λ 1 = λ min ( P ¯ i ) , λ 2 = λ max ( P ¯ i ) , λ 3 = λ max ( Q i ) , such that the linear matrix inequalities
[ ( 1 + α ) P i 0 A i P j Q i C i P j P j ] < 0 ,
(6)
P i μ P j , i N ,
(7)
[ P i 1 λ 1 P i 1 R λ 1 R ] < 0 , [ λ 2 R I P i 1 ] < 0 , i N ,
(8)
λ 1 c 2 ( 1 + α ) N ( λ 2 c 1 + λ 3 d ) > 1
(9)
hold, and the average dwell time of the switched discrete-time signal σ ( k ) satisfies
τ a > τ a = N ln μ ln ( λ 1 c 2 ) N ln ( 1 + α ) ln ( λ 2 c 1 + λ 3 d ) .
(10)

Then switched discrete-time system (5) with z ( k ) = 0 is finite-time bounded with respect to ( c 1 , c 2 , d , R , N ) .

Proof We consider the following Lyapunov-Krasovskii functional:
V ( x k , σ ( k ) ) = x ( k ) P σ ( k ) x ( k ) .
(11)
Taking the difference between the Lyapunov function candidates for two consecutive time instants yields
Δ V ( x k , σ ( k ) ) = V ( x k + 1 , σ ( k + 1 ) ) V ( x k , σ ( k ) ) = x ( k ) [ ( A i + B i K i ) P j A i P i ] x ( k ) + 2 x ( k ) A i P j C i ω ( k ) + ω ( k ) C i P j C i ω ( k ) = [ x ( k ) ω ( k ) ] [ A i P j A i P i A i P j C i C i P j C i ] [ x ( k ) ω ( k ) ] .
(12)
From condition (6), we can obtain
Δ V ( x k , σ ( k ) ) < α V ( x k , σ ( k ) ) + ω ( k ) Q i ω ( k ) .
(13)
Equations (9) and (11) yield
V ( x k , σ ( k ) ) < ( 1 + α ) V ( x k 1 , σ ( k 1 ) ) + sup i N { λ max ( Q i ) } ω ( k 1 ) ω ( k 1 ) < ( 1 + α ) 2 V ( x k 2 , σ ( k 2 ) ) + sup i N { λ max ( Q i ) } ( 1 + α ) ω ( k 2 ) ω ( k 2 ) + sup i N { λ max ( Q i ) } ω ( k 1 ) ω ( k 1 ) < < ( 1 + α ) k k l V ( x k l , σ ( k l ) ) + sup i N { λ max ( Q i ) } s = k l k 1 ( 1 + α ) k 1 s ω ( s ) ω ( s ) .
(14)
Noticing (7), we know that
V ( x k , σ ( k ) ) < μ V ( x k , σ ( k ) ) .
(15)
Thus
V ( x k , σ ( k ) ) < ( 1 + α ) k k l V ( x k l , σ ( k l ) ) + sup i N { λ max ( Q i ) } s = k l k 1 ( 1 + α ) k 1 s ω ( s ) ω ( s ) < μ ( 1 + α ) k k l 1 V ( x k l 1 , σ ( k l 1 ) ) + sup i N { λ max ( Q i ) } s = k l k 1 ( 1 + α ) k 1 s ω ( s ) ω ( s ) + μ sup i N { λ max ( Q i ) } s = k l 1 k l ( 1 + α ) k 1 s ω ( s ) ω ( s ) < < μ N σ ( 0 , k ) ( 1 + α ) k V ( x 0 , σ ( 0 ) ) + μ N σ ( 0 , k ) sup i N { λ max ( Q i ) } s = 0 k 1 ( 1 + α ) k 1 s ω ( s ) ω ( s ) + μ N σ ( k 1 , k ) sup i N { λ max ( Q i ) } s = k 1 k 2 ( 1 + α ) k 1 s ω ( s ) ω ( s ) + + sup i N { λ max ( Q i ) } s = k l k 1 ( 1 + α ) k 1 s ω ( s ) ω ( s ) < μ N σ ( 0 , k ) ( 1 + α ) k V ( x 0 , σ ( 0 ) ) + μ N σ ( 0 , k ) sup i N { λ max ( Q i ) } × s = 0 k 1 ( 1 + α ) k 1 s ω ( s ) ω ( s ) < μ N σ ( 0 , k ) ( 1 + α ) k { V ( x 0 , σ ( 0 ) ) + sup i N { λ max ( Q i ) } d } .
(16)
Define P i = R 1 2 P ¯ i R 1 2 , i N , then k { 1 , 2 , , N } , we have
V ( x k , σ ( k ) ) = x ( k ) R 1 2 P ¯ i R 1 2 x ( k ) inf i N { λ min ( P ¯ i ) } x ( k ) R x ( k ) .
(17)
Using the fact α 0 and x ( 0 ) R x ( 0 ) c 1 , for i N , we have
V ( x 0 , σ ( 0 ) ) sup i N { λ max ( P ¯ i ) } x ( 0 ) R x ( 0 ) sup i N { λ max ( P ¯ i ) } c 1 .
(18)
Then we can obtain
x ( k ) R x ( k ) < μ N σ ( 0 , k ) ( 1 + α ) N { sup i N { λ max ( P ¯ i ) } c 1 + sup i N { λ max ( Q i ) } d } inf i N { λ min ( P ¯ i ) } < μ N τ a ( 1 + α ) N { sup i N { λ max ( P ¯ i ) } c 1 + sup i N { λ max ( Q i ) } d } inf i N { λ min ( P ¯ i ) } .
(19)
From (8), we have
λ 1 R < P i < λ 2 R λ 1 I < P ¯ i < λ 2 I .
(20)
Define sup i N { λ max ( Q i ) } = λ 3 , since sup i N { λ max ( P ¯ i ) } λ 2 , inf i N { λ min ( P ¯ i ) } λ 1 and by condition (19), we can obtain
x ( k ) R x ( k ) < μ N τ a ( 1 + α ) N ( λ 2 c 1 + λ 3 d ) λ 1 .
(21)
When μ = 1 , which is the trivial case, from (21), x ( k ) R x ( k ) < c 2 . When μ > 1 , from (9), ln ( λ 1 c 2 ) N ln ( 1 + α ) ln ( λ 2 c 1 + λ 3 d ) > 0 . By virtue of (10), we have
N τ a < ln ( λ 1 c 2 ) N ln ( 1 + α ) ln ( λ 2 c 1 + λ 3 d ) ln μ .
(22)
Substituting (22) into (21) yields
x ( k ) R x ( k ) < μ ln ( λ 1 c 2 ) N ln ( 1 + α ) ln ( λ 2 c 1 + λ 3 d ) ln μ ( 1 + α ) N ( λ 2 c 1 + λ 3 d ) λ 1 = c 2 .
(23)

Thus we can conclude that switched discrete-time system (5) with u ( k ) = 0 is finite-time bounded with respect to ( c 1 , c 2 , d , R , N ) . The proof is completed. □

4 Finite-time H performance analysis

Theorem 4.1 Consider switched discrete-time system (5). If there exist symmetric positive definite matrices P i , 1 i N , and positive scalars κ > 0 , α > 0 , 0 c 1 < c 2 , d > 0 , α > 0 , such that i N , the linear matrix inequalities
[ ( 1 + α ) P i 0 ( A i + B i K i ) P j ( L i + D i K i ) γ 2 I ( 1 + μ ) N C i P j 0 P j 0 I ] < 0 ,
(24)
P i μ P j , i N ,
(25)
[ P i 1 P i 1 R R ] < 0 , [ κ R I P i 1 ] < 0 , i N ,
(26)
[ c 2 c 1 ( 1 + α ) N κ ] < 0 ,
(27)
hold, and the average dwell time of the switched discrete-time signal σ ( k ) satisfies
τ a > τ a = N ln μ ln c 2 ln ( γ 2 d ) .
(28)

Then switched system (5) is finite-time bounded with H performance level γ for any switching discrete-time signal with respect to ( c 1 , c 2 , N , d , R , σ ) .

Proof We will show the H performance of system (5), from Theorem 3.1, we have
Δ V ( x k , σ ( k ) ) = [ x ( k ) ω ( k ) ] [ ( A i + B i K i ) P j ( A i + B i K i ) P i ( A i + B i K i ) P j C i C i P j C i ] [ x ( k ) ω ( k ) ] .
(29)
Define
J ( k ) = z ( k ) z ( k ) γ 2 ( 1 + μ ) N ω ( k ) ω ( k ) .
(30)
From (12) it follows
Δ V ( x k , σ ( k ) ) + J ( k ) = [ x ( k ) ω ( k ) ] [ Ξ 1 , 1 ( A i + B i K i ) P j C i C i P j C i ] [ x ( k ) ω ( k ) ] ,
(31)
where
Ξ 1 , 1 = ( A i + B i K i ) P j ( A i + B i K i ) ( L i + D i K i ) ( L i + D i K i ) P i .
From (24) and the Schur complement, we have
Δ V ( x k , σ ( k ) ) + J ( k ) < μ V ( x k , σ ( k ) ) .
(32)
It follows from (32) that
Δ V ( x k , σ ( k ) ) < α V ( x k , σ ( k ) ) J ( k ) ,
(33)
which means
V ( x k , σ ( k ) ) < ( 1 + α ) V ( x k 1 , σ ( k 1 ) ) + J ( k 1 ) < ( 1 + α ) 2 V ( x k 2 , σ ( k 2 ) ) + J ( k 1 ) + ( 1 + α ) J ( k 2 ) < < ( 1 + α ) k V ( x 0 , σ ( 0 ) ) s = 0 k 1 ( 1 + α ) k s 1 J ( s ) .
(34)
Under the zero-initial condition, we have V ( x 0 , σ ( 0 ) ) = 0 , and due to the fact V ( x k , σ ( k ) ) 0 , it yields
s = 0 k 1 ( 1 + α ) k s 1 J ( s ) 0 ,
(35)
which means
( 1 + α ) N γ 2 ( 1 + α ) N s = 0 k 1 ω ( s ) ω ( s ) s = 0 k 1 z ( s ) z ( s ) γ 2 s = 0 N ω ( s ) ω ( s ) s = 0 N z ( s ) z ( s ) .
(36)

According to Definition 2.4, we know that Theorem 4.1 holds. This completes the proof. □

5 Finite-time H control design

Theorem 5.1 Consider finite-time switched discrete-time system (1) and a given scalar γ > 0 . Then there exists a switched H control in the form of u ( k ) = K σ ( k ) x ( k ) such that switched discrete-time system (5) is finite-time bounded with H performance level γ, if there exist symmetric positive-definite matrixes P i , X i , Y i and Z i such that i N ,
[ ( 1 + α ) Y i 0 Y i A i + X i B i Y i L i + X i D i γ 2 I ( 1 + α ) N C i 0 Z j 0 I ] < 0 ,
(37)
P i μ P j , i N ,
(38)
[ Y i Y i R R ] < 0 , [ κ R I Y i ] < 0 , i N ,
(39)
c 2 ( 1 + α ) N κ c 1 + γ 2 d > 1 ,
(40)
hold, and the average dwell time of the switched discrete-time signal σ ( k ) satisfies
τ a > τ a = max { N ln μ ln c 2 ln ( γ 2 d ) , ln μ α } .
(41)
Then the set of state feedback controllers is given by
X i = K i P i 1 , i , j N .
(42)
Proof Pre- and post-multiplying (24) with diag { P i 1 , I , P j 1 , I } and diag { P i 1 , I , P j 1 , I } , respectively, then (24) is transformed into
[ ( 1 + α ) P i 1 0 P i 1 A i + P i 1 K i B i P i 1 L i + P i 1 K i D i γ 2 I ( 1 + α ) N C i 0 P j 1 0 I ] < 0 .
(43)
Denote
Y i = P i 1 , Z j = P j 1 , X i = K i P i 1 , i , j N .

Therefore, we can obtain (37). The proof is completed. □

Remark 2 In our paper, finite-time stability and Lyapunov asymptotic stability are independent concepts: a system which is finite-time stable maybe not Lyapunov asymptotically stable. On the contrary, a Lyapunov asymptotically stable system could be not finite-time stable, and during the transients, its state exceeds the prescribed bounds.

Remark 3 In many actual applications, the minimum value of γ min 2 is of interest. In Theorem 4.1, as for finite-time stability and boundness, once the state bound c 2 is not ascertained, the minimum value c 2 min is of interest. With fixed α and μ, defining λ 1 = 1 , λ 2 = κ , we then can formulate the following optimization problem to get the minimum value c 2 min :
min c 2 s.t. (26), (27) and (28).
Therefore, the optimal value of ρ ( θ ) can be derived through the convex combination of γ min 2 and c 2 min , i.e., denote 0 ϑ 1 , ρ ( ϑ ) = ϑ γ min 2 + ( 1 ϑ ) c 2 min , which can be obtained through
min ρ ( ϑ ) s.t. (26), (27) and (28).

The optimized controller gains X i = K i P i 1 , i , j N can be derived by optimization procedure min κ 1 κ subject to (39) and (40) with fixed γ and minimum c 2 .

Remark 4 In this paper, if we can find a feasible solution with the parameter μ = 0 , through the discussion above, we know that the designed controller can ensure both finite-time and asymptotical stability of the delayed switched system. While in most situations we obtain controller with μ > 0 , and only finite-time stability can be established. Therefore, in real applications, asymptotical stabilizing controller for each subsystem should be designed to ensure asymptotical stability, which can be easily obtained by existing results for a non-switched system.

6 Illustrative example

Example 1 Consider a finite-time stabilization of the switched system as follows:
A 1 = [ 1.499 1.019 0.601 0.138 1.385 1.172 1.587 0.955 0.577 ] , A 2 = [ 0.836 0.302 0.949 0.853 0.416 0.542 0.477 0.043 0.821 ] , B 1 = [ 1.072 0.981 0.252 1.074 1.759 0.610 0.870 0.148 0.761 ] , B 2 = [ 0.254 0.677 0.240 0.153 0.849 0.921 0.557 0.469 0.907 ] , C 1 = [ 0.144 0.844 0.442 1.396 1.943 0.804 0.190 0.247 0.288 ] , C 2 = [ 0.467 1.205 1.991 0.005 1.404 0.028 0.326 0.206 1.931 ] , D 1 = [ 0.941 0.528 1.615 0.007 1.057 0.816 0.338 0.015 1.998 ] , D 2 = [ 0.748 0.847 0.492 0.199 1.337 0.969 0.373 1.616 0.474 ] , L 1 = [ 0.666 0.821 1.855 0.478 0.101 1.800 1.041 1.084 0.878 ] , L 2 = [ 0.6477 0.517 0.606 1.050 0.024 0.272 1.323 0.162 0.359 ] .

In this paper, disturbance k = 0 ω ( k ) ω ( k ) < 1 . The control objective is to find a feedback controller ensuring system (5) is finite-time bounded with respect to ( c 1 , c 2 , d , R , N ) and minimum value of γ min 2 + c 2 min . Choose c 1 = 2 , d = 8 and α = 3.35 . According to Theorem 5.1, the optimal value of γ min 2 + c 2 min depends on parameter μ. Through LMI then we see that the feasible solution is γ = 1.72 , c 2 = 61.512 and μ = 3.75 .

The state feedback controllers are given as
K 1 = [ 23.366 119.322 109.468 454.469 333.654 406.088 478.929 296.609 78.267 ] , K 2 = [ 48.041 155.125 690.152 467.431 18.232 38.023 900.225 92.460 291.209 ] .
According to (28), for any switching signal σ ( k ) with average dwell time τ a > τ a = 2.768 , system (5) is finite-time stochastically bounded with respect to the above parameters. Figure 1 shows the switching signal σ ( k ) with average dwell time τ a = 2.8 .
Figure 1

Switching signal σ ( k ) .

Choose the initial condition [ 0.4 , 0.3 ] , then switched discrete-time system (5) is finite-time bounded. The state responses of a filtering error system is shown in Figure 1. It can be seen that the designed filter meets the specified requirement. The state trajectory of system (5) is shown in Figure 2, where the initial state x ( 0 ) = [ 0.4 0.2 ] . From Figure 2, it is easy to see that system (5) is finite-time bounded.
Figure 2

State trajectory of system ( 5 ).

7 Conclusions

In this paper, we have examined the problems of finite-time H control of a switched discrete-time system with average dwell time. Based on the analysis result, the static state feedback control of finite-time boundness is given. Although the derived result is not in an LMIs form, we can turn it into the LMIs feasibility problem by fixing some parameters. A numerical example has also been given to demonstrate the effectiveness of the proposed approach. It should be noted that one of future research topics would be to investigate the problems of synchronous or asynchronous estimation for the switched neural network under the dwell time over a finite-time horizon.

Declarations

Acknowledgements

The authors would like to thank the associate editor and the anonymous reviewers for their detailed comments and suggestions. This work was supported by the China Postdoctoral Science Foundation (2012M521683) and the Fundamental Research Funds for the Central Universities (103.1.2E022050205).

Authors’ Affiliations

(1)
School of Aeronautics and Astronautics, University of Electronic Science and Technology of China, Chengdu, Sichuan, P.R. China
(2)
School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan, P.R. China
(3)
School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, Sichuan, P.R. China

References

  1. Nagpal K, Ravi R: H control and estimation problems with delayed measurements: state-space solutions. SIAM J. Control Optim. 1997, 35(4):1217-1243. 10.1137/S0363012994277499MathSciNetView ArticleGoogle Scholar
  2. Wu Z, Su H, Chu J: Delay-dependent H -infinity filtering for singular Markovian jump time-delay systems. Signal Process. 2010, 90(6):1815-1824. 10.1016/j.sigpro.2009.11.029View ArticleGoogle Scholar
  3. Zhao H, Chen Q, Xu S: H guaranteed cost control for uncertain Markovian jump systems with mode-dependent distributed delays and input delays. J. Franklin Inst. 2009, 346(10):945-957. 10.1016/j.jfranklin.2009.05.007MathSciNetView ArticleGoogle Scholar
  4. Zhao H, Xu S, Lu J, Zhou J: Passivity based control for uncertain stochastic jumping systems with mode-dependent round-trip time delays. J. Franklin Inst. 2012, 349(5):1665-1680. 10.1016/j.jfranklin.2011.11.011MathSciNetView ArticleGoogle Scholar
  5. Lin J, Fei S, Gao Z: Stabilization of discrete-time switched singular time-delay systems under asynchronous switching. J. Franklin Inst. 2012, 349(5):1808-1827. 10.1016/j.jfranklin.2012.02.009MathSciNetView ArticleGoogle Scholar
  6. Wu Z, Shi P, Su H, Chu J: Stochastic synchronization of Markovian jump neural networks with time-varying delay using sampled-data. IEEE Trans. Cybern. 2012. 10.1109/TSMCB.2012.2230441Google Scholar
  7. Kushner H Math. Sci. Eng. 33. In Stochastic Stability and Control. Academic Press, New York; 1967.Google Scholar
  8. Kozin J: A survey of stability of stochastic systems. Automatica 1969, 5: 95-112. 10.1016/0005-1098(69)90060-0MathSciNetView ArticleGoogle Scholar
  9. Rami M, Zhou X: Linear matrix inequalities, Riccati equations, and indefinite stochastic linear quadratic controls. IEEE Trans. Autom. Control 2000, 45(6):1131-1143. 10.1109/9.863597MathSciNetView ArticleGoogle Scholar
  10. Wu Z, Shi P, Su H, Chu J: Delay-dependent stability analysis for switched neural networks with time-varying delay. IEEE Trans. Syst. Man Cybern., Part B, Cybern. 2011, 41(6):1522-1530.MathSciNetView ArticleGoogle Scholar
  11. Koenig D, Marx B: H -filtering and state feedback control for discrete-time switched descriptor systems. IET Control Theory Appl. 2009, 3(6):661-670. 10.1049/iet-cta.2008.0132MathSciNetView ArticleGoogle Scholar
  12. Ma S, Zhang C, Wu Z:Delay-dependent stability and H control for uncertain discrete switched singular systems with time-delay. Appl. Math. Comput. 2008, 206(1):413-424. 10.1016/j.amc.2008.09.020MathSciNetView ArticleGoogle Scholar
  13. Phat V, Botmart T, Niamsup P: Switching design for exponential stability of a class of nonlinear hybrid time-delay systems. Nonlinear Anal. Hybrid Syst. 2009, 3: 1-10. 10.1016/j.nahs.2008.10.001MathSciNetView ArticleGoogle Scholar
  14. Vu L, Morgansen K: Stability of time-delay feedback switched linear systems. IEEE Trans. Autom. Control 2010, 55(10):2385-2390.MathSciNetView ArticleGoogle Scholar
  15. Zhao X, Zhang L, Shi P, Liu M: Stability of switched positive linear systems with average dwell time switching. Automatica 2012, 48(6):1132-1137. 10.1016/j.automatica.2012.03.008MathSciNetView ArticleGoogle Scholar
  16. Xiang W, Xiao J: H finite-time control for switched nonlinear discrete-time systems with norm-bounded disturbance. J. Franklin Inst. 2011, 348: 331-352. 10.1016/j.jfranklin.2010.12.001MathSciNetView ArticleGoogle Scholar
  17. Zhang L, Shi P:Stability, L 2 -gain and asynchronous H control of discrete-time switched systems with average dwell-time. IEEE Trans. Autom. Control 2009, 54: 2193-2200.View ArticleGoogle Scholar
  18. Niu B, Zhao J:Stabilization and L 2 -gain analysis for a class of cascade switched nonlinear systems: an average dwell-time method. Nonlinear Anal. Hybrid Syst. 2011, 5(4):671-680. 10.1016/j.nahs.2011.05.005MathSciNetView ArticleGoogle Scholar
  19. Zhao X, Zhang L, Shi P, Liu M: Stability and stabilization of switched linear systems with mode-dependent average dwell time. IEEE Trans. Autom. Control 2012, 57(7):1809-1815.MathSciNetView ArticleGoogle Scholar
  20. Zhao X, Shi P, Zhang L: Asynchronously switched control of a class of slowly switched linear systems. Syst. Control Lett. 2012, 61(12):1151-1156. 10.1016/j.sysconle.2012.08.010MathSciNetView ArticleGoogle Scholar
  21. Wang D, Shi P, Wang W, Wang J: Delay-dependent exponential H-infinity filtering for discrete-time switched delay systems. Int. J. Robust Nonlinear Control 2012, 22(13):1522-1536. 10.1002/rnc.1764View ArticleGoogle Scholar
  22. Mahmoud M, Shi P:Asynchronous H filtering of discrete-time switched systems. Signal Process. 2012, 92(10):2356-2364. 10.1016/j.sigpro.2012.02.007View ArticleGoogle Scholar
  23. Zhang G, Han C, Guan Y, Wu L: Exponential stability analysis and stabilization of discrete-time nonlinear switched systems with time delays. Int. J. Innov. Comput. Inf. Control 2012, 8(3):1973-1986.Google Scholar
  24. Attia S, Salhi S, Ksouri M: Static switched output feedback stabilization for linear discrete-time switched systems. Int. J. Innov. Comput. Inf. Control 2012, 8(5):3203-3213.Google Scholar
  25. Hou L, Zong G, Wu Y: Finite-time control for switched delay systems via dynamic output feedback. Int. J. Innov. Comput. Inf. Control 2012, 8(7):4901-4913.Google Scholar
  26. Dorato P: Short time stability in linear time-varying systems. Proc. IRE Int. Convention Record 1961, 4: 83-87.Google Scholar
  27. Cheng J, Zhu H, Zhong S, Zhang Y, Zeng Y:Finite-time stabilization of H filtering for switched stochastic systems. Circuits Syst. Signal Process. 2012. 10.1007/s00034-012-9530-yGoogle Scholar
  28. Zhu L, Shen Y, Li C: Finite-time control of discrete-time systems with time-varying exogenous disturbance. Commun. Nonlinear Sci. Numer. Simul. 2009, 14: 361-370. 10.1016/j.cnsns.2007.09.013MathSciNetView ArticleGoogle Scholar
  29. Huang X, Lin W, Yang B: Global finite-time stabilization of a class of uncertain nonlinear systems. Automatica 2005, 41(5):881-888. 10.1016/j.automatica.2004.11.036MathSciNetView ArticleGoogle Scholar
  30. Qian C, Li J: Global finite-time stabilization by output feedback for planar systems without observable linearization. IEEE Trans. Autom. Control 2005, 50(6):549-564.MathSciNetGoogle Scholar
  31. Hong Y: Finite-time stabilization and stability of a class of controllable systems. Syst. Control Lett. 2002, 48(4):231-236.View ArticleGoogle Scholar
  32. Amato F, Ariola M: Finite-time control of discrete-time linear systems. IEEE Trans. Autom. Control 2005, 50(5):724-729.MathSciNetView ArticleGoogle Scholar
  33. Zhai G, Hu B, Yasuda K, Michel A: Qualitative analysis of discrete-time switched systems. Proceedings of the American Control Conference 2002, 1880-1885.Google Scholar
  34. Song Y, Fan J, Fei M, Yang T:Robust H control of discrete switched system with time delay. Appl. Math. Comput. 2008, 205(1):159-169. 10.1016/j.amc.2008.05.046MathSciNetView ArticleGoogle Scholar
  35. Zhang L, Boukas E, Shi P: Exponential H filtering for uncertain discrete-time switched linear systems with average dwell time: a μ -dependent approach. Int. J. Robust Nonlinear Control 2008, 18(11):1188-1207. 10.1002/rnc.1276MathSciNetView ArticleGoogle Scholar
  36. Yang Y, Li J, Chen G: Finite-time stability and stabilization of Markovian switching stochastic systems with impulsive effects. J. Syst. Eng. Electron. 2010, 21(2):2254-2260.Google Scholar
  37. Luan X, Liu F, Shi P: Finite-time filtering for non-linear stochastic systems with partially known transition jump rates. IET Control Theory Appl. 2010, 4(5):735-745. 10.1049/iet-cta.2009.0014MathSciNetView ArticleGoogle Scholar
  38. Amato F, Ariola M, Cosentino C: Finite-time control of discrete-time linear systems: analysis and design conditions. Automatica 2010, 46: 919-924. 10.1016/j.automatica.2010.02.008MathSciNetView ArticleGoogle Scholar
  39. Xiang W, Xiao J, Xiao C: On finite-time stability and stabilization for switched discrete linear systems. Control Intell. Syst. 2011, 39(2):122-128.MathSciNetGoogle Scholar
  40. Lin X, Du H, Li S:Finite-time boundedness and L 2 -gain analysis for switched delay systems with norm-bounded disturbance. Appl. Math. Comput. 2011, 217(12):982-993.MathSciNetGoogle Scholar

Copyright

© Zhong et al.; licensee Springer 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.