Skip to content
BY 4.0 license Open Access Published by De Gruyter Open Access July 24, 2019

Nonfragile observer-based guaranteed cost finite-time control of discrete-time positive impulsive switched systems

  • Leipo Liu EMAIL logo , Hao Xing , Xiangyang Cao , Xiushan Cai and Zhumu Fu
From the journal Open Mathematics

Abstract

This paper considers the nonfragile observer-based guaranteed cost finite-time control of discrete-time positive impulsive switched systems(DPISS). Firstly, the positive observer and nonfragile positive observer are designed to estimate the actual state of the underlying systems, respectively. Secondly, by using the average dwell time(ADT) approach and multiple linear co-positive Lyapunov function (MLCLF), two guaranteed cost finite-time controller are designed and sufficient conditions are obtained to guarantee the corresponding closed-loop systems are guaranteed cost finite-time stability(GCFTS). Such conditions can be solved by linear programming. Finally, a numerical example is provided to show the effectiveness of the proposed method.

MSC 2010: 15-xx; 65-xx; 93-xx

1 Introduction

The switched system is a type of hybrid systems. It comprises a set of a differential or difference equations and a switched controller, which designate the switching between subsystems at a specific interval of time. It has been studied very well, see [1, 2, 3, 4]. As a special kind of switched systems, the positive switched systems whose output and state are non-negative have been paid much attention and adopted to many practical applications, such as communication networks [5], viral mutation [6], formation flying [7], and so on. There have been many available results about discrete-time positive switched systems [8, 9, 10]. Because of sudden changes in the state of the system at certain instants of switching, many practical switched systems exhibit impulsive dynamical behavior, these systems are usually called impulsive switched systems [11]. For discrete-time positive impulsive switched system, a few results have been obtained, see [12, 13]. In [12], the exponential stability for a class of discrete-time positive impulsive switched linear systems was studied. In [13], the finite-time stability for a class of discrete-time positive impulsive switched time-delay systems under asynchronous switching was discussed. However, [12] and [13] are based on the assumption of the known state.

Moreover, it is necessary to design a state observer, because the states of the systems are not all measurable in practice [14]. Recently, the exponential stability property of the proposed switching observer was discussed, and an LMI-based algorithm was given for discrete-time impulsive switched nonlinear systems with time-varying delays in [15]. The problem of state observation for continuous-time and discrete-time impulsive switched systems was investigated in [16]. Furthermore, when the state observer gain variations could not be avoided, a kind of nonfragile state observers for discrete-time switched nonlinear systems was proposed in [17]. However, [15, 16, 17] were involved in non-positive systems and the design of finite time controller was not considered.

On the other hand, in most practical applications, the researchers are more interested in designing the control system, which is not only finite-time stable but also guarantees an adequate level of performance. One method to this problem is so-called guaranteed cost finite time control. Some remarkable results have been presented, see [18, 19, 20, 21, 22, 23]. These results mainly focus on non-positive systems. Very recently, In [24], guaranteed cost finite-time control was extended to fractional-order positive switched systems and a cost function for fractional-order positive systems (or fractional-order positive switched systems) was proposed. In [25], the problem of guaranteed cost finite-time control for positive switched linear systems with time-varying delays was considered and a cost function of positive systems (or positive switched systems) was also presented. It is worth noting that [24] and [25] are involved in continuous-time positive switched systems with known states. To the best of our knowledge, the problem of observer-based guaranteed cost finite-time control of discrete-time impulsive switched systems has not been fully investigated, especially for DPISS, which motivates us for this study.

In this paper, the problem of nonfragile observer-based guaranteed cost finite-time control of DPISS is considered. The co-positive type Lyapunov function with average dwell time (ADT) technique is constructed. The main contributions lie in two aspects: 1) For DPISS, the design methods of positive observer and nonfragile positive observer are firstly proposed, respectively. 2) Two types of guaranteed cost finite-time controller are designed to guarantee the corresponding closed-loop systems are GCFTS, the obtained conditions can be easily solved by linear programming. The rest of the paper is organised as follows: Section 2 gives some necessary preliminaries and problem statements. In Section 3, the main results are given. In Section 4, a numerical example is provided. Section 5 concludes the paper.

Notations. The representation A ≻ 0 (⪰ 0, ≺ 0, ⪯ 0) means that aij > 0 (≥ 0, < 0, ≤ 0), which is also applying to a vector. AB (AB) means that AB ≻ 0 (AB ⪰ 0). R+n is the n-dimensional non-negative (positive) vector space. Rn×n denotes the space of n × n matrices with real entries. AT denotes the transpose of matrix A. N and N+ are the sets of non-negative and positive integers. Z+ denotes the set of positive integers. Matrices are assumed to have compatible dimensions for calculating if their dimensions are not explicitly stated.

2 Preliminaries and problem statements

Consider the following DPISS:

x(k+1)=Aσ(k)x(k)+Bσ(k)u(k),kkm1,mZ+x(k+1)=Eσ(k)x(k),k=km1,mZ+y(k)=Cσ(k)x(k)x(k0)=x0 (1)

where kN, x(k) ∈ Rn is the system state, u(k) ∈ Rm represents the control input. σ(k) represents switching signal of system and takes values in a finite set I = 1, 2, …, S, SN+. In general, Ai, Bi, Ci, Ei are the ith subsystem if σ(k) = iI. k0 = 0 is the initial time. km(mZ+) denotes the bth impulsive switching instant. Moreover, σ(k) = iI means that the ith subsystem is active. σ(k – 1) = j and σ(k) = i(ij) indicate that k is a switching instant at which the system is switched from the jth subsystem to the ith subsystem. At switching instants, there exist impulsive jumps described by (1). Ap, Bp, Cp, Ep are constant matrices with suitable dimensions.

Next, we will give some definitions and lemmas for the system (1).

Definition 1

[5]. System (1) with u(k) ⪰ 0 is positive if x(k0) ⪰ 0 and any switching signals σ(k), the corresponding trajectories x(k) ⪰ 0, y(k) ⪰ 0 hold for all kk0.

Lemma 1

System (1) is positive if and only if Ai ⪰ 0, Bi ⪰ 0, Ci ⪰ 0, Ei ⪰ 0, where iI.

2.1 Positive observer design

We construct the following DPISS (1):

x^(k+1)=(Aσ(k)Lσ(k)Cσ(k))x^(k)+Bσ(k)u(k)+Lσ(k)Cσ(k)x(k),kkm1,mZ+x^(k+1)=Hσ(k)x^(k),k=km1,mZ+u(k)=Kσ(k)x^(k)x(k0)=x0 (2)

where (k) ∈ Rn is the estimated state vector of x(k), ŷ(k) ∈ Rp is the observer output vector. LiRn×p is the observer gain, HiRn×n, ∀iI is the matrix to be determined.

Remark 1

For DPISS (1), it not only requires that the state of the designed observer converges to that of the considered system, but also guarantees the positivity of the estimated state (k) of system (2) with u(k) ⪰ 0. To this end, it is naturally required, according to Lemma 1, AiLiCi ⪰ 0, Bi ⪰ 0, LiCi ⪰ 0, Hi ⪰ 0, Ki ⪰ 0, where iI.

Let e(k) = x(k) – (k) be the estimated error, then we can obtain the following error system:

When kkm – 1, we have

e(k+1)x^(k+1)=AiLiCi0LiCiAi+BiKie(k)x^(k) (3)

When k = km – 1, we get

e(k+1)x^(k+1)=EiEiHi0Hie(k)x^(k) (4)

For the sake of convenience, we define (k + 1) = [eT(k + 1) T(k + 1)]T. Thus, equation (3) and (4) can be rewritten as

x~(k+1)=Ai~x~(k),kkm1,mZ+x~(k+1)=Bi~x~(k),k=km1,mZ+x~(k0)=x~0 (5)

