Hindawi Publishing Corporation Mathematical Problems in Engineering Article ID 425864 Research Article New Stability Analysis for Linear Systems with Time-Varying Delay Based on Combined Convex Technique Bin Yang and Chen-xin Fan The School of Control Science and Engineering, Dalian University of Technology, Dalian 116023, China Correspondence should be addressed to Chen-xin Fan; [email protected] Received 8 March 2014; Accepted 5 August 2014 Academic Editor: Huaguang Zhang Copyright © B. Yang and C.-x. Fan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. A novel combined convex method is developed for the stability of linear systems with a time-varying delay. A new delay-dependent stability condition expressed in terms of linear matrix inequalities (LMIs) is derived by employing a dedicated constructed Lyapunov-Krasovskii functional (LKF), utilizing the Wirtinger inequality and the reciprocally convex approach to handle the integral term of quadratic quantities. Different from the previous convex techniques which only tackle the time-varying delay, our method adopts the idea of combined convex technique which can tackle not only the delay but also the delay variation. Four well-known examples are illustrated to show the effectiveness of the proposed results. 1. Introduction In recent years, the stability of the time-delayed linear system is one of the hot issues in control theory, for time delay occurs in different physical, industrial, and engineering systems, such as aircraft, biological systems, population dynamics, and neural networks. It is well-known that time delay is often a source of the degradation of performance and/or the instability of the time-delayed linear system. Hence, the problem of the stability analysis of time-delayed systems has attracted considerable attention in recent years. For more details, see the literature [1β29]. Currently, many researchers have devoted time and effort to the stability analysis of linear-systems with time delay, and a great number of results on delay-dependent stability conditions for time-delayed systems have been reported in the briefs [6, 8, 11, 17, 20, 22, 28, 29] because it is well known that delay-dependent stability criteria which include the information on the size of time delay are generally less conservative than delay-independent ones when the size of time delay is small. The objective of the stability analysis is to find a less conservative condition to enlarge the feasibility region of stability criteria such that it guarantees asymptotic stability of time-delayed systems as large as possible. In order to reduce the conservatism of the stability criteria for linear time-delayed system, integral inequality lemma was used by Park and Ko [9]. He et al. presented some less conservative stability conditions using free-weighting matrix in [11, 23]. Descriptor model transform method was presented by Fridman and Shaked in [12]; Jensenβs inequality and delay decomposition method were used in [17, 20, 21] and [30], respectively. Jensenβs inequality introduces an undesirable conservatism in the stability conditions, so, some Wirtinger inequalities which allow consideration of more accurate integral inequalities are introduced by Seuret and Gouaisbaut to deal with the derivative of LKF recently in [18]. Notice that the reciprocal convex approach presented in [24] has been a popular method. Although this method can be more effective than earlier convex techniques in studying the timevarying delay systems, it still needs more improvements since it cannot tackle the delay variation or more complicated cases [15]. In the light of the discussion above, in this paper, the combined convex method which was presented in [31, 32] is further developed for the stability of the linear systems with time-varying delay. With the new method, both the time-varying delay and the variation of the delay can be tackled. We notice that some important terms are ignored during the construction of the LKF because of limitation of the previous method. First, we construct a new LKF and 2 Mathematical Problems in Engineering use reciprocal convex approach and Wirtinger inequality to handle the integral term of quadratic quantities, and then we derive the stability condition in terms of the sum of two firstorder convex functions with respect to the time-varying delay and its variation. Second, a novel delay-dependent stability criterion is presented in terms of LMIs which can be solved efficiently by convex optimization algorithm. Finally, four well-known examples are given to illustrate the effectiveness of the proposed method. Throughout this paper, the following notations will be used: πΆπ represents the transposition of matrix πΆ, Rπ denotes π-dimensional Euclidean space, and Rπ×π is the set of all π × π real matrices. π > 0 means that π is positively definite. Symbol β represents the elements below the main diagonal of a symmetric block matrix. Sym(π) is defined as Sym(π) = π + ππ . 2. Problem Statement Consider the following linear systems with time-varying delay: π₯Μ (π‘) = π΄π₯ (π‘) + π΅π₯ (π‘ β β (π‘)) , π₯ (π‘) = π (π‘) , π‘ β₯ 0, (1) π‘ β [ββ, 0] , where π₯(π‘) β Rπ is the state vector, π΄, π΅ β Rπ×π are constant matrices with appropriate dimensions, β(π‘) is the time-varying delay, and it is assumed to satisfy the following: Μ β€ π < 1, for all π‘ β₯ 0; C1: 0 β€ β(π‘) β€ β, π1 β€ β(π‘) 2 C2: 0 β€ β(π‘) β€ β, for all π‘ β₯ 0. The initial condition π(π‘) is a continuously differentiable function on [ββ, 0]. For C1, let us define βπ in the following set: Ξ¨π := {βπ | βπ β conv {βπ1 , βπ2 }} , βπ1 (2) (3) Μ is affinely dependent on β(π‘), then π|β(π‘)| If a matrix π|β(π‘)| Μ Μ can be expressed as convex combinations of the vertices = ππ[βπ1 ] + (1 β π) π[βπ2 ] . π[β(π‘)] Μ Lemma 1 (see [18]). For a given matrix π > 0, the following inequality holds for all continuously differentiable functions π in [π, π] β Rπ : π β« πΜ π (π’) π πΜ (π’) ππ’ β₯ π 1 (π (π) β π (π))π π (π (π) β π (π)) πβπ + 3 Ξ¨π π Ξ¨, πβπ (5) π where Ξ¨ = π(π) + π(π) β (2/(π β π)) β«π π(π’)ππ’. Lemma 2 (see [22]). Suppose that Ξ©, Ξ1π , Ξ2π (π = 1, 2) are the constant matrices of appropriate dimensions, πΌ β [0, 1], and π½ β [0, 1], then Ξ©+[πΌΞ11 +(1βπΌ)Ξ12 ]+[π½Ξ21 +(1βπ½)Ξ22 ] < 0 holds, if the following four inequalities hold simultaneously: Ξ© + Ξ11 + Ξ21 < 0, Ξ© + Ξ11 + Ξ22 < 0, Ξ© + Ξ12 + Ξ21 < 0, Ξ© + Ξ12 + Ξ22 < 0. (6) The reciprocally convex combination inequality provided in Park et al. [24] is used in this paper. This inequality has been reformulated by Seuret and Gouaisbaut [18] and is stated in Lemma 3. Lemma 3. For given positive integers π, π, a scalar πΏ in the interval (0, 1), a given π × π matrix π > 0, and two matrices π1 and π2 in Rπ×π . Define, for all vectors π in Rπ , the function Ξ(πΌ, π ) given by the following: Ξ (πΏ, π ) = 1 π π 1 π π π π1 π π1 π + π π2 π π2 π. πΏ 1βπΏ (7) Then, if there exists a matrix π in Rπ×π such that [ π β π π ] > 0, then the following inequality holds: π βπ2 = π1 , and = π2 . where conv denotes the convex hull, Μ can be Then, there exists a parameter π > 0 such that β(π‘) expressed as convex combination of the vertices as follows: βΜ (π‘) = πβπ1 + (1 β π) βπ2 . Before deriving the main results, the following lemmas are stated, which will be used in the proof of the main results. (4) Μ From (4), if a stability condition is affinely dependent on β(π‘), Μ instead of then it needs only to check the vertex values of β(π‘) Μ [33]. checking all values of β(π‘) ππ π π π1 π min Ξ (πΏ, π ) β₯ [ 1 ] [ ]. ][ π2 π β π π2 π πΏβ(0,1) (8) 3. Main Result The main objective of this section is to achieve a less conservative condition such that it can guarantee the stability of system (1) under the constraint C1. First, we estimate the derivative of Lyapunov functional less conservatively by constructing a new augmented LKF; then, with the Wirtinger inequality and the newly developed combined convex technique, the improved stability results are derived, which are less conservative than some existing ones. For simplicity of matrix representation, we set block entry matrices ππ (π = 1, . . . , 7) β R7π×π (e.g., π2π = [0 πΌ 0 0 0 0 0]) and we define the following: Mathematical Problems in Engineering ππ (π‘) = [π₯π (π‘) π₯π (π‘ β β) β« π‘ π‘ββ 3 ππ (π‘, π ) = [π₯π (π‘) π₯π (π ) π₯Μπ (π )] , π₯π (π ) ππ ] , ππ (π‘) = [π₯Μπ (π‘) 0 0] , (9) ππ (π‘) = [π₯π (π‘) π₯π (π‘ β β (π‘)) π₯π (π‘ β β) π‘ π‘ββ(π‘) 1 1 π₯π (π ) ππ π₯π (π ) ππ π₯Μπ (π‘ β β) π₯Μπ (π‘ β β (π‘))] , β« β« β (π‘) π‘ββ(π‘) β β β (π‘) π‘ββ Ξ£[βπ ] = β (1 β βππ ) [π1 π2 π7 π3 ] π[π1 π2 π7 π3 ] and construct the following LKF: π π π 4 π (π₯π‘ ) = βππ (π₯π‘ ) , (10) + (1 β βππ ) [π1 π2 π7 π3 ] π[π1 π2 π7 π3 ] , π π=1 Ξ£1 = ππ¦π ([0 0 π4 ] π[π΄ππΆ π6 π1 β π3 ] ) where π + ππ¦π ([π1 π4 0 π3 ] π[π΄ππΆ 0 0 π6 ] ) π1 (π₯π‘ ) = ππ (π‘) ππ (π‘) , π + ππ¦π ([0 π4 0] π[π΄ππΆ 0 0] ) , π π‘ π (π‘, π ) π (π‘, π ) [ ] π[ ] ππ π₯ (π‘ β β) π‘ββ(π‘) π₯ (π‘ β β) π2 (π₯π‘ ) = β« +β« π‘ββ(π‘) π‘ββ π3 (π₯π‘ ) = β« [ π Ξ£2 = ππ¦π ([0 0 π5 ] π[π΄ππΆ π6 π1 β π3 ] ) π π + ππ¦π ([π1 π5 0 π3 ] π[π΄ππΆ 0 0 π6 ] ) π (π‘, π ) π (π‘, π ) ] π[ ] ππ , π₯ (π‘ β β) π₯ (π‘ β β) π π‘ + ππ¦π ([0 π5 0] π[π΄ππΆ 0 0] ) , π π‘ββ π4 (π₯π‘ ) = β β« π‘ π(π‘, π ) ππ (π‘, π ) ππ , π Ξ = ππ¦π ([π1 π3 0] π[π΄ππΆ π6 π1 β π3 ] ) π‘ β« π₯Μπ (π’) π π₯Μ (π’) ππ’ ππ , π‘ββ π (11) + [π1 π1 π΄ππΆ π3 ] π[π1 π1 π΄ππΆ π3 ] π π and here π β R and π β Rπ×π . 3π×3π ,π β R 4π×4π ,π β R 4π×4π ,π β R 3π×3π , Theorem 4. For given scalar β β₯ 0, π1 and π2 with C1, the system (1) is asymptotically stable, if there exist symmetric positive definite matrices π β R3π×3π , π β R4π×4π , π β R4π×4π , π β R3π×3π , and π β Rπ×π and any matrices πππ β Rπ×π (π, π = 1, 2), such that the following LMIs are feasible: Ξ£[βπ ] + βΞ£1 + Ξ < 0, βπ = 1, 2, Ξ£[βπ ] + βΞ£2 + Ξ < 0, βπ = 1, 2, π π (12) (13) Ξ¦ > 0, (14) + ππ¦π ([0 0 π1 β π2 0] π[π΄ππΆ 0 0 π6 ] ) β [π1 π3 π6 π3 ] π[π1 π3 π6 π3 ] π + ππ¦π ([0 0 π2 β π3 0] π[π΄ππΆ 0 0 π6 ] ) + [π1 π1 π΄ππΆ] π[π1 π1 π΄ππΆ] π π β [π1 π3 π6 ] π[π1 π3 π6 ] π + ππ¦π ([βπ1 0 π1 β π3 ] π[π΄ππΆ 0 0] ) + β2 π΄ππΆπ π΄ πΆ β Ξπ Ξ¦Ξ, Ξ¦=[ where π Ξ π ], β Ξ Ξ=[ π 0 π π ] , π = [ 11 12 ] . π21 π22 0 3π (15) π π΄ππΆ = [π΄ π΅ 0 0 0 0 0] , π Ξ = [π1 β π2 π1 + π2 β 2π4 π2 β π3 π2 + π3 β 2π5 ] , Proof. Taking the derivative of π(π₯π‘ ) with respect to π‘ along the solutions of system (1) yields 4 Mathematical Problems in Engineering π₯Μ (π‘) π₯Μ (π‘ β β) ] ] π₯ β π₯ β β) (π‘ [ (π‘) ] [ π1Μ (π₯π‘ ) = 2ππ (π‘) π [ π = ππ (π‘) {Sym ([π1 π3 β (π‘) π4 + (β β β (π‘)) π5 ] π[π΄ππΆ π6 π1 β π3 ] )} π (π‘) , π π π (π‘, π‘) π (π‘, π‘) π (π‘, π‘ β β (π‘)) π (π‘, π‘ β β (π‘)) ] π2Μ (π₯π‘ ) = [ ] π[ ] β (1 β βΜ (π‘)) [ ] π[ π₯ (π‘ β β) π₯ (π‘ β β) π₯ (π‘ β β) π₯ (π‘ β β) + 2β« π‘ π‘ββ(π‘) β[ [ π π (π‘, π ) π (π‘) ] π[ π₯ (π‘ β β) π₯Μ (π‘ β β) π π (π‘, π‘ β β) π₯ (π‘ β β) π (π‘, π‘ β β) ] π[ π₯ (π‘ β β) ] ππ + (1 β βΜ (π‘)) [ π‘ββ(π‘) ] + 2β« π‘ββ [ π π (π‘, π‘ β β (π‘)) π (π‘, π‘ β β (π‘)) ] π₯ (π‘ β β) ] π[ π₯ (π‘ β β) π π (π‘) π(π‘, π ) ] π[ ] ππ π₯(π‘ β β) π₯Μ (π‘ β β) π π = ππ (π‘) {[π1 π1 π΄ππΆ π3 ] π[π1 π1 π΄ππΆ π3 ] β (1 β βΜ (π‘)) [π1 π2 π7 π3 ] π[π1 π2 π7 π3 ] π + Sym ([β (π‘) π1 β (π‘) π4 π1 β π2 β (π‘) π3 ] π[π΄ππΆ 0 0 π6 ] ) π π + (1 β βΜ (π‘)) [π1 π2 π7 π3 ] × π[π1 π2 π7 π3 ] β [π1 π3 π6 π3 ] π[π1 π3 π6 π3 ] π + Sym ([(β β β (π‘)) π1 (β β β (π‘)) π5 π2 β π3 (β β β (π‘)) π3 ] π[π΄ππΆ 0 0 π6 ] )} π (π‘) , π‘ π3Μ (π₯π‘ ) = π(π‘, π‘)π π π (π‘, π‘) β π(π‘, π‘ β β)π ππ (π‘, π‘ β β) + 2 β« π‘ββ π(π‘, π )π ππ (π‘) ππ π = ππ (π‘) {[π1 π1 π΄ππΆ] π[π1 π1 π΄ππΆ] β [π1 π3 π6 ] π[π1 π3 π6 ] π π + Sym ([βπ1 β (π‘) π4 + (β β β (π‘)) π5 π1 β π3 ] π[π΄ππΆ 0 0] )} π (π‘) . (16) Finally, π4Μ is easily obtained as × π [π₯ (π‘ β β (π‘)) β π₯ (π‘ β β)] π4Μ (π₯π‘ ) = β2 π₯Μπ (π‘) π π₯Μ (π‘) β β β« π‘ π‘ββ π₯Μπ (π ) π π₯Μ (π ) ππ . Using Lemmas 1 and 3 yields β ββ« π‘ π‘ββ = ββ β« β β π‘ π π‘ 3β 2 [π₯ (π‘) + π₯ (π‘ β β (π‘)) β π₯ (π ) ππ ] β« β (π‘) β (π‘) π‘ββ(π‘) × π [π₯ (π‘) + π₯ (π‘ β β (π‘)) β π₯Μπ (π ) π π₯Μ (π ) ππ π‘ββ(π‘) β€β (17) π‘ββ(π‘) π₯Μ (π ) π π₯Μ (π ) ππ β β β« π‘ββ π π₯Μ (π ) π π₯Μ (π ) ππ β [π₯ (π‘) β π₯ (π‘ β β (π‘))]π π [π₯ (π‘) β π₯ (π‘ β β (π‘))] β (π‘) β [π₯ (π‘ β β (π‘)) β π₯ (π‘ β β)]π β β β (π‘) β π π‘ 2 π₯ (π ) ππ ] β« β (π‘) π‘ββ(π‘) 3β β β β (π‘) × [π₯ (π‘ β β (π‘)) + π₯ (π‘ β β) β π‘ββ(π‘) 2 π₯ (π ) ππ ] β« β β β (π‘) π‘ββ × π [π₯ (π‘ β β (π‘)) + π₯ (π‘ β β) β π π‘ββ(π‘) 2 π₯ (π ) ππ ] β« β β β (π‘) π‘ββ Mathematical Problems in Engineering π₯ (π‘) β π₯ (π‘ β β (π‘)) 5 π where β [ ] π‘ =β [ ] β (π‘) π₯ (π‘) + π₯ (π‘ β β (π‘)) β 2 β« π₯ (π ) ππ β (π‘) π‘ββ(π‘) [ ] π = β (1 β βΜ (π‘)) [π1 π2 π7 π3 ] π[π1 π2 π7 π3 ] Ξ£[β(π‘)] Μ π₯ (π‘) β π₯ (π‘ β β (π‘)) [ × Ξ[ ] ] 2 π‘ π₯ (π‘) + π₯ (π‘ β β (π‘)) β π₯ (π ) ππ β« β (π‘) π‘ββ(π‘) [ ] π + (1 β βΜ (π‘)) [π1 π2 π7 π3 ] π[π1 π2 π7 π3 ] ; π½= β β β β β (π‘) π₯ (π‘ β β (π‘)) β π₯ (π‘ β β) [ ×[ π₯ (π‘ β β (π‘)) β π₯ (π‘ β β) ] π‘ββ(π‘) ] 2 π₯ (π‘ β β (π‘)) + π₯ (π‘ β β) β π₯ (π ) ππ β« β β β (π‘) π‘ββ [ ] π₯ (π‘) β π₯ (π‘ β β (π‘)) π ] [ ] [ 2 π‘ ] [ π₯ ππ π₯ + π₯ β β β β« (π ) (π‘) (π‘ (π‘)) ] [ β (π‘) π‘ββ(π‘) ] β€ β[ ] [ π₯ (π‘ β β (π‘)) β π₯ (π‘ β β) ] [ ] [ π‘ββ(π‘) ] [ 2 π₯ (π‘ β β (π‘)) + π₯ (π‘ β β) β π₯ (π ) ππ β« ] [ β β β (π‘) π‘ββ [ [ [ [ [ × Ξ¦[ [ [ [ [ (20) π ] π‘ββ(π‘) ] 2 π₯ (π‘ β β (π‘)) + π₯ (π‘ β β) β π₯ (π ) ππ β« β β β (π‘) π‘ββ [ ] [ × Ξ[ β (π‘) . β π₯ (π‘) β π₯3 (π‘ β β (π‘)) ] ] ] ] ] ], ] π₯ (π‘ β β (π‘)) β π₯ (π‘ β β) ] ] π‘ββ(π‘) ] 2 π₯ (π ) ππ π₯ (π‘ β β (π‘)) + π₯ (π‘ β β) β β« β β β (π‘) π‘ββ [ ] 2 π‘ π₯ (π ) ππ π₯ (π‘) + π₯ (π‘ β β (π‘)) β β« β (π‘) π‘ββ(π‘) π4Μ (π₯π‘ ) β€ ππ (π‘) π π1 βπ2 π1 βπ2 { } { { ]} [ } ] { [ } { 2 π ] [ π +π β2π π +π β 2π [ 1 2 1 2 4 ]} 4] [ × {β π΄ πΆπ π΄ πΆ β [ ] Ξ¦[ } π (π‘) { ] [ π2 βπ3 ] [ π βπ { ]} } 2 3 { } { } π +π β2π 5] [ 2 3 { [π2 +π3 β2π5 ]} + π½βΞ£1 + (1 β π½)βΞ£2 + Ξ < 0 implies It is clear that Ξ£[β(π‘)] Μ Μ π‘ ) < 0, which means that system (1) is asymptotically π(π₯ is affine and a convex combination stable. Notice that Ξ£[β(π‘)] Μ Μ Μ β€ π2 , then Ξ£[β(π‘)] can be on β(π‘) satisfying π1 β€ β(π‘) Μ = expressed as convex combinations of the vertices Ξ£[β(π‘)] Μ πΌΞ£[βπ1 ] + (1 β πΌ)Ξ£[βπ2 ] , πΌ β [0, 1]. Utilizing Lemma 2, then Ξ£[β(π‘)] + π½βΞ£1 + (1 β π½)βΞ£2 + Ξ < 0 holds, if and only if (12) Μ and (13) hold. This completes our proof. Remark 5. Recently, the reciprocally convex optimization technique and Wirtinger inequality to reduce the conservatism of stability criteria for linear systems with timevarying delay were proposed in [24, 25, 28] and [18, 21], respectively, and these methods were utilized in (18). In Lemma 1, it can be noticed that the term (1/(π β π))(π(π) β π(π))π π (π(π) β π(π)) is equal to Jensenβs inequality and that the newly appeared term (3/(π β π))Ξ¨π π Ξ¨ can reduce the LKF enlargement of the estimation. The usage of reciprocally convex optimization method avoids the enlargement of β(π‘) and β β β(π‘) while only introducing matrix π. Then, the convex optimization method is used to hanΜ π‘ ). During the proof procedure above, the deddle π(π₯ icated constructed LKF (11) has full information on the systems. Remark 6. Furthermore, we introduce terms π₯(π‘), π₯(π‘ β β) in π2 . Therefore, more information on the cross terms in Μ Μ β β) is utilized. To reduce π₯(π‘), π₯(π‘) and π₯(π‘ β β), π₯(π‘ π‘ββ(π‘) π(π‘,π ) π π(π‘,π ) ] π [ π₯(π‘ββ) ] ππ is the conservatism, the term β«π‘ββ [ π₯(π‘ββ) Μ chosen as LKF when π1 β€ β(π‘) β€ π2 . These considerations highlight the main differences in the construction of the LKF candidate in this paper. (18) Now, combining with (16)β(18), we get Μ Remark 7. When β(π‘) is not differentiable and β(π‘) is Μ β β(π‘)) cannot be utilized as the unknown, the state π₯(π‘ augmented vector π(π‘) by the methods presented in the proof of Theorem 4. Thus, we should modify the LKF which Μ β β(π‘)), so we set π, π = 0. Therefore, includes the term π₯(π‘ the corresponding stability criterion for C2 will be introduced as Corollary 8. πΜ (π₯π‘ ) β€ ππ (π‘) (Ξ£[β(π‘)] + π½βΞ£1 + (1 β π½) βΞ£2 + Ξ) π (π‘) , Μ (19) In Corollary 8, block entry matrices πΜπ (π‘) β R6π×π will be used and the following notations are defined for the sake of simplicity of matrix notation: = ππ (π‘) {β2 π΄ππΆπ π΄ πΆ βΞπΞ¦Ξ} π (π‘) . 6 Mathematical Problems in Engineering Table 1: Delay bounds β with different π2 and π1 = βπ2 . π2 Fridman and Shaked [12] He et al. [11] Sun et al. (2010) [20] Seuret and Gouaisbaut [18, Theorem 7] Theorem 4 Corollary 8 0.0 4.472 4.472 4.472 6.059 6.059 β πΜπ (π‘) = [π₯π (π‘) π₯π (π‘ β β (π‘)) π₯π (π‘ β β) 0.1 3.604 3.605 3.611 4.703 4.733 β 0.2 3.303 3.039 3.047 3.834 3.932 β 0.5 2.008 2.043 2.072 2.420 2.891 β 0.8 1.364 1.492 1.590 2.137 2.592 β π2 β₯ 1 or unknown 0.999 1.345 1.529 2.128 β 2.113 π‘ββ(π‘) 1 π‘ 1 π₯π (π ) ππ π₯π (π ) ππ π₯Μπ (π‘ β β)] , β« β« β (π‘) π‘ββ(π‘) β β β (π‘) π‘ββ π π Μ 1 = Sym ([0 0 πΜ4 ] π[π΄ Μπ 0 0] ) , Μπ πΜ6 πΜ1 β πΜ3 ] ) + Sym ([0 πΜ4 0] π[π΄ Ξ£ πΆ πΆ π π Μ 2 = Sym ([0 0 πΜ5 ] π[π΄ Μπ 0 0] ) , Μπ πΜ6 πΜ2 β πΜ3 ] ) + Sym ([0 πΜ5 0] π[π΄ Ξ£ πΆ πΆ Μπ π΄ πΆ (21) π = [π΄ π΅ 0 0 0 0] , π π π Μ = Sym ([Μ Μπ ] π[Μ Μπ ] β [Μ Μπ πΜ6 πΜ1 β πΜ3 ] ) + [Μ π1 πΜ3 0] π[π΄ π1 πΜ3 πΜ6 ] π[Μ π1 πΜ3 πΜ6 ] Ξ π1 πΜ1 π΄ π1 πΜ1 π΄ πΆ πΆ πΆ π Μπ 0 0] ) + β2 π΄ππΆπ π΄ πΆ β Ξπ Ξ¦Ξ. π1 0 πΜ1 β πΜ3 ] π[π΄ + Sym ([βΜ πΆ Corollary 8. For given scalar β β₯ 0 with C2, the system (1) is asymptotically stable, if there exist symmetric positive definite matrices π β R3π×3π , π β R3π×3π , and π β Rπ×π . and any matrices πππ β Rπ×π (π, π = 1, 2), such that the following LMIs are feasible: Μ1 + Ξ Μ < 0, Ξ£ Μ2 + Ξ Μ < 0, Ξ£ Finally, we can get Μ 2 + Ξ) Μ πΜ (π‘) ΜΜ (π₯π‘ ) β€ πΜπ (π‘) (π½βΞ£ Μ 1 + (1 β π½) βΞ£ π (25) with the augmented vector πΜπ (π‘) defined in (21) and it is easy Μ 1 + (1 β π½)βΞ£ Μ2 + Ξ Μ is a convex combination, to see that π½βΞ£ so we can see that (22) can guarantee the asymptotic stability for system (1). (22) 4. Numerical Examples Ξ¦ > 0, Μ 1, Ξ£ Μ2, Ξ Μ are defined in (21) and other matrices are where Ξ£ defined in Theorem 4. In this section, four examples are given to show the effectiveness of the proposed method. Proof. Example 9. Consider the linear system (1) with the parameters 3 Μ (π₯π‘ ) = βπ Μπ (π₯π‘ ) , π (23) π=1 where Μ1 (π₯π‘ ) = ππ (π‘) ππ (π‘) , π π‘ Μ2 (π₯π‘ ) = β« π π‘ββ Μ3 (π₯π‘ ) = β β« π π‘ π(π‘, π )π ππ (π‘, π ) ππ , π‘ β« π₯Μπ (π’) π π₯Μ (π’) ππ’ ππ . π‘ββ π (24) β2 0 π΄=[ ], 0 β0.9 β1 0 π΅=[ ]. β1 β1 (26) This system is a well-known delay-dependent stable system which has the analytical maximum allowable delay Μ = 0, βπ‘ β₯ 0. With the bound βmax = 6.1721 when β(π‘) Μ conditions 0 β€ β(π‘) β€ β and π1 β€ β(π‘) β€ π2 < 1, Table 1 shows that our results obtained by Theorem 4 improve the allowable maximum size of the delay for various π2 . For the case π2 is unknown, they show less conservatism compared to the results of [11, 12, 20]; they also show that the combined convex technique and the Wirtinger inequality methods are effective but fall short compared to the results of [18] for this case. Mathematical Problems in Engineering 7 Table 2: Delay bounds β with different π2 and π1 = 0. π2 0.00 0.05 0.10 0.50 π2 β₯ 1 or unknown Park and Ko [9] 1.99 1.81 1.75 1.61 1.60 Kim [14] 2.52 2.17 2.02 1.62 1.60 Theorem 4 3.03 2.82 2.78 2.59 β Corollary 8 β β β β 1.64 Table 3: Delay bounds β with different π2 and π1 = βπ2 . π2 Li et al. [5] 0.2 0.4 0.6 0.8 π2 β₯ 1 or unknown 1.6063 1.4119 1.2425 1.1077 β Park et al. [29, Theorem 2] 1.6492 1.5297 1.4489 1.3899 β Theorem 4 1.9464 1.7705 1.6646 1.5911 β Corollary 8 β β β β 1.4924 Table 4: Delay bounds β with different π2 and π1 = βπ2 . π2 0.5 0.9 π2 β₯ 1 or unknown Number of variables Li et al. [5] 0.62 0.60 β 10 He et al. [11] 0.59 0.58 β 12 He et al. [23] 0.63 0.62 β 14 Theorem 4 0.68 0.67 β 9 Corollary 8 β β 0.66 7 Example 10. Consider the linear system (1) with the parameters 0 1 π΄=[ ], β1 β1 0 0 π΅=[ ]. 0 β1 (27) Μ β€ π < 1, With the conditions 0 β€ β(π‘) β€ β and π1 β€ β(π‘) 2 our results obtained by Theorem 4 with the above systems are Μ is shown in Table 2. When β(π‘) is not differentiable or β(π‘) unknown, the corresponding results obtained by Corollary 8 are also included in Table 2. From Table 2, it can be seen that our results obtained both by Theorem 4 and by Corollary 8 improve the allowable maximum size of the delay for various π2 . Example 11. Consider the linear system (1) with the parameters Example 12. Consider the linear system (1) with the parameters β1 0 1 0 [ 0 ] β1 0 1 ] π΄=[ [β0.009 0.09 β0.04 0.04 ] , [ 0.09 0.09 0.04 β0.06] 1 0 0 0 [ 0 1 0 0 ] ] π΅=[ [β1.1789 β1.3096 β1.6629 β7.3974] . 0 0 0 ] [ 0 (29) Table 4 lists the comparison results for π2 and unknown π2 . It is clear that the results obtained in this paper are better than those in [5, 11, 23]. We can also see that the number of variables of our paper is less than that of others, so our methods can reduce the computational burden. 5. Conclusion β0.9 0.2 π΄=[ ], 0.1 β0.9 β1.1 β0.2 π΅=[ ]. β0.1 β1.1 (28) Our results obtained by Theorem 4 and by Corollary 8 are listed in Table 3. From Table 3, one can see that our results for Example 11 give larger upper bounds of time delay than the ones in [5, 29]. The problem of delay-dependent stability for linear system with time-varying delay is investigated in this paper. By using a novel combined convex technique and Wirtinger inequality to deal with the derivative of Lyapunov-Krasovskii functional, a less conservative delay-dependent stability criterion expressed in terms of LMIs has been presented. Four illustrative examples are given to demonstrate the reduced 8 conservativeness of the proposed method and improvements over some existing ones. Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper. Acknowledgment This work is supported by the National Nature Science Foundation under Grant 61374154. References [1] Y. Ariba and F. Gouaisbaut, βAn augmented model for robust stability analysis of time-varying delay systems,β International Journal of Control, vol. 82, no. 9, pp. 1616β1626, 2009. [2] P. Niamsup, K. Mukdasai, and V. N. Phat, βImproved exponential stability for time-varying systems with nonlinear delayed perturbations,β Applied Mathematics and Computation, vol. 204, no. 1, pp. 490β495, 2008. [3] W. Qian, S. Cong, Y. Sun, and S. Fei, βNovel robust stability criteria for uncertain systems with time-varying delay,β Applied Mathematics and Computation, vol. 215, no. 2, pp. 866β872, 2009. [4] S. Xu and J. Lam, βOn equivalence and efficiency of certain stability criteria for time-delay systems,β IEEE Trans on Automatic Control, vol. 52, no. 1, pp. 95β101, 2007. [5] T. Li, L. Guo, and L. Wu, βSimplified approach to the asymptotical stability of linear systems with interval time-varying delay,β IET Control Theory & Applications, vol. 3, no. 2, pp. 252β260, 2009. [6] P. Park, βA delay-dependent stability criterion for systems with uncertain time-invariant delays,β IEEE Transactions on Automatic Control, vol. 44, no. 4, pp. 876β877, 1999. [7] E. Fridman and U. Shaked, βAn improved stabilization method for linear time-delay systems,β IEEE Transactions on Automatic Control, vol. 47, no. 11, pp. 1931β1937, 2002. [8] S. K. Nguang, P. Shi, and S. Ding, βDelay-dependent fault estimation for uncertain time-delay nonlinear systems: an LMI approach,β International Journal of Robust and Nonlinear Control, vol. 16, no. 18, pp. 913β933, 2006. [9] P. G. Park and J. W. Ko, βStability and robust stability for systems with a time-varying delay,β Automatica, vol. 43, no. 10, pp. 1855β 1858, 2007. [10] W. Qian, S. Cong, T. Li, and S. Fei, βImproved stability conditions for systems with interval time-varying delay,β International Journal of Control, Automation and Systems, vol. 10, no. 6, pp. 1146β1152, 2012. [11] Y. He, Q. Wang, C. Lin, and M. Wu, βDelay-range-dependent stability for systems with time-varying delay,β Automatica, vol. 43, no. 2, pp. 371β376, 2007. [12] E. Fridman and U. Shaked, βA descriptor system approach to π»β control of linear time-delay systems,β IEEE Transactions on Automatic Control, vol. 47, no. 2, pp. 253β270, 2002. [13] R. Sipahi, S. Niculescu, C. T. Abdallah, W. Michiels, and K. Gu, βStability and stabilization of systems with time delay: limitations and opportunities,β IEEE Control Systems Magazine, vol. 31, no. 1, pp. 38β65, 2011. Mathematical Problems in Engineering [14] J. Kim, βNote on stability of linear systems with time-varying delay,β Automatica, vol. 47, no. 9, pp. 2118β2121, 2011. [15] O. M. Kwon, S. M. Lee, J. H. Park, and E. J. Cha, βNew approaches on stability criteria for neural networks with interval time-varying delays,β Applied Mathematics and Computation, vol. 218, no. 19, pp. 9953β9964, 2012. [16] X. Jiang and Q. L. Han, βNew stability criteria for linear systems with interval time-varying delay,β Automatica, vol. 44, no. 10, pp. 2680β2685, 2008. [17] H. Shao, βNew delay-dependent stability criteria for systems with interval delay,β Automatica, vol. 45, no. 3, pp. 744β749, 2009. [18] A. Seuret and F. Gouaisbaut, βWirtinger-based integral inequality: application to time-delay systems,β Automatica, vol. 49, no. 9, pp. 2860β2866, 2013. [19] Z. G. Wu, J. H. Park, H. Su, and J. Chu, βNew results on exponential passivity of neural networks with time-varying delays,β Nonlinear Analysis: Real World Applications, vol. 13, no. 4, pp. 1593β1599, 2012. [20] J. Sun, G. P. Liu, J. Chen, and D. Rees, βImproved delay-rangedependent stability criteria for linear systems with time-varying delays,β Automatica, vol. 46, no. 2, pp. 466β470, 2010. [21] K. Liu and E. Fridman, βWirtingerβs inequality and Lyapunovbased sampled-data stabilization,β Automatica, vol. 48, no. 1, pp. 102β108, 2012. [22] D. Yue, E. Tian, Y. Zhang, and C. Peng, βDelay-distributiondependent stability and stabilization of T-S fuzzy systems with probabilistic interval delay,β IEEE Transactions on Systems, Man, and Cybernetics B: Cybernetics, vol. 39, no. 2, pp. 503β516, 2009. [23] Y. He, Q. Wang, L. Xie, and C. Lin, βFurther improvement of free-weighting matrices technique for systems with timevarying delay,β IEEE Transactions on Automatic Control, vol. 52, no. 2, pp. 293β299, 2007. [24] P. Park, J. W. Ko, and C. Jeong, βReciprocally convex approach to stability of systems with time-varying delays,β Automatica, vol. 47, no. 1, pp. 235β238, 2011. [25] J. Jiao, βDelay-dependent stability criteria for singular systems with interval time-varying delay,β Mathematical Problems in Engineering, vol. 2012, Article ID 570834, 16 pages, 2012. [26] H. G. Zhang, Z. S. Wang, and D. R. Liu, βGlobal asymptotic stability and robust stability of a class of Cohen-Grossberg neural networks with mixed delays,β IEEE Transactions on Circuits and Systems, I: Regular Papers, vol. 56, no. 3, pp. 616β 629, 2009. [27] H. Zhang, Z. Wang, and D. Liu, βGlobal asymptotic stability of recurrent neural networks with multiple time-varying delays,β IEEE Transactions on Neural Networks, vol. 19, no. 5, pp. 855β 873, 2008. [28] W. Qian and H. R. Karimi, βNew delay-dependent stability conditions for time-varying delay systems,β Mathematical Problems in Engineering, vol. 2013, Article ID 360924, 6 pages, 2013. [29] M. J. Park, O. M. Kwon, J. H. Park, and S. M. Lee, βA new augmented Lyapunov-Krasovskii functional approach for stability of linear systems with time-varying delays,β Applied Mathematics and Computation, vol. 217, no. 17, pp. 7197β7209, 2011. [30] Q. L. Han, βA discrete delay decomposition approach to stability of linear retarded and neutral systems,β Automatica, vol. 45, no. 2, pp. 517β524, 2009. [31] X. M. Zhang and Q. L. Han, βStability of linear systems with interval time-varying delays arising from networked control Mathematical Problems in Engineering systems,β in Proceedings of the 36th Annual Conference of the IEEE Industrial Electronics Society (IECON β10), pp. 225β230, November 2010. [32] T. Li, T. Wang, A. Song, and S. Fei, βCombined convex technique on delay-dependent stability for delayed neural networks,β IEEE Transactions on Neural Networks and Learning Systems, vol. 24, no. 9, pp. 1459β1466, 2013. [33] I. E. K¨ose, F. Jabbari, and W. E. Schmitendorf, βA direct characterization of L2-gain controllers for LPV systems,β IEEE Transactions on Automatic Control, vol. 43, no. 9, pp. 1302β1307, 1998. 9 Advances in Operations Research Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Advances in Decision Sciences Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Journal of Applied Mathematics Algebra Hindawi Publishing Corporation http://www.hindawi.com Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Journal of Probability and Statistics Volume 2014 The Scientific World Journal Hindawi Publishing Corporation http://www.hindawi.com Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 International Journal of Differential Equations Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Volume 2014 Submit your manuscripts at http://www.hindawi.com International Journal of Advances in Combinatorics Hindawi Publishing Corporation http://www.hindawi.com Mathematical Physics Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Journal of Complex Analysis Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 International Journal of Mathematics and Mathematical Sciences Mathematical Problems in Engineering Journal of Mathematics Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Discrete Mathematics Journal of Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Discrete Dynamics in Nature and Society Journal of Function Spaces Hindawi Publishing Corporation http://www.hindawi.com Abstract and Applied Analysis Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 International Journal of Journal of Stochastic Analysis Optimization Hindawi Publishing Corporation http://www.hindawi.com Hindawi Publishing Corporation http://www.hindawi.com Volume 2014 Volume 2014
© Copyright 2024 ExpyDoc