Skip to main content

ORIGINAL RESEARCH article

Front. Phys., 12 September 2024
Sec. Complex Physical Systems

State estimation for Markovian jump Hopfield neural networks with mixed time delays

Lili Guo
Lili Guo*Wanhui HuangWanhui Huang
  • School of Computer Science and Technology, Anhui University of Technology, Ma’anshan, China

Markovian jump Hopfield NNs (MJHNNs) have received considerable attention due to their potential for application in various areas. This paper deals with the issue of state estimation concerning a category of MJHNNs with discrete and distributed delays. Both time-invariant and time-variant discrete delay cases are taken into account. The objective is to design full-order state estimators such that the filtering error systems exhibit exponential stability in the mean-square sense. Two sufficient conditions on the mean-square exponential stability of MJHNNs are established utilizing augmented Lyapunov–Krasovskii functionals, the Wirtinger–based integral inequality, the Bessel-Legendre inequality, and the convex combination inequality. Then, linear matrix inequalities-based design methods for the required estimators are developed through eliminating nonlinear coupling terms. The feasibility of these linear matrix inequalities can be readily verified via available Matlab software, thus enabling numerically tractable implementation of the proposed design methods. Finally, two numerical examples with simulations are provided to demonstrate the applicability and less conservatism of the proposed stability criteria and estimators. Lastly, two numerical examples are given to demonstrate the applicability and reduced conservatism of the proposed stability criteria and estimator design methods. Future research could explore further refinement of these analysis and design results, and exporing their extention to more complex neural network models.

1 Introduction

Neural networks (NNs) are composed of numerous interconnected neurons, providing them the ability to process large amounts of data simultaneously. Recently, NNs have been widely utilized in speech recognition [1], tracking control [2], associative memory [3], image restoration [4], and various other fields. As we all know, time delays are inevitable in the above practical applications, which may cause NNs to oscillate or become unstable [5]. This phenomenon has prompted extensive research on the stability analysis of NNs with time delays [69]. Notably, [10] designed an output feedback controller for NNs with time-invariant discrete delay to ensure the asymptotic stability of the closed-loop control system. The time delay considered in this study was constant. In cases where the time delay varies over time, [11] utilized a Lyapunov–Krasovskii functional (LKF) and subsequently established a stability criterion based on linear matrix inequalities (LMIs). However, these studies primarily focus on discrete delays, which may oversimplify these scenarios. In NNs, numerous interconnections between neurons form various parallel paths. Due to the varying sizes and complexities of these paths, signal transmission times are distributed within a certain period of time, resulting in distributed delays [12, 13].

On the other hand, in practical scenarios, environmental fluctuations can induce changes in the parameters of NNs. Researchers have recognized the significant advantages of Markovian jump processes in handling random changes in parameters [1419]. Over the past few decades, many Markovian jump NN models, either in discrete-time form [2023] or continuous-time form [2427], have been proposed and studied. Among these models, Markovian jump Hopfield NNs (MJHNNs) have received considerable attention due to their potential for application. Notably, for an MJHNN, the neuron states are often not completely available. Thus, to achieve a given control goal, it is necessary to estimate the neuron states based on available output data, which has led to a growing focus on the topic of state estimation. [28] examined the finite-time state estimation for MJHNNs with discrete delays and presented a discontinuous estimator design method. [29] focused on the design of state estimators for continuous-time MJHNNs with both discrete and distributed delays and proposed a mean-square exponential stability (MSES) criterion and an LMI-based state estimation strategy.

It should be noted that the criterion derived in [29] was based on Jensen’s inequality, and the LKF used therein omitted some items involving time-delay-related integrals, thus leaving room for further improvement. Another discovery is that the discrete delay considered therein was assumed to be time-invariant, which restricts the application scope of the state estimation strategy since the magnitude of delays may vary over time in practice. Inspired by the observations above, we re-examine the state estimation in MJHNNs with discrete and distributed delays. Unlike the assumption of time invariance made in [29], the discrete delay under consideration here is allowed to be time-variant. The primary contributions of this study are as follows:

(1) Establishing MSES criteria for MJHNNs by integrating augmented LKFs, the Wirtinger-based integral inequality (WBII), the Bessel–Legendre inequality (BLI), and the convex combination inequality (CCI). Compared to the criteria proposed in [29], those proposed in this study are less conservative.

(2) Developing design methods for the required estimators to ensure the MSES of the filtering error systems (FESs) by eliminating nonlinear coupling terms. The estimator gain matrices can be easily determined by solving a set of LMIs.

Notation: In this paper, Rp and S+q denote the set of p-dimensional real matrices and q-dimensional symmetric positive definite matrices, respectively. Im×n and 0p×q represent the m×n unit matrix and the p×q zero matrix, respectively. We denote ϑT as the transpose of the matrix ϑ, ϑ1 as the inverse of the matrix ϑ, col{μ1,,μl} as the column vector with elements {μ1T,,μl}, diag{Φ1,,Φm} as the diagonal matrix with diagonal elements {Φ1,,Φm}, as the symmetry term of a symmetric matrix, and as the Euclidean norm. The operator F() denotes the expectation, and He(Π)=Π+ΠT. The notation ϒ>0 (ϒ<0) indicates that the matrix ϒ is positive definite (negative definite).

2 Preliminaries

The MJHNN with time-invariant discrete and distributed delays is modeled as follows:

ϑ̇t=Aκtϑt+Cκtφϑt+Dκtφϑtξ+Gκttςtφϑzdz,t0,αt=Bκtϑt+δϑt,ϑs=ϑ0s,s2ζ,0,ζ=maxξ,ς,(1)

where ϑ(t)Rn and α(t)Rn represent the system state and measurement output, respectively. The positive scalars ξ and ς denote the time-invariant discrete delay and the distributed delay, respectively. ϑ0(s) is an initial function defined on [2ζ,0]. A(κt), B(κt), C(κt), D(κt), and G(κt) are matrix functions of the random jump process κt. To simplify the notation, we denote A(κt) as Ai and use a similar notation for the other matrices. In addition, κt takes values in the set D={1,2,,d}. The transition probability matrix is given by

Prκt+e=jκt=i=ηijee+oe,ji1+ηiiee+oe,j=i,

where e>0, lime0o(e)e=0, and ηij(e)0 (ji) denotes the rate at which the system transitions from mode i at time t to mode j at time t+e, and ηii=j=1,jidηij [30].

In the MJHNN Equation 1, φ() and δ() represent the activation and perturbation functions, respectively. These functions satisfy the following assumptions.

Assumption 1. For given matrices μ1 and μ2Rn×n, φ() satisfies

φψφψ̂μ1ψψ̂Tφψφψ̂μ2ψψ̂0,ψ,ψ̂Rn.(2)

Assumption 2. For given matrices λ1 and λ2Rm×n, δ() satisfies

δψδψ̂λ1ψψ̂Tδψδψ̂λ2ψψ̂0,ψ,ψ̂Rn.(3)

Remark 1. Equations 2 and 3 satisfy sector-bounded conditions [31], which have broader applicability than the standard Lipschitz conditions [32, 33] and are widely utilized in the study of NNs [9, 34].

The full-order state estimator for the MJHNN Equation 1 is designed as follows:

ϑ̂̇t=Aiϑ̂t+Ciφϑ̂t+Diφϑ̂tξ+Gitςtφϑ̂zdz+KiαtBiϑ̂tδϑ̂t,(4)

where ϑ̂(t)Rn and KiRn×m (iD) represent the state estimate and gain matrices, respectively.

Define ϵ(t)=ϑ(t)ϑ̂(t). Then, we obtain the following FES:

ϵ̇t=Ai+KiBiϵt+Ciϱt+D1iϱtξ+GitςtϱzdzKiϕt,(5)

where

ϱt=φϑtφϑ̂t,ϕt=δϑtδϑ̂t.(6)

Next, we introduce the definition of the MSES.

Definition 1. The FES Equation 5 has MSES if there exist positive scalars ι and τ such that

Fϵt,ϵ02<ιexpτtsupξs0Fϵ0s2,t0

holds, where ϵ0(t)Rn is the initial function of ϵ(t).

The primary objective of this paper is to establish the MSES criterion for the MJHNN and design the state estimator to ensure that the FES achieves MSES. To facilitate subsequent derivations, we have prepared four lemmas.

Lemma 1. [35, 36] (BLI) For a differentiable function ϑ:[μ1,μ2]Rn, the inequality

μ1μ2ϑ̇TuZϑ̇udu1μ2μ1ΓTdiagZ,3Z,5ZΓ

holds, where ZS+n, υμ1,μ2(u)=2uμ1μ2μ11, and

Γ=ϑμ2ϑμ1ϑμ2+ϑμ12μ2μ1μ1μ2ϑuduϑμ2ϑμ16μ2μ1μ1μ2υμ1,μ2uϑudu.

Lemma 2. [37] (WBII) For any matrix QS+n×n, scalars η1<η2, and function μ:[η1,η2]Rn, the inequality

η1η2μTzQμzdz1η2η1η1η2μTzdzQη1η2μzdz+3η2η1ΞTQΞ

holds, where

Ξ=η1η2μzdz2η2η1η1η2λη2μzdzdλ.

Lemma 3. [38, 39] (CCI) If there exist matrices ZS+n and ΠRn×n such that ZΠΠTZ0 holds, one has

1ψZ0011ψZZΠΠTZ,ψ0,1.

Lemma 4. [40] Given matrices Ξ, Wr, Ur, and Zr(r=1,,R) of appropriate dimensions, if there exist scalars μr>0 such that

Ξ+i=1RHeWrZr1UrT<0

holds, then we obtain

3 Stability analysis and state estimation of MJHNNs

In this section, we establish an MSES criterion and design a state estimator for MJHNNs with time-invariant discrete and distributed delays.

It can be deduced from Equations 2, 3, 6 that

ϖ1TtR̂ϖ1t0,ϖ1TtξR̂ϖ1tξ0,(7)

and

ϖ2TtR̂ϖ2t0,ϖ2TtξR̂ϖ2tξ0,ϖ3TtĤϖ3t0,(8)

where

ϖ1t=colϑt,φϑt,ϖ2t=colϵt,ϱt,ϖ3t=colϵt,ϕt,(9)

and

R1=μ1Tμ2+μ2Tμ12,R2=μ1T+μ2T2,H1=λ1Tλ2+λ2Tλ12,H2=λ1T+λ2T2,R̂=R1R2I,Ĥ=H1H2I.(10)

Next, the MSES criterion for the MJHNN Equation 1 is established.

Theorem 1. For given positive scalars ξ and ς and matrices μ1 and μ2, if there exist positive scalars ρ1i, and ρ2i and matrices EiS+3n, Z and WS+n, Ti and US+2n, and N1,N2Rn such that

j=1dηijTjU,(11)
Λi0(12)

hold, for iD where

Λi=HeF1TEiF0+F5TN̂F6i+F1Tj=1dηijEjF1+F3TTiF3F4TTiF4+F3TξUF3+c8TξZc81ξF2TẐF2+c5TςWc51ςc7TWc73ςF7TWF7ρ1iF3TR̂F3ρ2iF4TR̂F4,ci=0n×i1nIn0n×9in,i=1,,9,F0=c8Tc1Tc2Tc1T+c2T2c3TT,F1=c1Tξc3Tξc4TT,F2=c1Tc2Tc1T+c2T2c3Tc1Tc2T6c4TT,F3=c1Tc5TT,F4=c2Tc6TT,F5=c1Tc8TT,N̂=N1TN2TT,F6i=c8Aic1+Cic5+Dic6+Gic7,F7=c72c9,Ẑ=diagZ,3Z,5Z,(13)

and the remaining symbols are defined in Equation 10. Then, the MJHNN Equation 1 achieves MSES.

Proof. Define

ψ̂t=colψ0t,ψ1t,ψ2tψ3t,

where

ψ0t=ϑTtϑTtξT,ψ1t=1ξξ0ϑtTzdzξ0υzϑtTzdzT,ψ2t=φTϑtφTϑtξς0φtTϑtzdzT,ψ3t=ϑ̇Tt1ςς0σ0φTϑtzdzdσT,ϑtz=ϑt+z,φtz=φtt+z,υz=2z+ξξ1.

The LKF is constructed as follows:

Vϑt,ϑṫ,i=V1ϑt,i+V2ϑt,i+V3ϑt,ϑṫ+V4ϑt,V1ϑt,i=ϑ̂TtEiϑ̂t,V2ϑt,i=tξtϖ1TzTiϖ1zdz,V3ϑt,ϑṫ=ξ0t+βtϖ1TzUϖ1zdzdβ+ξ0t+βtϑ̇TzZϑ̇zdzdβ,V4ϑt=ς0t+βtφTϑzWφϑzdzdβ,