where

Ai~=AiLiCi0LiCiAi+BiKi,Bi~=EiEiHi0Hi

Remark 2

According to Lemma 1, if error dynamic system (5) is positive, then it should guarantee that Ãi ≥ 0, i ≥ 0, ∀ iI(It means AiLiCi ⪰ 0, LiCi ⪰ 0, Ai + BiKi ⪰ 0, Ei ⪰ 0, EiHi ⪰ 0, Hi ⪰ 0).

Definition 2

For any switching signal σ(k) and any k2k1 ≥ 0, let Nσ(k1, k2) denote the switching numbers over the interval [k1, k2). For given τα > 0 and N0 > 0, if the inequality

Nσ(k1,k2)N0+k2k1τα (6)

holds, then τα is called an average dwell time, and N0 is called a chattering bound. Generally, we choose N0 = 0.

Definition 3

(Finite-Time Stability(FTS)). For a given time Tf and two vectors αβ ≻ 0, discrete-time positive impulsive switched systems (5) with is said to be FTS with respect to (α, β, Tf, σ(k)), if

x~T(0)β1x~T(k)α<1,k[0,Tf] (7)

Remark 3

In (5), the state T(k) includes the e(k) and (k). From Definition 3, our goal is that the weighted system T(k)α does not exceed threshold 1 in a given time interval Tf, then the estimation error e(k) might not converge to zero in a given time interval Tf. If a smaller threshold is chosen, then the estimation error will become very small.

Now we give some new definitions for our further study.

Definition 4

[24]. Define the cost function of DPISS (5) as follows:

J=s=0Tf1(xT(s)R1+uT(s)R2) (8)

where R1 ≻ 0 and R2 ≻ 0 are two given vectors.

Definition 5

[24]. (GCFTS) For a given time constant Tf and two vectors αβ ≻ 0, consider DPISS (5) and cost function (8), if there exist a control law u(k) and a positive scalar J* such that the closed-loop system is FTS with respect to (α, β, Tf, σ(k)) and the cost function satisfies JJ*, then the closed-loop system is called GCFTS, where J* is a guaranteed cost value and u(k) is a guaranteed cost finite-time controller.

Remark 4

[14] noted that one could not stabilize any unstable positive system by using extended Luenberger type positive observers. But finite time stability means that the system state does not exceed the specified boundary within a given time interval and it is different from the asymptotic stability. So the problem of positive observer-based guaranteed cost finite-time control of DPISS is feasible.

2.2 Nonfragile positive observer design

If the state observer gain variations could not be avoided, a kind of nonfragile state observer will be designed as follows

x^(k+1)=(Aσ(k)(Lσ(k)+Lσ(k)))x^(k)+Bσ(k)u(k)+(Lσ(k)+Lσ(k))Cσ(k)x(k)kkm1,mZ+x^(k+1)=Hσ(k)x^(k),k=km1,mZ+u(k)=Kσ(k)x^(k)x(k0)=x0 (9)

where △LiRn×p are uncertain real-valued matrices which satisfy Li[L1,L2].L1Rn×p,L2Rn×p.

We can obtain the following error system

x~(k+1)=Ai~x~(k),kkm1,mZ+x~(k+1)=Bi~x~(k),k=km1,mZ+x~(k0)=x~0 (10)

where

Ai~=Ai(Li+Li)Ci0(Li+Li)CiAi+BiKi,Bi~=EiEiHi0Hi

Remark 5

According to Lemma 1, if observer system (9) and error dynamic system (10) are positive, then it should guarantee that Ãi ≥ 0, i ≥ 0, ∀iI(It means Ai – (Li + △Li)Ci ⪰ 0, (Li + △Li)Ci ⪰ 0, Ai + BiKi ⪰ 0, Bi ⪰ 0, Ei ⪰ 0, EiHi ⪰ 0, Ki ⪰ 0, Hi ⪰ 0).

