1.
Introduction
As we all know, complex dynamical networks (CDNs) generally are described by graphs, where the states are seen as nodes, and the communication information between nodes is denoted as an edge. In CDNs, each node has unique dynamic behavior, and the whole network can present different complex dynamics. In the past decades, CDNs have become a hot spot in various fields because they can represent multifarious real systems, such as biological networks, the World Wide Web, neural networks, genetic networks, ecosystems, social networks, biomolecular networks, and so forth [1,2,3,4]. CDNs consists of a large set of interconnected nodes, where each node is a basic unit with specific dynamic behavior, including stability, dissipativity, passivity and synchronization.
As a typical dynamic behavior of CDNs, synchronization is a fascinating phenomenon, which has important practical significance and broad application prospects. For example, after a great speech, the applause of the audience can change gradually from chaos to consensus. Therefore, the synchronization issue has attracted attention from many scholars in various fields: biomedicine, engineering technology, information communication and so on. Recently, there have many different synchronization patterns, such as phase synchronization [5], exponential synchronization [6], projective synchronization [7], finite-time synchronization [8], and fixed-time synchronization [9]. In these types of synchronization, all coupled nodes tend to present a common state as the network evolves, which is called complete synchronization. Nevertheless, complete synchronization of the entire network is not desirable or even possible. Therefore, cluster synchronization occurs in the application, that is, the nodes in the network are divided into several clusters, and the nodes in the same cluster are synchronized, while those nodes in different clusters are not synchronized. In recent years, a growing amount of attention has been paid to cluster synchronization in networks. In [10], cluster stochastic synchronization of complex networks was investigated, and a quantized controller was designed to realize the synchronization of CDNs within a settling time. The cluster synchronization problem for a class of CDNs with coupled time delays was discussed in [11].
It is worth noting that the above types of synchronization are asymptotic synchronization. However, compared with asymptotic synchronization, states can realize synchronization in finite time, in which the settling time is dependent on the initial states. Therefore, finite-time synchronization can only be utilized in a situation where the initial conditions are known. In comparison with finite-time synchronization, the stochastic settling time of fixed-time synchronization [12,13,14,15,16] is regardless of initial conditions. Recently, the finite-time and fixed-time cluster synchronization problems for CDNs have attracted increasing attention due to rapid convergence and better robustness to suppress uncertainties and disturbances. The problem of finite-time cluster synchronization for nonlinear CDNs with hybrid couplings based on aperiodically intermittent control was discussed in [17]. The authors in [18] studied the fixed-time cluster synchronization problem for a class of directed community networks with discontinuous nodes via periodically or aperiodically switching control. In [19], the cluster stochastic synchronization of CDNs via a fixed-time control scheme was discussed. The authors in [20] studied the fixed/preassigned-time cluster synchronization problem for multi-weighted CDNs with stochastic disturbances based on quantized adaptive pinning control.
As we all know, there are still a host of stochastic or unknown factors in the actual systems. Therefore, it is of great practical significance to study the dynamic properties of stochastic systems. Markovion jump systems are suitable for characterizing and modeling different types of systems with abrupt changes [21] and were extensively studied in many aspects, such as stability analysis, static output feedback controller design, and H∞ filtering problems [22,23,24,25,26,27,28]. For singular Markovian jump systems, there are abundant conclusions: especially, the issue of static output feedback control was studied in [29,30,31,32]. Unfortunately, the sojourn time in the Markovian jump model used in [33] is subject to the exponential distribution with the memoryless property, which is hard to promise in many practical systems [34]. It is worth mentioning that the sojourn-time in a semi-Markovian switching process [35] can be supposed to obey other probability distributions, such as the Weibull distribution or the Gaussian distribution. Hence, the investigation of semi-Markovian switching CDNs is of great theoretical value and practical significance. In [36], finite-time H∞ synchronization for CDNs with semi-Markovian jump topology was discussed. The event-triggered synchronization for semi-Markovian switching CDNs with hybrid couplings and time-varying delays was discussed in [37].
In reality, fuzzy logic has a close relationship with the synchronicity and complexity of CDNs. As an extremely important method proposed by Takagi and Sugeno, the fuzzy control approach provides a systematic method for studying the nonlinear systems by expressing a specific nonlinear system as a fuzzy sum of linear subsystems. For instance, in [38], fuzzy differential equations were used to describe the existing vague concepts of uncertainty components. The fuzzy logic theory [39] has been widely accepted as a simple and feasible method to deal with nonlinear systems. Hence, it is necessary to investigate the fuzzy CDNs. Among various fuzzy systems, one of the most important models is the Takagi-Sugeno (T-S) fuzzy system [40], which has been shown to approximate any smooth nonlinear system to any specified accuracy. In the past decade, T-S fuzzy systems have developed rapidly: fault detection, H∞ control, sampling systems, networked control systems and so on (see [41,42,43,44,45] and references therein). Recently, the research of T-S fuzzy networks has become a hot research topic. In [46], the issue of reliable mixed H∞ passive control for T-S fuzzy delayed networks based on a semi-Markovian jump model was concerned by using the LMI method. Synchronization and robust stability of T-S fuzzy networks with time-varying delay were discussed in [47] and [48]. In [49], global exponential synchronization of Takagi-Sugeno fuzzy CDNs with multiple time-varying delays and stochastic perturbations was studied via delayed impulsive distributed control. It is worth pointing out that, there is no relevant result about global stochastic finite/fixed-time cluster synchronization for discontinuous semi-Markovian switching T-S fuzzy CDNs currently.
Motivated by the aforementioned discussions, in this paper our objective is to investigate the global stochastic finite/fixed-time cluster synchronization for discontinuous semi-Markovian switching T-S fuzzy CDNs. By employing Filippov discontinuous theory, the Lyapunov stability theory, Lyapunov-Krasovskii functional approach and stochastic analysis techniques, the global finite/fixed-time cluster synchronization conditions are addressed in the form of LMIs. The innovations of this paper compared with the existing results are summarized below:
(1) It is the first time to investigating the global stochastic finite/fixed-time cluster synchronization for T-S fuzzy CDNs with discontinuous activations under semi-Markovian switching.
(2) A principle of the global stochastic stability in fixed time for the nonlinear system with semi-Markovian switching is developed; see Lemma 2.
(3) A fuzzy switching state-feedback discontinuous controller is designed to achieve the global finite/fixed time cluster synchronization.
(4) The stochastic finite/fixed-time cluster synchronization conditions are obtained in terms of LMIs.
(5) The upper bounds of the setting time of stochastic finite/fixed time cluster synchronization are explicitly evaluated.
The rest of this paper is organized as follows. In Section 2, some useful lemmas, definitions, and system models are provided. In Section 3, some criteria for the global stochastic finite/fixed-time cluster synchronization of T-S fuzzy semi-Markovian CDNs with discontinuous nodes are established, and the upper bound of stochastic settling time is explicitly proposed. In Section 4, two numerical simulations are provided to illustrate the effectiveness of the theoretical results. Finally, the conclusion is given in Section 5.
2.
Materials and methods
2.1. Preliminaries
In this subsection, the fixed-time stochastic stability principle for the nonlinear semi-Markovian switching system is presented, and some useful definitions and lemmas are provided for the analysis of the main objective.
The three stochastic processes [35] are described as follows:
(1) Stochastic process {ρk}k∈ˉZ+ takes values in N in which ρk denotes the index of the system mode at the kth transition.
(2) Stochastic process {tk}t∈ˉZ+ takes values in ˉR+, in which tk is the time at the kth transition. Moreover, t0=0, tk increases monotonically with k.
(3) Stochastic process {hk}t∈ˉZ+ takes values in ˉR+, in which hk=tk−tk−1, refers to the sojourn time of mode rk−1 between the (k−1)th transition and kth transition, and h0=0.
Then, we introduce the semi-Markovian process as follows:
Definition 1. ([35]) Stochastic process ρ(t)=ρk, t∈[tk,tk+1), is said to be a homogeneous semi-Markovian process if the following two conditions hold for ı,ȷ∈N, t0,t1,…,tk≥0:
i) Pr{ρk+1=ȷ,hk+1≤h∣ρk,…,ρ0,tk,…,t0}=Pr{ρk+1=ȷ,hk+1≤h∣ρk},
ii) The probability Pr{ρk+1=ȷ,hk+1≤h∣ρk=ı} is independent on k,
hold, where h is sojourn time.
In this paper, the network model described by the continuous-time and discrete-state homogeneous semi-Markovian process with right continuous trajectories is established. Based on Definition 1, state ρ(t) takes values in N, and transition rate matrix Π(h)=(πıȷ(h))N×N is characterized by
where δ>0, limδ→0o(δ)δ=0, for ı≠ȷ (ı,ȷ∈N), πıȷ(h)≥0 is the transition rate from mode ı at time t to mode ȷ at time t+δ, and πıı(h)=−∑Nȷ=1,ȷ≠ıπıȷ(h), for ı∈N.
Generally, the transition rate Πıȷ(h) is bounded, i.e., π_ıȷ≤πıȷ(h)≤ˉπıȷ, where π_ıȷ and ˉπıȷ are positive constants. As a consequence, πıȷ(h) can always be written as πıȷ(h)=πıȷ+△πıȷ, where πıȷ(h)=12(ˉπıȷ+π_ıȷ), |△πıȷ|≤λıȷ with λıȷ=12(ˉπıȷ−π_ıȷ).
Consider the following semi-Markovian switching system:
where x(t)∈Rn is the state vector of the system, g: Rn×ˉR+×N→Rn is a continuous nonlinear function, ρ(t) is the continuous-time semi-Markovian process, and ρ0 is the initial mode. Assume that, for any x0∈Rn, ρ0∈N, there exists a global solution with the initial state x0 and initial mode ρ0, which is defined as x(t,x0,ρ0) for system (2.2).
Definition 2. ([36]) For any x0∈Rn, ρ0∈N, if there exists a stochastic function T:Rn→(0,+∞), which is called the stochastic settling-time function, such that the solution x(t,x0,ρ0) of system (2.2) satisfies
when t≥E{T(x0,ρ0)}, ∥x(t,x0,ρ0)∥≡0, then system (2.2) is said to be globally stochastic stable in finite time.
Definition 3. ([36]) If system (2.2) is globally stochastic stable in finite time, and E{T(x0,ρ0)} is bounded, namely, ∃Tmax>0 such that E{T(x0,ρ0)}≤Tmax for ∀x0∈Rn, then system (2.2) is said to be globally stochastic stable in fixed time.
In the present paper, we suppose that V:ˉR+×Rn×N→R is a continuous and differential functional, x(t)∈Rn, and ρ(t) is a continuous-time and discrete-state semi-Markovian process. Then, the infinitesimal operator of stochastic functional V(t,x(t),ρ(t)) is given by
where ı,ȷ∈N, Vt(t,x(t),ρ(t))=∂V(t,x(t),ρ(t))∂t, Vx(t,x(t),ρ(t))=(∂V(t,x(t),ρ(t))∂xi1,…,∂V(t,x(t),ρ(t))∂xin)⊤.
Lemma 1. ([41])Let V(t,x(t),ρ(t))∈C2,1(R+×Rn×N;R+) be positive definite and radially unbounded. If thereexists a continuous function ℵ:(0,+∞)→R for v∈(0,+∞), such that
i) LV(t,x(t),ρ(t))≤−ℵ(V(t,x(t),ρ(t))),
ii) for any 0≤s<+∞, ∫s01ℵ(v)dv<+∞,
iii) for v>0, ˙ℵ(v)≥0
hold, then system (2.2) is globally stochastic finite-time stable inprobability. Moreover, the stochastic settling time Tε satisfies
In this paper, we consider ℵ(v)=kvμ−θv for all v∈(0,+∞), and θkv1−μ<μ, where μ∈(0,1) and k>0, θ>0; then
Lemma 2. Let x(t)=x(t,x0,ρ0) be the solution of system (2.2) withinitial value x0∈Rn {0} and initial mode ρ0∈N. If there exists a continuous stochastic functional V:Rn×N→R+, such that
i) V(x,ρ)>0, x≠0, and V(0,ρ)=0,
ii)V(x,ρ)→+∞, as ‖x‖→+∞,
iii)LV(x(t),ρ(t))≤−αVξ(x(t),ρ(t))−βVη(x(t),ρ(t))−c
hold, then, system (2.2) is globally stochastic stable in fixed time, and the upper bound Tmax of the stochastic settling time can becalculated explicitly by
where α, β>0 and 0<ξ<1, η>1.
Proof. The proof is divided into two cases.
Case 1: In this case, we prove that system (2.2) is globally stochastic stable in finite time.
Let ϕ(V)=∫V01T(θ)dθ, where T(θ)=αθξ+βθη+c. Obviously, ϕ(V)>0, and ϕ(V)=0 if and only if V=0.
Set T(x0,ρ0)=ϕ(V(x0,ρ0)). In the following, we claim that there exists t1∈(0,E{T(x0,ρ0)}), such that E{∥x(t,x0,ρ0)∥2}=0. Otherwise, E{∥x(t,x0,ρ0)∥2}≠0 on (0,E{T(x0,ρ0)}).
By the formula dV(x(t),ρ(t))=LV(x(t),ρ(t))dt, it follows from condition iii) that
i.e,
which yields that E{ϕ(V(x(T(x0,ρ0)),ρ(T(x0,ρ0))))}=0 by the positive definiteness of ϕ(V). This leads to a contradiction.
Next, we prove that E{∥x(t,x0,ρ0)∥2}=0 for all t≥t1. If it does not hold, then there exists t2≥t1, such that E{∥x(t,x0,ρ0)∥2}≠0. Let
Obviously, t1<t3<t2, E{∥x(t,x0,ρ0)∥2}=0, and E{∥x(t,x0,ρ0)∥2}≠0 for any t∈(t3,t2]. Analogous to the proof of (2.3), we can get
It contradicts with the non-negativity of ϕ. Therefore, for all t>t1, E{∥x(t,x0,ρ0)∥2}=0. This implies that system (2.2) is globally stochastic stable in finite time.
Case 2: In this case, we show that E{T(x0,ρ0)} is bounded.
where s1, s2 are arbitrary positive numbers. This derives that E{T(x0,ρ0)} is bounded for any x0∈Rn and ρ0∈N.
On the basis of Cases 1 and 2, we can conclude that system (2.2) is globally stochastic stable in fixed time.
In the following, we develop an accurate estimation for E{T(x0,ρ0)}. To do so, set
then
and we obtain that the stationary point (s1,s2)=((cα)1ξ,(cβ)1η), which shows that g(s1,s2) reaches its minimum value gmin,
Thus, E{T(x0,ρ0)}≤gmin. The proof is complete.
Remark 1. It should be noted that, fixed-time stability problem of systems was widely studied [50,51,52]. However, there is no result with respect to the settling-time in the published literature, which can be derived by Lyapunov functional V(t) satisfying LV(x(t))≤−αVξ(x(t))−βVη(x(t))−c. In this paper, on the basis of the conditions of Lemma 2, global fixed-time stability is discussed with respect to nonlinear systems (2.2) with stochastic switching, and the upper bound of the settling time is proposed. Furthermore, since Lemma 2 is independent of a specific stochastic process in reality, the semi-Markovian process ρ(t) in system (2.2) can be related to any stochastic process.
2.2. System model description
In this paper, we consider a class of CDNs with semi-Markovian switching and time-varying delay, which can be described by
where xi(t)=(xi1(t),xi2(t),…,xin(t))⊤∈Rn is the state vector of the ith node, ρ(t) is a semi-Markovian switching process, and fi:R×Rn×Rn→Rn is a nonlinear vector-valued function. A(ρ(t))=diag{a1(ρ(t)),a2(ρ(t)),…,an(ρ(t))} is a diagonal matrix with positive entries ai(ρ(t)), B(ρ(t))∈Rn×n, τ(t) represents time-varying delay in CDNs, and c1 and c2 are coupling strengths. Γ1(ρ(t))=diag{δ11(ρ(t)),δ21(ρ(t)),…,δn1(ρ(t))} and Γ2(ρ(t))=diag{δ12(ρ(t)),δ22(ρ(t)),…,δn2(ρ(t))} represent the inner-coupling matrices among the clusters, respectively. D(ρ(t))=(dij(ρ(t)))N×N and Q(ρ(t))=(qij(ρ(t)))N×N are non-delayed and time-varying delayed out-coupling configuration matrices that stand for the topological structure; ui(t) is the control input.
Divide N nodes into Ω clusters, i.e, {1,2,…,N}=K1∪K2∪…∪KΩ, Kω⋂Kh=∅, where h,ω∈{1,2,…,Ω}. For convenience, set K1={1,2,…,ν1}, K2={ν1+1,ν1+2,…,ν2}, KΩ={νΩ−1+1,νΩ−1+2,…,νΩ}, and v0=0, vΩ=N.
Then, the outer coupling matrix D can be characterized by the following block form:
where each diagonal block Dωω=(dij(ρ(t)))(νω−νω−1)×(νω−νω−1) represents the interactions in the community Kω. Here, for i,j∈Kω, i≠j, dij(ρ(t))>0 are satisfied,
dii(ρ(t))=−∑νωj=νω−1+1dij(ρ(t)), and each non-diagonal block Dωh=dij(ρ(t)))(νω−νω−1)×(νh−νh−1) represents the interactions between the communities Kω and Kh, which are satisfied ∑νhj=νh−1+1dij(ρ(t))=0,
i∈Kω, j∈Kh, h≠ω. Similarly, Q(ρ(t)) has the same properties as D(ρ(t)).
(A1) For i=1,2,…,N, fi:Rn→Rn is continuous except on a countable set of isolated points σk, each of which has a finite left limit fi(σ−k) and right limit fi(σ+k), respectively. Moreover, fi has at most a finite number of jump discontinuous points in every compact interval of R.
Under the assumption (A1), for the ωth cluster (1≤ω≤Ω), we define fνω−1+1=fνω−1+2=…=fνω=fω; fω is undefined at the points where fω is discontinuous, and ¯co[fω(x)]=(¯co[fω1(xi1)],¯co[fω2(xi2)],…,¯co[fωn(xin)]), where ¯co[∗] denotes the closure of the convex hull of set ∗. It follows that ¯co[fωl]=[min{fωl(x−il),fωl(x+il)},max{fωl(x−il),fω(x+il)}], i∈Kω.
(A2) for each i=1,2,…,N, l=1,2,…,n, there exist positive constants Lωlε, zωl, ε=1,2,…,n, such that
(A3) τ(t) is a bounded and continuously differentiable function, meeting 0<˙τ(t)<ϑ≤1 and 0≤τ(t)≤τ.
Definition 4. A function x : [0,T)→Rn, T∈(0,+∞), is a Filippov solution of CDNs on [−τ,T) if:
(i) x(t) is continuous on [−τ,T] and absolutely continuous on [0,T),
(ii) there is ϕω(t)∈¯co[fω(xi(t))], which is a measurable function, such that
ϕ(t)=(ϕω1(t),ϕω2(t),…,ϕωn(t))⊤: [−τ,T)→Rn, for a.e. t∈[0,T),
where i∈Kω, ϕω satisfying system (2.5) is called an output solution associated with the state xi(t).
Let sω, ω=1,2,…,Ω, denotes the target trajectories defined by
which may be equilibrium points, periodic orbits or even chaotic attractors.
Analogous to Definition 4, the solution of system (2.6) in the Filippov sense can be given as follows:
Definition 5. A function s(t) : [0,T)→Rn, T∈(0,+∞), is defined as a solution of CDNs on [0,T) if
(i) s(t) is absolutely continuous on [0,T),
(ii) given ˉϕ(t)∈¯co[fω(sω(t))], there exists a measurable function ˉϕ(t)=(¯ϕ1(t),ˉϕ2(t),…,ˉϕn(t))⊤ :[0,T)→Rn, such that, for almost all t∈[0,T),
Define ei(t)=xi(t)−sω(t), i∈Kω, as the synchronization errors. Then, taking (2.5) with (2.7), in the Filippov sense, the error dynamic system can be written as
where i∈Kω, ˆϕω(t)=ϕω(t)−ˉϕω(t), ϕω(t)∈¯co[fω(xi(t))], ˉϕω(t)∈¯co[fω(sω(t))].
For simplicity, we denote A(ρ(t)), B(ρ(t)), Γ1(ρ(t)), Γ2(ρ(t)), D(ρ(t)), Q(ρ(t)) by Aρ, Bρ, Γ1ρ, Γ2ρ, Dρ, Qρ for ρ(t)∈N. Then, system (2.8) can be rewritten as
Moreover, a T-S fuzzy model can be described by a set of fuzzy IF-THEN rules that characterize local relations of a nonlinear system in the state space. The l-th rule for semi-Markovian switching CDNs in (2.9) is represented as
Fuzzy rule l: IF ∅1 is Ml1, ∅2 is Ml2, …, ∅s is Mls,
THEN:
where l=1,2,…,m, where m is the number of IF-THEN rules. The premise variables ∅1,∅2,…∅s are proper state variables, and Mlp(p=1,2,…,s) is the fuzzy set that is characterized by the membership function. Using the singleton fuzzifier, product fuzzy inference, and a weighted average defuzzifier, the final output of the T-S fuzzy system is inferred as follows:
where ∅(t)=(∅1(t),∅2(t),…,∅s(t))⊤, hl(∅(t))=wl(∅(t))∑ml=1wl(∅(t)), wl(∅(t))=∏sp=1Mlp(∅p(t)), wl(∅(t))≥0, and ∑ml=1wl(∅(t))≥0. It is clear that
for all t∈R+, where hl(∅(t)) can be regarded as the normalized weight of the IF-THEN rules. In this paper, we will denote hl(∅(t))=hl for simplicity.
In order to obtain the main results in this paper, the following lemmas are given.
Lemma 3. ([8])For any vector x, y∈Rn, scalar δ>0 and positivedefinite matrix Q∈Rn×n,
Lemma 4. ([50])Let φ1,φ2,…,φn≥0, 0<p≤1, and q>1. Then,
Lemma 5. ([51])Let ψ1,ψ2,…,ψn≥0, 0<p<q. Then,
Lemma 6. ([53])(Schur complement) Given constant matrices Ξ1, Ξ2 and Ξ3, where Ξ1=Ξ⊤1 and Ξ2>0,
if and only if
3.
Main results
3.1. Stochastic finite-time cluster synchronization for semi-Markovian switching T-S fuzzy CDNs with discontinuous dynamic nodes
In this section, by designing state-feedback controllers with the discontinuous terms, we consider the global stochastic cluster synchronization in finite time for semi-Markovian switching T-S fuzzy CDNs under the case τ(t)=τ. The global stochastic finite-time cluster synchronization conditions are addressed in the form of LMIs.
Then, system (2.11) can achieve global stochastic finite time stability under the following controller:
where 0<α<1, Kρ=diag{kρ1,kρ2,…,kρn}, Hρ=diag{hρ1,hρ2,…,hρn} and Mρ=diag{mρ1,mρ2,…,mρn} are the controller gain matrices, kρϵ, hρϵ and mρϵ ϵ=1,2,…,n are non-negative constants to be designed, and ηρ is a tunable constant.
Note that controller u1i(t) is discontinuous, which is a special case of assumption (A1). Then, there exists a measurable function Sign(ei(t))∈¯co[sign(ei(t))] such that
where ξ1i(t)∈¯co[u1i(t)],
The designed controller described by the T-S fuzzy model is composed of a set of fuzzy rules.
Fuzzy rule l: IF ∅1 is Ml1, ∅2 is Ml2, …, ∅s is Mls, THEN
The state-feedback controller is deduced as
Theorem 1. Suppose that assumptions A1 and A2 are satisfied. For any ρ∈N, if there exist positive definite matrices Pρ, Mρ, Oρ, Hρ and positive scalars ζ, ηρ, such that the following LMIs hold,
then system (2.11) can achieve global stochastic stability in finitetime. Moreover, the upper bound of the stochastic settling time is givenby
where Φ11=∑Nk=1,k≠ρ(πρk(IN⊗Pk)+λ2ρk4(IN⊗Oρk))+πρρ(IN⊗Pρ)−(IN⊗PrAlρ)+(L⊗∣PρBlρ∣+∣PρBlρ∣⊤2)+c1(Dlρ⊗PρΓ1ρ)+c212ζ(Qlρ⊗PρΓ2ρ)(Qlρ⊗PρΓ2ρ)⊤−(IN⊗Klρ), Φ22=c2ζ(IN⊗In)−(IN⊗Mρ), Φ13={IN⊗(Pρ−P1),…,IN⊗(Pρ−Pρ−1),IN⊗(Pρ−Pρ+1),…,IN⊗(Pρ−PN)}, Φ33={IN⊗Oρ,1,…,IN⊗Oρ,ρ−1,IN⊗Oρ,ρ+1,…,IN⊗Oρ,N}, Z=diag{z1,…,z1⏟ν1,…,zΩ,…,zΩ⏟νΩ−νΩ−1}, L=diag{L1,…,L1⏟ν1,…,LΩ,…,LΩ⏟νΩ−νΩ−1}, a=min{ηρλ−1+α2max(Pρ),ηρλmin(Pρ)}, b={ηρ,λmax(Mρ)λmin(Pρ)}.
Proof. Consider the following stochastic Lyapunov-Krasovskii functional:
Calculating LV(t,e(t),ρ) along the trajectory of the error system (2.11), we have
Substituting (3.3) into (3.8), we obtain that
Employing Lemma 3, there is a positive constant ζ satisfying
In addition, by means of assumptions (A1) and (A2), we have
where Z=diag{z1,…,z1⏟ν1,…,zΩ,…,zΩ⏟νΩ−νΩ−1}, L=diag{L1,…,L1⏟ν1,…,LΩ,…,LΩ⏟νΩ−νΩ−1}.
For ρ,k∈N, considering πρk=πρk+△πρk, △πρρ=∑Nk=1,k≠ρ△πρk and employing Lemma 6, the following inequality holds:
For simplicity, let e(t)=[e⊤1(t),e⊤2(t),…,e⊤N(t)]⊤; by using the Kronecker product and substituting (3.10)-(3.12) into (3.9), it holds that
By virtue of (3.4), (3.13) is rewritten as
where E=[e(t),e(t−τ)]⊤. Φ=(ˆΦ110∗Φ22), in which, ˆΦ11=∑Nk=1,k≠ρ(πρk(IN⊗Pk)+λ2ρk4(IN⊗Oρk))+πρρ(IN⊗Pρ)+∑Nk=1,k≠ρIN⊗((Pk−Pρ)O−1ρk(Pk−Pρ))−(IN⊗PρAlρ)+(L⊗∣PρBlρ∣+∣PρBlρ∣⊤2)+c1(Dlρ⊗PρΓ1ρ)+c2ζ2(Qlρ⊗PρΓ2ρ)(Qlρ⊗PρΓ2ρ)⊤−(IN⊗Klρ), Φ22=c2ζ(IN⊗In)−(IN⊗Mρ).
It should be noted that there exist nonlinear terms (Pk−Pρ)O−1ρk(Pk−Pρ) in matrix Φ. As we know, it's difficult to solve matrix inequalities with nonlinear terms. To this end, we denote Φ11=[∑Nk=1,k≠ρ(πρk(IN⊗Pk)+λ2ρk4(IN⊗Oρk))+πρρ(IN⊗Pρ)−(IN⊗PρAlρ)+(L⊗∣PρBlρ∣+∣PρBlρ∣⊤2)+c1(Dlρ⊗PρΓ1ρ)+c2ζ2(Qlρ⊗PρΓ2ρ)(Qlρ⊗PρΓ2ρ)⊤−(IN⊗Klρ)]. It is easy to see that, ˆΦ11=Φ11+∑Nk=1,k≠ρ(IN⊗((Pk−Pρ)O−1ρk(Pk−Pρ)). By Lemma 6 and (3.12), we get
where Φ13={IN⊗(Pρ−P1),…,IN⊗(Pρ−Pρ−1),IN⊗(Pρ−Pρ+1),…,IN⊗(Pρ−PN)}, Φ33={IN⊗Oρ1,…,IN⊗Oρρ−1,IN⊗Oρρ+1,…,IN⊗OρN}.
According to Lemma 4, we have
Combining with (3.14) and (3.15), it follows that
where a=min{ηρλ−1+α2max(Pρ),ηρλmin(Pρ)}, b={ηρ,λmax(Mρ)λmin(Pρ)}.
On the basis of Lemma 1, system (2.11) is globally stochastic finite-time stable. This means that system (2.5) and (2.7) can achieve global stochastic finite-time synchronization, and the settling time is estimated by
This completes the proof.
Remark 2. It is seen from (3.17) that the stochastic cluster synchronization can be achieved in finite time. However, the settling time depends on the initial value. This implies that, when the initial value is unknown, the synchronization results in finite time have certain limitations.
3.2. Stochastic fixed-time cluster synchronization for semi-Markovian switching T-S fuzzy CDNs with discontinuous dynamic nodes
In this subsection, the global stochastic fixed-time synchronization conditions for the considered network systems (2.11) are achieved. To this end, the control law is designed as follows:
where 0<α<1, Hρ=diag{hρ1,hρ2,…,hρn} is the controller gain matrix, hρϵ, ϵ=1,2,…,n are nonnegative constants, Pρ, Wρ and Mρ are positive definite matrices, and k1ρ, k2ρ, ςρ and ϱρ are tunable constants.
Based on assumption (A1) and the IF-THEN rules, we redesign the T-S fuzzy state feedback controller with the discontinuity. Similar to (3.3), we get
Next, we will establish a set of sufficient conditions for system (2.11) to realize global stochastic stability in fixed time in the presence of the designed controller (3.19).
Theorem 2. Suppose the assumptions (A1)−(A3) hold. If there existscalars k1ρ>0, k2ρ>0, ςρ>0, ϱρ>0 and n×n real matrices Hρ, Pρ, Wρ, Oρ, Mρ>0, ρ∈{1,2,…,N}, such that the following LMIs holds,
then system (2.11) can achieve global stochastic stability infixed time. Moreover, the upper bound of the stochastic settling time isgiven by
where Ω11=∑Nk=1,k≠ρ(πρk(IN⊗Pk)+λ2ρk4(IN⊗Oρk))+πρρ(IN⊗Pρ)−(IN⊗PρAlρ)+(L⊗∣PρBlρ∣+∣PρBlρ∣⊤2)+12c2ζ(Qlρ⊗PρΓ2ρ)(Qlρ⊗PρΓ2ρ)⊤+c1(Dlρ⊗PρΓ1ρ), Ω22=c22ζ(IN⊗In)−(1−ϑ)(IN⊗Mr), Ω13=[IN⊗(Pρ−P1),…,IN⊗(Pρ−Pρ−1),IN⊗(Pρ−Pρ+1),…,IN⊗(Pρ−PN)], Ω33=diag{IN⊗Oρ1,…,IN⊗Oρ(ρ−1),IN⊗Oρ(ρ+1),…,IN⊗OρN}, γ=min{k1ρλ−1+μ2min(Pρ),λmin(Pρ)ϖρ}, β=min[2kρ2(Nλmax)1−λ2,λmin(Mρ)ϱρN1−λ2], c=ςρλmin(IN⊗Pρ). Z and L are the same as in Theorem 1.
Proof. Consider the following Lyapunov-Krasovskii functional:
By assumption (A3), calculating LV(t,e(t),ρ) along the trajectory of the error system (2.11) gives
Substituting (3.19) into the above inequality, we can get
By using the Kronecker product and substituting (3.10)-(3.12) into (3.25), we get
In the light of (3.21), (3.26) is rewritten as
where E=[e(t),e(t−τ)]⊤, and Δ=(ˉΔ110∗Δ22), where ˉΔ11=∑ml=1hl[∑Nk=1,k≠ρ(πρk(IN⊗Pk)+λ2ρk4(IN⊗Oρk))+πρρ(IN⊗Pρ)+∑Nk=1,k≠ρIN⊗((Pk−Pρ)O−1ρk(Pk−Pρ))−(IN⊗PρAlρ)+(L⊗∣PρBlρ∣+∣PρBlρ∣⊤2)+c2ζ2(Qlρ⊗PρΓ2ρ)(Qlρ⊗PrΓ2ρ)⊤+c1(Dlρ⊗PrΓ1ρ)], Δ22=c22ζ(IN⊗In)−(IN⊗Mρ).
For the nonlinear terms (Pk−Pρ)O−1ρk(Pk−Pρ), the method in this part is similar to that in Theorem 1, so we can get
where Ω13=[IN⊗(Pρ−P1),…,IN⊗(Pρ−Pρ−1),IN⊗(Pρ−Pρ+1),…,IN⊗(Pρ−PN)], Ω33=[IN⊗Oρ1,…,IN⊗Oρ(ρ−1),IN⊗Oρ(ρ+1),…,IN⊗OρN].
In view of Lemma 4 and Lemma 5, it follows that
Moreover,
Applying (3.29) and Lemma 4, it follows that
where γ=min{k1ρλ−1+μ2min(Pρ),λmin(Pρ)ϖρ}.
Similarly, based on (3.30) and Lemma 4, we can derive
where β=min[23−λ2kρ2(Nλmax)1−λ2,λmin(Mρ)ϱρ(2N)1−λ2].
Then, according to (3.21), (3.22), (3.30) and (3.31), we can obtain that
where c=ςρλmin(IN⊗Pρ).
On the basis of Definition 2 and Lemma 2, system (2.11) can achieve global stochastic stability in fixed time under controller (3.19). Moreover,
According to Lemma 2, the fixed-time cluster synchronization is finally realized. The proof is completed.
Remark 3. It can be seen that the settling time of fixed-time synchronization does not depends on the initial value. Compared with the finite time, fixed-time synchronization is more practical when the initial value is arbitrarily selected.
4.
Simulation results
In this section, we provide two examples to illustrate the correctness of the obtained theoretical results. Consider the T-S fuzzy semi-Markovian switching CDNs with 5 nodes, where the nodes are divided into two groups, K1={x1,x2,x3} and K2={x4,x5}, and have two modes. The dynamical equations are described by
where ω=1,2, r=1,2.
∙ Mode 1
Fuzzy rule 1: IF ∅1 is 0, THEN:
Fuzzy rule 2: IF ∅1 is 1, THEN:
∙ Mode 2
Fuzzy rule 1: IF ∅2 is 0, THEN:
Fuzzy rule 2: IF ∅2 is 1, THEN:
Example 1. In this example, the effectiveness of Theorem 1 is verified. Consider the three-dimensional T-S fuzzy semi-Markovian switching CDNs, where each node is described by Chua's circuit. Set τ(t)=τ=1; the system parameters are given as follows: c1=1.065, c2=1.09545,
Let f(xi(t))=−0.5379xi(t)+0.5(−1.577+0.5379)(|xi(t)+1|−|xi(t)−1|). It is easy to check that assumptions A1 and A2 hold, and L11=0.05, L12=0.075, L21=0.3, L22=0.46, z11=z12=z21=z22=0.
Design the fuzzy weighting function: λ1(ϕ(t))=cos2(t) and λ2(ϕ(t))=sin2(t).
The transition rates of the semi-Markovian switching system in this mode are given.
For mode 1: π11(h)∈(−4.26,−3.98),π12(h)∈(3.98,4.26). For mode 2: π21(h)∈(−6.17,−5.89),π22(h)∈(5.89,6.17). Then, we can get the parameters πρk, λρk, where ρ,k∈N={1,2}, π11=−3.95,π12=3.95,λ11=λ12=0.96, π21=6.1,π22=−6.1,λ21=λ22=0.07.
Take the controller gain parameters as η1=20.42, η2=0.53,
By using the MATLAB tools, it is illustrated that the conditions of Theorem 1 are satisfied, and T=7.55s. Meanwhile, the graph of semi-Markovian switch signals is displayed in Figure. 1. The synchronization for nodes in the same group with their target trajectories is described in Figure. 2.
Example 2. In this example, the effectiveness of Theorem 2 is checked. For model (4.1), we consider that the nodes are two-dimensional.
Set
The membership functions are defined as follows:
The system parameters are given as :c1=0.38,
c2=0.45, Γ11=Γ12=0.75I2,
Γ21=Γ22=0.55I2;
f11=0.02(xi(t))+0.3sign(xi(t)),
f12=0.14(xi(t))+0.42sign(xi(t)), i=1,2,3;
f21=0.17(xi(t))+0.38sign(xi(t)),
f22=0.21(xi(t))+0.46sign(xi(t)), i=4,5. It is easy to verify that L11=0.02, L12=0.014, z11=0.6,
z12=0.84, L21=0.17, L22=0.21, z21=0.76,
z22=0.62. Take τ(t)=0.65+0.35sin(t−1). It is easy to check that ϑ=0.35, τ1=0.3, τ2=1.
The transition rates with respect to the semi-Markovian process are given as follows:
For mode 1:
For mode 2:
Accordingly,
Take the controller gain parameters as k11=k21=0.95, k12=k22=0.86, ς1=ς2=10.8, ϖ1=ϖ2=10.4, ϱ1=ϱ2 = 12.8, λ = 2.1, μ = 0.5,
By solving LMIs (3.20)-(3.21), we can obtain that
Based on the above parameters, it is easy to verify that the conditions of Theorem 2 hold. The semi-Markovian switching T-S fuzzy CDNs with the above parameters can achieve global stochastic fixed-time cluster synchronization. Based on (3.22), we can obtain that Tmax=6.1226s.
In addition, the semi-Markovian process is presented in Figure 3. The state trajectories of nodes in each cluster are depicted in Figures 4-7. displays this intra-cluster synchronization behavior. We can easily see that the state trajectories of nodes in each cluster can reach globally stochastic fixed-time synchronization. However, the synchronization goal cannot be achieved between different clusters.
5.
Conclusions
In this paper, we have investigated global stochastic cluster synchronization in finite/fixed time for T-S fuzzy CDNs with semi-Markovian switching topologies and discontinuous activations. A new lemma about global stochastic stability in fixed time for the nonlinear system with semi-Markovian switching was developed. In addition, some novel T-S fuzzy state-feedback controllers were designed, which involve double integral terms and discontinuous factors, to achieve the global stochastic finite/fixed-time cluster synchronization objective. The global stochastic cluster synchronization conditions have been addressed in the form of LMIs. Furthermore, the upper bound of the settling time, which depends on the control gains and the chosen controller parameters, has been explicitly calculated. Finally, numerical examples have been provided to illustrate the effectiveness and less conservativeness of the theoretical results.
In the future, the following research works are considered:
1) stochastic cluster synchronization in pre-assigned time for T-S fuzzy discontinuous CDNs with semi-Markovian switching,
2) stochastic synchronization in finite time for T-S fuzzy fractional CDNs with Markovian switching.
Acknowledgments
The research was supported by the National Natural Science Foundation of China (Grant No. A12171416).
Conflict of interest
The authors declare there is no conflict of interests.