where ϖ1(t) is defined in Equation 9 and

ϑ̂t=colϑt,ξψ1t.

The infinitesimal generator L is defined as

LV1ϑt,i=limι0+1ιFV1ϑt+ι,κt+ιϑt,κt=iVϑt,κt=i=V1t+ϑ̇TtV1ϑκt=i+j=1dηijV1ϑt,j=Heϑ̂TtEiϑ̂̇t+ϑ̂Ttj=1dηijEjϑ̂t.(14)

ψ̂(t) is abbreviated as ψ̂. Then, ϑ̂(t) and ϑ̂̇(t) have the following first components:

ϑt=c1ψ̂,ϑ̇t=c8ψ̂.

The second components are given by

ξψ1t=ξ[c3Tc4T]Tψ̂,ξψ̇1t=c1Tc2Tc1T+c2T2c3TTψ̂,

and these enable us to deduce that

ϑ̂t=F1ψ̂,ϑ̂̇t=F0ψ̂,

where F0 and F1 are defined in Equation 13. It follows from Equation 14 that

LV1ϑt,i=ψ̂THeF1TEiF0+F1Tj=1dηijEjF1ψ̂,LV2ϑt,i=ϖ1TtTiϖ1tϖ1TtξTiϖ1tξ+j=1dηijtξtϖ1TzTjϖ1zdz,LV3ϑt,ϑṫ=ϖ1TtξUϖ1t+ϑ̇TtξZϑ̇ttξtϑ̇TzZϑ̇zdz+tξtϖ1TzUϖ1zdz,LV4ϑt=φTϑtςWφϑtς0φtTϑzWφtϑzdz.(15)

Under Equation 11, the integral terms j=1dηijtξtϖ1T(z)Tjϖ1(z)dz in LV2 and tξtϖ1T(z)Uϖ1(z)dz in LV3 can be eliminated to obtain

LV2ϑt,iϖ1TtTiϖ1tϖ1TtξTiϖ1tξ=ψ̂TF3TTiF3F4TTiF4ψ̂,LV3ϑt,ϑṫϖ1TtξUϖ1t+ϑ̇TtξZϑ̇ttξtϑ̇TzZϑ̇zdz.(16)

Utilizing Lemma 1, the following inequality holds:

tξtϑ̇TzZϑ̇zdz1ξF2TẐF2.(17)

Combining Equations 16 and 17 yields

LV3ϑt,ϑṫψ̂TF3TξUF3+c8TξZc81ξF2TẐF2ψ̂.(18)

For the integral term ς0φtT(ϑ(z))Wφt(ϑ(z))dz in LV4, by applying Lemma 2, we can establish

LV4ϑtφTϑtςWφϑt1ςς0φtTϑzdzWς0φtϑzdz3ςΞTWΞ,

where

Ξ=ς0φtϑzdz2ςς0σ0φtϑzdzdσ.

Then, it is easy to obtain

LV4ϑtψ̂Tc5TςWc51ςc7TWc73ςF7TWF7ψ̂.(19)

Additionally, for the system Equation 1, utilizing the free-weight matrix technique yields

ψ̂THeF5TN̂F6iψ̂=0.(20)

From Equations 7 and 1520, for any scalars ρ1i>0 and ρ2i>0, we can obtain

LVϑt,ϑṫ,iψ̂THeF1TEiF0+F5TN̂F6i+F1Tj=1dηijEjF1+F3TTiF3F4TTiF4+F3TξUF3+c8TξZc81ξF2TẐF2+c5TςWc51ςc7TWc73ςF7TWF7ρ1iF3TR̂F3ρ2iF4TR̂F4)ψ̂=ψ̂TΛiψ̂.

Applying the Schur complement to Equation 12 yields

LVϑt,ϑṫ,ibϑt2+ϑtξ2+ϑtς2,

where b=λmin{Λi}>0. From the definitions of V(ϑt,ϑṫ,i), ϑ̇(t), and φ(ϑ(t)), there exist positive scalars a1, a2, a3, a4, and ι such that the following inequalities hold:

LVϑt,ϑṫ,ia1ϑt2+a2tζtϑt2dt+a3tζtϑzξ2dz+a4tζtϑzς2dz,(21)
ιmaxa1+a2ζeιζ,a3ζeιζ,a4ζeιζb.(22)

Combining Equation 21 with Equation 22 results in

FeιtVϑt,ϑṫ,ieιtιa1bϑt2bϑtξ2bϑtς2+ιa2tζtϑz2dz+ιa3tζtϑzξ2dz+ιa4tζtϑzς2dz.

By utilizing Dynkin’s formula, for h>0, it follows that

FeιtVϑh,ϑḣ,iJ1+ιa1bF0heιtϑt2dtbF0heιtϑtξ2dtbF0heιtϑtς2dt+ιa2F0htζteιtϑz2dzdt+ιa3F0htζteιtϑzξ2dzdt+ιa4F0htζteιtϑzς2dzdt,(23)

where

J1=a1+ζa2+ζa3+ζa4sup2ζs0Fωs2.

By changing the order of integration, we can write

0htζteιtϑz2dzdtζhz0z+ζheιtdtϑz2dzζhζeιz+ζϑz2dzζeιζ0heιtϑt2dt+ζeιζζ0ϑ0s2dsζeιζ0heιtϑt2dt+ζ2eιζsupζs0ϑ0s2ζeιζ0heιtϑt2dt+ζ2eιζsup2ζs0ϑ0s2,(24)
0htζteιtϑzξ2dzdtζeιζ0heιtϑtξ2dt+ζ2eιζsup2ζs0ϑ0s2,(25)
0htζteιtϑzζz2dzdtζeιζ0heιtϑtς2dt+ζ2eιζsup2ζs0ϑ0s2.(26)

Substituting Equations 2426 into Equation 23 and combining it with Equation 21, we obtain

FeιtVϑh,ϑḣ,iJ1+J2

where

J2=ιa2ζ2eιζ+ιa3ζ2eιζ+ιa4ζ2eιζsup2ζs0Fϑ0s2.

One can write the following inequality:

Fϑh,ϑ02J1+J2λminPieιt.

Then, we can prove that for any h>0,

Fxh,ϑ02βeιtsup2ζs0Fϑ0s2

holds, where

β=1λminPia1+ζa2+ζa3+ζa4+ιa2ζ2eιζ+ιa3ζ2eιζ+ιa4ζ2eιζ.

