3.1 Stability analysis
In this section, two necessary lemmas are given firstly for the following non-switched positive system:
(6)
where A is a Metzler constant matrix and is a constant matrix; denotes the time-varying delay satisfying , ; .
Choose the co-positive type Lyapunov-Krasovskii functional candidate for system (6) as follows:
(7)
where
and , .
For the sake of simplicity, is written as in this paper.
Lemma 2 For a given positive constant α, if there exist vectorsandsuch that
where
with () represents the rth column vector of matrix A (), and, , , , represents the rth element of the vector. Then along the trajectory of system (6), we have
Proof Along the trajectory of system (6), for the co-positive type Lyapunov-Krasovskii functional (7), we have
Using the Leibniz-Newton formula, one has
(11)
Considering that
(12)
the following relationship can be obtained for any vector :
(13)
From (10) and (13), we have
(14)
One can obtain from (8) and (9) that
It follows that
Then, along the trajectory of system (6), we have
□
Lemma 3 Consider system (6), for a given positive constant β, if there exist vectorsandsuch that
where
() represents the rth column vector of matrix A (); and, , , . Then, along the trajectory of system (6), we have
Proof Choose the following co-positive type Lyapunov-Krasovskii functional candidate for system (6):
where
and , .
The rest of the proof of this lemma is similar to that of Lemma 2, and thus is omitted here. □
Now we are in a position to provide the stability conditions for the following positive switched system:
(21)
where , , are Metzler constant matrices and , , are constant matrices; denotes the time-varying delay satisfying , ; .
Let Q denote the index set of all stable subsystems, which is a nonempty subset of , and denote the index set of all unstable subsystems. Let denote the total activation time of the unstable subsystems during , let denote the total activation time of the stable subsystems during , then we have the following result.
Theorem 1 Given positive constants α and β, if there existand, , such that
where
() represents the rth column vector of matrix (), ; and, , , . Then system (21) is exponentially stable for any switching signalswith the average dwell time
(26)
where, andsatisfies
(27)
Proof
Choose the following piecewise co-positive type Lyapunov-Krasovskii functional candidate:
Let denote the switching instants of over the interval . By Lemmas 2 and 3, one can obtain from (22)-(25) that
(28)
From (27) and the co-positive type Lyapunov-Krasovskii functional, at the switching instants , , it is obtained that
(29)
where .
By (26), (28), (29) and Definition 4, for , it is not hard to get
(30)
Denoting yields
(31)
Denote
and , then
(32)
From (30)-(32), we obtain
Thus, by denoting , , it can be seen from (33) that , , where . Therefore, we can conclude that system (21) is exponentially stable for any switching signal with average dwell time (26). □
Remark 2 In Theorem 1, sufficient conditions for the existence of the exponential stability for positive switched system (21) with both stable and unstable subsystems are presented via the average dwell time approach. It is shown by (26) that when the average dwell time is sufficiently large and the total activation time of unstable subsystems is relatively small compared with that of stable subsystems, the stability of the system can be guaranteed.
3.2 -gain property analysis
Theorem 2 Given positive constants α, β and γ, if there existand, , such that
where
represents the rth column vector of matrix, . Then system (1) is exponentially stable and has-gain performance index γ for any switching signalwith the average dwell time (26).
Proof It is easy to get that (22)-(25) can be deduced from (34)-(37). According to Theorem 1, system (1) with is exponentially stable. In the sequel, we will prove that the -gain performance of system (1) is guaranteed.
Let denote the switching instants of over the interval . Following the proof line of Theorem 1, one can obtain from (34)-(37) that
(38)
where .
Then, for , we have
(39)
Under the zero initial condition, we have , then (39) becomes
From the condition (26), it is obvious that
then
That is,
(40)
Multiplying both sides of (40) by yields
(41)
By Definition 4 and condition (26), one can obtain
(42)
Integrating both sides of (42) from to ∞ leads to
This means that system (1) achieves -gain performance index γ.
The proof is completed. □
3.3 Reliable control
In what follows, we design a state feedback controller for positive switched system (3) such that resulting closed-loop system (5) is exponentially stable with -gain performance index γ.
Theorem 3 Consider system (3), for given positive constants α, β and γ, if there existand, , such that
where
() represents the rth column vector of matrix (), ; () represents the rth column vector of matrix (); , .
Then, under the controller (4), resulting closed-loop system (5) is exponentially stable and has-gain performance index γ for any switching signalswith the average dwell time (26).
Proof Under the controller (4), the resulting closed-loop system can be written as (5).
Denote , , and , , then by Theorem 2, one can obtain from (43)-(46) that closed-loop system (5) is exponentially stable and has -gain performance index γ. This completes the proof. □
We now present the following algorithm for the construction of the reliable state feedback controller.
Algorithm 1 Step 1. Input the matrices , , , , and , ;
Step 2. By adjusting parameters α and β, we can find the solutions of , , , , such that (43) and (45) hold;
Step 3. From and , one can obtain the gain matrices , and then substitute into (44) and (46). If inequalities (44) and (46) hold and are Metzler matrices, then go to Step 4; otherwise, go back to Step 2;
Step 4. With , , , the switching signal can be obtained by (26) and (27);
Step 5. Construct the feedback controller (4), where are gain matrices obtained in Step 3.