
A graph G is said to be claw-free if G does not contain K1,3 as an induced subgraph. For an integer s≥0, G is s-Hamiltonian if for any vertex subset S⊂V(G) with |S|≤s, G−S is Hamiltonian. Lai et al. in [On s-Hamiltonian line graphs of claw-free graphs, Discrete Math., 342 (2019)] proved that for a connected claw-free graph G and any integer s≥2, its line graph L(G) is s-Hamiltonian if and only if L(G) is (s+2)-connected.
Motivated by above result, we in this paper propose the following conjecture. Let G be a claw-free connected graph such that L(G) is 3-connected and let s≥1 be an integer. If one of the following holds:
(i) s∈{1,2,3,4} and L(G) is essentially (s+3)-connected,
(ii) s≥5 and L(G) is essentially (s+2)-connected,
then for any subset S⊆V(L(G)) with |S|≤s, |D≤1(L(G)−S)|≤⌊s2⌋ and L(G)−S−D≤1(L(G)−S) is Hamiltonian. Here, D≤1(L(G)−S) denotes the set of vertices of degree at most 1 in L(G)−S. Furthermore, we in this paper deal with the cases s∈{1,2,3,4} and L(G) is essentially (s+3)-connected about this conjecture.
Citation: Xia Liu. A related problem on s-Hamiltonian line graphs[J]. AIMS Mathematics, 2022, 7(10): 19553-19561. doi: 10.3934/math.20221073
[1] | Tiantian Zhang, Wenwen Xu, Xindong Li, Yan Wang . Multipoint flux mixed finite element method for parabolic optimal control problems. AIMS Mathematics, 2022, 7(9): 17461-17474. doi: 10.3934/math.2022962 |
[2] | Jie Liu, Zhaojie Zhou . Finite element approximation of time fractional optimal control problem with integral state constraint. AIMS Mathematics, 2021, 6(1): 979-997. doi: 10.3934/math.2021059 |
[3] | Lu Zhi, Jinxia Wu . Adaptive constraint control for nonlinear multi-agent systems with undirected graphs. AIMS Mathematics, 2021, 6(11): 12051-12064. doi: 10.3934/math.2021698 |
[4] | Andrew Calcan, Scott B. Lindstrom . The ADMM algorithm for audio signal recovery and performance modification with the dual Douglas-Rachford dynamical system. AIMS Mathematics, 2024, 9(6): 14640-14657. doi: 10.3934/math.2024712 |
[5] | Xiang Wu, Yuzhou Hou, Kanjian Zhang . Optimal feedback control for a class of fed-batch fermentation processes using switched dynamical system approach. AIMS Mathematics, 2022, 7(5): 9206-9231. doi: 10.3934/math.2022510 |
[6] | Yuelong Tang . Error estimates of mixed finite elements combined with Crank-Nicolson scheme for parabolic control problems. AIMS Mathematics, 2023, 8(5): 12506-12519. doi: 10.3934/math.2023628 |
[7] | Jun Moon . The Pontryagin type maximum principle for Caputo fractional optimal control problems with terminal and running state constraints. AIMS Mathematics, 2025, 10(1): 884-920. doi: 10.3934/math.2025042 |
[8] | Jun Moon . A Pontryagin maximum principle for terminal state-constrained optimal control problems of Volterra integral equations with singular kernels. AIMS Mathematics, 2023, 8(10): 22924-22943. doi: 10.3934/math.20231166 |
[9] | Min Wang, Jiao Teng, Lei Wang, Junmei Wu . Application of ADMM to robust model predictive control problems for the turbofan aero-engine with external disturbances. AIMS Mathematics, 2022, 7(6): 10759-10777. doi: 10.3934/math.2022601 |
[10] | Gerardo Sánchez Licea . Strong and weak measurable optimal controls. AIMS Mathematics, 2021, 6(5): 4958-4978. doi: 10.3934/math.2021291 |
A graph G is said to be claw-free if G does not contain K1,3 as an induced subgraph. For an integer s≥0, G is s-Hamiltonian if for any vertex subset S⊂V(G) with |S|≤s, G−S is Hamiltonian. Lai et al. in [On s-Hamiltonian line graphs of claw-free graphs, Discrete Math., 342 (2019)] proved that for a connected claw-free graph G and any integer s≥2, its line graph L(G) is s-Hamiltonian if and only if L(G) is (s+2)-connected.
Motivated by above result, we in this paper propose the following conjecture. Let G be a claw-free connected graph such that L(G) is 3-connected and let s≥1 be an integer. If one of the following holds:
(i) s∈{1,2,3,4} and L(G) is essentially (s+3)-connected,
(ii) s≥5 and L(G) is essentially (s+2)-connected,
then for any subset S⊆V(L(G)) with |S|≤s, |D≤1(L(G)−S)|≤⌊s2⌋ and L(G)−S−D≤1(L(G)−S) is Hamiltonian. Here, D≤1(L(G)−S) denotes the set of vertices of degree at most 1 in L(G)−S. Furthermore, we in this paper deal with the cases s∈{1,2,3,4} and L(G) is essentially (s+3)-connected about this conjecture.
As we all know, fuzzy model is a extension of deterministic systems, which gives the input, output and state variables definitions on fuzzy sets. Recently, due to the effectiveness in handling the problems of safety control for nonlinear NCSs, fuzzy models have been applied in many research fields, such as fault diagnosis systems, robot control systems and power systems. The ability of fuzzy systems to deal with uncertainty and nonlinear has also attracted much attention in network control, engineering, computer science, and other fields, such as [1,2,3]. The T-S fuzzy methods can approximate the nonlinear systems through a set of local linear systems and a set of IF-THEN rules. Based on the fuzzy systems, many methods of stability and synchronization analysis for linear systems can be extended to the study of nonlinear systems. This provides great convenience undoubtedly for the research of nonlinear NCSs.
Markov jump processes can describe the switch suddenly of system structure parameters due to external disturbance. The transition of the system among the various modes is determined by a set of Markov chains. Recently, SMJSs whose transition rates change with sojourn time have also been investigated. The semi-Markovian processes are similar to the Markov processes generally. However, compared with the Markov processes, the transition time and probability are decided by the time when the system reaches the current state. Recently, more and more researchers have investigated the SMJSs [4,5,6]. In [7], the stable and robust stability conditions for uncertain Markov transition neural networks(NNs) with partially unknown transition probabilities are derived. In [8], the problem of finite-time H∞ fault tolerant control for the T-S SMJSs is investigated. In [9], the asynchronous control problem of a nonlinear MJS based on a method of fuzzy quantization is investigated. Moreover, the designed fuzzy sample controller and the system are asynchronous. The stochastic stability of T-S fuzzy MJSs is guaranteed based on the HMM. In [10], the problem of an elastic asynchronous H∞ control for an uncertain slow sampling discrete-time Markov singular perturbation system (SPS) is investigated. A new conservative sampling controller is proposed to achieve the stability and the H∞ performance of the closed-loop system. In [11], an asynchronous H∞ filter based on an ETM for SMJSs at finite time intervals is designed. In [12], the resilient cooperative output regulation problem of a class of uncertain nonlinear multi-intelligent systems under denial-of-service attacks is studied. A distributed control scheme consisting of a resilient distributed observer and a distributed adaptive controller is proposed. The results show that the control scheme can solve the elastic cooperative output regulation problem for a related class of uncertain nonlinear mathematical models.
As is known to all, time-triggered mechanism and ETM are applied to decrease the network communication burden. Both two communication mechanisms have been introduced into the most NCSs. Based on the previous communication scheme, the signals of the system can be conveyed regularly. For ETM, the data signals of the system can be conveyed unless the given events occur. Meanwhile, ETM can bring more difficulties in constructing the controllers. The advantage over time triggered communication is that ETM can reduce more burden of network communication if it undergoes a little changes for the transmitted signals [13]. In order to make better use of network resources, some strategies on event-triggered communication are proposed for MJSs [14,15,16]. In [17], the guaranteed performance control for T-S fuzzy MJSs with time-varying delays and incompletely unknown transition probabilities is investigated. An ETM related to the system mode is considered at the feedback channel where the network-induced delay occurs randomly. In [18], the safety control problem of the nonlinear unmanned vehicle (UMV) systems is investigated. Sensor-to-controller and controller-to-actuator-side dynamic ETM and an observer-based sliding mode control (SMC) scheme are proposed to stabilize the system under DOS attacks.
Besides ETM, quantization protocol is another method to reduce the burden of network communication [19,20,21]. In [19,20], the robust stability of unknown discrete linear systems with the double quantization strategy is investigated. They also propose some sufficient conditions for closed-loop systems with norm bounded uncertainty and dual quantization. The latter takes into account the phenomenon of the data packets loss. In [21], the problem of quantitative feedback control for uncertain time varying systems based on a sliding mode observer (SMO) is investigated. By constructing a novel L-K function, a time delay-dependent SMO designed criteria is proposed so that the dynamical error system is practically stable.
In [22], the problem of a static output feedback robust H∞ control for the discrete-time singular MJSs is studied. Moreover, the transition probability is incompletely known. In [23], an H∞ tracking control method with adaptive dynamic programming (ADP) for the nonlinear continuous-time SMJSs is proposed. A neural network (NN) detector which includes the input and output of the system signals is designed. In [24], a tracking control problem of nonlinear SMJSs based on T-S fuzzy methods with the incompletely known transition probability is investigated. Furthermore, the designed controller does not fully control the mode that the system maintains at runtime. In this imperfect modal information scenario, a mechanism based on HMM is improved to simulate the defect of modal asynchrony. The main work of [25] is on investigating a class of state output tracking control problem for fuzzy SMJSs. Besides, the affect of both unpredictable external disturbances and uncertainties in the system are also considered. In [26], the location control based on intelligent event triggering in a networked unmanned vehicle (UMV) system based on hybrid attack is studied, where the UMV and the control station are connected through a communication network. The mean square exponential stability condition of the closed loop system and the design method of the controller based on the observer are achieved.
Based on the above analysis of many literatures, this paper investigates a quantitative output feedback control problem of fuzzy tracking control systems under the the influence of the uncertainty and external interference. The main contributions of this paper are summarized as the following:
1) An AETM based on the period data sampling is adopted to relieve the communication burden of the network. The triggered threshold in the AET condition can be adjusted dynamically through an adaptive threshold function ϵ(t), which overcomes the defect of the static ETM. Meanwhile, the size of ϵ(t) can be regulated by an equation related to its derivative ˙ϵ(t);
2) This paper employs a double quantization strategy, which quantizes the controller input and controller output, to compress the network signal. The uncertainty caused by double quantization will increase the difficulties of the research. Therefore, this paper applies two lemmas to deal with this uncertainty.
3) The asynchronous phenomenon is inevitable in realistic situation. In this paper, the time-delay caused by AETM will introduce the asynchronous phenomenon between the controller and the system. Thus, an HMM is established to deal with this problem. Moreover, some sufficient inequality conditions which can ensure the stochastic stability of the system and satisfy the prescribed H∞ tracking performance are derived.
The remainder of this paper is arranged as follows. In Section 2, a controller with AETM and double quantization strategy is constructed for the continuous-time fuzzy SMJSs. In Section 3, some sufficient inequality conditions, which can guarantee the stochastic stability of the system with a prescribed H∞ tracking performance, are derived. Two examples are shown in Section 4 to illustrate the effectiveness of proposed methods. Finally, some conclusions for this paper are summarized in Section 5.
Notations: Rnν represents the nν dimension Euclidean space; Rn×m represents the set of all n×m real matrices; P>0 denotes that P is a positive define matrix; ∗ in matrices represent the symmetric elements for a symmetric matrix; Z+ represents a set of non-negative integers; I and 0 denote unity matrix and zero matrix, respectively; ZT denotes the transpose of Z; sym(AB) represents AB+BTAT; diag{⋅} denotes a diagonal matrix; E{⋅} denotes the mathematical expectation in probability statistics.
In consideration of a nonlinear fuzzy SMJS with Markov jump parameter ϕt. Let r be the number of the fuzzy rules. Then, the ith fuzzy rule can be described as follows:
Plant rule i: If η1(℘(t)) is Mi1, η2(℘(t)) is Mi2, ⋯, and ηa(℘(t)) is Mia, then,
{˙ϰ(t)=Ai(ϕt)ϰ(t)+Bi(ϕt)u(t)+Di(ϕt)ω(t),z(t)=C(ϕt)ϰ(t), | (2.1) |
where Mi1, Mi2, ⋯, Mia denote the fuzzy sets of the rule i, i∈I={1,2,⋯,r}. ηι(t), ι∈A={1,2,⋯,a} represent the premise variables. ϰ(t)∈Rnν is the system state vector. And u(t)∈Rnu is the input vector which will be designed in this paper. ω(t) denotes the external disturbance which belongs to L[0,+∞]. Ai(ϕt), Bi(ϕt), C(ϕt), Di(ϕt) are known real coefficient matrices which has appropriate dimensions. For notational brevity, these will be denoted by Ais, Bis, Cs, Dis for ϕt=s.
Through the method of fuzzy approach, denote ϕt=s, the description of the system (2.1) can be modified as
{˙ϰ(t)=∑ri=1hi(η(t))[Aisϰ(t)+Bisu(t)+Disω(t)],z(t)=Csϰ(t), | (2.2) |
where η(t)=[η1(t)η2(t)⋯ηa(t)] and
{hi(η(t))=ϑi(η(t))∑ri=1ϑi(η(t)),ϑi(η(t))=a∏ι=1Miι(ηι(t)), |
with Miι(ηj(t)) being the membership grade of ηι(t) in Miι. For i∈I, hi(η(t)) is the membership functions(MFs) of rule i which has been normalized. hi(η(t))≥0 and ∑ri=1hi(η(t))=1. For the symbol simplification, hi replaces hi(η(t)) in the subsequent sections.
Let ϕı, where ı={0,1,2,⋯}, denotes the ıth system mode switch. ˆhı is the residence time from the (ı−1)th switch to the ıth switch. Let ˆh0=0 and ϕt∈S={1,2,⋯,M}. {ϕt,h}t≥0≜{ϕı,ˆhı}ı∈S≥1 can be described as a semi-Markovian process. The matrix of the transition probability Λ(ˆh)=[λisjs(ˆh)]M×M can be written as[5]
{Pr{ϕı+1=js,ˆhı+1≤ˆh+θ|ϕı=is,ˆhı+1>ˆh}=λisjs(ˆh)θ+o(θ),is≠js,Pr{ϕı+1=js,ˆhı+1>ˆh+θ|ϕı=is,ˆhı+1>ˆh}=1+λisis(ˆh)θ+o(θ),is=js, | (2.3) |
where θ>0, limθ→0(o(θ)/θ)=0, λisjs(h)≥0 for ∀is≠js, and λisis(h)=−∑Mjs=1λisjs(h).
Remark 2.1. To avoid notational confusion, it is necessary to clarify that the is and js is a specific value of the system mode s. For example, the λisjs indicates the probability of transfer from modality is to modality js. The is and s represent the same concept. However, it should be noted that the i in is is not the same meaning as the fuzzy rule i previously mentioned in this article.
In order to track the desired signal of the reference output, the following stable reference model is selected. The system output z(t) in (2.2) tracks the reference signals zr(t) :
{˙ϰr(t)=Arϰr(t)+Brr(t),zr(t)=Crϰr(t), | (2.4) |
where ϰr(t), zr(t), r(t) are the state vector, output vector, and the bounded reference input, respectively. Ar, Br, Cr are known real matrices which have appropriate dimensions.
Remark 2.2. The system (2.4) is selected as the reference model of H∞ tracking control. What's more, the reference system is known and stable. In the following research, by letting the system (2.2) track the system (2.4).
AETM is a strategy which is applied to save the communication cost and reduce the network bandwidth pressure. The measurement/control signal will be released when the pre-specified triggered condition are met. The AETM is based on the data sampling. We denote τ0<τ1<⋯<τm<⋯ and η=τm+1−τm as the sampling instants and the sampling period. Assume that τ0=0 and η is a constant. Let t0,t1,⋯,tk denote the event triggered instants. Assume that t0=0. For t∈[τm,τm+1), m∈Z+, the asynchronous fuzzy tracking controller related to AET can be constructed as
u(t)=r∑j=1ˆhj(ρ(t))[Kj(φt)ϰ(tk)+Fj(φt)ϰr(τm)], | (2.5) |
where
Kj(φt)=r∑j=1ˆhj(ρ(t))Kj(φt),ˆhj(ρ(t))=μj(ρ(t))∑rj=1μj(ρ(t)),μj(ρ(t))=Πgt=1μj(φt)(ρ(k)), |
and {φt}t∈R+∈M={1,2,⋯,S}. Due to the existence of the time delay and other external disturbance, the mode switching between the controller and the system is not synchronous at all time. Hence, a hidden process is introduced and its property is defined by
Pr{φt=μ|ϕt=s}=ϱsμ, |
where for ∀s∈S, μ∈M, ϱ∈[0,1], and ∑Sμ=1ϱsμ=1. In (2.5), tk=max{t|t∈{td,d=0,1,⋯,}} denotes the latest event-triggered instants. Kj(φt) and Fj(φt) denote the control gain matrices. For notational brevity, we use Kjμ and Fjμ to denote Kj(φt) and Fj(φt).
The event trigger will work if t=τm(m∈Z+) and the condition (2.6) is violated:
ξT(τm)ξ(τm)≤ϵ(t)ζT(τm)ζ(τm), | (2.6) |
where ξ(τm)=x(τm)−x(tk), ζ(τm)=[xT(τm)xTr(τm)]T. ϵ(t) is a threshold which can be adjusted adaptively. According to [27], ϵ(t) can be adjusted by
˙ϵ(t)=1ϵ(t)[1ϵ(t)−ϵ0]ξT(τm)ξ(τm), | (2.7) |
where ϵ0 is a given constant.
Remark 2.3. The conditional probability ϱsμ in (2.5) is applied as a mechanism to measure the asynchronous degree. This will be considered in the design of the ultimate controller.
Remark 2.4. The AETM is more effective than traditional ETM in saving bandwidth resources. It can be obtained from (2.7) that the event trigger threshold can be adjusted dynamically. Moreover, if ϵ(0) is 1ϵ0, where ϵ(0) is the initial value of ϵ(t). In this case, ˙ϵ(t)=0 for t≥0, which applies that ϵ(t) is a constant. The AET condition is modified as the traditional ETM [28,29].
Inspired by [30], this paper quantizes both the controller input and the controller output. Given a vector b=[b1b2⋯bC]T∈Rn, let ˆf(b)=[ˆf1(b1)ˆf2(b2)⋯ˆfC(bC)]T be the quantizer of the controller input. For c=1,2,⋯,C, ˆfc(bc) is described as
ˆfc(bc)={ucl,ˆucl1+θˆfc≤bc≤ˆucl1−θˆfc,bc>0,0,bc=0,−ˆfc(−bc),bc<0, |
where θfc=(1−ρˆfc)/(1+ρˆfc), 0<ρˆfc<1 is defined as the density of the double quantization. ˆucȷ∈Uc is defined as the level of the double quantization, and Uc={±ˆucȷ,ˆucȷ=(ρˆfc)ȷˆuc0,ȷ=±1,±2,⋯,}∪{±ˆuc0}∪{0} with ˆuc0>0.
For the quantization of the controller input, let △ˆf=diag{△ˆf1,△ˆf2,⋯,△ˆfC}, △ˆfc∈[−θfc,θfc], for c∈N={1,2,⋯,C}. Refer to [31], through the approach of the sector bound, ˆf(b) is defined as
ˆf(b)=(I+△ˆf)b. | (2.8) |
For the quantization of the controller output, let △ˆg=diag{△ˆg1,△ˆg2,⋯,△ˆgC}, △ˆgc∈[−θgc,θgc], ˆgc(bc) is described in the same way as ˆfc(bc):
ˆg(b)=(I+△ˆg)b. | (2.9) |
For simplicity, we set θfc=θf and θgc=θg, 0<θf<1 and 0<θg<1. The following two inequalities are specified:
△Tˆf△ˆf≤θ2fI,△Tˆg△ˆg≤θ2gI. | (2.10) |
Through mentioned above quantization scheme, the tracking controller in (2.5) can be modified as
u(t)=r∑j=1ˆhj(ρ(t))ˆg[Kj(φt)ˆf(ϰ(tk))+Fj(φt)ˆf(ϰr(τm))]. | (2.11) |
Combining (2.8), (2.9) and (2.11), we can rewrite the double quantization controller as
u(t)=r∑j=1ˆhj[(Kjμ+△r1(t))ϰ(tk)+(Fjμ+△r2(t))ϰr(τm)], | (2.12) |
where
{△r1(t)=△ˆgKjμ+Kjμ△ˆf+△ˆgKjμ△ˆf,△r2(t)=△ˆgFjμ+Fjμ△ˆf+△ˆgFjμ△ˆf. | (2.13) |
Note that Kj(φt)f(ϰ(tk))+Fj(φt)f(ϰr(τm)) is the output of the controller which varies with t. Hence, by the function of g(⋅) and f(⋅), △ˆg and △ˆf also change with t. Thus, we have
△Tˆf(t)△ˆf(t)≤θ2fI,△Tˆg(t)△ˆg(t)≤θ2gI. | (2.14) |
For simplicity, △ˆf(t), △ˆg(t), △r1(t) and △r2(t) are abbreviated as △ˆf, △ˆg, △r1 and △r2, respectively. It is necessary to note
{△1r1=△ˆgKjμ,△2r1=Kjμ△ˆf,△3r1=△ˆgKjμ△ˆf,△1r2=△ˆgFjμ,△2r2=Fjμ△ˆf,△3r2=△ˆgFjμ△ˆf. | (2.15) |
Then,
{△r1=△1r1+△2r1+△3r1,△r2=△1r2+△2r2+△3r2. | (2.16) |
Remark 2.5. To quantify the data which need to be transmitted between the system and the controller, that is, to convert the form of transmitted data from continuous one to discrete one. At this time, less bandwidth resource is required for the data transmission. However, for most network quantization methods, they only consider the single quantization between the system and the controller [32,33].
In this paper, the double quantization between the system and the controller is considered. Therefore, compared with the existing work, this paper adopts the method of double quantization in [34] to design the tracking controller of (2.12) to save more bandwidth resources. Here, double quantization refers to the quantization of the input and output of the controller, that is, from system to controller and from controller to system both require quantization. The advantage of quantizing the input and output of the controller respectively is that it can reduce the communication burden more efficiently. However, there are also some disadvantages, such as this strategy will introduce more uncertainty in the final system. At the same time, it will add more difficulties to the derivation of the paper. Since the states of the original system and the reference system are not identical, two control gain matrices are introduced to fully account for the differences between the two systems. It is necessary to note that the quantization controller contains two different control gain matrices Kjμ and Fjμ corresponding with the system (2.2) and reference system (2.4), respectively.
Denote the tracking error e(t)=z(t)−zr(t) and let ε(t)=t−τm. Then, the following augment tracking error dynamic system can be obtained:
{˙ζ(t)=∑ri=1∑rj=1hi(θ(t))ˆhj(ρ(t))[ˉAisζ(t)+ˉBijsμζ(t−ε(t))−ˉEijsμξ(t−ε(t))+ˉDisˉω(t)],e(t)=ˉCsζ(t), | (2.17) |
where i,j∈I and
ζ(t)=[ϰT(t)ϰTr(t)]T,ˉω(t)=[ωT(t)rT(t)]T,ϰ(tk)=ϰ(τm)−ξ(τm),ˉAis=[Ais00Ar],ˉBijsμ=[Bis(Kjμ+△r1)Bis(Fjμ+△r2)00],ˉEijsμ=[Bis(Kjμ+△r1)0],ˉDis=[Dis00Br],ˉCs=[Cs−Cr]. |
Figure 1 shows the framework of NCS with double quantizers and the AET. As shown in Figure 1, in consideration of the limited capacity of the communication channels and in order to decrease the rate of the data transmission, two quantizers will quantize the signals of the state and control before they are transmitted to the network medium. To this end, the following definitions and some related lemmas are necessary to list here.
Definition 2.1. The system (2.17) will achieve a stochastic stability, if for ∀ˆt, ˉω(ˆt)≡0 and ζ(0)∈Rn, the following inequality holds:
E{∫∞ˆt=0‖ζ(ˆt)‖2|ζ(0),λ0}<∞. | (2.18) |
Definition 2.2. For the dynamic tracking error system (2.17), there is a definition for the H∞ norm:
‖Φ‖∞=sup{‖e(ˆt)‖2‖ˉω(ˆt)‖2;‖ˉω(ˆt)‖2≠0}. |
Under the controller (2.12) and the zero initial condition, if system (2.17) satisfies the condition in the Definition 2.1, and ‖Φ‖∞<λ, such that the following inequality holds:
∫∞0eT(ˆt)e(ˆt)dˆt<∫∞0λ2ˉωT(ˆt)ˉω(ˆt)dˆt, | (2.19) |
then, it is reasonable to believe that the system (2.17) achieves a stochastic stability and satisfies the given H∞ output tracking performance index λ.
Lemma 2.1. There exists matrices R>0, X is a matrix which has appropriate dimensions, the following inequality can be established under all the circumstance:
−XTR−1X≤−XT−X+R. |
Lemma 2.2. For ∀υ>0, there exists matrices ˜Υ1 and ˜Υ2 the following inequality can be established:
˜ΥT1˜Υ2+˜ΥT2˜Υ1≤υ˜ΥT1˜Υ1+υ−1˜ΥT2˜Υ2. |
Lemma 2.3. For N1≥2n, ℵ∈Rn×n is a semi-positive matrix, and ℵ1∈RN1×N2 is a symmetric matrix which is described as
ℵ=[ℵ100ℵ100000000ℵ100ℵ1]. |
Then, we can get ℵ≥0.
Remark 2.6. It is necessary to note that the researches about the stochastic stability for the fuzzy SMJSs mostly focus on the field of discrete-time. This paper extends the tracking control problem of T-S fuzzy MJSs to the continuous-time domain compared with the extant researches [35,36].
This section will firstly analyze the stability and H∞ tracking performance of the augment system (2.17) with the AETM and the double quantization strategy.
Theorem 3.1. For some given scalars ρi, ρj, λ>0, the control gain matrices Kjμ and some other matrices Pis>0, Q>0, W>0, Zi=ZTi, Zj=ZTj with appropriate dimensions, the system (2.17) can achieve the defined stochastic stability and satisfy the prescribed H∞ tracking performance λ, if ˆhj−ρjhj≥0, such that for ∀is,js∈S, ∀μ∈M. Meanwhile, ∀i,j∈I, the following inequalities conditions hold:
ˉΘijis=ˆΩ+ˆΥ<0, | (3.1) |
ˉΘijis−Zi<0, | (3.2) |
ρiˉΘijis+(1−ρi)Zi<0, | (3.3) |
ρiˉΘijis+ρjˉΘijis+(1−ρi)Zj+(1−ρj)Zi<0,i<j, | (3.4) |
where
ˆΩ=[sym(PisˉAis)+∑js∈SˉλisjsPjs+Q+ˉCTsˉCsPisˉBijsμ0−PisˉEijsμ0ˉATis∗I000ˉBTijsμ∗∗−Q000∗∗∗−ϵ0I0−ˉETijsμ∗∗∗∗−λ2I0∗∗∗∗∗−1ηW−1],ˆΥ=−1ηˆFT˜WˆF,˜W=[W00W],ˆF=[I−I00000I−I000],ˉλisjs=∫∞0λisjs(ˆh)g(ˆh)dˆh, |
where g(ˆh) is the probability density function (PDF) of the residence time ˆh for the system mode is.
Proof. Suppose ζt(y)=ζ(t+y) for η≤y≤0. For t∈[τm,τm+1), m∈Z+, the following L-K functions are selected as
V(ζt,s,t)=4∑k=1Vk(ζt,s,t), | (3.5) |
where
V1(ζt,s,t)=ζT(t)Pshζ(t),V2(ζt,s,t)=∫0−ηζT(y)Qζ(y)dy,V3(ζt,s,t)=∫0−η∫0ν˙ζTt(y)W˙ζt(y)dydν,V4(ζt,s,t)=12ϵ2(t), |
where Psh=∑ri=1hiPsi. For a given small scalar θ which is not the same as θ in θg and θf. Let γ(t)=[ζT(t)ζT(t−ε(t)ζT(t−η)ξT(t−ε(t)]T. The following equalities hold:
ζ(t+y)=ζ(t)+θ˙ζ(t)+o(θ)=[I+θˉAshθˉBshμ0−θˉEhsμ]γ(t)+o(θ), | (3.6) |
limθ→0Gis(ˆh+θ)−Gi(ˆh)θ(1−Gis(ˆh))=λi(ˆh), | (3.7) |
limθ→01−Gis(ˆh+θ)1−Gis(ˆh)=1, | (3.8) |
where ˉAsh=∑ri=1hiˉAis, ˉBshμ=∑ri=1∑rj=1hiˆhjˉBijsμ, ˉEhsμ=∑ri=1∑rj=1hiˆhjˉEijsμ. Gis(ˆh) represents the cumulative distribution function (CDF) of the residence time h for the mode is, and qisjs represents the probability that the mode of the system changes from is to js, i.e., qisjs=Pr{ϕı+1=js|ϕı=is} and M∑js=1js≠isqisjs=1. λis(ˆh) is the transition rate of the system mode is. λisjs(ˆh)=qisjsλis(ˆh) for is≠js, λisis(ˆh)=−M∑js=1js≠isλisjs(ˆh).
Refer to [5,29], for the semi-Markov process {ζt,s,t≥0} in this paper. Denote J to be the weak infinitesimal operator. For s=is∈S, the derivative of V1(ζt,s,t) along the trajectories of the system (2.17) can be calculated by L:
JV1(ζt,s,t)=limθ→01θ[E{M∑js=1js≠isPr{ϕı+1=js,ˆhı+1≥ˆh+θ|ϕı=is,ˆhı+1>ˆh}ζT(t+θ)Pjsζ(t+θ)+Pr{ϕı+1=is,ˆhı+1>ˆh+θ|ϕı=is,ˆhı+1>ˆh}ζT(t+θ)Pisζ(t+θ)}−ζT(t)Pisζ(t)]=limθ→01θ[E{M∑js=1js≠isqisjs(Gis(ˆh+θ)−Gis(ˆh))1−Gis(ˆh)ζT(t+θ)Pjsζ(t+θ)+1−Gis(ˆh+θ)1−Gis(ˆh)ζT(t+θ)ζ(t+θ)}−ζT(t)Pisζ(t)]=r∑i=1r∑j=1n∑μ=1hiˆhjϱsμγT(t)(Xis+FT1∑js∈SˉλisjsPjsF1)γ(t), | (3.9) |
where F1=[I,0,0,0] and
Xis=[sym(PisˉAsh)PisˉBshμ0−PisˉEshμ∗000∗∗00∗∗∗0]. |
Take the derivative of V2(ζt,s,t) as follows:
JV2(ζt,s,t)=ζT(t)Qζ(t)−ζT(t−η)Qζ(t−η)=γ(t)(FT1QF1−FT3QF3)γ(t), | (3.10) |
where F3=[0,0,I,0].
Then, we take the derivative of V3(ζt,s,t) as follows:
JV3(ζt,s,t)=r∑i=1r∑j=1n∑μ=1hiˆhjϱsμγT(t)[ηYTisWYis−∫tt−η˙ζT(y)W˙ζ(y)dy]γ(t), | (3.11) |
where Yis=[ˉAshˉBshμ0−ˉEshμ]. By the Jensen-inequality in [37], the second term in the right of (3.11) is modified as
−∫tt−η˙ζT(y)W˙ζ(y)dy=−∫t−ε(t)t−η˙ζT(y)W˙ζ(y)dy−∫tt−ε(t)˙ζT(y)W˙ζ(y)dy≤−η−ε(t)η∫t−ε(t)t−η˙ζT(y)W˙ζ(y)dy−ε(t)η∫tt−ε(t)˙ζT(y)W˙ζ(y)dy≤−1ηγT(t)(F2−F3)TW(F2−F3)γ(t)−1ηγT(t)(F1−F2)TW(F1−F2)γ(t)=−γT(t)1ηFT˜WFγ(t), | (3.12) |
where F2=[0,I,0,0] and
F=[I−I000I−I0],˜W=[W00W]. |
Hence, from (3.11) and (3.12), it follows that
JV3(ζt,s,t)≤r∑i=1r∑j=1n∑μ=1hiˆhjϱsμγT(t)(ηYTisWYis−1ηFT˜WF)γ(t). | (3.13) |
Then, considering the event-triggered condition in (2.6) and (2.7), the derivative of V4(ζt,s,t) is calculated as follows:
JV4(ζt,s,t)=ϵ(t)˙ϵ(t)=ξT(t−ε(t))ξ(t−ε(t))ϵ(t)−ϵ0ξT(t−ε(t))ξ(t−ε(t))≤ζT(t−ε(t))ζ(t−ε(t)−ϵ0ξT(t−ε(t))ξ(t−ε(t))=γT(t)(˜I1−˜I2)γ(t), | (3.14) |
where
˜I1=[00000I0000000000],˜I2=[000000000000000ϵ0I]. |
Combining (3.9), (3.10), (3.13) and (3.14) yields
JV(ζt,s,t)≤r∑i=1r∑j=1n∑μ=1hiˆhjϱsμγT(t)Θijisγ(t), | (3.15) |
where Θijis=Ω+Υ, Υ=−1ηFT˜WF and
Ω=[Ω11PisˉBijsμ0−PisˉEijsμˉATis∗I00ˉBTijsμ∗∗−Q00∗∗∗−ϵ0I−ˉETijsμ∗∗∗∗−1ηW−1],Ω11=sym(PisˉAis)+∑j∈SˉλisjsPjs+Q. |
Then, for (3.1), through the Schur complement, Θijis<0 can be deduced, i.e., JV(ζt,s,t)<0. Through the Dynkin's formula, if JV(ζt,s,t)<0, for a cut-off time T>0 and a constant ϵ>0, the following inequality will hold:
E{V(ζ(T),s,T)}−V(ζ0,ϕ0)}<−ϵE{∫T0‖ζ(t)‖2dt}. |
Then, let T→∞, it has
E{∫T0‖ζ(t)‖2dt}<1ϵV(ζ0,ϕ0,0)<∞. |
From Definition 2.1, it can be obtained that the system (2.17) have achieved a stochastic stability. Furthermore, the H∞ tracking performance under the condition of external disturbance ˉω(t)≠0 is considered. From (3.15), we can obtain
J=∫∞0E{eT(t)e(t)−λ2ˉωT(t)ˉω(t)}dt≤∫∞0E{eT(t)e(t)−λ2ˉωT(t)ˉω(t)}dt−V(ζ0,ϕ0)+E{V(ζ(∞),ϕ(∞))}=∫∞0E{eT(t)e(t)−λ2ˉωT(t)ˉω(t)+LV(ζt,s,t)}dt=r∑i=1r∑j=1n∑μ=1hiˆhjϱsμ∫∞0ˉγT(t)ˉΘijisˉγ(t)dt, | (3.16) |
where ˉγ(t)=[γT(t)ˉωT(t)]T and ˉΘijis=ˆΩ+ˆΥ.
In order to reduce the conservativeness and make full use of the MFs information, we introduce the slack matrices Zi. Due to ∑ri=1hi−∑rj=1ˆhj=0. Then, according to [38,39,40,41], combining (3.2)–(3.4) with the system (2.17) and considering ˆhj−ρjhj≥0, we can get
r∑i=1r∑j=1hi(hj−ˆhj)Zi=r∑i=1hi(r∑j=1hj−r∑j=1ˆhj)Zi=0. |
Then, combining the above formula, we can get
ˉΘhis=r∑i=1r∑j=1hiˆhjˉΘijis=r∑i=1r∑j=1hiˆhjˉΘijis+r∑i=1r∑j=1hi(hj−ˆhj+ρjhj−ρjˆhj)Zi=r∑i=1h2i(ρjˉΘijis+(1−ρj)Zi)+r∑i=1r∑j=1hi(ˆhj−ρjhj)(ˉΘijis−Zi)+r−1∑i=1r∑j=1hihj(ρjˉΘijis+ρiˉΘijis+(1−ρj)Zi+(1−ρi)Zj)<0. |
Hence, the condition (3.1) in Theorem 3.1 shows that J<0. i.e.,
∫∞0eT(t)e(t)dt<∫∞0λ2ˉωT(t)ˉω(t)dt. |
From Definition 2.2, it is obvious that the system (2.17) achieves a stochastic stable state and satisfies the prescribed H∞ tracking performance λ.
Thus, the proof is completed.
Remark 3.1. In consideration of reducing the conservatism, referring to [30]. The difference from [30] is that we select the fuzzy Lyapunov matrix Psh=∑ri=1hiPsi as the modal dependency matrix in this paper. This paper studies the stability of the system and H∞ tracking performance, but [30] studies the stability of multi-agent system. For the purpose of making full use of the AET conditions, the quadratic integral term ∫0−η∫0ν˙ζTt(y)W˙ζt(y)dydν related to ζ(t−ε(t) and 12ϵ2(t) related to AET threshold ϵ(t) are all considered in Theorem 3.1, which can decrease the conservatism of the system.
In Theorem 3.1, some sufficient criteria which can ensure the stochastic stability with ˉω(k)=0 and achieve a given H∞ tracking performance for the system (2.17). However, based on the analysis results in Theorem 3.1, it is difficult for us to parameterize the controller gains directly because of the existence of nonlinear terms. For the purpose of using the method of LMIs to solve the problem, the results of the controller construction are summarized in the following achievements.
The matrices in Theorem 3.2 are mainly some equivalent transformations of the final matrix of Theorem 3.1 such as contract transformation and Schur complementary, etc. The matrix separation technique is also used to separate out some uncertain terms. Meanwhile, two lemmas given in the paper are also applied to perform the corresponding deflation without changing the properties of the original matrix. Finally, we can achieve Theorem 3.2.
Theorem 3.2. For some given scalars ρ, η, γ, β, ρi, ρj, λ>0, a1>0, a2>0 and a3>0 and controller gain matrices Kjμ, the system (2.17) can achieve a stochastic stability and satisfy the prescribed H∞ tracking performance, and for some other matrices His>0, ˆQ>0, ˆW>0, Wis>0, ˆKjμ and ˆZi with appropriate dimensions such that, for ∀is∈S, ∀μ∈M, ∀i,j∈I, the following inequalities hold:
ˆΘijis−ˆZi<0, | (3.17) |
ρiˆΘijis+(1−ρi)ˆZi<0, | (3.18) |
ρiˆΘijis+ρjˆΘijis+(1−ρi)ˆZj+(1−ρj)ˆZi<0,i<j, | (3.19) |
ρHis+ρHTis−ρ2In≥Wis, | (3.20) |
[γWisˆKjμ∗I]≥0,[βWisˆFjμ∗I]≥0, | (3.21) |
ˆΘijis=[˜Ω(11)+˜Υ+BrGTisGTisGTis∗−a1I00∗∗−a2I0∗∗∗−a3I]<0, | (3.22) |
![]() |
˜Ω(11)11=sym(AisHis)+ˉλisisHTis,˜Ω(11)22=sym(ArHis)+ˉλisisHTis,˜Ω(11)55=−HTis−His+ˆQ,˜Ω(11)66=−HTis−His+1ϵ0I,˜Ω(11)77=−HTis−His+1λ2I,˜Ω(11)113=[√ˉλis1HTis,√ˉλis2HTis,⋯,√ˉλis(is−1)HTis,√ˉλis(is+1)HTis,⋯,√ˉλisMHTis],˜Ω(11)1313=−diag{H1,H2,⋯,His−1,His+1,⋯,HM},˜Υ=1ηFT[−sym(His)+ˆW00−sym(His)+ˆW]F,F=[I−I000⋯00I−I00⋯0⏟10],Gis=[00His00000⋯0000His0000⋯000000His00⋯0⏟7],Br=a1B1r+a2B2r+a3B3r,B1r=[B111r00⋯0B181r00⋯0000⋯0000⋯0⋮⋮⋮⋮000⋯0000⋯0B811r00⋯0B881r00⋯0000⋯0000⋯0⋮⋮⋮⋮000⋯0⏟6000⋯0⏟5],B2r=[B112r00⋯0B182r00⋯0000⋯0000⋯0⋮⋮⋮⋮000⋯0000⋯0B812r00⋯0B882r00⋯0000⋯0000⋯0⋮⋮⋮⋮000⋯0⏟6000⋯0⏟5],B3r=[B113r00⋯0B183r00⋯0000⋯0000⋯0⋮⋮⋮⋮000⋯0000⋯0B813r00⋯0B883r00⋯0000⋯0000⋯0⋮⋮⋮⋮000⋯0⏟6000⋯0⏟5],{B111r=B181r=B811r=B881r=(2γ+β)αisθ2gI,B112r=B182r=B812r=B882r=(2γ+β)αisθ2fI,B113r=B183r=B813r=B883r=(2γ+β)αisθ2gθ2fI, |
where θg and θf are defined in (2.14), αis is the largest eigenvalue of BisBTis. Then, the tracking control gains Kjμ and Fjμ for is∈S, is given by Kjμ=ˆKjμH−1is and Fjμ=ˆFjμH−1is.
Proof. Let His=P−1is. Define Λ=diag{His,His,His,His,His,I}. Then, pre- and post-multiplying (3.1) with ΛT and Λ, respectively, it can be obtained that
ΛTˉΘijisΛ=ΛTˆΩΛ+ΛTˆΥΛ<0. | (3.23) |
Let ˜Ω=ΛTˆΩΛ and ˜Υ=ΛTˆΥΛ. Thus,
˜Ω=[˜Ω11ˉBijsμHis0−ˉEijsμHis0HTisˉATis∗HTisHis000HTisˉBTijsμ∗∗−HTisQHis000∗∗∗−ϵ0HTisHis0−HTisˉETijsμ∗∗∗∗−λ2HTisHis0,∗∗∗∗∗−1ηW−1]˜Ω11=sym(ˉAisHis)+∑js∈Sjs≠isˉλisjsHTisH−1jsHis+ˉλisisHTis+HTisQHis+HTisˉCTsˉCsHis. | (3.24) |
Based on Lemma 2.1, we can obtain
˜Υ=−1ηˆFT[HTis00HTis][W00W][His00His]ˆF≤1ηˆFT[−sym(His)+W−100−sym(His)+W−1]ˆF | (3.25) |
and
{−HTisQHis≤−HTis−His+Q−1,−ϵ0HTisHis=−HTis(ϵ0I)His≤−HTis−His+1ϵ0I,−λ2HTisHis=−HTis(λ2I)His≤−HTis−His+1λ2I. | (3.26) |
Integrating (3.24)–(3.26) into (3.23) and using the Schur complement for (3.23). Thus, (3.1) holds if the following condition holds:
˜Ω(1)+˜Υ<0, | (3.27) |
where
˜Ω(1)=[˜Ω(11)110Φ1Φ20−Φ10HTisATis0HTis0HTisCTs˜Ω(11)113∗˜Ω(11)22000000HTisATr00−HTisCTr0∗∗00000ΦT100HTis00∗∗∗0000ΦT200000∗∗∗∗˜Ω(11)5500000000∗∗∗∗∗˜Ω(11)660−ΦT100000∗∗∗∗∗∗˜Ω(11)77000000∗∗∗∗∗∗∗−1ηˆW00000∗∗∗∗∗∗∗∗−1ηˆW0000∗∗∗∗∗∗∗∗∗−ˆQ000∗∗∗∗∗∗∗∗∗∗−I00∗∗∗∗∗∗∗∗∗∗∗−I0∗∗∗∗∗∗∗∗∗∗∗∗˜Ω(11)1313], |
where
Φ1=Bis(ˆKjμ+△r1His),Φ2=Bis(ˆFjμ+△r2His),ˆKjμ=KjμHis,ˆFjμ=FjμHis,ˆQ=Q−1,ˆW=W−1. |
Considering (2.15), (2.16) and (3.27), ˜Ω(1) can be rewritten as
˜Ω(1)=˜Ω(11)+sym{B1rGis+B2rGis+B3rGis}, | (3.28) |
where
B1r=[Bis△1r1Bis△1r2Bis△1r1I10I10I10Bis△1r1Bis△1r2Bis△1r1I20I20I20],B2r=[Bis△2r1Bis△2r2Bis△2r1I10I10I10Bis△2r1Bis△2r2Bis△2r1I20I20I20],B3r=[Bis△3r1Bis△3r2Bis△3r1I10I10I10Bis△3r1Bis△3r2Bis△3r1I20I20I20],I10=[000000]T,I20=[00000]T. |
From Lemma 2.2, we have
sym{B1rGis+B2rGis+B3rGis}≤a1BT1rB1r+a2BT2rB2r+a3BT3rB3r+a−11GTisGis+a−12GTisGis+a−13GTisGis=B∗r, | (3.29) |
where 0<a1,a2,a3∈R and
BT1rB1r=[B111rI10TB181rI20TI10I30I10I30TB811rI10TB881rI20TI20I30I20I30T],BT2rB1r=[B112rI10TB182rI20TI10I30I10I30TB812rI10TB882rI20TI20I30I20I30T],BT3rB1r=[B113rI10TB183rI20TI10I30I10I30TB813rI10TB883rI20TI20I30I20I30T],I30=[000000000000000000000000000000],{B111r=B181r=B811r=B881r=2(Bis△1r1)(Bis△1r1)T+(Bis△1r2)(Bis△1r2)T,B112r=B182r=B812r=B882r=2(Bis△2r1)(Bis△2r1)T+(Bis△2r2)(Bis△2r2)T,B113r=B183r=B813r=B883r=2(Bis△3r1)(Bis△3r1)T+(Bis△3r2)(Bis△3r2)T. |
Then, considering (3.28) and (3.29), we can obtain that (3.27) holds if
˜Ω(11)+˜Υ+B∗r<0. | (3.30) |
By Lemma 2.1, it is obvious that
HTisHis=ρHTis(1ρ2I)ρHis≥ρHTis+ρHis−ρ2I. | (3.31) |
Applying Schur complement to (3.21), we have
−γWis+ˆKTjμˆKjμ<0. | (3.32) |
Considering (3.20), (3.31), (3.32) and ˆKjμ=KjμHis, it can be achieved that
HTisHis≥1γHTisKTjμKjμHis. | (3.33) |
Pre- and post-multiplying (3.33) with H−1is yields KTjμKjμ≤γI. Since KTjμKjμ and KjμKTjμ have same nonzero eigenvalues, thus KjμKTjμ≤γI.
Based on those and (2.15), we can obtain
(Bis△1r1)(Bis△1r1)T=Bis△1r1△T1r1BTis≤Bisγ△g△TgBTis≤αisθ2gγI, | (3.34) |
where αis denotes the largest eigenvalue of BisBTis.
Using similar methods, we can get
(Bis△1r2)(Bis△1r2)T≤αisθ2gβI. |
Similarly, we can also get
{(Bis△2r1)(Bis△2r1)T≤αisθ2fγI,(Bis△2r2)(Bis△2r2)T≤αisθ2fβI,(Bis△3r1)(Bis△3r1)T≤αisθ2gθ2fγI,(Bis△3r2)(Bis△3r2)T≤αisθ2gθ2fβI. |
Hence, we can see that BT1rB1r≤B1r, BT2rB2r≤B2r and BT3rB3r≤B3r. Therefore, (3.30) holds if the following holds:
˜Ω(11)+˜Υ+a1B1r+a2B2r+a3B3r+(a−11+a−12+a−13)GTisGis<0. | (3.35) |
By the Schur complement, (3.35) is equivalent (3.22). In summary, (3.1)–(3.4) hold if (3.17)–(3.22) hold. So far, the proof is completed.
In order to verify the effectiveness of the theoretical results, a numerical example and a single-link flexible joint manipulator system are selected in this section.
Example 1. In the numerical example, three modes of the system (2.2) are specified. The corresponding three-dimensional transition probability matrix with a semi-Markovian process is chosen as
˜Λ(ˆh)=[−2ˆh−1.5ˆh1.2ˆh1.5ˆh2−3ˆh2−0.5ˆh2.5ˆh2−2.5ˆh2−0.5ˆh]. |
Through relevant calculations, the mathematical expectation of ˜Λ(ˆh) is
E{˜Λ(ˆh)}=[−1.7250.0880.0761.354−2.7080.9851.345−0.9761.213]. |
Consider a two-rules T-S fuzzy MJSs of the form (2.1):
Plant rule 1: If ϰ1(t) is −mϕt, then,
{˙ϰ(t)=A1,ϕtϰ(t)+B1,ϕtu(t)+D1,ϕtω(t),z(t)=Cϕtϰ(t). | (4.1) |
Plant rule 2: If ϰ2(t) is mϕt, then,
{˙ϰ(t)=A2,ϕtϰ(t)+B2,ϕtu(t)+D2,ϕtω(t),z(t)=Cϕtϰ(t), | (4.2) |
with its parameters selected as
A11=[−4.5555.5],A21=[−9.54.33−3.5],A12=[−4.565.5−6.2],A22=[−2.52.31−3.6],A13=[−4.5555.5],A23=[−9.54.33−3.5],B11=B12=B13=[10],B21=B22=B23=[20],C1=C2=C3=[10],D11=D12=D13=[−1.31.5],D21=D22=D23=[−1.11.3]. |
According to the reference system (2.4), assume a reference model with its parameters:
Ar=[−500−1.5],Br=[0.5−0.1],Cr=[12]. |
The parameters of AET condition (2.6) are selected as ϵ0=0.1. The parameters of quantization are chosen as ˆuc0=2, θfc=(1−ρfc)/(1+ρfc)=1.0001, θgc=(1−ρgc)/(1+ρgc)=1.00015 where c∈C={1,2,...,C}. In Theorem 3.2, let γ=1.5, β=0.5. An expected H∞ performance λ∗=0.0052 can be achieved with the results of the controller gains as follows:
K11=[−13.612−2.687],K12=[−19.911−3.182],K13=[−17.268−4.484],K21=[−1.612−0.323],K22=[−2.613−0.484],K23=[−4.623−0.581],F11=[16.63830.941],F12=[19.87723.487],F13=[14.1633.481],F21=[1.8973.783],F22=[2.4154.692],F23=[1.0733.488]. |
Let the reference input r(t)=sin(t) and the external disturbances w(t)=0.5exp(−t). Figure 2 shows the mode evolution of the system and the controller. The state trajectories of two-rules without a controller are depicted in Figure 3. We can see that the system is unable to achieve a stochastic stability. When the designed controllers (2.12) are added to the system, it is obvious that the system is stable stochastically and the corresponding trajectories are shown in the Figure 4. Figure 5 shows that the output-tracking trajectories of the z(t) and zr(t). It can be seen that the system tracks the reference system perfectly with the controller. Figure 6 depicts that the trajectories of the tracking error with the designed controllers. The value of the tracking error reaches a stochastic stability around the 15th second. Figure 7 is the state trajectory of ζ(t) which also remains stable after the 15th second. Figure 8 demonstrates the AET release instants and intervals. From Figure 5, it can be found that the number of the triggered times is 132. By simple calculation, it implies that there has 10.1% of the sampled data require to be transmitted to the controller. Additionally, it can be calculated that the maximal value of the release interval is 2.109 and the average value of the release interval is 1.046. Next, in order to improve the performance of the network system, it is necessary to analyze that how two quantization parameters θf and θg affect the optimal H∞ tracking performance index λ∗. Through corresponding numerical calculation and simulation, the related results are presented in Table 1.
θf | θg | λ∗ |
0.01 | 0.001 | 0.0523 |
0.02 | 0.001 | 0.0589 |
0.05 | 0.001 | 0.0834 |
0.08 | 0.001 | 0.0978 |
0.1 | 0.001 | 0.3241 |
0.01 | 0.002 | 0.0849 |
0.01 | 0.005 | 0.1787 |
0.01 | 0.008 | 0.2903 |
0.01 | 0.01 | 0.3890 |
Due to the limited space of the paper, the data in Table 1 only shows some representative simulation results, and the following conclusions can be obtained through the remaining large number of simulation results. From Table 1, it can be obtained that with the value of output quantization parameter unchanged, the input quantization parameter value increases, λ∗ also increases. Correspondingly, when the value of input quantization parameter remains unchanged, the output quantization parameter value increases, λ∗ also increases. This shows that the smaller both the quantization parameters are, the more superior tracking performance which the original system has.
Example 2. Borrowed from [24], an example of a single-link flexible joint manipulator is selected. The dynamic equation of the system is
{˙ϰ1(˜t)=ϰ3(˜t),˙ϰ2(˜t)=ϰ4(˜t),˙ϰ3(˜t)=LsMhϰ2(˜t)−L2mL2gRmMhϰ3(˜t)+LmLgRmMhu(˜t),˙ϰ4(˜t)=−LsMhϰ2(˜t)+L2mL2gRmMhϰ3(˜t)−LmLgRmMhu(˜t)−LsMhϰ2(˜t)+mlghMlsin(ϰ1(˜t)+ϰ2(˜t)), | (4.3) |
where ϰ1(˜t) is the angular position of the arm, ϰ2(˜t) is the angular displacement, ϰ3(˜t) is the angular velocity of the motor, ϰ4(˜t) is the angular velocity. Moreover, ϰ1(˜t)+ϰ2(˜t)∈[−π/2,π/2], Thus, y1(ϰ1(˜t))=sin(ϰ1(˜t)+ϰ2(˜t))ϰ1(˜t)+ϰ2(˜t)∈[y1min,y1max]=[0,1], some related parameters are listed in Table 2.
Parameters | Symbol | Value |
Elastic hardness | Ls | 1.23[N/m] |
Hub inertia | Mhν | 0.005[Kg⋅m2] |
Connecting rod mass | ml | 0.504[Kg] |
Gravitational constant | g | -9.8[N/m] |
Height of C.M | h | 0.08[m] |
Motor const | Lm | 0.00676[N/rad/s] |
Load inertia | Ml | 0.0065[Kg ⋅m2] |
Gears ratio | Lg | 99 for mode one |
The MFs are denoted as h1(ϰ1(˜t))=y1(ϰ1(˜t))−y1maxy1min−y1max and h2(ϰ1(˜t))=1−h1(ϰ1(˜t)). The manipulator is considered as a 2-rule fuzzy MJS of system (2.1). Its parameters are selected as
A1=[001000010LsMh−L2mL2gRmMh0y1minmlghMla1L2mL2gRmMh0],A2=[001000010LsMh−L2mL2gRmMh0y1maxmlghMla2L2mL2gRmMh0],B1=[00LmLgRmMh−LmLgRmMh],B2=[00LmLgRmMh−LmLgRmMh],C1=C2=[10000100],D1=D2=[−0.40.50.10.2], |
with
{a1=−(LsMh+LsMl)+y1minmlghMl,a2=−(LsMh+LsMl)+y1maxmlghMl. |
Then, the reference model is selected as follows:
Ar=[00100001−4123.234134.789−2742.75339.3494234.172−427.7762671.075−39.467],Br=[00LmLgRmMh−LmLgRmMh]. |
By setting the initial value ϰ(0)=[2110]T, ϰr(0)=[0.1110]T, the desired control gains with λmin=1.2456>‖e(˜t)‖2‖ˉω(˜t)‖2=0.0627. The corresponding state and error trajectories are shown in Figures 9–11. It is obtained that the above system can also reaches the stochastic stability under some prescribed conditions. Meanwhile, the manipulator system can also track the desired reference system well under the given H∞ tracking performance index λmin.
In this paper, a class of H∞ tracking control problem for continuous-time fuzzy SMJSs is investigated. The AETM and double quantization strategy for the controller input and the controller output are adopted to compress network communication signals and improve the transmission efficiency. Based on the improved L-K functions and LMI techniques, some sufficient criteria which can enable the system achieve a stochastic stability and satisfy the H∞ tracking performance of the tracking control system are derived. At the same time, a quantitative tracking feedback controller based on fuzzy basis and mode dependence is constructed. Finally, two examples are given to demonstrate the effectiveness and rationality of the above method. In the future work, it is hoped that the results can be extended to other fuzzy SMJSs with the time-varying delay, deception attacks, DOS attacks, and so on. Of course, other quantized strategies are also worth our further research.
This work was supported in part by the National Natural Science Foundation of China under Grant 11661028, the Natural Science Foundation of Guangxi under Grant 2020GXNSFAA159141, Guangxi Philosophy and Social Science Programming Project (2022) under Grant 22BTJ001.
The authors declare that they have no conflicts of interest concerning the publication of this manuscript.
[1] | J. A. Bondy, U. S. R. Murty, Graph theory, Springer, 2008. http://dx.doi.org/10.1007/978-1-84628-970-5 |
[2] |
H. J. Broersma, H. J. Veldman, 3-connected line graphs of triangular graphs are pan-connected and 1-Hamiltonian, J. Graph Theor., 11 (1987), 399–407. https://doi.org/10.1002/jgt.3190110314 doi: 10.1002/jgt.3190110314
![]() |
[3] |
P. A. Catlin, A reduction method to find spanning eulerian subgraphs, J. Graph Theor., 12 (1988), 29–44. https://doi.org/10.1002/jgt.3190120105 doi: 10.1002/jgt.3190120105
![]() |
[4] | P. A. Catlin, Supereulerian graphs, collapsible graphs, and four-cycles, Congressus Numerantium, 58 (1988), 233–246. |
[5] |
P. A. Catlin, Z. Y. Han, H. J. Lai, Graphs without spanning closed trals, Discrete Math., 160 (1996), 81–91. https://doi.org/10.1016/S0012-365X(95)00149-Q doi: 10.1016/S0012-365X(95)00149-Q
![]() |
[6] |
P. A. Catlin, H. J. Lai, Y. Shao, Edge-connectivity and edge-disjoint spanning trees, Discrete Math., 309 (2009), 1033–1040. https://doi.org/10.1016/j.disc.2007.11.056 doi: 10.1016/j.disc.2007.11.056
![]() |
[7] |
Z. H. Chen, H. J. Lai, W. Shiu, D. Li, An s-Hamiltonian line graph problem, Graph. Combinator., 23 (2007), 241–248. https://doi.org/10.1007/s00373-007-0727-y doi: 10.1007/s00373-007-0727-y
![]() |
[8] |
F. Harary, C. S. J. A. Nash-Williams, On eulerian and Hamiltonian graphs and line graphs, Can. Math. Bull., 8 (1965), 701–710. https://doi.org/10.4153/CMB-1965-051-3 doi: 10.4153/CMB-1965-051-3
![]() |
[9] |
H. J. Lai, Y. Shao, On s-Hamiltonian line graphs, J. Graph Theor., 74 (2013), 344–358. https://doi.org/10.1002/jgt.21713 doi: 10.1002/jgt.21713
![]() |
[10] |
H. J. Lai, Y. Shao, H. Wu, J. Zhou, Every 3-connected, essentially 11-connected line graph is Hamiltonian, J. Comb. Theory B, 96 (2006), 571–576. https://doi.org/10.1016/j.jctb.2005.11.002 doi: 10.1016/j.jctb.2005.11.002
![]() |
[11] |
H. J. Lai, M. Zhan, T. Zhang, J. Zhou, On s-Hamiltonian line graphs of claw-free graphs, Discrete Math., 342 (2019), 3006–3016. https://doi.org/10.1016/j.disc.2019.06.006 doi: 10.1016/j.disc.2019.06.006
![]() |
[12] | Y. Shao, Claw-free graphs and line graphs, Ph.D. Dissertation, West Virginia University, 2005. |
1. | BETHANY I. CALDWELL, DOUGLAS–RACHFORD ALGORITHM FOR OPTIMAL CONTROL PROBLEMS, 2025, 0004-9727, 1, 10.1017/S0004972725100208 |
θf | θg | λ∗ |
0.01 | 0.001 | 0.0523 |
0.02 | 0.001 | 0.0589 |
0.05 | 0.001 | 0.0834 |
0.08 | 0.001 | 0.0978 |
0.1 | 0.001 | 0.3241 |
0.01 | 0.002 | 0.0849 |
0.01 | 0.005 | 0.1787 |
0.01 | 0.008 | 0.2903 |
0.01 | 0.01 | 0.3890 |
Parameters | Symbol | Value |
Elastic hardness | Ls | 1.23[N/m] |
Hub inertia | Mhν | 0.005[Kg⋅m2] |
Connecting rod mass | ml | 0.504[Kg] |
Gravitational constant | g | -9.8[N/m] |
Height of C.M | h | 0.08[m] |
Motor const | Lm | 0.00676[N/rad/s] |
Load inertia | Ml | 0.0065[Kg ⋅m2] |
Gears ratio | Lg | 99 for mode one |
θf | θg | λ∗ |
0.01 | 0.001 | 0.0523 |
0.02 | 0.001 | 0.0589 |
0.05 | 0.001 | 0.0834 |
0.08 | 0.001 | 0.0978 |
0.1 | 0.001 | 0.3241 |
0.01 | 0.002 | 0.0849 |
0.01 | 0.005 | 0.1787 |
0.01 | 0.008 | 0.2903 |
0.01 | 0.01 | 0.3890 |
Parameters | Symbol | Value |
Elastic hardness | Ls | 1.23[N/m] |
Hub inertia | Mhν | 0.005[Kg⋅m2] |
Connecting rod mass | ml | 0.504[Kg] |
Gravitational constant | g | -9.8[N/m] |
Height of C.M | h | 0.08[m] |
Motor const | Lm | 0.00676[N/rad/s] |
Load inertia | Ml | 0.0065[Kg ⋅m2] |
Gears ratio | Lg | 99 for mode one |