Therefore, following a similar approach as in [29], system Equation 1 achieves MSES according to Definition 1.

Remark 2. [39] considered the BLI and proved that V1 needs to include ξ0ϑtT(z)dz and ξ0υ(z)ϑtT(z)dz to fully benefit from the BLI. Therefore, we consider the state augmentation of V1 and demonstrate its conservative reduction through Example 1.

Remark 3. As shown in Equation 17, the term tξtϑ̇T(z)Z1ϑ̇(z)dz is processed using the BLI, instead of scaling it up by 1ξ[ϑ(t)ϑ(tξ)]TZ1[ϑ(t)ϑ(tξ)] as in [29]. This approach helps further reduce conservatism.

Next, the state estimator design method is as follows.

Theorem 2. For given positive scalars ξ, ε, and ς, and matrices μ1, μ2, λ1, and λ2, there exist positive scalars ρ1i, ρ2i, and ρ3i and matrices EiS+3n, Z and WS+n, Ti and US+2n, and Li, Mi, N1, and N2Rn such that

j=1dηijTjU,(27)
ΛiΩiεL+LT0(28)

hold, for iD where

Λi=HeF1TEiF0+F5TN̂F6i+F1Tj=1dηijEjF1+F3TTiF3F4TTiF4+F3TξUF3+c8TξZc81ξF2TẐF2+c5TςWc51ςc7TWc73ςF7TWF7ρ1iF3TR̂F3ρ2iF4TR̂F4ρ3iF8TĤF8,Ωi=N1TεMiBi0n×6nN2T0n×nεMiT,ci=0n×i1nIn0n×10in,i=1,,10,F8=[c1Tc10T]T,(29)

The remaining symbols coincide with those defined in Theorem 1. For the MJHNN Equation 1, the estimator Equation 4 with gain matrices

Ki=Li1Mi(30)

guarantees the MSES of the FES Equation 5.

Proof. Define

ψ̂t=colψ0t,ψ1t,ψ2t,ψ3t,

where

ψ0t=ϵTtϵTtξT,ψ1t=1ξξ0ϵtTzdzξ0υzϵtTzdzT,ψ2t=ϱTtϱTtξς0ϱtTzdzT,ψ3t=ϵ̇Tt1ςς0σ0ϱtTzdzdσϕTtT,ϵtz=ϵt+z,ϱtz=ϱt+z,υz=2z+ξξ1.

The LKF is constructed as follows:

Vϵt,ϵṫ,i=V1ϵt,i+V2ϵt,i+V3ϵt,ϵṫ+V4ϵt,V1ϵt,i=ϵ̂TtEiϵ̂t,V2ϵt,i=tξtϖ2TzTiϖ2zdz,V3ϵt,ϵṫ=ξ0t+βtϖ2TzUϖ2zdzdβ+ξ0t+βtϵ̇TzZϵ̇zdzdβ,V4ϵt=ς0t+βtϱTzWϱzdzdβ,

where ϖ2(t) is defined in Equation 9 and

ϵ̂t=colϵt,ξψ1t.

Along similar lines to Theorem 1, by combining Equations 5 and 8, we can obtain LV(ϵt,ϵṫ,i). Then, under Equation 30, one has

LVϵt,ϵṫ,iΛi+HeϒNKϒBT=Λi+HeϒNLi1MiϒBT,

where Λi(iD) are defined in Equation 29 and

ϒN=N1T0n×6nN2T0n×2nT,ϒB=B0n×8nIT.

In light of Lemma 4, Equations 27 and 28 can ensure the MSES of the FES Equation 5.

4 Extension to the time-variant discrete-delay situation

Consider the MJHNN with time-variant discrete and distributed delays as follows:

ϑ̇t=Aiϑt+Ciφϑt+Diφϑtξ+Gitςtφϑzdz,t0,αt=Biϑt+δϑt,ϑs=ϑ0s,s2ζ,0,ζ=maxξ,ς,(31)

where ξ represents a time-variant discrete delay and satisfies

0<ξ1<ξ<ξ2,ξ12ξ2ξ1.

Then, the estimator and the FES for the MJHNN Equation 31 are considered as follows:

ϑ̂̇t=Aiϑ̂t+Ciφϑ̂t+Diφϑ̂tξ+Gitςtφϑ̂zdz+KiαtBiϑ̂tδϑ̂t,ϵ̇t=Ai+KiBiϵt+Ciϱt+D1iϱtξ+GitςtϱzdzKiϕt.(32)

We can provide the condition of the MSES for the MJHNN Equation 31 as follows.

Theorem 3. For given positive scalars ξ1, ξ2, and ς and matrices μ1 and μ2, there exist positive scalars ρ1i and ρ2i and matrices EiS+5n, W, Z1, and Z2S+n, T1i, T2i, U1, and U2S+2n, P1 and P2R21n×2n, SR3n, and N1 and N2Rn such that

j=1dηijT1jU1,j=1dηijT2jU2,(33)
Γ=Ẑ2SSTẐ20,Λiξ<0(34)

hold, for iD and ξ[ξ1,ξ2], where

Λiξ=HeF1TξEiF0+P1u1iξ+P2u2iξ+F9TN̂X1i+F1Tξj=1dηijEjF1ξ+T̂i+F5Tξ1U1+ξ12U2F5+c20Tξ1Z1+ξ12Z2c201ξ1F2TẐ1F21ξ12ΣTΓΣ+c15TςWc151ςc17TWc173ςX2TWX2ρ1iF5TR̂F5ρ2iF6TR̂F6,T̂i=F5TT1iF5F7TT1iF7+F7TT2iF7F8TT2iF8,Ẑi=diagZi,3Zi,5Zi,i=1,2,F0=c20Tc1Tc2Tc1T+c2T2c5Tc2Tc4TF̂0TT,F̂0=ξ12c2+c42c11+c13,F1ξ=c1Tξ1c5Tξ1c6Tc11T+c13TF̂1TξT,F̂1ξ=ξ2ξc11+c14+ξξ1c12c13,F2=c1Tc2Tc1T+c2T2c5Tc1Tc2T6c6TT,F3=c2Tc3Tc2T+c3T2c7Tc2Tc3T6c8TT,F4=c3Tc4Tc3T+c4T2c9Tc3Tc4T6c10TT,F5=c1Tc15TT,F6=c3Tc16TT,F7=c2Tc18TT,F8=c4Tc19TT,F9=c1Tc20TT,Σ=F3TF4TT,X1i=c20Aic1+Cic15+Dic16+Gic17,X2=c172c21,ci=0n×i1nIn0n×21in,i=1,,21,u1iξ=ξξ1c7c8c11c12,u2iξ=ξ2ξc9c10c13c14,(35)