The aim of this paper is to design the positive observer and nonfragile positive observer based on state feedback controller, and find a class of switching signals σ(k) for systems (2) and (6) such that the corresponding closed-loop systems are GCFTS, respectively.

3 Main results

3.1 Observer-based guaranteed cost finite-time stability analysis

In this subsection, we will focus on the problem of GCFTS for DPISS (5). The following theorem gives sufficient conditions of GCFTS for system (5).

Theorem 1

Consider the system (5), for a given time constant Tf, vectors αβ ≻ 0 and R1 ≻ 0, R2 ≻ 0, if there exist a set of positive vectors νi, νj, υi, υj, ij, iI, positive matrices Ki, Li and positive constants ϕ1, ϕ2, ξ > 1, μ > 1, and such that the following inequalities hold:

(AiTCiTLiT)νi+R1+CiTLiTυiξνi0 (11)
(AiT+KiTBiT)υi+R1+KiTR2ξυi0 (12)
EiTνjμνi0 (13)
(EiTHiT)νj+HiTυjμυi0 (14)
ϕ1αψiϕ2β (15)
AiLiCi0 (16)
Ai+BiKi0 (17)
EiHi0 (18)
ϕ1>ϕ2ξTf (19)

ψi = [ψi1, ψi2, …, ψin]T, ψir represents the ith elements of the vectors ψi, respectively, then under the following ADT scheme

Tα>Tα=Tflnμlnϕ1lnϕ2Tflnξ (20)

the system (5) is GCFTS with respect to (α, β, Tf, σ(k)) and the guaranteed cost value of system (5) is given by

J=s=0Tf1(xT(s)R1+uT(s)R2)J=ξTfμTfTαϕ2 (21)

Proof

Construct the following multiple linear co-positive Lyapunov function for the systems (5) as follows:

Vix~(k)=x~T(k)ψi (22)

where ψi=νiTυiTT,iI.

Supposing a switching sequence 0 = k0k1kmkm+1 ≤ … ≤ Tf. Without loss of generality, we assume that subsystem i is activated at the switching instant km–1 and the subsystem j is activated at the switching instant km.

When k ∈ [km–1, km – 1), mN, σ(k) = σ(k + 1) = i, along the trajectory of system (5), the difference of the MLCLF is

