Abstract

For the switched systems, switching behavior always affects the finite-time stability (FTS) property, which was neglected by most previous studies. This paper is mainly concerned with the problem of delay-dependent finite-time and -gain analysis for switched systems with time-varying delay. Several less conservative sufficient conditions related to finite-time stability and boundness of switched system with time-varying delays are proposed; the system trajectory stays within a special bound with the information of switching signal. At last, a numerical example is also given to illustrate the efficiency of the developed method.

1. Introduction

During the past decades, the systems with time delays have received much attention since they often fall in various practical systems, for instance, neural networks, networked control systems, engineering systems, biology, economics, and other fields. However, time delay is always frequently the major cause of oscillation and instability; the stability for systems with time delays has been devoted to a lot of effort. Nowadays, the stability of time delay is parted into two classes: delay-independent stability criteria and delay-dependent ones. It should be pointed out that delay-independent criteria turn out to be more conservative, especially for the small-size delays. The problem of delay-dependent stability analysis for time-delay systems has received considerable attention, and lots of important results have also been reported [112].

In recent years, there has been an increasing interest in analysis of hybrid and switched systems due to their importance both in theory and its applications. As an important class of hybrid systems, switched linear systems comprise a collection of linear subsystems described by differential equations as well as a switching law to specify the switching during these subsystems. A switched system is a type of hybrid system with a combination of the discrete and continuous dynamical systems. These systems are recognized as models for appearance which cannot be denoted by exclusively continuous or discrete processes. Recently, based on the Lyapunov functions and other analysis tools, the corresponding stability and stabilization for both linear and nonlinear and switched systems have been investigated and many good results have been obtained; for a recent survey on this issue and related matters, one can also refer to [1326].

Most of the existing results have concentrated on Lyapunov-based asymptotic stability for the switched systems; the behavior of that is above the infinite time interval. However, in practical engineering, there exists the bad transient characteristics; the system is asymptotically stable without unusable. For the systems which work in a short time interval, for instance, control system, missile system, and communication network system, which mainly care about the behavior over a finite time interval. To deal with this problem, in 1961, Dorato presented the idea of finite-time stability in [27]. Over the past few years, many study efforts have been dedicated to the finite-time stability (FTS) of switched systems due to its wide applications. Comparing with the classical Lyapunov stability, which currently is the focus on a large and growing interdisciplinary area of research. To study 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 important to emphasize the disconnection between classical Lyapunov stability and finite-time stability. The problem about finite-time stabilization has been widely learned in the literature [2844]. It is worth pointing out that there is a difference between finite-time stability and Lyapunov asymptotic stability, and they are also independent of each other.

Recently, some papers are found to be related to finite-time stability for switched systems. For example, based on the technique of average dwell time, the problem of finite-time boundedness for the switched linear system with time delays was investigated in [36]. The issue of finite-time stability and stabilization for switched nonlinear discrete-time systems was developed in [37]. The problem of finite-time quantized control problem for a class of discrete-time switched time-delay systems with time-varying exogenous disturbances was also discussed in [38]. But, to the best of the authors' knowledge, the finite-time -gain problems for switched systems have not been completely studied. The previous research has some conservatism of stability criterion; it is natural to look for an alternative way to reduce the conservatism of corresponding stability criteria. This idea motivates to our study.

The main contribution of this paper is that we present a novel approach for finite-time stability of the given switched system. Moreover, several sufficient conditions ensuring the finite-time stability and boundness are proposed with different information we know about the switching signal. It shows the less conservative results when more information about the switching signal is available. By selecting the appropriate Lyapunov-Krasovskii functional, the sufficient conditions are obtained to guarantee finite-time stability of the systems and the closed-loop system trajectory stays in a special bound. The finite-time stability criteria can also be dealt with in the form of linear matrix inequalities and average dwell time. Finally, a numerical example is given to illustrate the effectiveness of the developed techniques.

2. Preliminaries

In this paper, the following switched systems are described as follows: where is the state vector of the system, is the controlled output, and is the external disturbance vector and satisfies the constraint: , , , , and are the constant real matrices with appropriate dimension. represents the mode-dependent time-varying state delay in the switched system and satisfies the following conditions: where is the upper bound of the time-varying delay and is the variation rate of the time-varying delay . is the differentiable vector-valued initial function on . is the right continuous piecewise constant switching signal to be designed.

Corresponding to the switching signal , we get the follwing switching sequence: where is the initial time when , is the initial state and th subsystem is active. Therefore, the trajectory of the switched system (1) is called the trajectory of the th subsystem. As assumed before, we get rid of Zeno behavior for all types related to switching signal. Throughout this paper, we assumed that the state of the switched system (1) does not jump at the switching instants; that is, the trajectory is continuous everywhere.