and the remaining symbols coincide with those defined in theorem 1. Then, the MJHNN Equation 31 achieves MSES.

Proof. Define

ψ̂=colψ0t,,ψ8t,

where

ψ0t=ϑTtϑTtξ1ϑTtξϑTtξ2T,ψ1t=1ξ1ξ10ϑtTzdzξ10υ1zϑtTzdzT,ψ2t=1ξξ1ξξ1ϑtTzdzξξ1υ2zϑtTzdzT,ψ3t=1ξ2ξξ2ξϑtTzdzξ2ξυ3zϑtTzdzT,ψ4t=ξξ1ψ2t,ψ5t=ξ2ξψ3t,ψ6t=φTϑtφTϑtξς0φtTϑzdzT,ψ7t=φTϑtξ1φTϑtξ2T,ψ8t=ϑ̇Tt1ςς0σ0φtTϑzdzdσT,ψ9t=ξ2ξ1ϑtTzdzξ12ξ2ξ1υ4zϑtTzdzT,υ1z=2z+ξ1ξ11,υ2z=2z+ξξξ11,υ3z=2z+ξ2ξ2ξ1,υ4z=2z+ξ2ξ121,ϑtz=ϑt+z,φtz=φt+z.

The LKF is constructed as follows:

Vϑt,ϑṫ,i=V1ϑt,i+V2ϑt,i+V3ϑt,ϑṫ+V4ϑt,V1ϑt,i=ϑ̂TtEiϑ̂t,V2ϑt,i=tξ1tϖ1TzT1iϖ1zdz+tξ2tξ1ϖ1TzT2iϖ1zdz,V3ϑt,ϑṫ=ξ10t+βtϖ1TzU1ϖ1zdzdβ+ξ1ξ2t+βtϖ1TzU2ϖ1zdzdβ+ξ10t+βtϑ̇TzZ1ϑ̇zdzdβ+ξ1ξ2t+βtϑ̇TzZ2ϑ̇zdzdβ,V4ϑt=ς0t+βtφTϑzWφϑzdzdβ,

where ϖ1(t) is defined in Equation 9 and

ϑ̂t=colϑt,ξ1ψ1t,ψ9t.

By the definition of L in Equation 14, along the MJHNN Equation 31, we have

LV1ϑt,i=Heϑ̂TtEiϑ̂̇t+ϑ̂Ttj=1dηijEjϑ̂t,(36)

where ϑ̂(t) includes the following components:

ϑt=c1ψ̂,ξ1ψ1t=ξ1c5Tc6TTψ̂,ψ9t=ξξ1ϑtzdz+ξ2ξϑtzdzξ12ξξ1υ4zϑtzdz+ξ2ξυ4zϑtzdz.(37)

The initial n components are (c11+c13)ψ̂, while the subsequent n components demand two distinct expressions for υ4(z), depending on υ2(z) and υ3(z). It can be attained that

ξ12υ4z=ξξ1υ2z+ξ2ξ=ξ2ξυ3zξξ1.(38)

Substituting Equation 38 into Equation 37, we obtain

ξ12ξξ1υ4zϑtzdz+ξ2ξυ4zϑtzdz=ξξ1ξξ1υ2z+ξ2ξϑtzdz+ξ2ξξ2ξυ3zξξ1ϑtzdz=F̂1iξψ̂.

Therefore, we obtain ψ9(t)=c11T+c13TF̂1iT(ξ)ψ̂ and

ϑ̂t=F1ξψ̂.(39)

The components of ϑ̂̇(t) are as follows:

ϑ̇t=c20ψ̂,ξ1ψ̇1t=c1Tc2Tc1T+c2T2c5TTψ̂,ψ̇9t=c2Tc4Tξ12c2T+ξ12c4T2c11T2c13TTψ̂=c2Tc4TĜ0TTψ̂,

and it is easy to obtain

ϑ̂̇t=F0ψ̂.(40)

Then, we deduce from Equation 35 that

ξξ1ψ2tψ4t=0,ξ2ξψ3tψ5t=0.

Hence, leveraging the matrices u1 and u2 defined in Equation 35, we can derive the following equation for matrices P1 and P2R21n×2n:

ψ̂THeP1u1iξ+P2u2iξψ̂=0.(41)

One can derive from Equations 3641 that

LV1ϑt,i=ψ̂THeF1TξEiF0+P1u1iξ+P2u2iξ+F1Tξj=1dηijEjF1ξψ̂.(42)

It follows from Equation 33 that

LV2ϑt,iψ̂TT̂iψ̂,LV3ϑt,ϑṫϖ1Ttξ1U1+ξ12U2ϖ1t+ϑ̇Ttξ1Z1+ξ12Z2ϑ̇ttξ1tϑ̇TzZ1ϑ̇zdztξ2tξ1ϑ̇TzZ2ϑ̇zdz.(43)

By applying Lemma 1 to the integral term in LV3, one can obtain

tξ1tϑ̇TzZ1ϑ̇zdz1ξ1F2TẐ1F2,(44)

and

tξ2tξ1ϑ̇TzZ2ϑ̇zdz1ξ2ξF4TẐ2F41ξξ1F3TẐ2F3=ΣT1ξξ1Ẑ2001ξ2ξẐ2Σ.(45)

Utilizing Lemma 2, we can deduce from Equation 45 that

1ξξ1Ẑ2001ξ2ξẐ21ξ12Ẑ2SSTẐ2,(46)

leading to

V3ϑt,ϑṫψ̂T(F5Tξ1U1+ξ12U2F51ξ1F2TẐ1F2+c20Tξ1Z1+ξ12Z2c201ξ12ΣTΓΣ)ψ̂.(47)

According to Lemma 2, LV4(ϑt) can be computed as follows:

LV4ϑtψ̂Tc15TςWc151ςc17TWc173ςX2TWX2ψ̂.(48)

Similar to Theorem 1, Equation 20 can be written as

ψ̂THeF9TN̂X1iψ̂=0.(49)

From Equation 7 and Equations 4249, for any scalars ρ1i>0 and ρ2i>0, we can obtain