Vi(x~(k)+xT(k)R1+xT(k)KiTR2=x~T(k+1)ψix~T(k)ψi+xT(k)R1+xT(k)KiTR2=x~T(k)(AiTCiTLiT)νi+R1+CiTLiTυi(AiT+KiTBiT)υi+R1+KiTR2x~T(k)ψi (23)

From (11) and (12), we have

Vi(x~(k))+xT(k)R1+xT(k)KiTR2(ξ1)x~T(k)ψi (24)

it implies

Vi(x~(k+1))ξx~T(k)ψi (25)

When k = km – 1, σ(k + 1) = σ(km) = j, σ(k) = σ(km – 1) = i, ij. Along the trajectory of system (5), the difference of MLCLF is

Vj(x~(k+1))μVi(x~(k))=x~T(k+1)ψjμx~T(k)ψi=x~T(k+1)ψjx~(k)ψix~T(k)EiTνjμνi(EiTHiT)νj+HiTυjμυi (26)

From (13) and (14), we have

Vj(x~(k+1))μVi(x~(k)),ij. (27)

So, when k ∈ [km, km+1), from (27), we get

Vσ(k)(x~(k))<ξkkmVσ(km)(x~(km))<μξkkmVσ(km1)(x~(km1)) (28)

Repeating the procedure of (28) and noting ξ > 1, we obtain

Vσ(k)(x~(k))<ξkkmVσ(km)(x~(km))<μξkkmVσ(km1)(x~(km1))<μξkkmξkm1km1Vσ(km1)(x~(km1))<μξkkm1Vσ(km1)(x~(km1)) (29)

By iterative operation, we get

Vσ(k)(x~(k))<μ2ξkkm2Vσ(km2)(x~(km2))μNσ(k,k0)ξkk0Vσ(k0)(x~(k0))=μNσ(k,k0)ξkk0Vσ(k0)(x~(k0)) (30)

From (15) and (22), we have

Vσ(k)(x~(k))=x~T(k)ψσ(k)ϕ1x~T(k)α (31)
Vσ(k0)(x~(k0))=x~T(0)ψσ(k0)ϕ2x~T(0)β (32)

From (30)-(32), we obtain

x~T(k)α1ϕ1μTfTαξTfϕ2xT(0)β1ϕ1μTfTαξTfϕ2 (33)

Substituting (20) into (33), one has

x~T(k)α<1 (34)

According to Definition 3, we conclude that the system (5) with u(k) = 0 is FTS with respect to (α, β, Tf, σ(k)).

Next, we will give the guaranteed cost value of system (5).

When k ∈ [km–1, km – 1), mN, according to (24), we know

Vi(x~(k))ξx~T(k)νixT(k)R1xT(k)KiTR2 (35)

Similar to the proof process of (25)-(30), for any k ∈ [0, Tf] and μ > 1, we can obtain

Vσ(k)(x~(k))<μNσ(k,k0)ξkk0Vσ(k0)(x~(k0))s=k0k1xT(s)(R1+KiTR2) (36)

Noting that Vσ(k)((k)) > 0, (36) can be rewritten as

0<μNσ(k,k0)ξkk0Vσ(k0)(x~(k0))s=0k1x(s)T(R1+KiTR2) (37)

Letting k = Tf, we get

s=0Tf1x(s)T(R1+KiTR2)<μNσ(k,k0)ξkk0(Vσ(k0)x~(k0))<μNσ(Tf,k0)ξTfk0(Vσ(k0)x~(k0)) (38)

Then we can obtain

J=s=0Tf1xT(s)(R1+KiTR2)J=ξTfμTfTαϕ2 (39)

Therefore, according to Definition 5, we can conclude that the system (5) is GCFTS. Thus, the proof is completed.

In Theorem 1, (11) and (12) are nonlinear matrix inequalities, there are no effective methods to solve Ki and Li. So, an algorithm is presented to obtain the feedback gain matrices Ki, Li, iI.

Algorithm 1

  1. By adjusting the parameters ξ, μ and Letting fp = KpTBpTυp , then solving (13)-(19) via linear programming, positive vectors νp, υp, Kp and Lp can be obtained.

  2. Substituting υp and Kp into fp = KpTBpTυp , p can be obtained. The gain Lp, νp and υp are substituted into (12).

  3. If pfp ⪯ 0 and (12) are all satisfied at the same time, then Kp and Lp are admissible. Otherwise, return to Step 1.

3.2 Nonfragile observer-based guaranteed cost finite-time stability analysis

Now we consider system (10); the following theorem gives sufficient conditions of GCFTS for system (10).

Theorem 2

Consider the system (10), for a given time constant Tf, vectors αβ0,L1,L2 and R1 ≻ 0, R2 ≻ 0, if there exist a set of positive vectors νi, νj, υi, υj, ij, iI, positive matrices Ki, Li and positive constants ϕ1, ϕ2, ξ > 1, μ > 1, such that (12)-(15), (17)-(19) and the following inequalities hold:

(AiTCiT(Li+Li)Tνi+R1+CiT(Li+Li)Tυiξνi0 (40)
Ai(Li+Li)Ci0 (41)

then under the ADT scheme (20), the system (10) is GCFTS with respect to (α, β, Tf, σ(k)) and the guaranteed cost value of the system (10) is given by

J=s=0Tf1(xT(s)R1+uT(s)R2)J=ξTfμTfTαϕ2 (42)

Proof

Replacing (AiTCiTLiT)νi+R1+CiTLiTυi in (23) with (AiTCiT(Li+Li)Tνi+R1+CiT(Li+Li)Tυi, similar to the proof of Theorem 1, we easily obtain that the resulting closed-loop system (10) is GCFTS.

Thus, the proof is completed.

Theorem 3

Consider the system (10), for a given time constant Tf, vectors αβ0,L1,L2 and R1 ≻ 0, R2 ≻ 0, if there exist a set of positive vectors νi, νj, υi, υj, ij, iI, positive matrices Ki, Li and positive constants ϕ1, ϕ2, ξ > 1, μ > 1, such that (12)-(15), (17)-(19) and the following inequalities hold:

(AiTCiT(Li+L1)Tνi+R1+CiT(Li+L2)Tυiξνi0 (43)
Ai(Li+L1)Ci0 (44)

then under the ADT scheme (20), the system (10) is GCFTS with respect to (α, β, Tf, σ(k)) and the guaranteed cost value of the system (10) is given by

J=s=0Tf1(xT(s)R1+uT(s)R2)J=ξTfμTfTαϕ2 (45)

Proof

If (AiTCiT(Li+L1)Tνi+R1+CiT(Li+L2)Tυiξνi0 and Ai(Li+L1)Ci0, we can easily get (AiTCiT(Li+Li)Tνi+R1+CiT(Li+Li)Tυiξνi0 and Ai – (Li + △Li)Ci ≻ 0. Then, the conditions of Theorem 2 are satisfied. So the resulting closed-loop system (10) is GCFTS.

To obtain the feedback gain matrices Ki and Li in Theorem 3, an algorithm is presented.

Algorithm 2

  1. By adjusting the parameters ξ, μ and Letting fp = KpTBpTυp , then solving (13)-(15), (17)-(19) and (44) via linear programming, positive vectors νp, υp, Kp and Lp can be obtained.

  2. Substituting υp and Kp into fp = KpTBpTυp , p can be obtained. The gain Lp, νp and υp are substituted into (43).

  3. If pfp ⪯ 0 and (43) are all satisfied at the same time, then Kp and Lp are admissible. Otherwise, return to Step 1.

4 Numerical example

We present a numerical example to show the effectiveness of the proposed approach. Without loss of generality, we consider the case of nonfragile positive observer of DPISS (10) with the parameters as follows:

A1=0.10.30.20.3,B1=0.30.10.10.2,E1=0.20.30.30.2,H1=0.10.20.10.1,C1=0.150.2,A2=0.20.150.30.2,B2=0.10.20.20.1,E2=0.30.40.20.5,H2=0.20.20.10.4,C2=0.10.3,R1=0.50.6,R2=0.10.2,L1=0.030.02,L2=0.040.03α=0.2,0.35,0.1,0.4T,β=0.4,0.1,0.2,0.1T,

Choosing Tf = 5, ξ = 1.1 and μ = 1.05. Solving the inequalities in Theorem 3 by linear programming, we have

ν1=0.15220.1594,ν2=0.15220.1593,υ1=0.08170.0869,υ2=0.08150.0888,K1=0.03810.14980.00520.1234,K2=0.05830.15050.02350.1244,L1=0.38290.4170,L2=0.39530.4258,f1=0.01940.0825,f2=0.02570.0929,

It is easy to firm that pfp ⪯ 0 and (10) are satisfied. then Kp and Lp are admissible. According to (20), we get Tα=1.7.

The simulation results are shown in Figs. 1-5, where the initial conditions of the system (10) are (0) = [2, 2, 1, 1]T, which meet the condition T(0)β < 1. The state trajectory of x1 and state observation trajectory 1 are shown in Fig. 1. The state trajectory of x2 and state observation trajectory 2 are depicted in Fig. 2. Fig. 3 plots the state of the error dynamic system. The switching signal σ(k) is depicted in Fig. 4. Fig. 5 plots the evolution of (t)α, which implies that the corresponding closed-loop system is GCFTS with respect to (α, β, Tf, σ(k)) to (α, β, Tf, σ(k)), and the cost value J = 2.33, which can be obtained by (45).

Fig. 1 
The state trajectory of x1 and state observation trajectory x̂1.
Fig. 1

The state trajectory of x1 and state observation trajectory 1.

Fig. 2 
The state trajectory of x2 and state observation trajectory x̂2.
Fig. 2

The state trajectory of x2 and state observation trajectory 2.

Fig. 3 
State of the error dynamic system.
Fig. 3

State of the error dynamic system.

Fig. 4 
Switching signal of system (5) with ADT.
Fig. 4

Switching signal of system (5) with ADT.

Fig. 5 
The evolution of x̃T(k)α of system (5).
Fig. 5

The evolution of T(k)α of system (5).

5 Conclusions

In this paper, we have considered the issue of nonfragile observer-based guaranteed cost finite-time control for DPISS. Based on the ADT approach and co-positive type Lyapunov function technique, two types of guaranteed cost finite-time controller based on positive observer and nonfragile positive observer are designed, and sufficient conditions are obtained to guarantee the corresponding closed-loop systems are guaranteed cost finite-time stability(GCFTS), respectively. Such conditions can be solved by linear programming. Finally, a numerical example is given to illustrate the effectiveness of the proposed method.

Acknowledgement

The authors are thankful for the supports of the National Natural Science Foundation of China under grants U1404610, 61773350 and young key teachers plan of Henan province (2016GGJS-056).

  1. Conflict of Interest: The authors declare that there is no conflict of interests regarding the publication of this paper.

References

[1] Niu B., Wang D., Alotaibi N.D., Alsaadi F.E., Adaptive neural state-feedback tracking control of stochastic nonlinear switched systems, IEEE Transactions on Neural Networks and Learing Systems, 10.1109/TNNLS.2018.2860944Search in Google Scholar PubMed

[2] Niu B., Li H., Zhang Z.H., Li J., Hayat T., Alsaadi F.E., An average dwell-time method and adaptive neural-network-based dynamic surface control for stochastic interconnected nonlinear non-strict-feedback systems with dead zone, IEEE Transactions on Systems, Man, and Cybernetics: Systems, 10.1109/TSMC.2018.2866519Search in Google Scholar

[3] Liu X., Li S.H., Zhang K., Optimal control of switching time in switched stochastic systems with multi-switching times and different costs, International Journal of Control, 10.1080/00207179.2016.1214879Search in Google Scholar

[4] Liu X., Zhang K., Li S.H., Fei S.H., Wei H., Time optimisation problem for switched stochastic systems with multi-switching times, IET Control Theory and Applications, 2014, 8(16): 1732-174010.1049/iet-cta.2014.0053Search in Google Scholar

[5] Zhao X., Liu X., Yin S., Improved results on stability of continuous-time switched positive linear systems, Automatica, 2014, 50(2): 614-62110.1016/j.automatica.2013.11.039Search in Google Scholar

[6] Liu S., Xiang Z., Exponential L1 output tracking control for positive switched linear systems with time-varying delays, Nonlinear Analysis: Hybrid Systems, 2014, 11: 118-12810.1016/j.nahs.2013.07.002Search in Google Scholar

[7] Zong G., Ren H., Hou L., Finite-time stability of interconnected impulsive switched systems, IET Control Theory and Applications, 2016, 10(6): 648-65410.1049/iet-cta.2015.0617Search in Google Scholar

[8] Zhang J., Han Z., Huang J., Stabilization of discrete-time positive switched systems Circuits Syst, Signal Process, 2013, 32(3), 1129-114510.1007/s00034-012-9510-2Search in Google Scholar

[9] Fornasini E., Valcher M.E., Stability and stabilizability criteria for discrete-time positive switched systems, IEEE Transactions on Automatic Control, 2012, 57(5): 1208-122110.1109/TAC.2011.2173416Search in Google Scholar

[10] Rami M.A., Tadeo F., Benzaouia A., Control of constrained positive discrete systems, American Control Conference, 2007: 5851-585610.1109/ACC.2007.4282448Search in Google Scholar

[11] Guan Z.H., Hill D.J., Shen X., On hybrid impulsive and switching systems and application to nonlinear control, IEEE Transactions on Automatic Control, 2005, 50(7): 1058-106210.1007/978-3-030-02161-0_7Search in Google Scholar

[12] Xiang M., Xiang Z., Exponential stability of discrete-time switched linear positive systems with time-delay, Applied Mathematics and Computation, 2014, 230(3): 193-19910.1016/j.amc.2013.12.118Search in Google Scholar

[13] Liu T., Wu B., Liu L., Wang Y.E., Asynchronously finite-time control of discrete impulsive switched positive time-delay systems, Journal of the Franklin Institute, 2015, 352(10): 4503-451410.1016/j.jfranklin.2015.06.015Search in Google Scholar

[14] Li X., Xiang Z., Observer design of discrete-time impulsive switched nonlinear systems with time-varying delays, Applied Mathematics and Computation, 2014, 229(6): 327-33910.1016/j.amc.2013.12.053Search in Google Scholar

[15] Mahmoudi A., Momeni A., Aghdam A.G., Gohari P., On observer design for a class of impulsive switched systems, 2008 American Control Conference, 2008: 11-1310.1109/ACC.2008.4587226Search in Google Scholar

[16] Rami M.A., Helmke U., Tadeo F., Positive observation problem for linear time-delay positive systems, Conference on Control and Automation, 2008, 3(1): 1-6Search in Google Scholar

[17] Xiang Z., Wang R., Jiang B., Nonfragile observer for discrete-time switched nonlinear systems with time delay, Circuits Systems and Signal Processing, 2011, 30(1): 73-8710.1007/s00034-010-9210-8Search in Google Scholar

[18] Huang S., Xiang Z., Karimi H.R., Input-output finite-time stability of discrete-time impulsive switched linear systems with state delays, Circuits Systems and Signal Processing, 2014, 33(1): 141-15810.1007/s00034-013-9610-7Search in Google Scholar

[19] Yang D., Cai K.Y., Finite-time quantized guaranteed cost fuzzy control for continuous-time nonlinear systems, Expert Systems with Applications, 2010, 37(10): 6963-696710.1016/j.eswa.2010.03.024Search in Google Scholar

[20] Niamsup P., Ratchagit K., Phat V.N., Novel criteria for finite-time stabilization and guaranteed cost control of delayed neural networks, Neurocomputing, 2015, 160: 281-28610.1016/j.neucom.2015.02.030Search in Google Scholar

[21] Zhang Y.Q., Liu L., Mu X.W, Stochastic finite-time guaranteed cost control of markovian jumping singular systems, Mathematical Problems in Engineering, 2011, 2011(11): 34-3510.1155/2011/431751Search in Google Scholar

[22] Cai K.Y., Finite-time reliable guaranteed cost fuzzy control for discrete-time nonlinear systems, International Journal of Systems Science, 2011, 42(1): 121-12810.1080/00207720903470163Search in Google Scholar

[23] Yan Z., Zhang G., Wang J., Finite-time guaranteed cost control for linear stochastic systems, 30th Chinese Control Conference, 2011: 1389-1394Search in Google Scholar

[24] Liu L., Cao X., Fu Z., Song S., Guaranteed cost finite-time control of fractional-order positive switched systems, Advances in Mathematical Physics, 2017, 2017(3): 1-1110.1155/2017/2695894Search in Google Scholar

[25] Cao X., Liu L., Fu Z., Song X., Song S., Guaranteed cost finite-time control for positive switched linear systems with time-varying delays, Journal of Control Science and Engineering, 2017, 1-1010.1155/2017/7051658Search in Google Scholar

Received: 2018-09-04
Accepted: 2019-05-05
Published Online: 2019-07-24

© 2019 Liu et al., published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 Public License.

Downloaded on 11.10.2024 from https://www.degruyter.com/document/doi/10.1515/math-2019-0058/html
Scroll to top button