Firstly, we will give the definitions and lemmas about switched system (1), which plays an major role in the derivation of our results.

Definition 1. Switch system (1) is said to be finite-time bounded with respect to , if condition (6) holds: where and .

Definition 2. For , , , , , and , system (3) is said to be finite-time stable with a weighted performance with respect to , if the following condition holds: and under zero initial condition, it holds for all nonzero : .

Definition 3 (see [21]). For any , let denote the switching number of during . If holds for and , then and are called chattering bound and average dwell time, respectively. Here we assume for simplicity as supported by reference.

Lemma 4 (see [9]). Let have positive values in an open subset of . Then, the reciprocally convex combination of over satisfies

Lemma 5 (see [11]). For any constant matrix , , scalars , such that the following integrations are well defined; then

Lemma 6 (Schur’s complement). Given constant matrices , , , where and , then if and only if

3. Finite-Time Boundedness Analysis

Theorem 7. System (3) is said to be finite-time stability with respect to if there exist symmetric positive matrices ,   ,   , and matrices , , , scalars , ,   , , , , , ; such that , we have the following linear matrix inequalities: with the average dwell time of the switching signal satisfying where Consider

Proof. Define . We consider the following Lyapunov-Krasovskii functional:
Taking the time derivative of along the trajectory of the system (1), one has
Since we define
Then,
By Lemma 5, one can obtain where
From the Leibniz-Newton formula, the following equation is true for any matrices , , and with appropriate dimensions:
From Lemma 4, it yields By using Lemma 5, we have
Therefore, for a given and from (21)–(30), one can obtain that
where
The LMIs (11) lead to and to , respectively. It is easy to see that results from and results from . Thus, we obtain
Notice that
Integrating (34) from to , we can get that
Note that (12) and , it yields
Then, we can easily have
Thus, from (35)–(37), it yields
Define , , .
Note that
Thus,
On the other hand,
From (40) and (41), one obtains
When , which is the trivial case, from (13), . When , from (13), , we have
Substituting (43) into (42) yields The proof is completed.

Remark 8. It should be mentioned that to reduce the conservatism, and are bounded with and , respectively.

Remark 9. One can clearly see that criteria given in Theorem 7 are delay-dependent. It is well known that the delay-dependent criteria are less conservative than delay-independent criteria when the delay is small or belongs to a given interval. Interval time-varying delay is a time delay that varies in an interval in which the lower bound is not restricted to zero.

Remark 10. In Theorem 7, the free weight matrix technology is employed, which reduces the conservativeness of the stability condition.

4. Finite-Time Weighted -Gain Analysis

Theorem 11. System (3) is finite-time bounded with respect to if there exist symmetric positive matrices ,   , , and matrices , , , scalars , , , , , , , , , such that ; we have the following linear matrix inequalities: with the average dwell time of the switching signal satisfying

Proof. Choose the same Lyapunov-Krasovskii functional as in Theorem 7; after some mathematical manipulation and Schur complement, we can get
Define
From (45), we obtain
When , where is the th switching instant,
Notice that ; then one obtains
For any , one has
Under zero initial condition, we have which implies that
Multiplying both sides of (55) by yields
It is easy to deduce from (47) that
Since , we have
Therefore, we can obtain
According to Definition 2, we know that Theorem 11 holds. This completes the proof.

Remark 12. It can be seen that Theorem 11 presents a more general result than [3342] which contain the decay ; such a condition is derived by advantage of the simultaneous usage of the Lyapunov functional and the state variable transformation.

Remark 13. In many real applications, the minimum value of is of interest. In Theorem 11, with a fixed and , can be obtained through following procedure:

5. Illustrative Example

Example 1. Consider the system (1) with the following data: The values of , , , and matrix are given as follows:

Through Theorem 7, when , we can see that the admissible maximum computed by [36] is 0.2, and the maximal value of in this paper is 0.262. It is obvious that our method shows less conservatism result than that in [36]. Moreover, when , the optimal bound with minimum value of relies on the parameter . One can obtain clearly that Theorem 7 in our paper can indeed provide much smaller admissible than the stability criteria in [36] which shows the less conservative result in this paper.

6. Conclusions

In this paper, we have examined the problems of delay-dependent finite-time and -gain analysis for switched systems with time-varying delay by allowing new Lyapunov-Krasovskii functional and average dwell time. A numerical example has also been given to demonstrate the effectiveness of the proposed approach. It is possible to extend the main results obtained in this paper to real systems which contain some practical constrains, for example, the failures of controllers. Details will be reported in our follow-up work in the future.

Acknowledgment

This work was supported by the Fundamental Research Funds for the Central Universities (103.1.2E022050205).