LVϑt,ϑṫ,iψ̂T(HeF1TξEiF0+P1u1iξ+P2u2iξ+F9TN̂X1i+F1Tξj=1dηijEjF1ξ+F5Tξ1U1+ξ12U2F51ξ1F2TẐ1F2+c20Tξ1Z1+ξ12Z2c201ξ12ΣTΓΣ+T̂i+c15TςWc151ςc17TWc17ρ1iF5TR̂F5ρ2iF6TR̂F6ψ̂=ψ̂TΛiξψ̂,

where Λi(iD) are defined in Equation 35. Using a similar approach to Theorem 1, we can derive that Equations 34 and 35 can ensure the MSES of the MJHNN Equation 31.

Then, based on Theorem 2, we can establish the following estimator design method.

Theorem 4. For given positive scalars ξ1, ξ2, ε, and ς and matrices μ1, μ2, λ1, and λ2, there exist positive scalars ρ1i, ρ2i, and ρ3i and matrices EiS+5n, W, Z1, and Z2S+n, T1i, T2i, U1, and U2S+2n, P1 and P2R22n×2n, SR3n, and Li, Mi, N1, and N2Rn such that

j=1dηijT1jU1,j=1dηijT2jU2,Γ=Ẑ2SSTẐ20,ΛiξΩεL+LT0

hold, for iD and ξ[ξ1,ξ2], where

Λiξ=HeF1ξTEiF0+P1u1iξ+P2u2iξ+F9TN̂X1i+F1Tξj=1dηijEjF1ξ+T̂i+F5Tξ1U1+ξ12U2F5+c20Tξ1Z1+ξ12Z2c201ξ1F2TẐ1F21ξ12ΣTΓΣ+c15TςWc151ςc17TWc173ςX2TWX2ρ1iF5TR̂F5ρ2iF6TR̂F6ρ3iX3TĤX3,Ω=N1TεMiBi0n×18nN2T0n×nεMiT,ci=0n×i1nIn0n×22in,i=1,,22,X3=c1Tc22TT,

and the remaining symbols coincide with those defined in theorem 3. For the MJHNN Equation 31, the estimator Equation 32 with gain matrices

Ki=Li1Mi

guarantees the MSES of the FES Equation 32.

5 Numerical example

Example 1. Consider MJHNNs Equation 5 and Equation 32 with

A1=2.2002.5,A2=2.3002.4,C1=0.20.50.40.3,C2=0.30.10.20.4,D1=0.30.80.50.4,D2=0.10.90.81.2,G1=0.50.50.20.7,G2=0.30.20.50.4,η11=2,η22=3,μ1=I.

By solving LMIs in theorems 1 and 3 in this paper and Theorem 2 in [29], we can obtain the maximum admissible upper bound ςmax for different values of ξ and μ2, as shown in Table 1, which clearly shows the effectiveness of theorems 1 and 3 in this paper. Compared to Theorem 2 in [29], theorem 1 in this study is less conservative.

The maximum admissible upper bound ξmax for various ς and μ2 is presented in Table 2. It can be observed that for the same ς and μ2, ξmax in theorem 1 is larger than in Theorem 2 of [29].

In addition, for different combinations of ς, ξ1, and μ2, solving Theorem 3 yields the maximum admissible upper bound ξ2max, as shown in Table 3. As ς increases, ξ2max decreases under the corresponding ξ1 and μ2 conditions.

Table 1
www.frontiersin.org

Table 1. Maximum allowable delay upper bound ςmax for various ξ and μ2.

Table 2
www.frontiersin.org

Table 2. Maximum allowable delay upper bound ξmax for various ς and μ2.

Table 3
www.frontiersin.org

Table 3. Maximum allowable delay upper bound ξ2max for various ς, ξ1, and μ2 in Theorem 3.

Example 2. Consider MJHNNs Equation 5 and Equation 32 with

A1=0.8001.0,C1=0.50.20.60.3,D1=0.100.10.2,G1=0.20.10.30.1,B1=0.60.30.20.8,A2=1.0001.2,C2=0.60.30.70.6,D2=0.20.10.10.3,G2=0.10.20.20.3,B2=0.80.50.60.9,η11=0.2,η22=0.8,μ1=μ2=0.5I,λ1=0.2I,λ2=0.3I.

Next, we design state estimators to ensure the MSES of FESs with discrete and distributed delays, considering cases of time-invariant and time-variant discrete delays.

Case 1. Time-invariant discrete delay.

For the FES Equation 5, with ς=1.5, ξ=1.0, and ε=0.9, solving the LMIs in Theorem 2 yields the estimator Equation 4 with gain matrices

K1=0.63170.01460.14390.6857,K2=0.47830.20920.23510.5689.

Case 2. Time-variant discrete delay.

For the FES Equation 32, with ς=1.5, ξ1=0.5, ξ2=1.5, and ε=0.9, solving the LMIs in Theorem 4 yields the estimator Equation 32 with gain matrices

K1=0.67390.00450.13100.7854,K2=0.52570.16940.17740.6153.

In the simulations, we set δ(ϑ)=0.25sinϑ+0.05ϑ, φ(ϑ)=0.5sinϑ, and

ϑs=10.5,ϑ̂s=11.5,s20.

The simulations of the state estimators are shown in Figures 14. For the MJHNN with time-invariant discrete and distributed delays, Figure 1 shows the state trajectories and their corresponding estimations, while Figure 2 shows the trajectories of the FES. Figures 3, 4 show the corresponding trajectories under time-variant discrete delay scenarios. The proposed state estimator design methods are effective for MJHNNs with discrete and distributed delays in both cases of time-invariant and time-variant discrete delays.

Figure 1
www.frontiersin.org

Figure 1. State trajectories ϑ1(t) and ϑ2(t), estimations ϑ̂1(t) and ϑ̂2(t), and Markovian chain κt (Case 1).

Figure 2
www.frontiersin.org

Figure 2. State trajectories of the FES ϵ1(t) and ϵ2(t) (Case 1).

Figure 3
www.frontiersin.org

Figure 3. State trajectories ϑ1(t) and ϑ2(t), estimations ϑ̂1(t) and ϑ̂2(t), and Markovian chain κt (Case 2).

Figure 4
www.frontiersin.org

Figure 4. State trajectories of the FES ϵ1(t) and ϵ2(t) (Case 2).

6 Conclusion

This paper has investigated the state estimation for MJHNNs with discrete and distributed delays. Specifically, both time-invariant and time-variant discrete delay cases are considered. Two conditions for the MSES of MJHNNs have been proposed utilizing augmented LKFs, the WBII, the BLI, and the CCI. The LMIs-based design methods for the required estimators have been developed by eliminating nonlinear coupling terms. Lastly, two numerical examples are given to demonstrate the applicability and reduced conservatism of the proposed stability criteria and estimator design methods. Future research could explore further refinement of these analysis and design results, and exporing their extention to more complex neural network models.

Data availability statement

The raw data supporting the conclusion of this article will be made available by the authors, without undue reservation.

Author contributions

LG: Investigation, Methodology, Writing–review and editing. WH: Writing–original draft.

Funding

The author(s) declare that no financial support was received for the research, authorship, and/or publication of this article.

Conflict of interest

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Publisher’s note

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors, and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.

References

1. Xiang S, Zhang T, Han Y, Guo X, Zhang Y, Shi Y, et al. Neuromorphic speech recognition with photonic convolutional spiking neural networks. IEEE J Sel Top Quan Electron (2023) 29:1–7. doi:10.1109/JSTQE.2023.3240248

CrossRef Full Text | Google Scholar

2. Cui G, Yang W, Yu J. Neural network-based finite-time adaptive tracking control of nonstrict-feedback nonlinear systems with actuator failures. Inf Sci (2021) 545:298–311. doi:10.1016/j.ins.2020.08.024

CrossRef Full Text | Google Scholar

3. Pan C, Hong Q, Wang X. A novel memristive chaotic neuron circuit and its application in chaotic neural networks for associative memory. IEEE Trans Comput Aided Des Integr Circuits Syst (2021) 40:521–32. doi:10.1109/TCAD.2020.3002568

CrossRef Full Text | Google Scholar

4. Sharma P, Bisht I, Sur A. Wavelength-based attributed deep neural network for underwater image restoration. Acm T Multim Comput (2023) 19:1–23. doi:10.1145/3511021

CrossRef Full Text | Google Scholar

5. Marcus C, Westervelt R. Stability of analog neural networks with delay. Phys Rev A (1989) 39:347–59. doi:10.1103/PhysRevA.39.347

PubMed Abstract | CrossRef Full Text | Google Scholar

6. Gunasekaran N, Thoiyab NM, Zhu Q, Cao J, Muruganantham P. New global asymptotic robust stability of dynamical delayed neural networks via intervalized interconnection matrices. IEEE Trans Cybern (2022) 52:11794–804. doi:10.1109/TCYB.2021.3079423

PubMed Abstract | CrossRef Full Text | Google Scholar

7. Liu M, Jiang H, Hu C, Lu B, Li Z. Novel global asymptotic stability and dissipativity criteria of BAM neural networks with delays. Front Phys (2022) 10:898589. doi:10.3389/fphy.2022.898589

CrossRef Full Text | Google Scholar

8. Chang S, Wang Y, Zhang X, Wang X. A new method to study global exponential stability of inertial neural networks with multiple time-varying transmission delays. Math Comput Simul (2023) 211:329–40. doi:10.1016/j.matcom.2023.04.008

CrossRef Full Text | Google Scholar

9. Tai W, Zhao A, Guo T, Zhou J. Delay-independent and dependent L2-L filter design for time-delay reaction–diffusion switched Hopfield networks. Circ Syst Signal Pr (2023) 42:173–98. doi:10.1007/s00034-022-02125-0

CrossRef Full Text | Google Scholar

10. Zhou J, Ma X, Yan Z, Arik S. Non-fragile output-feedback control for time-delay neural networks with persistent dwell time switching: a system mode and time scheduler dual-dependent design. Neural Netw (2024) 169:733–43. doi:10.1016/j.neunet.2023.11.007

PubMed Abstract | CrossRef Full Text | Google Scholar

11. Rajchakit G, Sriraman R. Robust passivity and stability analysis of uncertain complex-valued impulsive neural networks with time-varying delays. Neural Process Lett (2021) 53:581–606. doi:10.1007/s11063-020-10401-w

CrossRef Full Text | Google Scholar

12. Wang L, He H, Zeng Z. Global synchronization of fuzzy memristive neural networks with discrete and distributed delays. IEEE Trans Fuzzy Syst (2019) 28:2022–34. doi:10.1109/TFUZZ.2019.2930032

CrossRef Full Text | Google Scholar

13. Wang H, Wei G, Wen S, Huang T. Generalized norm for existence, uniqueness and stability of Hopfield neural networks with discrete and distributed delays. Neural Netw (2020) 128:288–93. doi:10.1016/j.neunet.2020.05.014

PubMed Abstract | CrossRef Full Text | Google Scholar

14. Wang G, Ren Y, Huang C. Stabilizing control of Markovian jump systems with sampled switching and state signals and applications. Int J Robust Nonlin (2023) 33:5198–228. doi:10.1002/rnc.6637

CrossRef Full Text | Google Scholar

15. Zhou J, Dong J, Xu S. Asynchronous dissipative control of discrete-time fuzzy Markov jump systems with dynamic state and input quantization. IEEE Trans Fuzzy Syst (2024) 31:3906–20. doi:10.1109/TFUZZ.2023.3271348

CrossRef Full Text | Google Scholar

16. Hu B, Guan ZH, Lewis FL, Chen CP. Adaptive tracking control of cooperative robot manipulators with Markovian switched couplings. IEEE Trans Ind Electron (2020) 68:2427–36. doi:10.1109/TIE.2020.2972451

CrossRef Full Text | Google Scholar

17. Chen G, Xia J, Park JH, Shen H, Zhuang G. Asynchronous sampled-data controller design for switched Markov jump systems and its applications. IEEE Trans Syst Man Cybern: Syst (2022) 53:934–46. doi:10.1109/TSMC.2022.3188612

CrossRef Full Text | Google Scholar

18. Ma X, Dong J, Tai W, Zhou J, Paszke W. Asynchronous event-triggered H control for 2D Markov jump systems subject to networked random packet losses. Commun Nonlinear Sci (2023) 126:107453. doi:10.1016/j.cnsns.2023.107453

CrossRef Full Text | Google Scholar

19. Ali MS, Tajudeen MM, Kwon OM, Priya B, Thakur GK. Security-guaranteed filter design for discrete-time Markovian jump delayed systems subject to deception attacks and sensor saturation. ISA Trans (2024) 144:18–27. doi:10.1016/j.isatra.2023.10.020

PubMed Abstract | CrossRef Full Text | Google Scholar

20. Xia W, Xu S, Lu J, Zhang Z, Chu Y. Reliable filter design for discrete-time neural networks with Markovian jumping parameters and time-varying delay. J Franklin Inst (2020) 357:2892–915. doi:10.1016/j.jfranklin.2020.02.039

CrossRef Full Text | Google Scholar

21. Nagamani G, Soundararajan G, Subramaniam R, Azeem M. Robust extended dissipativity analysis for Markovian jump discrete-time delayed stochastic singular neural networks. Neural Comput Appl (2020) 32:9699–712. doi:10.1007/s00521-019-04497-y

CrossRef Full Text | Google Scholar

22. Yang H, Wang Z, Shen Y, Alsaadi FE, Alsaadi FE. Event-triggered state estimation for Markovian jumping neural networks: on mode-dependent delays and uncertain transition probabilities. Neurocomputing (2021) 424:226–35. doi:10.1016/j.neucom.2020.10.050

CrossRef Full Text | Google Scholar

23. Tao J, Xiao Z, Li Z, Wu J, Lu R, Shi P, et al. Dynamic event-triggered state estimation for Markov jump neural networks with partially unknown probabilities. IEEE Trans Neural Networks Learn Syst (2021) 33:7438–47. doi:10.1109/TNNLS.2021.3085001

CrossRef Full Text | Google Scholar

24. Aravind RV, Balasubramaniam P. Stochastic stability of fractional-order Markovian jumping complex-valued neural networks with time-varying delays. Neurocomputing (2021) 439:122–33. doi:10.1016/j.neucom.2021.01.053

CrossRef Full Text | Google Scholar

25. Yao L, Wang Z, Huang X, Li Y, Ma Q, Shen H. Stochastic sampled-data exponential synchronization of Markovian jump neural networks with time-varying delays. IEEE Trans Neural Networks Learn Syst (2023) 34:909–20. doi:10.1109/TNNLS.2021.3103958

CrossRef Full Text | Google Scholar

26. Tai W, Li X, Zhou J, Arik S. Asynchronous dissipative stabilization for stochastic Markov-switching neural networks with completely-and incompletely-known transition rates. Neural Netw (2023) 161:55–64. doi:10.1016/j.neunet.2023.01.039

PubMed Abstract | CrossRef Full Text | Google Scholar

27. Sathishkumar V, Vadivel R, Cho J, Gunasekaran N. Exploring the finite-time dissipativity of Markovian jump delayed neural networks. Alex Eng J (2023) 79:427–37. doi:10.1016/j.aej.2023.07.073

CrossRef Full Text | Google Scholar

28. Wang T, Zhao S, Zhou W, Yu W. Finite-time state estimation for delayed Hopfield neural networks with Markovian jump. Neurocomputing (2015) 156:193–8. doi:10.1016/j.neucom.2014.12.062

CrossRef Full Text | Google Scholar

29. Chen Y, Zheng WX. Stochastic state estimation for neural networks with distributed delays and Markovian jump. Neural Netw (2012) 25:14–20. doi:10.1016/j.neunet.2011.08.002

PubMed Abstract | CrossRef Full Text | Google Scholar

30. Yao L, Huang X, Wang Z, Liu K. Secure control of Markovian jumping systems under deception attacks: an attack-probability-dependent adaptive event-trigger mechanism. IEEE Trans Control Netw Syst (2023) 10:1818–30. doi:10.1109/TCNS.2023.3269007

CrossRef Full Text | Google Scholar

31. Khalil H. Nonlinear systems. Pearson education. Prentice Hall (2002).

Google Scholar

32. Zheng F, Li X, Du B. Periodic solution problems of neutral-type stochastic neural networks with time-varying delays. Front Phys (2024) 12:1338799. doi:10.3389/fphy.2024.1338799

CrossRef Full Text | Google Scholar

33. Chen Q, Liu X, Wang F. Improved results on L2-L state estimation for neural networks with time-varying delay. Circ Syst Signal Pr (2022) 41:122–46. doi:10.1007/s00034-021-01799-2

CrossRef Full Text | Google Scholar

34. Qian W, Xing W, Fei S. H state estimation for neural networks with general activation function and mixed time-varying delays. IEEE Trans Neural Networks Learn Syst (2020) 32:3909–18. doi:10.1109/TNNLS.2020.3016120

CrossRef Full Text | Google Scholar

35. Seuret A, Gouaisbaut F. Hierarchy of LMI conditions for the stability analysis of time-delay systems. Syst Control Lett (2015) 81:1–7. doi:10.1016/j.sysconle.2015.03.007

CrossRef Full Text | Google Scholar

36. Zeng HB, He Y, Wu M, She J. New results on stability analysis for systems with discrete distributed delay. Automatica (2015) 60:189–92. doi:10.1016/j.automatica.2015.07.017

CrossRef Full Text | Google Scholar

37. Seuret A, Gouaisbaut F. Wirtinger-based integral inequality: application to time-delay systems. Automatica (2013) 49:2860–6. doi:10.1016/j.automatica.2013.05.030

CrossRef Full Text | Google Scholar

38. Park P, Ko JW, Jeong C. Reciprocally convex approach to stability of systems with time-varying delays. Automatica (2011) 47:235–8. doi:10.1016/j.automatica.2010.10.014

CrossRef Full Text | Google Scholar

39. Liu K, Seuret A, Xia Y. Stability analysis of systems with time-varying delays via the second-order Bessel–Legendre inequality. Automatica (2017) 76:138–42. doi:10.1016/j.automatica.2016.11.001

CrossRef Full Text | Google Scholar

40. Zhou J, Dong J, Xu S, Ahn CK. Input-to-state stabilization for Markov jump systems with dynamic quantization and multimode injection attacks. IEEE Trans Syst Man Cybern: Syst (2024) 54:2517–29. doi:10.1109/TSMC.2023.3344869

CrossRef Full Text | Google Scholar

Keywords: Hopfield neural networks, Markovian jump, mean-square exponential stability, state estimation, time delays

Citation: Guo L and Huang W (2024) State estimation for Markovian jump Hopfield neural networks with mixed time delays. Front. Phys. 12:1447788. doi: 10.3389/fphy.2024.1447788

Received: 12 June 2024; Accepted: 26 August 2024;
Published: 12 September 2024.

Edited by:

Shiping Wen, University of Technology Sydney, Australia

Reviewed by:

Guici Chen, Wuhan University of Science and Technology, China
Guodong Zhang, South-Central University for Nationalities, China

Copyright © 2024 Guo and Huang. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.

*Correspondence: Lili Guo, guolili@ahut.edu.cn

Disclaimer: All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.