Research article

An improved reachable set estimation for time-delay linear systems with peak-bounded inputs and polytopic uncertainties via augmented zero equality approach

  • Received: 13 October 2022 Revised: 05 December 2022 Accepted: 06 December 2022 Published: 26 December 2022
  • MSC : 34D20, 34K20, 34K25

  • This paper proposes an improved estimation of the reachable set (RS) analysis in linear systems with polytopic uncertainties, peak-bounded inputs and time-varying delay. Inspired by past literature, Lyapunov-Krasovskii's functionals are dealt for treating the time-delay and bounding analysis effectively. So, the proposed method focuses on Lyapunov-Krasovskii's functionals via various time-delay conditions for linear systems. Based on the Lyapunov method, some integral inequalities, useful zero equalities, and the augmented zero equality approach are introduced. The results are expressed in terms of linear matrix inequalities, which are easy to get optimized solutions for obtaining guaranteed minimum RS of system dynamics. Finally, two numerical examples are shown to judge that the proposed estimation method can lead to less conservative results.

    Citation: Yonggwon Lee, Yeongjae Kim, Seunghoon Lee, Junmin Park, Ohmin Kwon. An improved reachable set estimation for time-delay linear systems with peak-bounded inputs and polytopic uncertainties via augmented zero equality approach[J]. AIMS Mathematics, 2023, 8(3): 5816-5837. doi: 10.3934/math.2023293

    Related Papers:

    [1] Xipan Zhang, Changchun Shen, Dingju Xu . Reachable set estimation for neutral semi-Markovian jump systems with time-varying delay. AIMS Mathematics, 2024, 9(4): 8043-8062. doi: 10.3934/math.2024391
    [2] Sheng-Ran Jia, Wen-Juan Lin . Adaptive event-triggered reachable set control for Markov jump cyber-physical systems with time-varying delays. AIMS Mathematics, 2024, 9(9): 25127-25144. doi: 10.3934/math.20241225
    [3] Beibei Su, Liang Zhao, Liang Du, Qun Gu . Research on the ellipsoidal boundary of reachable sets of neutral systems with bounded disturbances and discrete time delays. AIMS Mathematics, 2024, 9(6): 16586-16604. doi: 10.3934/math.2024804
    [4] Seunghoon Lee, Youngjae Kim, Yonggwon Lee, Myeongjin Park, Ohmin Kwon . Relaxed stability conditions for linear systems with time-varying delays via some novel approaches. AIMS Mathematics, 2021, 6(3): 2454-2467. doi: 10.3934/math.2021149
    [5] Zerong Ren, Junkang Tian . Improved stability criterion for distributed time-delay systems via a generalized delay partitioning approach. AIMS Mathematics, 2022, 7(7): 13402-13409. doi: 10.3934/math.2022740
    [6] Erfeng Xu, Wenxing Xiao, Yonggang Chen . Local stabilization for a hyperchaotic finance system via time-delayed feedback based on discrete-time observations. AIMS Mathematics, 2023, 8(9): 20510-20529. doi: 10.3934/math.20231045
    [7] Boonyachat Meesuptong, Peerapongpat Singkibud, Pantiwa Srisilp, Kanit Mukdasai . New delay-range-dependent exponential stability criterion and H performance for neutral-type nonlinear system with mixed time-varying delays. AIMS Mathematics, 2023, 8(1): 691-712. doi: 10.3934/math.2023033
    [8] Guijun Xing, Huatao Chen, Zahra S. Aghayan, Jingfei Jiang, Juan L. G. Guirao . Tracking control for a class of fractional order uncertain systems with time-delay based on composite nonlinear feedback control. AIMS Mathematics, 2024, 9(5): 13058-13076. doi: 10.3934/math.2024637
    [9] Yakufu Kasimu, Gulijiamali Maimaitiaili . Non-fragile H filter design for uncertain neutral Markovian jump systems with time-varying delays. AIMS Mathematics, 2024, 9(6): 15559-15583. doi: 10.3934/math.2024752
    [10] Liping Luo, Yonggang Chen, Jishen Jia, Kaixin Zhao, Jinze Jia . Event-triggered anti-windup strategy for time-delay systems subject to saturating actuators. AIMS Mathematics, 2024, 9(10): 27721-27738. doi: 10.3934/math.20241346
  • This paper proposes an improved estimation of the reachable set (RS) analysis in linear systems with polytopic uncertainties, peak-bounded inputs and time-varying delay. Inspired by past literature, Lyapunov-Krasovskii's functionals are dealt for treating the time-delay and bounding analysis effectively. So, the proposed method focuses on Lyapunov-Krasovskii's functionals via various time-delay conditions for linear systems. Based on the Lyapunov method, some integral inequalities, useful zero equalities, and the augmented zero equality approach are introduced. The results are expressed in terms of linear matrix inequalities, which are easy to get optimized solutions for obtaining guaranteed minimum RS of system dynamics. Finally, two numerical examples are shown to judge that the proposed estimation method can lead to less conservative results.



    Dynamical systems have been recognized as one of the most important studies in the engineering field. Developments of the industrial machine, which has various dynamics from simple mechanical equipment to complex algorithm robots, are good examples for showing an importance of dynamical systems [1,2]. Nowadays, as the need for heavy industrial equipment increases, the system engineers are interested in designing systems that have peak value inputs [3]. As discussed in [4,5], the reachable set estimation (RSE) has been selected to solve the minimization problems of peak gain and disturbance problems. In other words, the result of studying RSE in dynamic systems shows the ellipsoid bounded set of system trajectories with peak value inputs.

    There are two well-known unavoidable phenomena when designing or operating dynamic hardware systems. The first is the systematic uncertainty phenomenon and the other is a time delay [6,7]. The occurrence of them can derive low performance and system fault [8]. So, the bounding analysis with Lyapunov-Krasovskii's Functionals (LKFs) has been selected to design feedback controllers and find the stable region of the system with various conditions [9,10]. By constructing appropriate LKFs, past works [6,11] could investigate the RSE with bounding analysis. Furthermore, time-delay systems can be investigated in RSE problems with the uncertainties and disturbances phenomena by the LKFs methods [4,6,12].

    The RSE of time-delay systems with bounded peak inputs gives essential meanings to dynamic differential systems [8,13]. With the aforementioned concerns, studies of RSE have been developed in various systems. For adopting the practical dynamic systems, discrete-time systems [14,15,16], sampled-data systems [17], switched systems [18] have been considered. Furthermore, fuzzy systems [19,20] that can provide effective solutions for nonlinear systems, Markov jump systems [21] for controlling complex uncertainties, and neural networks [22,23,24], which applied the mentioned techniques, are received attention in RSE research. As the above kinds of literature pointed out, some mathematical techniques affect improved estimation. The expression of polytopic uncertainties was used frequently in [6,7,25]. Jensen's inequality [26] and Wirtinger-based integral inequality (WBII) [27], which are represented as integral inequalities, are used for treating single or multi integral terms in the derivative of LKFs. Many works showed that utilizing these inequalities can expand the feasible region of stability criteria in time-delay systems [28,29,30]. The reciprocally convex approach (RCA) derives a tighter bound with an appropriate matrix [31,32,33]. It is well-known that expanding augmented vectors in integral terms of the Lyapunov function leads to less conservative results [34]. However, existing RSE methods are limited to expanding augmented vectors in integral terms of Lyapunov functions by containing eα(st). In order to compensate for this limitation, an integral term of the Lyapunov function candidate without eα(st) can be considered for RSE [35]. In [35], the absence of the eα(st) method focused on calculating time-varying delay. This paper concentrates on the expanding augmented vectors for improved RSE with the mentioned method.

    To get more optimized reachable bounding set, this paper introduces augmented integral terms of LKFs. And an advanced generalized integral inequality [36] for a derivative term of double integral Lyapunov function is utilized. And the convex parameters are treated by RCA [37]. Finally, inspired by [38,39], the appropriate augmented vectors and free-weighting matrices are used for the Augmented zero equality approach (AZEA) [40,41]. With the mentioned approaches, the reachable bounding set for linear time-delay systems with polytopic uncertainties and bounded peak inputs is proposed. For the proving proposed suggestions, next section introduces some inequalities and mathematical facts. In Section 3, Theorems and Corollary are organized by the conditions of time-varying delay η(t) and its time-derivative ˙η(t). Section 4 introduces our investigation results and compares them with the past studies. Finally, two numerical examples are included to prove the superiority of proposed approaches with listed ellipsoidal bounds sizes and state trajectories.

    Notation. Rn is the n-dimensional Euclidean space, Rm×n denotes the set of m×n real matrix. MSn+ denotes the sets of positive definite n×n matrix. NSn denotes the sets of symmetric n×n matrix. P>0 means that the matrix P is a real symmetric positive definite matrix. I and In denote the identity matrix with appropriate dimension and n×n identity matrix, respectively. 0m and 0m×k denote the m×m and m×k sizes zero matrices, respectively. refers to the Euclidean vector norm and the induced matrix norm. diag{} denotes the block diagonal matrix. The symmetric elements will be denoted by . For a given matrix XRm×n, such that rank(X)=r, we define XRn×(nr) as the right orthogonal complement of X; i.e., XX=0. X[α, β(t)] represents the value of function X is dependent on the scalar α and scalar function β(t). Sym{X} denotes X+XT. col{} is the column matrices.

    Consider the following bounded peaked input linear systems with time-varying delay [7,42,43]

    ˙x(t)=(A+ΔA(t))x(t)+(D+ΔD(t))x(tη(t))+(B+ΔB(t))w(t),t>0,x(s)0,s[η, 0],η>0, (2.1)

    where x(t)Rn is the state vector. A, ΔA(t)Rn×n, D, ΔD(t)Rn×n and B, ΔB(t)Rn×m. A, D, B are known constant matrices. ΔA(t), ΔD(t), ΔB(t) are uncertain matrices which belong to a given polytope by a linear convex-hull of matrices Au,k, Du,k and Bu,k

    Λ(t)=Nk=1λk(t)Λk (2.2)

    where λk(t)[0,1], Nk=1λk(t)=1, Λ(t)=[ΔA(t), ΔD(t), ΔB(t)]. And Λk=[Au,k, Du,k, Bu,k] (k=1,,N) are the vertices. Au,k, Du,k, Bu,k are known constant matrices with appropriate dimensions. w(t)Rm is the input in the form

    wT(t)w(t)w2m. (2.3)

    The time-varying delay η(t) is considered in this paper. It is assumed that the time-varying delays have the following conditions as:

    Case 1.

    0η(t)η,˙η(t)μ,t>0, (2.4)

    Case 2.

    0 ηmη(t)η,μ˙η(t)μ,t>0. (2.5)

    A reachable set that bounds the state of systems (2.1) is defined by RxΔ= {x(t)Rn:x(t) and w(t) satisfy Eqs (2.1) and (2.3)}. As Boyd and Wang pointed out [11,12], this RSE problem has the same meaning as the problem of finding an ellipsoid bound to the Rx. The ellipsoid can be defined by

    RϵΔ={xRn, xTPx1}, (2.6)

    where matrix P has constant value and positive definite. Thus, instead of solving the optimized RSE problem, our work can focus on finding a solution for the smallest ellipsoid bound problem.

    The main goal of this paper is to calculate the optimized RS bounds of the system (2.1) with w(t). With the following adopted lemmas, the next section derives the construction of suitable LKFs for system (2.1) and sufficient conditions.

    Lemma 1. [11] Let V(x(t)) be a LKF for system (2.1) with V(x(0))=0 and wT(t)w(t)w2m. If

    ˙V(x(t))+αV(x(t))αw2mwT(t)w(t)0, α>0, (2.7)

    then, V(x(t))1,  t0.

    Lemma 2. [36] ((l=0,2), k=0) For a matrix M>0, the following inequality is satisfied:

    Φ0(α)li=0(2i+1)TΥTi(α)MΥi(α), (2.8)

    where Φ0(α)=(ba)baαT(s)Mα(s)ds, and the Υ0(α)=baα(s)ds, Υ1(α)=2bababsα(v)dvdsbaα(s)ds and Υ2(α)=12(ba)2babsbvα(z)dzdvds6bababsα(v)dvds+baα(s)ds.

    Lemma 3. [31] Let N1Rn×n, N2Rm×m be positive definite matrices, if there exists any matrix XRn×m such that [N1XXTN2]0, then the inequality

    [1αN10011αN2][N1XXTN2] (2.9)

    holds for all α(0, 1).

    Lemma 4. [38] Let SRd, ζRn, Φ=ΦTSn, and BRm×n. For each sS, the following statements are equivalent:

    (i) ζTΦ(s)ζ<0,B(s)ζ=0,ζ0,

    (ii) Ψ(s)Rn×m:Φ(s)+Ψ(s)B(s)+BT(s)ΨT(s)<0,

    (iii) (B(s))TΦ(s)B(s)<0.

    The RSE of the system (2.1) is proposed in this section. To avoid complicated expression, some notations of matrices are defined as

    (3.1)

    Now, we have the following theorem.

    Theorem 1. For given scalars η>0, w2m>0 and μ>0, the RSs of the system (2.1) with delay conditions of (2.4) are bounded by an ellipsoid Rϵ (2.6), if there exist matrices RS4n+, R1, N, G, QkSn+ (k=1, 2), Pi (i=1, 2) Sn, any matrix SR6n×6n, and a scalar α>0, such that the following linear matrix inequalities(LMIs) hold:

    (Γj,[0])TΞ(Γj,[0])0,(Γj,[η])TΞ(Γj,[η])0 (j=1, , N),Q10, Q20, Ω0, R˜R1, (3.2)

    where Ξ and Γj,[η(t)] are defined in (3.1), respectively.

    Proof. For positive matrices R, R1, N, G, Qk (k=1, 2), let us choose the following LKFs candidate as

    VT(t)=3k=1VTk(t), (3.3)

    where

    VT1(t)=BT1(t)RB1(t),VT2(t)=ηttη˙xT(s)N˙x(s)ds+ttη(t)xT(s)Gx(s)ds,VT3(t)=ηttηtseα(ut)˙xT(u)Q1˙x(u)duds+ηttηtseα(ut)xT(u)Q2x(u)duds,

    where B1(t)=col{x(t), x(tη), ttηx(s)ds, ttηts˙x(u)duds}. The ˙VT1(t) and ˙VT2(t) can be calculated as

    ˙VT1(t)=2BT1(t)R˙B1(t)=ζT(t)˜Ξ1ζ(t)αVT1(t)+αVT1(t)=0=ζT(t)Ξ1ζ(t)αVT1(t), (3.4)
    ˙VT2(t)=η˙BT2(t, tη)[N0nN]˙B2(t, tη)+BT2(t, tη(t))[G0n(1˙η(t))G]×B2(t, tη(t))ζT(t)Ξ2ζ(t), (3.5)

    where B2(t, s)=col{x(t), x(s)}.

    Then, the ˙VT3(t) can be expressed as

    ˙VT3(t)=ηttηeα(tt)BT3(t)QB3(t)dsηttηeα(st)BT3(s)QB3(s)ds+ηttηtseα(st)ddt(BT3(u)QB3(u))dudsαVT3(t)=η2BT3(t)QB3(t)ζT(t)˜Ξ3ζ(t)ηttηeα(st)BT3(s)QB3(s)dsαVT3(t)αVT2(t)+αVT2(t)=0=ζT(t)˜Ξ3ζ(t)ηttη(t)eα(st)BT3(s)QB3(s)ds+αVT21(t)+αVT23(t)ηtη(t)tηeα(st)BT3(s)QBT3(s)ds+αVT22(t)αVT2(t)αVT3(t), (3.6)

    where VT2(t)=ηttη(t)˙xT(s)N˙x(s)dsVT21(t)+ηtη(t)tη˙xT(s)N˙x(s)dsVT22(t)+ttη(t)xT(s)Gx(s)dsVT23(t), and B3(u)=col{˙x(u), x(u)}.

    Inspired by [44], the zero equations with matrices Pi=PTi (i=1, 2) are considered as

    0=ηBT2(t,tη(t))[P10n0nP1]B2(t, tη(t))ηttη(t)BT3(s)[0nP1PT10n]B3(s)ds, (3.7)
    0=ηBT2(tη(t),tη)[P20n0nP2]B2(tη(t), tη)ηtη(t)tηBT3(s)[0nP2PT20n]B3(s)ds. (3.8)

    An upper bound of the first integral term of (3.6) with αVT21(t), αVT23(t) and Eq (3.7) can be obtained as

    ηttη(t)eα(st)BT3(s)QB3(s)ds+αVT21(t)+αVT23(t)=ηttη(t)eα(st)BT3(s)QB3(s)dsηttη(t)BT3(s)[0nP1PT10n]B3(s)ds+ηBT2(t, tη(t))[P10n0nP1]B2(t, tη(t))+αVT21(t)+αVT23(t)ηeαηttη(t)BT3(s)QB3(s)dsηeαηttη(t)BT3(s)(1eαη[αNP1PT1αηG])B3(s)ds+ηBT2(t, tη(t))[P10n0nP1]B2(t, tη(t)). (3.9)

    With the Lemma 2 (l=2) and an LMI condition, integral terms of (3.9) can be bounded as

    ηeαηttη(t)BT3(s)QB3(s)dsηeαηttη(t)BT3(s)(1eαη[αNP1PT1αηG])B3(s)ds+ηBT2(t, tη(t))[P10n0nP1]B2(t, tη(t))ηeαηη(t)(ΛT1,1(t)(Q+1eαη[αNP1PT1αηG]Q1)Λ1,1(t)+3ΛT1,2(t)Q1Λ1,2(t)+5ΛT1,3(t)Q1Λ1,3(t))+ηBT2(t, tη(t))[P10n0nP1]B2(t, tη(t)), (3.10)

    where Λ1,1(t)=ttη(t)B3(s)ds, Λ1,2(t)=ttη(t)B3(s)ds2η(t)ttη(t)tsB3(u)duds and Λ1,3(t)=ttη(t)B3(s)ds6η(t)ttη(t)tsB3(u)duds+12η2(t)ttη(t)tstuB3(v)dvduds.

    Likewise, the another integral term of (3.6) with αVT22(t) and Eq (3.8) are bounded as

    ηtη(t)tηeα(st)BT3(s)QB3(s)ds+αVT22(t)ηeαηtη(t)tηBT3(s)QB3(s)dsηeαηtη(t)tηBT3(s)(1eαη[αNP2PT20n])B3(s)ds+ηBT2(tη(t), tη)[P20n0nP2]B2(tη(t), tη). (3.11)

    With the Lemma 2 (l=2) and an LMI condition, integral terms of (3.11) can be bounded as

    ηeαηtη(t)tηBT3(s)QB3(s)dsηeαηtη(t)tηBT3(s)(1eαη[αNP2PT20n])B3(s)ds+ηBT2(tη(t), tη)[P20n0nP2]B2(tη(t), tη)ηeαηηη(t)(ΛT2,1(t)(Q+1eαη[αNP2PT20n]Q2)Λ2,1(t)+3ΛT2,2(t)Q2Λ2,2(t)+5ΛT2,3(t)Q2Λ2,3(t))+ηBT2(tη(t), tη)[P20n0nP2]B2(tη(t), tη), (3.12)

    where Λ2,1(t)=tη(t)tηB3(s)ds, Λ2,2(t)=tη(t)tηB3(s)ds2ηη(t)tη(t)tηtη(t)sB3(u)duds and Λ2,3(t)=tη(t)tηB3(s)ds6ηη(t)tη(t)tηtη(t)sB3(u)duds+12(ηη(t))2tη(t)tηtη(t)stη(t)uB3(v)dvduds.

    And then, by utilizing Lemma 3, the sum of (3.10) and (3.12) can be written and bounded as

    ηeαηη(t)[Λ1,1(t)Λ1,2(t)Λ1,3(t)]TΛT1(t)[Q102n02n3Q102n5Q1]Qaug,1Λ1(t)ηeαηηη(t)[Λ2,1(t)Λ2,2(t)Λ2,3(t)]TΛT2(t)[Q202n02n3Q202n5Q2]Qaug,2Λ2(t)+ηBT4(t)[P10n0nP2P10nP2]PaugB4(t)eαη[Λ1(t)Λ2(t)]T[Qaug,1SSTQaug,2]Ω[Λ1(t)Λ2(t)]+ηBT4(t)PaugB4(t). (3.13)

    From (3.6) to (3.13), an upper bound of ˙VT3(t) can be obtained as

    ˙VT3(t)ζT(t)˜Ξ3ζ(t)eαη[Λ1(t)Λ2(t)]TΩ[Λ1(t)Λ2(t)]+ηBT4(t)PaugB4(t)αVT2(t)αVT3(t)=ζT(t)Ξ3ζ(t)αVT2(t)αVT3(t), (3.14)

    where B4(t)=col{x(t), x(tη(t)), x(tη)} and other notations are defined in (3.1).

    The system (2.1) with polytope expression (2.2) and some equations with vector ζ(t) can be considered as

    [eT4+AjeT1+DjeT2+BjeT16]Γ1,jζ(t)=0 (j=1, ,N), (3.15)
    [η(t)eT8eT10]Γ2,[η(t)]ζ(t)=0, (3.16)
    [(ηη(t))eT9eT11]Γ3,[η(t)]ζ(t)=0, (3.17)
    [η(t)eT6eT14]Γ4,[η(t)]ζ(t)=0, (3.18)
    [(ηη(t))eT7eT15]Γ5,[η(t)]ζ(t)=0, (3.19)

    where Γ1,jζ(t) (j=1, , N }), Γi,[η(t)]ζ(t) (i=2, , 5) represent the zero equations.

    By combining the (3.15)–(3.19) and the free-weighting matrices ϕ1,j (j = 1, , N), ϕi,k (i = 2 , 5, k = 1, 2) R(15n+m)×n, the zero equations can be obtained as

    ζT(t)(Φj,kΓj,[η(t)]+ΓTj,[η(t)]ΦTj,k)ζ(t)=0 (j=1, , N, k=1, 2), (3.20)

    with the relation Φj,k=Υ[ϕ1,j, ϕ2,k, , ϕ5,k], Γj,[η(t)]=col{Γ1,j, Γ2[η(t)], , Γ5[η(t)]}.

    Therefore, from (3.4)–(3.14) and (3.20), the ˙VT(t)+αVT(t)αw2mwT(t)w(t) can be bounded as

    ˙VT(t)+αVT(t)αw2mwT(t)w(t)ζT(t)(Ξ1+Ξ2+Ξ3αw2me16eT16+Sym{Φj,kΓj,[η(t)]})ζ(t). (3.21)

    If the following inequality is negative definite, the chosen LKFs (3.3) can satisfy the condition VT(t)1 by Lemma 1.

    Ξ1+Ξ2+Ξ3αw2me16eT16+Sym{Φj,kΓj,[η(t)]}0subject toΓj,[η(t)]ζ(t)=0, (3.22)

    where the Φk,1 with η(t)=0 and the Φk,2 with η(t)=η are defined, respectively.

    Since the Γj,[η(t)] is dependent on system polytope and time-delay η(t)[0,η], if the following inequalities:

    Ξ1+Ξ2+Ξ3αw2me16eT16+Sym{Φj,1Γj,[0]}0, (3.23)
    Ξ1+Ξ2+Ξ3αw2me16eT16+Sym{Φj,2Γj,[η]}0 (j=1, , N)  (3.24)

    hold, then inequality (3.22) is satisfied.

    Finally, by utilizing of AZEA according to Lemma 4, (3.23) and (3.24) can be described as

    (Γj,[0])T(Ξ1+Ξ2+Ξ3αw2me16eT16Ξ)(Γj,[0])0, (3.25)
    (Γj,[η])T(Ξ1+Ξ2+Ξ3αw2me16eT16Ξ)(Γj,[η])0 (j=1, , N). (3.26)

    For satisfying definition (2.6), a matrix ˜R1R4n×4n, which was inspired by Wang et al. [12], is defined as

    R[R10n×3n03n×3n]=˜R1. (3.27)

    From (3.3)–(3.27) and Lemma 1, it is easy to guarantee that xT(t)R1x(t)VT1(t)VT(t)1. Thus, the following condition

    [ˉδInInR1]0 (3.28)

    can be derived from xT(t)R1x(t)1. Then, if conditions (3.2) and (3.28) satisfy, the RS of the system (2.1) is contained in the ellipsoid (2.6). By the Schur complement, the condition (3.28) represents R11/ˉδIn=δIn where δ is an ellipsoidal parameter. This completes our proof.

    Remark 1. In (3.21), adding zero equalities with free-weighting matrices can derive improved estimation results. However, the free-weighting matrices Φj,k have an enormous amount of computational burden. This fatal disadvantage makes the researcher calculate the trade-off. As past work [41] showed, AZEA can eliminate the concerns of the computational burden by applying finsler's lemma. So, a more optimized reachable bounding set is proposed with AZEA.

    In the following corollary, the time-delay condition when an upper bound of ˙η(t) is unknown can be considered. To prove them with simplicity, the following LKFs and notations are rewritten.

    QC,k=Q+1eαη(αNC+[0nPi0n])(k=1, 2),QC aug,k=[QC,k02n02n3QC,k02n5QC,k](k=1, 2),ΩC=[QC aug,1SQC aug,2],ΞC2=η[e4, e1]NC[e4, e1]Tη[e5, e3]NC[e5, e3]T,ΞC3=˜Ξ3eαη[Λ1, Λ2]ΩC[Λ1, Λ2]T+η[e1, e2, e3]Paug[e1, e2, e3]T,ΞC=Ξ1+ΞC2+ΞC3αw2me16eT16. (3.29)

    Corollary 1. For a given scalar η>0, the RSs of the system (2.1) with time-delay condition 0η(t)η is bounded by an ellipsoid Rϵ (2.6), if there exist matrices RS4n+, R1Sn+, NC, QS2n+, Pi (i=1, 2) Sn, any matrix SR6n×6n, and a scalar α>0, such that the following LMIs hold:

    (Γj,[0])TΞC(Γj,[0])0,(Γj,[η])TΞC(Γj,[η])0 (j=1, , N),QC,10, QC,20, ΩC0, R˜R, (3.30)

    where ΞC, QC,k and ΩC are defined in (3.29), respectively. Other notations are defined in (3.1).

    Proof. In order to discuss the delay conditions 0η(t)η and unknown ˙η(t), let us choose the LKFs candidate as

    VC(t)=3k=1VCk(t), (3.31)

    where

    VC1(t)=VT1(t),VC2(t)=ηttηBT3(s)NCB3(s)ds,VC3(t)=ηttηtseα(ut)BT3(u)QB3(u)duds.

    The ˙VC2(t) can be calculated as

    ˙VC2(t)=ηBT3(t)NCB3(t)ηBT3(tη)NCB3(tη)=ζT(t)ΞC2ζ(t). (3.32)

    And the expressions of ˙VC1(t) and ˙VC3(t) from (3.31) are similar to (3.4) and (3.6), respectively.

    The VC2(t) derives more simple results than VT2(t). In (3.10), the absence of intergral term, which has interval from tη(t) to t makes difference. So, integral term of VC3(t) can be written as

    ηeαηttη(t)BT2(s)QB2(s)dsηeαηttη(t)BT2(s)1eαη(αNC+[0nP1PT10n])B2(s)dsηeαηη(t)(ΛT1,1(t)QC,1Λ1,1(t)+3ΛT1,2(t)QC,1Λ1,2(t)+5ΛT1,3(t)QC,1Λ1,3(t))+ηBT2(t, tη(t))[P10n0nP1]BT2(t, tη(t)) (3.33)

    where QC,1=Q+1eαη(αNC+[0nP1PT10n]).

    And other integral term has same process. Thus, the upper bound of ˙VC3(t) can be obtained that

    ˙VC3(t)ζT(t)˜Ξ3ζ(t)eαη[Λ1(t)Λ2(t)]T[QC aug,1SSTQC aug,2]ΩC[Λ1(t)Λ2(t)]+BT4(t)PaugB4(t)αVC2(t)αVC3(t)=ζT(t)ΞC3ζ(t)αVC2(t)αVC3(t). (3.34)

    Likewise, the (3.15)–(3.19) can be combined, and the ˙VC(t)+αVC(t)αw2mwT(t)w(t) can be bounded as

    ˙VC(t)+αVC(t)αw2mwT(t)w(t)ζT(t)(ΞC+Sym{Φj,kΓj,[η(t)]})ζ(t). (3.35)

    Lastly, similar to Theorem 1, LMIs (3.30) can be obtained. So rest proof is omitted.

    Remark 2. In past literature, constructing integral LKFs for RSE was limited by the presence of est. However, inspired by Kwon et al.[35], the authors tried to choose the integral Lyapunov function VC2(t) and VC3(t) with augmented vectors [˙xT(s)xT(s)]T. Although some definite conditions about QC,k and ΩC are needed to combine inequality lemmas, the result can lead to get a tighter upper bound of RSE condition. To the author's knowledge, this trial is the first time in RSE.

    In the following theorem, an interval time-delay condition and a lower bound condition about ˙η(t) are investigated, the following new LKFs and notations are introduced to prove them.

    (3.36)

    Theorem 2. For given scalars ηm>0, η>0 and μ>0, the system (2.1), the RSs of the system (2.1) with time-delay condition (2.5) are bounded by an ellipsoid Rϵ (2.6), if there exist matrices ˆRS7n+, R2, Ni, Gi (i=1, 2), USn+, QS2n+, Pi (i=1, 2) Sn×n, any matrix SR6n×6n, and a scalar α>0, such that the following LMIs hold:

    (ˆΓj,[ηm])TˆΞ[μ](ˆΓj,[ηm])0,(ˆΓj,[ηm])TˆΞ[μ](ˆΓj,[ηm])0,(ˆΓj,[η])TˆΞ[μ](ˆΓj,[η])0,(ˆΓj,[η])TˆΞ[μ](ˆΓj,[η])0 (j=1, , N),ˆQ10, ˆQ20, Q30, ˆΩ0, ˆR˜R2, (3.37)

    where ˆΞ[˙η(t)] and ˆΓj,[η(t)] are defined in (3.36), respectively.

    Proof. For the condition (2.5), positive matrices ˆR, R2, Ni, Gi (i=1, 2), U, Q, and the following LKFs candidate are chosen as

    ˆVT(t)=3k=1ˆVTk(t), (3.38)

    where

    ˆVT1(t)=ˆBT1(t)ˆRˆB1(t),ˆVT2(t)=ηmttηm˙xT(s)N1˙x(s)ds+ηttη˙xT(s)N2˙x(s)ds+ttη(t)xT(s)G1x(s)ds+tη(t)tηxT(s)G2x(s)ds,ˆVT3(t)=ηttηtseα(ut)BT3(u)QB3(u)duds+ηmttηmtseα(ut)˙xT(u)U˙x(u)duds,

    where ˆB1(t)=col{x(t), x(tηm), x(tη), ttηmx(s)ds, tηmtη(t)x(s)ds, tη(t)tηx(s)ds, ttηts˙x(u)duds}.

    By constructing the LKFs as (3.38), the RSE about conditions (2.5) can be proved. And the B2(t), B3(t) are noticed in Theorem 1.

    The ˙ˆVT1 and ˙ˆVT2 can be written as

    ˙ˆVT1(t)=ˆζT(t)ˆΞ1[˙η(t)]ˆζ(t)αˆVT1(t), (3.39)
    ˙ˆVT2(t)=˙ˆBT2(t, tηm, tη)[ηmN1+ηN20n0nηmN10nηN2]˙ˆB2(t, tηm, tη)+ˆBT2(t, tη(t), tη)[G10n0n(1˙η(t))(G2G1)0nG2]ˆB2(t, tη(t), tη)=ˆζT(t)ˆΞ2[˙η(t)]ˆζ(t), (3.40)

    where ˆB2(t, u, s)=col{x(t), x(u), x(s)}.

    Calculating the time-derivative of ˆVT3 leads to

    ˙ˆVT3(t)=ˆζT(t)ˉΞ3ˆζ(t)ηttη(t)eα(st)BT2(s)QB2(s)ds+α(ˆVT21(t)+ˆVT23(t))ηtη(t)tηeα(st)BT3(s)QB3(s)ds+α(ˆVT22(t)+ˆVT24(t))ttηm˙xT(s)U˙x(s)ds+αˆVT20(t)αˆVT2(t)αˆVT3(t), (3.41)

    where

    ˆVT2(t)=ηmttηm˙xT(s)N1˙x(s)dsˆVT20(t)+ηttη(t)˙xT(s)N2˙x(s)dsˆVT21(t)+ηtη(t)tη˙xT(s)N2˙x(s)dsˆVT22(t)+ttη(t)xT(s)G1x(s)dsˆVT23(t)+tη(t)tηxT(s)G2x(s)dsˆVT24(t).

    Same as (3.7) and (3.8), the zero equations with Pi (i=1, 2) are considered. An upper bound of the first integral term of (3.41) with αˆVT21(t), αˆVT23(t) and zero Eq (3.7) can be obtained as

    ηttη(t)eα(st)BT3(s)QBT3(s)ds+α(ˆVT21(t)+ˆVT23(t))ηeαηttη(t)BT3(s)QB3(s)dsηeαηttη(t)BT3(s)(1eαη[αN2P1PT1αηG1])B3(s)ds+ηBT2(t, tη(t))[P10n0nP1]B2(t, tη(t)). (3.42)

    With the Lemma 2 (l=2) and an LMI condition, the integral terms of (3.42), which have interval from tη(t) to t, can be bounded as

    ηeαηttη(t)BT3(s)QB3(s)dsηeαηttη(t)BT3(s)(1eαη[αN2P1PT1αηG1])BT3(s)dsηeαηη(t)(ΛT1,1(t)ˆQ1Λ1,1(t)+3ΛT1,2(t)ˆQ1Λ1,2(t)+5ΛT1,3(t)ˆQ1Λ1,3(t)), (3.43)

    where ˆQ1=Q+1eαη[αN2P1PT1αηG1].

    Likewise, the another integral term of (3.42) with αˆVT22(t), αˆVT24(t) and Eq (3.8) are bounded as

    ηtη(t)tηeα(st)BT3(s)QB3(s)ds+α(ˆVT22(t)+ˆVT24(t))ηeαηtη(t)tηBT3(s)QB3(s)dsηeαηtη(t)tηBT3(s)(1eαη[αN2P2PT2αηG2])B3(s)ds+ηBT2(tη(t), tη)[P20n0nP2]B2(tη(t), tη). (3.44)

    With the Lemma 2 (l=2) and an LMI condition, integral terms of (3.44), which have interval from tη to tη(t), can be bounded as

    ηeαηtη(t)tηBT3(s)QB3(s)dsηeαηtη(t)tηBT3(s)(1eαη[αN2P2PT2αηG2])B3(s)dsηeαηηη(t)(ΛT2,1(t)ˆQ2Λ2,1(t)+3ΛT2,2(t)ˆQ2Λ2,2(t)+5ΛT2,3(t)ˆQ2Λ2,3(t)), (3.45)

    where ˆQ2=Q+1eαη[αNP2PT2αηG2].

    And then, by utilizing Lemma 3, sum of (3.43) and (3.45) can be rewritten and bounded as

    ηeαηη(t)ΛT1(t)[ˆQ102n02n3ˆQ102n5ˆQ1]ˆQaug,1Λ1(t)ηeαηηη(t)ΛT2(t)[ˆQ202n02n3ˆQ202n5ˆQ2]ˆQaug,2Λ2(t)eαη[Λ1(t)Λ2(t)]T[ˆQaug,1SSTˆQaug,2]ˆΩ[Λ1(t)Λ2(t)]. (3.46)

    Finally, after Lemma 2 (l=0) about ηmttηm˙xT(s)U˙x(s)ds in (3.41) with αˆVT20(t), the ˙ˆVT3(t) has an upper bound as

    ˙ˆVT3(t)ˆζT(t)ˆΞ3ˆζ(t)αˆVT2(t)αˆVT3(t), (3.47)

    where ˆΞ1[˙η(t)], ˆΞ2[˙η(t)], ˆΞ3 and ˆζ(t) are defined in (3.36).

    Similarly with Theorem 1, the zero equations can be obtained as

    ˆζT(t)(ˆΦj,kˆΓj,[η(t)]+ˆΓTj,[η(t)]ˆΦTj,k)ˆζ(t)=0   (j=1, , N, k=1, 2), (3.48)

    where ˆΦj,k=ˆΥ[ˆϕ1,j, ˆϕ2,k, , ˆϕ5,k], ˆΓj,[η(t)]=col{ˆΓ1,j, ˆΓ2[η(t)], , ˆΓ5[η(t)]}.

    Therefore, from (3.39)–(3.47) with adding the (3.48), the following RSE condition can be written as

    ˙ˆVT(t)+αˆVT(t)αw2mwT(t)w(t)ˆζT(t)(ˆΞ[˙η(t)]+Sym{ˆΦj,kˆΓj,[η(t)]})ˆζ(t)0. (3.49)

    The inequality (3.49) can be satisfied with the following equality condition holds:

    ˆΞ1[˙η(t)]+ˆΞ2[˙η(t)]+ˆΞ3αw2mˆe19ˆeT19+Sym{ˆΦj,kˆΓj,[η(t)]}0. (3.50)

    And then, the LMIs conditions (3.37) are obtained by the same processes as Theorem 1. This completes our proof.

    Remark 3. In RSE studies, past literature constructed the non-integral Lyapunov functional candidate V1(t) by choosing only x(t). And recently, Wang et al.[12] introduced an augmented method of non-integral Lyapunov functional candidate for RSE. With this expanded Lyapunov functional, a less conservative result can be obtained. However, it still has limitations for deriving various time-delay conditions without time-varying delay information in V1(t). In this paper, by choosing the appropriate state vectors in the proposed ˆVT1(t), the time-varying delay condition (2.5) can be considered effectively.

    Remark 4. For investigating the practical conditions, various time-varying delay conditions should be considered. Case 1(2.4) is the time condition for Theorem 1 where 0η(t)η, ˙η(t)μ. Case 2(2.5) is the time condition for Theorem 2 where 0ηmη(t)η, μ˙η(t)μ. The time condition, when an upper bound of ˙η(t) is unknown is investigated in Corollary 1. Moreover, by constructing the ˆVT1(t) with augmented vectors about tηm, and the ˆVT2(t) with integral intervals from tηm to t and from tη to tη(t), the delay condition Case 2(2.5) can be investigated in Theorem 2.

    In this section, we provide two examples to show the improved RSE with optimized ellipsoidal bound parameter ˉδ=δ1.

    Example 1. Consider the system (2.1) with the following parameters which have been studied for polytopic uncertainty:

    A+Au,1=[2000.7], D+Du,1=[1010.9], B+Bu,1=[0.51],A+Au,2=[2001.1], D+Du,2=[1011.1], Bu,2=Bu,1, wT(t)w(t)w2m=1,Aj=A+Au,j, Dj=D+Du,j, Bj=B+Bu,j (j=1, 2), ηm=0, η=0.7, ηmη(t)η. (4.1)

    By definition (2.2), system uncertainties are expressed in polytope expression. So polytopic uncertainties about the system are introduced with Aj, Dj, Bj (j=1, 2). For comparison with past literature [7,35,42,45,46], the delay conditions in (4.1) are utilized. In Table 1, our computed results are listed with various conditions of time-varying delay. It should be noted that our result with unknown ˙η(t) represents a smaller ˉδ than the result of the delay condition (2.4). This difference is derived from the augmented [˙xT(s)xT(s)]T in VC2(t), VC3(t). It is well-known that for getting less conservative results, the LKFs should be constructed with bounded conditions about η(t) and ˙η(t). Thus, a smaller ellipsoidal bound can be obtained with a simple augmented approach in Corollary 1. Moreover, the number of decision variables for Table 1(Example 1) is listed in Table 2. And Figure 1 shows that comparison of results when delay conditions (2.5) where ηm=0, η=0.7 are selected.

    Table 1.  The sizes if ˉδ bound with η=0.7 and different μ (Example 1).
    μ 0.1 0.3 0.6 0.9 unknown ˙η(t)
    Kwon[35](Thm1) - - - - 2.1139 ˙η(t)
    Sheng[45](Thm1) - - - - 1.61 ˙η(t)
    Our result(Cor1) - - - - 1.2277 ˙η(t)
    Kwon[35](Thm2) 1.9475 2.0182 2.1123 2.1139 - ˙η(t)μ
    Chen[42](Thm10) 1.84 1.95 2.06 3.09 - ˙η(t)μ
    Our result(Thm1) 1.4683 1.4844 1.4844 1.4844 - ˙η(t)μ
    Zuo[7](Thm7) 1.94 2.08 2.60 3.51 - μ˙η(t)μ
    Kwon[35](Thm4) 1.7728 1.8199 1.8674 1.9433 - μ˙η(t)μ
    Chen[46](Thm2) 1.51 1.63 1.94 2.05 - μ˙η(t)μ
    Our result(Thm2, ηm=0) 1.1766 1.2091 1.2462 1.2607 - μ˙η(t)μ

     | Show Table
    DownLoad: CSV
    Table 2.  The number of decision variables for Example 1.
    Methods NoDVs
    Zuo[7](Thm7) 2n2+2n+5
    Kwon[35](Thm1) 6n2+2n
    Kwon[35](Thm2) 6.5n2+2.5n
    Kwon[35](Thm4) 11.5n2+4.5n
    Sheng[45](Thm1) 12.5n2+(3.5+m)n+1
    Chen[42](Thm10) 7n2+5n+1
    Chen[46](Thm2) 6n2+4n+1
    Our result(Thm1) 47.5n2+5.5n+1
    Our result(Cor1) 49.5n2+5.5n+1
    Our result(Thm2) 66.5n2+8.5n+1
    *m: dimension of disturbance

     | Show Table
    DownLoad: CSV
    Figure 1.  The graph undervalues of Table 1 (μ˙η(t)μ) (Example 1, Theorem 2).

    Example 2. Consider the system (2.1) with the following parameters:

    Aj=[10.514], Dj=[0.10.20.42], Bj=[00.5] (j=1),ηm=0.1, η=0.5, μ=0.2, wT(t)w(t)w2m=1. (4.2)

    Theorem 2 focused on investigating the interval time delay η(t) and lower bound of ˙η(t) conditions. The obtained ellipsoid matrices about not only Optimized but also constant parameters α=0.3, 0.6, 0.9, which mean matrix P in (2.6), are listed in Table 3. Here, the fminsearch.m, which Kim in [6] introduced, can be used for getting a local optimum α. The system state trajectory and guaranteed RS bound in [25] are compared with our obtained results in Figure 2. Finally, the number of decision variables for Table 3 (Example 2) is listed in Table 4.

    Table 3.  Ellipse parameters and the comparisons of ellipse size for different α (Example 2).
    α 0.3 0.6 0.9 Optimized
    Zhang[43](Thm1) [3.7390.3070.3073.053] [3.9840.0380.0383.9511] [1.0130.0080.0081.024] -
    Ding[25](Cor2) [3.9480.3860.3863.083] [4.3330.2660.2664.101] [1.0480.0560.0561.123] [4.9320.5720.5724.293],ˉδ=0.253
    Our result(Thm2) [3.4930.0160.0163.463] [4.9520.0010.0014.951] [1.7220.2020.2021.944] [5.1840.3450.3454.804],ˉδ=0.217

     | Show Table
    DownLoad: CSV
    Figure 2.  The system trajectories under values ηm=0.1, η=0.5, μ=0.2, η(t)=μsin(t)+ημ and wT(t)=[cos(t), sin(t)] (Example 2, Theorem 2).
    Table 4.  The number of decision variables for Example 2.
    Methods NoDVs
    Zhang[43](Thm1) 4.5n2+3.5n+2
    Ding[25](Cor1) 7.5n2+3.5n+1
    Our result(Thm2) 66.5n2+8.5n+1

     | Show Table
    DownLoad: CSV

    In this paper, the augmented integral LKFs methods for RSE problems about time-delay linear systems with uncertainty and peak input value were proposed. For the various delay conditions, Theorem 1 and Theorem 2 constructed appropriate LKFs, and they utilized the WBII and RCA methods with an augmented zero equality approach. And Corollary 1 introduced the augmented LKFs method in integral terms with considering e(st). Finally, the superiorities of our methods are represented in tables and figures. Based on the proposed idea, the authors will try to investigate the various systems of reachable set estimations, such as neural networks, discrete-time models, sampled-data control systems, and so on.

    This research was supported by Chungbuk National University Korea National University Development Project (2022).

    The authors declare no conflict of interest.



    [1] C. Goerzen, Z. Kong, B. Mettler, A survey of motion planning algorithms from the perspective of autonomous UAV guidance, J. Intell. Robot. Syst., 57 (2010), 65. http://dx.doi.org/10.1007/s10846-009-9383-1 doi: 10.1007/s10846-009-9383-1
    [2] J. Kober, J. Bagnell, J. Peters, Reinforcement learning in robotics: a survey, The International Journal of Robotics Research, 32 (2013), 1238–1274.
    [3] W. He, Y. Dong, C. Sun, Adaptive neural impedance control of a robotic manipulator with input saturation, IEEE Trans. Syst. Man. Cy.-Sys., 46 (2016), 334–344. http://dx.doi.org/10.1109/TSMC.2015.2429555 doi: 10.1109/TSMC.2015.2429555
    [4] E. Fridman, U. Shaked, On reachable sets for linear systems with delay and bounded peak inputs, Automatica, 39 (2003), 2005–2010. http://dx.doi.org/10.1016/S0005-1098(03)00204-8 doi: 10.1016/S0005-1098(03)00204-8
    [5] C. Durieu, E. Walter, B. Polyak, Multi-input multi-output ellipsoidal state bounding, J. Optim. Theory Appl., 111 (2001), 273–303. http://dx.doi.org/10.1023/A:1011978200643 doi: 10.1023/A:1011978200643
    [6] J. Kim, Improved ellipsoidal bound of reachable sets for time-delayed linear systems, Automatica, 44 (2008), 2940–2943. http://dx.doi.org/10.1016/j.automatica.2008.03.015 doi: 10.1016/j.automatica.2008.03.015
    [7] Z. Zuo, D. Ho, Y. Wang, Reachable set bounding for delayed systems with polytopic uncertainties: the maximal Lyapunov-Krasovskii functional approach, Automatica, 46 (2010), 949–952. http://dx.doi.org/10.1016/j.automatica.2010.02.022 doi: 10.1016/j.automatica.2010.02.022
    [8] J. Park, T. Lee, Y. Liu, J. Chen, Dynamic systems with time delays: stability and control, Singapore: Springer Nature, 2019. http://dx.doi.org/10.1007/978-981-13-9254-2
    [9] W. Kwon, P. Park, Stabilizing and optimizing control for time-delay systems, Cham: Springer, 2019. http://dx.doi.org/10.1007/978-3-319-92704-6
    [10] E. Fridman, U. Shaked, Delay-dependent stability and H control: constant and time-varying delays, Int. J. Control, 76 (2003), 48–60. http://dx.doi.org/10.1080/0020717021000049151 doi: 10.1080/0020717021000049151
    [11] S. Boyd, L. Ghaoui, E. Feron, V. Balakrishnam, Linear matrix inequalities in system and control theory, Philadelphia: SIAM, 1994. http://dx.doi.org/10.1137/1.9781611970777
    [12] W. Wang, S. Zhong, F. Liu, J. Cheng, Reachable set estimation for linear systems with time-varying delay and polytopic uncertainties, J. Franklin I., 356 (2019), 7322–7346. http://dx.doi.org/10.1016/j.jfranklin.2019.03.031 doi: 10.1016/j.jfranklin.2019.03.031
    [13] D. Panagou, K. Margellos, S. Summers, J. Lygeros, K. Kyriakopoulos, A viability approach for the stabilization of an underactuated underwater vehicle in the presence of current disturbances, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference, 2010, 8612–8617. http://dx.doi.org/10.1109/CDC.2009.5400954 doi: 10.1109/CDC.2009.5400954
    [14] N. That, P. Nam, Q. Ha, Reachable set bounding for linear discrete-time systems with delays and bounded disturbances, J. Optim. Theory Appl., 157 (2013), 96–107. http://dx.doi.org/10.1007/s10957-012-0179-2 doi: 10.1007/s10957-012-0179-2
    [15] Z. Zuo, Y. Fu, Y. Wang, Results on reachable set estimation for linear systems with both discrete and distributed delays, IET Control Theory Appl., 6 (2012), 2346–2350. http://dx.doi.org/10.1049/iet-cta.2012.0491 doi: 10.1049/iet-cta.2012.0491
    [16] L. Hien, N. An, H. Trinh, New results on state bounding for discrete-time systems with interval time-varying delay and bounded disturbance inputs, IET Control Theory Appl., 8 (2014), 1405–1414. http://dx.doi.org/10.1049/iet-cta.2013.0980 doi: 10.1049/iet-cta.2013.0980
    [17] Z. Wu, P. Shi, H. Su, C. Jian, Sampled-data synchronization of chaotic Lur'e systems with time delays, IEEE T. Neur. Net. Lear., 24 (2013), 410–421. http://dx.doi.org/10.1109/TNNLS.2012.2236356 doi: 10.1109/TNNLS.2012.2236356
    [18] T. Hu, L. Ma, Z. Lin, Stabilization of switched systems via composite quadratic functions, IEEE T. Automat. Contr., 53 (2008), 2571–2585. http://dx.doi.org/10.1109/TAC.2008.2006933 doi: 10.1109/TAC.2008.2006933
    [19] T. Ru, J. Xia, X. Huang, X. Chen, J. Wang, Reachable set estimation of delay fuzzy inertial neural networks with Markov jumping parameters, J. Franklin I., 357 (2020), 6882–6898. http://dx.doi.org/10.1016/j.jfranklin.2020.04.036 doi: 10.1016/j.jfranklin.2020.04.036
    [20] Z. Feng, W. Zheng, L. Wu, Reachable set estimation of T-S fuzzy systems with time-varying delay, IEEE T. Fuzzy Syst., 25 (2017), 878–891. http://dx.doi.org/10.1109/TFUZZ.2016.2586945 doi: 10.1109/TFUZZ.2016.2586945
    [21] H. Yuan, Reachable set of open quantum dynamics for a single spin in markovian environment, Automatica, 49 (2013), 955–959. http://dx.doi.org/10.1016/j.automatica.2013.01.005 doi: 10.1016/j.automatica.2013.01.005
    [22] Z. Zuo, Z. Wang, Y. Chen, Y. Wang, A non-ellipsoidal reachable set estimation for uncertain neural networks with time-varying delay, Commun. Nonlinear Sci., 19 (2014), 1097–1106. http://dx.doi.org/10.1016/j.cnsns.2013.08.015 doi: 10.1016/j.cnsns.2013.08.015
    [23] W. Lin, Y. He, M. Wu, Q. Liu, Reachable set estimation for Markovian jump neural networks with time-varying delay, Neural Networks, 108 (2018), 527–532. http://dx.doi.org/10.1016/j.neunet.2018.09.011 doi: 10.1016/j.neunet.2018.09.011
    [24] J. Zhao, Algebraic criteria for reachable set estimation of delayed memristive neural networks, IET Control Theory Appl., 13 (2019), 1736–1743. http://dx.doi.org/10.1049/iet-cta.2018.5959 doi: 10.1049/iet-cta.2018.5959
    [25] Y. Ding, H. Lium H. Xu, S. Zhong, On uniform ultimate boundness of linear systems with time-varying delays and peak-bounded disturbances, Appl. Math. Compu., 349 (2019), 381–392. http://dx.doi.org/10.1016/j.amc.2018.12.068 doi: 10.1016/j.amc.2018.12.068
    [26] K. Gu, An integral inequality in the stability problem of time-delay systems, Proceedings of the 39th IEEE Conference on Decision and Control, 2002, 2805–2810. http://dx.doi.org/10.1109/CDC.2000.914233 doi: 10.1109/CDC.2000.914233
    [27] A. Seuret, F. Gouaisbaut, Wirtinger-based integral inequality: application to time-delay systems, Automatica, 49 (2013), 2860–2866. http://dx.doi.org/10.1016/j.automatica.2013.05.030 doi: 10.1016/j.automatica.2013.05.030
    [28] S. Xu, J. Lam, A survey of linear matrix inequality techniques in stability analysis of delay systems, Int. J. Syst. Sci., 39 (2008), 1095–1113. http://dx.doi.org/10.1080/00207720802300370 doi: 10.1080/00207720802300370
    [29] M. Park, O. Kwon, J. Park, S. Lee, E. Cha, Stability of time-delay systems via Wirtinger-based double integral inequality, Automatica, 55 (2015), 204–208. http://dx.doi.org/10.1016/j.automatica.2015.03.010 doi: 10.1016/j.automatica.2015.03.010
    [30] X. Zhang, Q. Han, X. Yu, Survey on recent advances in networked control systems, IEEE T. Ind. Inform., 12 (2016), 1740–1752. http://dx.doi.org/10.1109/TII.2015.2506545 doi: 10.1109/TII.2015.2506545
    [31] P. Park, J. Ko, C. Jeong, Reciprocally convex approach to stability of systems with time-varying delays, Automatica, 47 (2011), 235–238. http://dx.doi.org/10.1016/j.automatica.2010.10.014 doi: 10.1016/j.automatica.2010.10.014
    [32] K. Liu, E. Fridman, Wirtinger's inequality and Lyapunov-based sampled-data stabilization, Automatica, 48 (2012), 102–108. http://dx.doi.org/10.1016/j.automatica.2011.09.029 doi: 10.1016/j.automatica.2011.09.029
    [33] P. Park, W. Lee, S. Lee, Auxiliary function-based integral inequalities for quadratic functions and their applications to time-delay systems, J. Franklin I., 352 (2015), 1378–1396. http://dx.doi.org/10.1016/j.jfranklin.2015.01.004 doi: 10.1016/j.jfranklin.2015.01.004
    [34] X. Zhang, Q. Han, A. Seuret, F. Gouaisbaut, An improved reciprocally convex inequality and an augmented Lyapunov-Krasovskii functional for stability of linear systems with time-varying delay, Automatica, 84 (2017), 221–226. http://dx.doi.org/10.1016/j.automatica.2017.04.048 doi: 10.1016/j.automatica.2017.04.048
    [35] O. Kwon, S. Lee, J. Park, On the reachable set bounding of uncertain dynamic systems with time-varying delays and disturbances, Inform. Sciences, 181 (2011), 3735–3748. http://dx.doi.org/10.1016/j.ins.2011.04.045 doi: 10.1016/j.ins.2011.04.045
    [36] M. Park, O. Kwon, J. Ryu, Generalize integral inequality: application to time-delay systems, Appl. Math. Lett., 77 (2018), 6–12. http://dx.doi.org/10.1016/j.aml.2017.09.010 doi: 10.1016/j.aml.2017.09.010
    [37] H. Zeng, Y. He, M. Wu, J. She, Free-matrix-based integral inequality for stability analysis of systems with time-varying delay, IEEE T. Automat. Contr., 60 (2015), 2768–2772. http://dx.doi.org/10.1109/TAC.2015.2404271 doi: 10.1109/TAC.2015.2404271
    [38] J. Ishihara, H. Kussaba, R. Borges, Existence of continuous or constant Finsler's variables for parameter-dependent systems, IEEE T. Automat. Contr., 62 (2017), 4187–4193. http://dx.doi.org/10.1109/TAC.2017.2682221 doi: 10.1109/TAC.2017.2682221
    [39] O. Kwon, S. Lee, M. Park, S. Lee, Augmented zero equality approach to stability for linear systems with time-varying delay, Appl. Math. Comput., 381 (2020), 125329. http://dx.doi.org/10.1016/j.amc.2020.125329 doi: 10.1016/j.amc.2020.125329
    [40] S. Lee, Y. Kim, Y. Lee, M. Park, O. Kwon, Relaxed stability conditions for linear systems with time-varying delays via some novel approaches, AIMS Mathematics, 6 (2021), 2454–2467. http://dx.doi.org/10.3934/math.2021149 doi: 10.3934/math.2021149
    [41] Y. Kim, Y. Lee, S. Kim, S. Lee, O. Kwon, An augmented approach to absolute stability for uncertain Lur'e system with time-varying delay, Math. Method. Appl. Sci., in press. http://dx.doi.org/10.1002/mma.8061
    [42] H. Chen, Improved results on reachable set bounding for linear delayed systems with polytopic uncertainties, Discrete Dyn. Nat. Soc., 2015 (2015), 895412. http://dx.doi.org/10.1155/2015/895412 doi: 10.1155/2015/895412
    [43] B. Zhang, J. Lam, S. Xu, Relaxed results on reachable set estimation of time-delay systems with bounded peak inputs, Int. J. Robust Nonlin., 26 (2016), 1994–2007. http://dx.doi.org/10.1002/rnc.3395 doi: 10.1002/rnc.3395
    [44] S. Kim, P. Park, C. Jeong, Robust H stabilisation of networks control systems with packet analyser, IET Control Theory Appl., 4 (2010), 1828–1837. http://dx.doi.org/10.1049/iet-cta.2009.0346 doi: 10.1049/iet-cta.2009.0346
    [45] Y. Sheng, Y. Shen, Improved reachable set bounding for linear time-delay systems with disturbances, J. Franklin I., 353 (2016), 2708–2721. http://dx.doi.org/10.1016/j.jfranklin.2016.05.013 doi: 10.1016/j.jfranklin.2016.05.013
    [46] H. Chen, S. Zhong, New results on reachable set bounding for linear time delay systems with polytopic uncertainties via novel inequalities, J. Ineq. Appl., 2017 (2017), 277. http://dx.doi.org/10.1186/s13660-017-1552-3 doi: 10.1186/s13660-017-1552-3
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1937) PDF downloads(115) Cited by(0)

Figures and Tables

Figures(2)  /  Tables(4)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog