Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Few-shot bearing fault detection based on multi-dimensional convolution and attention mechanism


  • Received: 12 December 2023 Revised: 06 February 2024 Accepted: 20 February 2024 Published: 01 March 2024
  • Bearings are critical components of industrial equipment and have a significant impact on the safety of industrial physical systems. Their failure may lead to equipment shutdown and accidents, posing a significant risk to production safety. However, it is difficult to obtain a large amount of bearing fault data in practice, which makes the problem of small sample size a major challenge for bearing fault detection. In addition, some methods may overlook important features in bearing vibration signals, leading to insufficient detection capabilities. To address the challenges in bearing fault detection, this paper proposed a few sample learning methods based on the multidimensional convolution and attention mechanism. First, a multichannel preprocessing method was designed to more effectively utilize the information in the bearing vibration signal. Second, by extracting multidimensional features and enhancing the attention to important features through multidimensional convolution operations and attention mechanisms, the feature extraction ability of the network was improved. Furthermore, nonlinear mapping of feature vectors into the metric space to calculate distance can better measure the similarity between samples, thereby improving the accuracy of bearing fault detection and providing important guarantees for the safe operation of industrial systems. Extensive experiments have shown that the proposed method has good fault detection performance under small sample conditions, which is beneficial for reducing machine downtime and economic losses.

    Citation: Yingying Xu, Chunhe Song, Chu Wang. Few-shot bearing fault detection based on multi-dimensional convolution and attention mechanism[J]. Mathematical Biosciences and Engineering, 2024, 21(4): 4886-4907. doi: 10.3934/mbe.2024216

    Related Papers:

    [1] Keguo Ren, Xining Li, Qimin Zhang . Near-optimal control and threshold behavior of an avian influenza model with spatial diffusion on complex networks. Mathematical Biosciences and Engineering, 2021, 18(5): 6452-6483. doi: 10.3934/mbe.2021321
    [2] Miniak-Górecka Alicja, Nowakowski Andrzej . Sufficient optimality conditions for a class of epidemic problems with control on the boundary. Mathematical Biosciences and Engineering, 2017, 14(1): 263-275. doi: 10.3934/mbe.2017017
    [3] Vincenzo Capasso, Sebastian AniȚa . The interplay between models and public health policies: Regional control for a class of spatially structured epidemics (think globally, act locally). Mathematical Biosciences and Engineering, 2018, 15(1): 1-20. doi: 10.3934/mbe.2018001
    [4] Yuanpei Xia, Weisong Zhou, Zhichun Yang . Global analysis and optimal harvesting for a hybrid stochastic phytoplankton-zooplankton-fish model with distributed delays. Mathematical Biosciences and Engineering, 2020, 17(5): 6149-6180. doi: 10.3934/mbe.2020326
    [5] Chaofeng Zhao, Zhibo Zhai, Qinghui Du . Optimal control of stochastic system with Fractional Brownian Motion. Mathematical Biosciences and Engineering, 2021, 18(5): 5625-5634. doi: 10.3934/mbe.2021284
    [6] Jerzy Klamka, Helmut Maurer, Andrzej Swierniak . Local controllability and optimal control for\newline a model of combined anticancer therapy with control delays. Mathematical Biosciences and Engineering, 2017, 14(1): 195-216. doi: 10.3934/mbe.2017013
    [7] Wei You, Jie Ren, Qimin Zhang . Finite-time contraction stability of a stochastic reaction-diffusion dengue model with impulse and Markov switching. Mathematical Biosciences and Engineering, 2023, 20(9): 16978-17002. doi: 10.3934/mbe.2023757
    [8] Urszula Ledzewicz, Heinz Schättler . Controlling a model for bone marrow dynamics in cancer chemotherapy. Mathematical Biosciences and Engineering, 2004, 1(1): 95-110. doi: 10.3934/mbe.2004.1.95
    [9] An Ma, Shuting Lyu, Qimin Zhang . Stationary distribution and optimal control of a stochastic population model in a polluted environment. Mathematical Biosciences and Engineering, 2022, 19(11): 11260-11280. doi: 10.3934/mbe.2022525
    [10] Tingting Xue, Long Zhang, Xiaolin Fan . Dynamic modeling and analysis of Hepatitis B epidemic with general incidence. Mathematical Biosciences and Engineering, 2023, 20(6): 10883-10908. doi: 10.3934/mbe.2023483
  • Bearings are critical components of industrial equipment and have a significant impact on the safety of industrial physical systems. Their failure may lead to equipment shutdown and accidents, posing a significant risk to production safety. However, it is difficult to obtain a large amount of bearing fault data in practice, which makes the problem of small sample size a major challenge for bearing fault detection. In addition, some methods may overlook important features in bearing vibration signals, leading to insufficient detection capabilities. To address the challenges in bearing fault detection, this paper proposed a few sample learning methods based on the multidimensional convolution and attention mechanism. First, a multichannel preprocessing method was designed to more effectively utilize the information in the bearing vibration signal. Second, by extracting multidimensional features and enhancing the attention to important features through multidimensional convolution operations and attention mechanisms, the feature extraction ability of the network was improved. Furthermore, nonlinear mapping of feature vectors into the metric space to calculate distance can better measure the similarity between samples, thereby improving the accuracy of bearing fault detection and providing important guarantees for the safe operation of industrial systems. Extensive experiments have shown that the proposed method has good fault detection performance under small sample conditions, which is beneficial for reducing machine downtime and economic losses.



    Ever since the studies of epidemiology conducted by Kermack et al. [1] mathematical models have become important tools for studying the spread and control of infectious diseases. For some deterministic epidemic models, many researchers have studied the dynamical behaviors [1,2,3,4,5,6]. Moreover, Chen et al. [9] proposed that the coefficient of deterministic epidemic system may be influenced by stochastic perturbation. Therefore, stochastic models have been studied to find out impacts of stochastic fluctuation upon the infectious diseases [11,11,24,29,30]. For example, the studies conducted by Zhao et al. [11] on the asymptotic behavior of a stochastic SIS epidemic model with vaccination. Cai et al. [11] proves the existence of stationary distribution of a stochastic SIRS epidemic model.

    In fact, some parameters of the epidemic models may be influenced by the sudden changes such as color noise which deems to be a random switching from one environment regime to another under the influence of such factors as temperature or rainfall [15,17]. For the first equation of the SIV epidemic model, the parameters are determined as follows:

    dS(t)=((1p)μ+αI(t)(μ+u1)S(t)βS(t)I(t))dtσS(t)I(t)dB(t), (1.1)

    we assume that there are n regimes and the system obeys

    dS(t)=((1p(1))μ(1)+α(1)I(t)(μ(1)+u1(1))S(t)β(1)S(t)I(t))dtσ(1)S(t)I(t)dB(t), (1.2)

    when it is in regime 1, while it obeys another stochastic model

    dS(t)=((1p(2))μ(2)+α(2)I(t)(μ(2)+u1(2))S(t)β(2)S(t)I(t))dtσ(2)S(t)I(t)dB(t), (1.3)

    in regime 2 and so on. Therefore, the system obeys

    dS(t)=((1p(i))μ(i)+α(i)I(t)(μ(i)+u1(i))S(t)β(i)S(t)I(t))dtσ(i)S(t)I(t)dB(t) (1.4)

    in regime i(1in). To best reveal the way the environment noise affects the epidemic systems, we propose the application of continuous-time Markov chain to define this phenomenon [18,19,20]. It is significant to study the effect of random switching of environmental regimes on the spread dynamic of diseases.

    As it is known that SIV epidemic model has drawn much attention. For instance, Liu et al. [26] discussed the existence and uniqueness of the global positive solution of the system, and Lin et al. [23] considered the asymptotic stability of the stochastic SIV epidemic model and the existence of a stationary distribution. The above work done just focused on the studies of dynamic behaviors of SIV system with quite few studies focusing on the optimal control for stochastic SIV models with Markov chains. The study of optimal control of stochastic SIV epidemic model, therefore, becomes significant.

    In addition, vaccination and treatment have become the most effective strategies in the control of the epidemic transmission. We give priority to vaccinations to susceptible people. Vaccination duration and effective treatment make it possible to curb the spread of diseases and cut the cost of vaccines. For instance, Measles is a highly contagious disease that may result in serious illness in the early childhood stage, and therefore the advance immunization is necessary [25]. The global Measles and Rubella Strategic Plan 2012–2020, aims to reduce global measles mortality and to achieve measles elimination by the end of the 2020 (http://www.measlesinitiative.org/). The most effective approach to achieve this plan is vaccination. In view of this above, it is meaningful to carry out the research of a stochastic SIV epidemic model with vaccination and saturated treatment to analyze the near-optimal control with Markov chains.

    According to the paper, the objective function is determined and constructed on the basis of an optimal control problem with two control variables of vaccination and treatment. And the optimal solution of the model is provided according to the objective function through analysis in the relevant optimal theories. Aiming at the stochastic SIV model with Markov chain, we carried out thorough studies on the minimization of the number of infected individuals through the application of prophylactic vaccination and saturated treatment. We also define the sufficient and necessary conditions for the near-optimal control problems. The innovative ideas of the study are as follows:

    ● Provision of an innovative stochastic SIV epidemic model with vaccination, treatment and Markov chains;

    ● Discussion of sufficient and necessary conditions of the near-optimal control for a stochastic SIV model.

    The remaining part of of the paper is so organized as: Section 2 preliminaries and introduction of stochastic SIV model; Section 3 proof of the necessary condition for near-optimal control; Section 4, institution of sufficient conditions for near-optimal control; Section 5 numerical simulations display to confirm the results; and, Section 6, conclusions.

    In this section, we first introduce the following notations and definitions before we formulate the model.

    We define (Ω,F,F0tT,P) be a complete filtered probability space on a finite time horizon [0,T]. We assume (Ft)0tT is the natural filtration and F=FT, Uad is the set of all admissible controls, fx denotes the partial derivative of f with respect to x, || denotes the norm of an Euclidean space, XS denotes the indicator function of a set S, X+Y is the set {x+y: xX, yY} for any sets X and Y, C is the different parameters in the paper.

    We establish the optimal problems on the basis of a stochastic SIV model was put forward by Safan and Rihan et al. [14] as follows:

    {dS(t)=[(1p)μ+αI(t)(μ+u1)S(t)βS(t)I(t)]dt,dI(t)=[βS(t)I(t)+(1e)βV(t)I(t)(μ+α)I(t)]dt,dV(t)=[pμ+u1S(t)μV(t)(1e)βV(t)I(t)]dt. (2.1)

    with initial conditions S(0)0,I(0)0, and V(0)0. The population size is denoted by N(t) with N(t)=S(t)+I(t)+V(t). The SIV model assume that recovered individuals may lose immunity and move into the susceptible class again. Note that 0p1 and βS(t)I(t) is the incidence rate. Vaccinated individuals can either die with rate μ or obtain infected with force of infection (1e)βI where e measures the efficacy of the vaccine induced protection against infection. If e=1, then the vaccine is perfectly effective in preventing infection, while e=0 means that the vaccine has no effect. The following flux diagram (Figure 1) illustrating the transmission of susceptible, infected and vaccinated. S, I and V represent susceptible, infected and vaccinated respectively. The continuous line represents nonlinear transmission rate between different compartments.

    Figure 1.  The flux diagram illustrating the SIV epidemic model of Equation 2.1.

    We assume that stochastic perturbations in the environment will mainly affect the parameter β, as in Tornatore et al. [27], so that ββ+σ˙B(t), where B(t) is a standard Brownian motion with the intensity σ2>0. All parameters in model (2.1) are assumed to be positive due to the physical meaning and more precisely are listed in Table.1. By this way, the stochastic version corresponding to system (2.1) be expressed by Liu et al. [26] as follows:

    {dS(t)=[(1p)μ+αI(t)(μ+u1)S(t)βS(t)I(t)]dtσS(t)I(t)dB(t),dI(t)=[βS(t)I(t)+(1e)βV(t)I(t)(μ+α)I(t)]dt+σS(t)I(t)dB(t)+(1e)σV(t)I(t)dB(t),dV(t)=[pμ+u1S(t)μV(t)(1e)βV(t)I(t)]dt(1e)σV(t)I(t)dB(t). (2.2)
    Table 1.  List of parameters, variables, and their meanings in model (2.2).
    Parameters Biological meanings
    p The proportion of population that get vaccinated immediately after birth
    u1 Vaccinated rate
    β Per capita transmission coefficient
    μ Per capita natural death rate / birth rate
    α Per capita recovery rate
    σ The intensities of the white noise
    S(t) Susceptible proportion in the total population
    I(t) Infected proportion in the total population
    V(t) Vaccinated proportion in the total population

     | Show Table
    DownLoad: CSV

    According to [28], we know that the switching of the Markov chain is memoryless and the waiting time for the next switch is subjected to an exponential distribution. In addition, we assume that there are N regimes and the switching between them is governed by a Markov chain on the state space S={1,2,...,N}. Then as the sample path of Markov chain ξ(t) is right continuous step function almost surely, its jump points have no accumulation point. Thus, there exists a stopping sequence {τk}k0 for every wΩ, and a finite random constant ˉk=ˉk(w) such that 0=τ0<τ1...<τˉk=τ. Then when k>ˉk, we get that τk>τ and ξ(t) is a random constant in every intervals. That is to say, ξ(t)=ξ(τk) for τktτk+1.

    Let Rn+={xRn:xi>0,i=1,2,...,n}, and |x|=ni=1x2i. Then Markov process (x(t),ξ(t))Rn+×S, making up a diffusion component x(t) and a jump component ξ(t), can be described as follows:

    {dx(t)=f(x(t),ξ(t))dt+g(x(t),ξ(t))dB(t),x(0)=x0Rn+,ξ(0)=ˉwS, (2.3)

    where B(t) is a d-dimensional Brownian motion, and f(,):Rn×SRn, g(,):Rn×SRn×d.

    If for any twice continuously differentiable function V(x,k)C2(Rn×S), define linear operator L by

    LV(x,k)=nj=1fj(x,i)V(x,i)xj+12nj,k=1ajk(x,i)2V(x,i)xixj+jkSqkj(x)(V(x,j)V(x,k)),

    where a(x,i)=g(x,i)g(x,i) with the superscript T stands for the transpose of a matrix or vector.

    Hypothesis. The following basic hypothesis need to be satisfied

    (H1) For all 0tT, the partial derivatives Lx1(t)(t,x(t);u(t)), Lx2(t)(t,x(t);u(t)), and Lx3(t)(t,x(t);u(t)) are continuous, and there is a constant C such that

    |A1+A2|C(1+|x1(t)+x2(t)+x3(t)|).

    (H2) Let x(t), x(t)R3+ and ui(t), ui(t)Uad,i=1,2, then for any 0tT, the function L(t,x(t);u(t)) is differentiable in u(t), and there exists a constant C such that

    |hx2(t)(x(t))hx2(t)(x(t))|C|x2(t)x2(t)|.

    (H3) The control set Uad is convex.

    (H4) Assume that

    Π=lMπk(μ(k)+12σ21(k)+(μ(k)+α(k))+12σ22(k)+(μ(k)+α(k))+12σ23(k))>0, (2.4)

    holds.

    (H5) Assume that

    K=(1p(k))b(k)x1(t)β(k)x2(t)1+x22(t)+α(k)x3(t)x1(t)u1(t)12σ24(k)x22(t)(1+x22(t))2+β(k)x1(t)1+x22(t)12σ24(k)x21(t)(1+x22(t))2+p(k)b(k)x3(t)m(k)u2(t)1+η(k)x2(t)+u1(t)x1(t)x3(t)+m(k)u2(t)x2(t)(1+η(k)x2(t))x3(t)+α(k)x2(t)x3(t)<0, (2.5)

    holds. We introduce the treatment control u2(t) into the above model (2.2). With the help of vaccination or treatment, the number of susceptible individuals increased, using Su represent it. In fact, every community should have proper treatment ability. If investment in treatment is too large, the community will pay unnecessary expenses. If it is too small, the community will have the risk of disease outbreaks. Therefore, it is very important to determine the right treatment ability. Following Wang's argument in [22], the advantage of using a saturated type treatment function is that it generates near-linear treatment results. We assume that the treatment function is a function of u2(t) and I(t). It is defined as T(u2(t),I(t))=mu2(t)I(t)1+ηI(t), where m>0,η0. Our new model is as follows:

    {dS(t)=((1p)μ+αI(t)(μ+u1(t))S(t)βS(t)I(t))dtσS(t)I(t)dB1(t)dI(t)=(βS(t)I(t)+(1e)βV(t)I(t)(μ+α)I(t)mu2(t)I(t)1+ηI(t))dtσS(t)I(t)dB2(t)+(1e)σV(t)I(t)dB4(t),dV(t)=(pμμV(t)(1e)βV(t)I(t)+u1(t)S(t)+mu2(t)I(t)1+ηI(t))dt(1e)σV(t)I(t)dB3(t). (2.6)

    where m is the cure rate, η in the treatment function measures the extent of delayed treatment given to infected people. Let UR be a bounded nonempty closed set. The control u(t)U is called admissible, if it is an Ft-adapted process with values in U. The set of all admissible controls is denoted by Uad. In this optimal problem, we assume a restriction on the control variable such that 0u1(t)0.9 [12], because it is impossible for all susceptible individuals to be vaccinated at one time. u2(t)=0 represents no treatment, and u2(t)=1 represents totally effective treatment.

    For the sake of showing such sudden environmental abrupt shift in different regimes, we will introduce the colored noise (i.e. the Markov chain) into the SIV epidemic model (2.6). Let ξ(t) be a right-continuous Markov chain in a finite state space S={1,2,...,N} with generator α=(qij)N×N given by

    P{ξ(t+Δt)=j|ξ(t)=i}={qijΔt+o(Δ), if ji,1+qiiΔt+o(Δ), if j=i, (2.7)

    where Δt>0 and qij is the transition rate from state i to state j and qij0 if ji while qii=jiqij.

    Then we can obtain the novel SIV epidemic model as follows:

    {dS(t)=((1p(ξ(t)))μ(ξ(t))+α(ξ(t))I(t)(μ(ξ(t))+u1(t))S(t)β(ξ(t))S(t)I(t))dtσ(ξ(t))S(t)I(t)dB1(t),dI(t)=(β(ξ(t))S(t)I(t)+(1e)β(ξ(t))V(t)I(t)(μ(ξ(t))+α(ξ(t)))I(t)m(ξ(t))u2(t)I(t)1+η(ξ(t))I(t))dtσ(ξ(t))S(t)I(t)dB2(t)+(1e)σ(ξ(t))V(t)I(t)dB4(t),dV(t)=(p(ξ(t))μ(ξ(t))+u1(t)S(t)μ(ξ(t))V(t)(1e)β(ξ(t))V(t)I(t)+m(ξ(t))u2(t)I(t)1+η(ξ(t))I(t))dt(1e)σ(ξ(t))V(t)I(t)dB3(t). (2.8)

    To simplify equations, we represent xi(t)=(x1(t),x2(t),x3(t))=(S(t),I(t),V(t)), u(t)=(u1(t),u2(t)) and the model (2.8) can be rewritten as

    {dx1(t)=((1p(ξ(t)))μ(ξ(t))+α(ξ(t))x2(t)μ(ξ(t))x1(t)β(ξ(t))x1(t)x2(t)u1(t)x1(t))dtσ(ξ(t))x1(t)x2(t)dB1(t)f1(x(t),u(t))dtσ14(x(t))dB(t),dx2(t)=(β(ξ(t))x1(t)x2(t)+(1e)β(ξ(t))x2(t)x3(t)(μ(ξ(t))+α(ξ(t)))x2(t)m(ξ(t))u2(t)x2(t)1+η(ξ(t))x2(t))dtσ(ξ(t))x1(t)x2(t)dB2(t)+(1e)σ(ξ(t))x2(t)x3(t)dB4(t)f2(x(t),u(t))dtσ24(x(t))dB(t),dx3(t)=(p(ξ(t))μ(ξ(t))+u1(t)x1(t)μ(ξ(t))x3(t)(1e)β(ξ(t))x2(t)x3(t)+m(ξ(t))u2(t)x2(t)1+η(ξ(t))x2(t))dt(1e)σ(ξ(t))x2(t)x3(t)dB3(t)f3(x(t),u(t))dtσ34(x(t))dB(t),x(0)=x0. (2.9)

    with the objective function

    J(0,x0;u(t))=E(T0L(x(t),u(t))dt+h(x(T))), (2.10)

    where x(t)={x(t):0tT} is the solution of model (2.9) on the filtered space (Ω,F,(Ft)0tT,P). For any u(t)Uad, model (2.9) has a unique Ft-adapted solution x(t) and (x(t),u(t)) is called an admissible pair. The control problem is to find an admissible control which minimizes or nearly minimizes the objective function J(0,x0;u()) over all u()Uad. The objective function J(0,x0;u()) represent a function that t=0,x(t)=x0 with control variable u(). The value function is as follows:

    V(0,x0)=minu()UadJ(0,x0;u()).

    Our goal is to minimize the total number of the infected and susceptible individuals by using minimal control efforts. Refering to Lashari et al. [13], let the objective function in this paper is

    J(0,x0;u(t))=E{T0(A1S(t)+A2I(t)+12(τ1u21(t)+τ2u22(t)))dt+h(x(T))}, (2.11)

    where τ1 and τ2 are positive constants,

    L(x(t),u(t))=A1S(t)+A2I(t)+12(τ1u21(t)+τ2u22(t)),h(x(T))=(0,I(T),0).

    Definition 2.1. (Optimal Control) [7]. If u() or an admissible pair(x(t),u(t)) attains the minimum of J(0,x0;u()), then an admissible control u() is called optimal.

    Definition 2.2. (ε-Optimal Control) [7]. For a given ε>0, an admissible pair(x(t),u(t)) or an admissible control uε() is called ε-optimal, if

    |J(0,x0;uε())V(0,x0)|ε.

    Definition 2.3. (Near-optimal Control) [7]. A family of admissible controls {uε()} parameterized by ε>0 and any element (x(t),u(t)), or any element uε() in the family are called near-optimal, if

    |J(0,x0;uε())V(0,x0)|δ(ε),

    holds for a sufficiently small ε>0, where δ is a function of ε satisfying δ(ε)0 as ε0. The estimate δ(ε) is called an error bound. If δ(ε)=cεκ for some c,κ>0, then uε() is called near-optimal with order εκ.

    Definition 2.4. [11]. Let ΞRn be a region and u1:ΞRn be a locally Lipschitz continuous function. The generalized gradient of ϕ at ξΞ is defined as

    ϕ(ξ)={ζRn|ζ,η¯limyξ,yΞ,m0ϕ(y+mη)ϕ(y)m}.

    Our next goal is to derive a set of necessary conditions for near-optimal controls.

    In this section, we will introduce two lemmas at first, then we will obtain the necessary condition for the near-optimal control of the model (2.8).

    Lemma 3.1. For all θ0 and 0<κ<1 satisfying κθ<1, and u(t),u(t)</italic><italic>∈Uad, along with the corresponding trajectories x(t),x(t), there exists a constant C=C(θ,κ) such that

    3i=1Esup0tT|xi(t)xi(t)|2θC2i=1d(ui(t),ui(t))κθ. (3.1)

    Proof. We assume θ1 and r>0, use the elementary inequality, and get

    Esup0tr |x1(t)x1(t)|2θCEr0[(β2θ(ξ(t))+σ2θ4(ξ(t)))|x1(t)x2(t)1+x22(t)x1(t)x2(t)1+x22(t)|2θ+(μ2θ1(ξ(t))σ2θ2(ξ(t)))|x1(t)x1(t)|2θ+α2θ(ξ(t))|x3(t)x3(t)|2θ+|u1(t)x1(t)u1(t)x1(t)|2θ]dtCEr03i=1|xi(t)xi(t)|2θdt+C[Er0χu1(t)u1(t)(t)dt]κθC[Er03i=1|xi(t)xi(t)|2θdt+d(u1(t),u1(t))κθ]. (3.2)

    If 0<κ<1, then θ1, we apply Cauchy-Schwartz's inequality and get

    Er0χu1(t)u1(t)(t)dtC(Er0dt)1κθ×(Er0χu1(t)u1(t)(t)dt)κθCd(u1(t),u1(t))κθ. (3.3)

    Similarly, we can get the following estimates for |xi(t)xi(t)|2θ(i=2,3)

    Esup0tr |x2(t)x2(t)|2θC[Er02i=1|xi(t)xi(t)|2θdt+d(u2(t),u2(t))κθ],Esup0tr |x3(t)x3(t)|2θC[Er03i=2|xi(t)xi(t)|2θdt+2i=1d(ui(t),ui(t))κθ]. (3.4)

    Then, summing up (3.2) and (3.4), we may obtain that

    3i=1Esup0tr |xi(t)xi(t)|2θC[r03i=1Esup0ts|xi(t)xi(t)|2θds+2i=1d(ui(t),ui(t))κθ].

    Now by considering 0θ<1, with the help of Cauchy-Schwartz's inequality, we have

    3i=1Esup0tr |xi(t)xi(t)|2θ3i=1[Esup0tr |xi(t)xi(t)|2]θC[r03i=1Esup0ts|xi(t)xi(t)|2θds+2i=1d(ui(t),ui(t))κ]θCθ[2i=1d(ui(t),ui(t))κθ]. (3.5)

    Therefore, the result is true by making use of Gronwall's inequality.

    The proof is completed.

    Lemma 3.2. Let Hypotheses (H3) and (H4) hold. For all 0<κ<1 and 0<θ<2 satisfying (1+κ)θ<2, and u(t),u(t)Uad, along with the corresponding trajectories x(t),x(t), and the solution (p(t),q(t)),(p(t),q(t)) of corresponding adjoint equation, there exists a constant C=C(κ,θ)>0 such that

    3i=1ET0|pi(t)pi(t)|θdt+3i=1ET0|qi(t)qi(t)|θdtC2i=1d(ui(t),ui(t))κθ2. (3.6)

    Proof. Let ˆpi(t)pi(t)pi(t),ˆqj(t)qj(t)qj(t)(i,j=1,2,3). From the adjoint equation (4.5), we have

    {dˆp1(t)=[((μ(ξ(t))+u1(t))x1(t)+β(ξ(t))x2(t)+μ(ξ(t)))ˆp1(t)+β(ξ(t))x2(t)ˆp2(t)+u1(t)ˆp3(t)σ(ξ(t))x2(t)ˆq1(t)+σ(ξ(t))x2(t)ˆq2(t)+ˆf1(t)]dt+ˆq1(t)dB(t),dˆp2(t)=[(α(ξ(t))β(ξ(t))x1(t))ˆp1(t)+(β(ξ(t))x1(t)(1e)β(ξ(t))x3(t)(μ(ξ(t))+α(ξ(t)))m(ξ(t))u2(t)x2(t)1+η(ξ(t))x2(t))ˆp2(t)((1e)β(ξ(t))x3(t)m(ξ(t))u2(t)x2(t)1+η(ξ(t))x2(t))ˆp3(t)σ(ξ(t))x1(t)ˆq1(t)+(σ(ξ(t))x1(t)+(1e)σ(ξ(t))x3(t))ˆq2(t)((1e)σ(ξ(t))x3(t))ˆq3(t)+ˆf2(t)]dt+ˆq2(t)dB(t),dˆp3(t)=[((1e)β(ξ(t))x2(t))ˆp2(t)(μ(ξ(t))+(1e)β(ξ(t))x2(t)ˆp3(t)]dt+((1e)σ(ξ(t))x2(t))ˆq2(t)+((1e)σ(ξ(t))x2(t))ˆq3(t)+ˆf3(t)+ˆq3(t)dB(t). (3.7)

    where

    ˆf1(t)=β(ξ(t))(x2(t)x2(t))(p2(t)p1(t))+σ(ξ(t))(x2(t)x2(t))(q2(t)q1(t)),ˆf2(t)=β(ξ(t))(x1(t)x1(t))(p2(t)p1(t))+(1e)β(ξ(t))(x3(t)x3(t))(p3(t)p2(t))+m(ξ(t))x(u2(t)(1+η(ξ(t))x2(t))2u2(t)(1+η(ξ(t))x2(t))2)(p3(t)p2(t))+σ(ξ(t))(x1(t)x1(t))(q2(t)q1(t))+(1e)σ(ξ(t))(x3(t)x3(t))(q3(t)q2(t)),ˆf3(t)=(1e)β(ξ(t))(x2(t)x2(t))(p2(t)p3(t))+(1e)σ(ξ(t))(x2(t)x2(t))(q2(t)q3(t)),

    We assume the solution of the following stochastic differential equation is ϕ(t)=(ϕ1(t),ϕ2(t),ϕ3(t)).

    {dϕ1(t)=[((μ(ξ(t))+u1(t))x1(t)+β(ξ(t))x2(t)+μ(ξ(t)))ϕ1(t)+(α(ξ(t))β(ξ(t))x1(t))ϕ2(t)+|ˆp1(t)|θ1sgn(ˆp1(t))]dt+[(σ(ξ(t))x2(t))ϕ1(t)+(σ(ξ(t))x1(t))ϕ2(t)+|ˆq1(t)|θ1sgn(ˆq1(t))]dB(t),dϕ2(t)=[β(ξ(t))x2(t)ϕ1(t)+(β(ξ(t))x1(t)(1e)β(ξ(t))x3(t)(μ(ξ(t))+α(ξ(t)))m(ξ(t))u2(t)x2(t)1+η(ξ(t))x2(t))ϕ2(t)+(1e)β(ξ(t))x2(t)ϕ3(t)+|ˆp2(t)|θ(ξ(t))1sgn(ˆp2(t))]dt+[σ(ξ(t))x2(t)ϕ1+(σ(ξ(t))x1(t)+(1e)σ(ξ(t))x3(t))ϕ2+(1e)σ(ξ(t))x2(t)ϕ3+|^q2|θ1sgn(ˆq2(t)]dB(t),dϕ3(t)=[u1(t)ϕ1((1e)β(ξ(t))x3(t)m(ξ(t))u2(t)x2(t)1+η(ξ(t))x2(t))ϕ2(μ(ξ(t))+(1e)β(ξ(t))x2(t))ϕ3+|ˆp3(t)|θ1sgn(ˆp3(t))]dt+(((1e)σ(ξ(t))x3(t))ϕ1+((1e)σ(ξ(t))x2(t))ϕ2+|ˆq3(t)|θ1sgn(ˆq3(t)))dB(t), (3.8)

    where sgn() is a symbolic function.

    According to Hypothesis (H1), the definition of L and Lemma 4.2, the above equation admits a unique solution. Meanwhile, Cauchy-Schwartz's inequality indicates that

    3i=1Esup0tT|ϕi(t)|θ13i=1ET0 |ˆpi(t)|θdt+3i=1ET0 |ˆqi(t)|θdt, (3.9)

    where θ1>2 and 1θ1+1θ=1.

    In order to obtain the above inequality (3.6), we define the function

    V(x(t),ˆp(t),ϕ(t),ˆq(t),k)=3i=1ˆpi(t)ϕi(t)+3i=1lnxi(t)+(¯wk+|ˉw|)=V1(x(t),ˆp(t),ϕ(t),ˆq(t))+V2(x(t))+V3(k), (3.10)

    where ˉw=(ˉw1,ˉw2,,ˉwN), |ˉw|=ˉw21++ˉw2N and ¯wk(kS) are to be determined later and the reason for |ˉw| being is to make ¯wk+|ˉw| non-negative. Using Itô's formula [4] yields

    LV1(x(t),ˆp(t),ϕ(t),ˆq(t))=3i=1E |ˆpi(t)|θ+2i=1E |ˆqi(t)|θ3i=1E ˆfi(t)ϕi(t), (3.11)
    LV2(x(t))=(1p(k))μ(k)x1(t)+αx2(t)x1(t)μ(k)β(k)x2(t)u1(t)+β(k)x1(t)+(1e)β(k)x3(t)(μ(k)+α(k))m(k)u2(k)1+η(k)x2(t)+p(k)μ(k)x3(t)+u1(k)x1(t)x3(t)μ(k)(1e)β(k)x2(t)+m(k)u2(k)x2(t)(1+η(k)x2(t))x3(t)12σ2(k)x22(t)+12σ2(k)x21(t)+12(1e)2σ(k)x23(t)12(1e)2σ2(k)x22(t)=K(μ(k)+12σ21(k)+(μ(k)+α(k))+12σ22(k)+(μ(k)+α(k))+12σ23(k)), (3.12)
    LV3(k)=lMαkl¯wl. (3.13)

    We define a vector Ξ=(Ξ1,Ξ2,,ΞN) with

    Ξk=μ(k)+12σ21(k)+(μ(k)+α(k))+12σ22(k)+(μ(k)+α(k))+12σ23(k). (3.14)

    Due to the generator matrix α is irreducible and Lemma 2.3 in [5], for Ξk there exists a solution

    ˉw=(¯w1,¯w2,,¯wN),

    for the following poisson systems:

    αˉwΞk=Nj=1πjΞj.

    Thus, we obtain that

    lMαkl¯wl(μ(k)+12σ21(k)+(μ(k)+α(k))+12σ22(k)+(μ(k)+α(k))+12σ23(k))=lMπk(μ(k)+12σ21(k)+(μ(k)+α(k))+12σ22(k)+(μ(k)+α(k))+12σ23(k))=Π. (3.15)

    According to Hypotheses (H4) and (H5), we get that

    LV(x(t),p(t),q(t),k)=LV1(x(t),ˆp(t),ϕ(t),ˆq(t))+LV2(x(t))+LV3(k)=Π+3i=1E |ˆpi(t)|θ+2i=1E |ˆqi(t)|θ3i=1E ˆfi(t)ϕi(t)+K3i=1E |ˆpi(t)|θ+2i=1E |ˆqi(t)|θ3i=1E ˆfi(t)ϕi(t). (3.16)

    Integrating both side of (3.16) from 0 to T and taking expectations, we get that

    3i=1ET0 |ˆpi(t)|θdt+2i=1ET0 |ˆqi(t)|θdt=2i=1ET0 ˆfi(t)ϕi(t)dt+3i=1Ehxi(t)(x(T))ϕi(T)C[2i=1(ET0 |ˆfi(t)|θdt)1θ(ET0 |ϕi(t)|θ1dt)1θ1+3i=1(E|hxi(t)(x(T))|θ)1θ(E|ϕi(T)|θ1)1θ1]. (3.17)

    Substituting (3.9) into (3.17),

    3i=1ET0 |ˆpi(t)|θdt+2i=1ET0 |ˆqi(t)|θdtC3i=1ET0|ˆfi(t)|θdt+3i=1E|hxi(t)(x(T))hxi(t)(x(T))|θ. (3.18)

    We proceed to estimate the right side of (3.18). From Hypothesis (H3) and Lemma 4.1, it follows that

    3i=1E|hxi(t)(x(T))hxi(t)(x(T))|θCθ3i=1E|xi(T)xi(T)|θC. (3.19)

    Application of Cauchy-Schwartz's inequality, we obtain

    ET0 |ˆf1(t)|θdtCET0 |x2(t)x2(t)|θ(2i=1|pi(t)|θ+2i=1|qi(t)|θ)dtC(ET0 |x2(t)x2(t)|2θ2θdt)1θ2[(2i=1ET0 |pi(t)|2dt)θ2+(2i=1ET0 |qi(t)|2dt)θ2]. (3.20)

    Noting that 2θ1θ<1, 11θ>κθ2 and d(u(t),u(t))<1, using Lemmas 4.2 and 3.1, we derive that

    ET0 |ˆf1(t)|θdtCd(u(t),u(t))κθ2. (3.21)

    Applying the same method, we can get the same estimate, i.e.

    3i=2ET0 |ˆfi(t)|θdtCd(u(t),u(t))κθ2. (3.22)

    Combining (3.18) with the above two estimates, the desired result then holds immediately.

    Theorem 3.1. Let Hypotheses (H1) and (H2) hold. (pε(t),qε(t)) is the solution of the adjoint equation (4.5) under the control uε(t). Then, there exists a constant C such that for any θ[0,1),ε>0 and any ε-optimal pair (xε(t),uε(t)), it holds that

    minu(t)UadET0(u1(t)xε1(t)(pε3(t)pε1(t))+m(ξ(t))u2(t)xε2(t)1+η(ξ(t))xε2(t)(pε3(t)pε2(t))+12(τ1u21(t)τ2u22(t)))dtET0(uε1(t)xε1(t)(pε3(t)pε1(t))+m(ξ(t))uε2(t)xε2(t)1+η(ξ(t))xε2(t)(pε3(t)pε2(t))+12(τ1u2ε1(t)τ2u2ε2(t)))dtCεθ3. (3.23)

    Proof. The crucial step of the proof is to indicate that Hu(t)(t,xε,uε(t),pε(t),qε(t)) is very small and use ε to estimate it. Let us fix an ε>0. Define a new metric d as follows:

    d(uε(t),˜uε(t))ε23, (3.24)

    and

    ˜J(0,x0;˜uε(t))˜J(0,x0;u(t)) u(t)Uad[0,T], (3.25)

    where the cost functional

    ˜J(0,x0;u(t))=J(0,x0;u(t))+ε13d(u(t),˜uε(t)). (3.26)

    This implies that (˜xε(t),˜uε(t)) is optimal for state equations (2.9) with the cost functional (2.11). Then, for a.e. t[0,1],θ[0,1), a stochastic maximum principle yields

    H(t,˜xε(t),˜uε(t),˜pε(t),˜qε(t))=minuUad[H(t,˜xε(t),˜uε(t),˜pε(t),˜qε(t))+εθ3|u(t)˜uε(t)|], (3.27)

    where (˜pε(t),˜qε(t)) is the solution of (4.5) with ˜uε(t).

    For simplicity, let

    W1(t)=H(t,˜xε(t),˜uε(t),˜pε(t),˜qε(t))H(t,xε(t),uε(t),pε(t),qε(t)),W2(t)=H(t,˜xε(t),u(t),˜pε(t),˜qε(t))H(t,xε(t),u(t),pε(t),qε(t)).

    By virtue of (3.27) and elementary inequality, there exists a constant C such that

    ET0H(t,xε(t),uε(t),pε(t),qε(t))dtET0H(t,˜xε(t),˜uε(t),˜pε(t),˜qε(t))dt+ET0|W1(t)|dt=ET0minuUad[H(t,˜xε(t),˜uε(t),˜pε(t),˜qε(t))+ε13|u(t)˜uε(t)|]dt+ET0|W1(t)|dtET0minuUad[H(t,˜xε(t),˜uε(t),˜pε(t),˜qε(t))]dt+ET0|W1|dt+Cεθ3ET0minuUad[H(t,xε(t),uε(t),pε(t),qε(t))]dt+ET0minuUad|W2(t)|dt+ET0|W1(t)|dt+Cεθ3minuUadET0[H(t,xε(t),uε(t),pε(t),qε(t))]dt+minuUadET0|W2(t)|dt+ET0|W1(t)|dt+Cεθ3.

    From Hypothesis (H1) and the definition of L, Lemma 3.1 and 3.2, we get

    minuUadET0|W2(t)|dt+ET0|W1(t)|dtCεθ3.

    Thus, we get the result, i.e.

    minu(t)UadET0(u1(t)xε1(t)(pε3(t)pε1(t))+m(ξ(t))u2(t)xε2(t)1+η(ξ(t))xε2(t)(pε3(t)pε2(t))+12(τ1u21(t)τ2u22(t)))dtET0(uε1(t)xε1(t)(pε3(t)pε1(t))+m(ξ(t))uε2(t)xε2(t)1+η(ξ(t))xε2(t)(pε3(t)pε2(t))+12(τ1u2ε1(t)τ2u2ε2(t)))dtCεθ3. (3.28)

    Lemma 4.1. For any θ0 and u(t)Uad, we have

    Esup0tT|x1(t)|θC,Esup0tT|x2(t)|θC,Esup0tT|x3(t)|θC, (4.1)

    where C is a constant that depends only on θ.

    Proof. First, we assume θ1. The first equation of (2.9) can be rewritten as

    x1(t)=EFt[x1(T)+T0((1p(ξ(t)))μ(ξ(t))+α(ξ(t))x2(t)μ(ξ(t))x1(t)β(ξ(t))x1(t)x2(t)u1(t)x1(t))ds].

    Similarly,

    x2(t)=EFt[x2(T)+T0(β(ξ(t))x1(t)x2(t)+(1e)β(ξ(t))x3(t)x2(t)(μ(ξ(t))+α(ξ(t)))x2(t)m(ξ(t))u2(t)x2(t)1+η(ξ(t))x2(t))ds],
    x3(t)=EFt[x3(T)+T0(p(ξ(t))μ(ξ(t))μ(ξ(t))x3(t)(1e)β(ξ(t))x3(t)x2(t)+u1(t)x1(t)+m(ξ(t))u2(t)x2(t)1+η(ξ(t))x2(t))ds],

    where EFt[x] represent the conditional expectation of x with respect to Ft. Using the elementary inequality, we can get

    |m1+m2+m3+m4|n4n(|m1|n+|m2|n+|m3|n+|m4|n),n>0,

    then we get

    |x1(t)|θEFt[xθ1(T)+T0|(1p(ξ(t)))μ(ξ(t)|θ+|α(ξ(t))x2(t)|θ|μ(ξ(t))x1(t)|θ|β(ξ(t))x1(t)x2(t)|θ|u1(t)x1(t)|θ)ds]. (4.2)
    |x2(t)|θEFt[xθ2(T)+T0(|β(ξ(t))x1(t)x2(t)|θ|(1e)β(ξ(t))x3(t)x2(t)|θ|(μ(ξ(t))+α(ξ(t)))x2(t)|θ|m(ξ(t))u2(t)x2(t)1+η(ξ(t))x2(t)|θ)ds], (4.3)
    |x3(t)|θEFt[xθ3(T)+T0(|p(ξ(t))μ(ξ(t))|θ+|u1(t)x1(t)|θ|μ(ξ(t))x3(t)|θ|(1e)β(ξ(t))x3(t)x2(t)|θ+|m(ξ(t))u2(t)x2(t)1+η(ξ(t))x2(t)|θ)ds], (4.4)

    Summing up (4.2), (4.3) and (4.4), we can get

    |x1(t)|θ+|x2(t)|θ+|x3(t)|θCEFt[3i=1xθi(T)+1+T0(|x1(t)|θ+|x2(t)|θ+|x3(t)|θ)ds].

    Let t[Tε,T] with ε=12C, we get

    |x1(t)|θ+12|x2(t)|θ+12|x3(t)|θCEFt[3i=1xθi(T)+1+T0(|x1(t)|θ+|x2(t)|θ+|x3(t)|θ)ds].

    By Gronwall's inequality, we can get that

    Esup0tT |x1(t)|θC, Esup0tT |x2(t)|θC, Esup0tT |x3(t)|θC,

    when 0<θ<1.

    Then, we can get

    Esup0tT |x1(t)|θ(E122θ)1θ2(E(sup0tT|x1(t)|θ)2θ)θ2(Esup0tT |x1(t)|2)θ2C.

    Similarly, we have

    Esup0tT |x2(t)|θC,and Esup0tT |x3(t)|θC,

    The proof is complete.

    Next, we will draw into the adjoint equation [11] as follows:

    {dp1(t)=b1(x(t),u(t),p(t),q(t))dt+q1(t)dB(t),dp2(t)=b2(x(t),u(t),p(t),q(t))dt+q2(t)dB(t),dp3(t)=b3(x(t),u(t),p(t),q(t))dt+q3(t)dB(t),pi(T)=hxi(x(T)), i=1,2,3, (4.5)

    where

    b1(x(t),u(t),p(t),q(t))=((μ(ξ(t))+u1(t))x1(t)+β(ξ(t))x2(t)+μ(ξ(t)))p1(t)+β(ξ(t))x2(t)p2(t)+u1(t)p3(t)σ(ξ(t))x2(t)q1(t)+σ(ξ(t))x2(t)q2(t),b2(x(t),u(t),p(t),q(t))=(α(ξ(t))β(ξ(t))x1(t))p1(t)+(β(ξ(t))x1(t)+(1e)β(ξ(t))x3(t)(μ(ξ(t))+α(ξ(t)))m(ξ(t))u2(t)(1+η(ξ(t))x2(t))2)p2(t)((1e)β(ξ(t))x3(t)m(ξ(t))u2(t)(1+η(ξ(t))x2(t))2)p3(t)σ(ξ(t))x1(t)q1(t)+(σ(ξ(t))x1(t)+(1e)σ(ξ(t))x3(t))q2(t)(1e)σ(ξ(t))x3(t)q3(t),b3(x(t),u(t),p(t),q(t))=(1e)β(ξ(t))x2(t)p2(t)(μ(ξ(t))+(1e)β(ξ(t))x2(t))p3(t)+(1e)σ(ξ(t))x2(t)q2(t)(1e)σ(ξ(t))x2(t)q3(t).

    Lemma 4.2. For any u(t), u(t)Uad, we have

    3i=1Esup0tT|pi(t)|2+3i=1ET0|qi(t)|2dtC, (4.6)

    where C is a constant.

    Proof. Integrating the first equation of both sides (4.5) from t to T, we obtain that

    p1(t)+Ttq1(s) dB(s)=p1(T)+Ttb1(x(s),u(s),p(s),q(s))ds. (4.7)

    Squaring the equation above and making use of the second moments, taking note of x(t)α for all t0, we have

    E|p1(t)|2+ETt|q1(s)|2 dsCE|p1(T)|2+C(Tt)ETt|b1(x(s),u(s),p(s),q(s))|2dsCE(1+|p1(T)|2)+C(Tt)3i=1ETt|pi(s)|2ds+C(Tt)2i=1ETt|qi(s)|2ds. (4.8)

    Similarly,

    E|p2(t)|2+ETt|q2(s)|2 dsCE(1+|p2(T)|2)+C(Tt)3i=1ETt|pi(s)|2ds+C(Tt)2i=1ETt|qi(s)|2ds, (4.9)
    E|p3(t)|2E(1+|p3(T)|2)+C(Tt)ETt|p1(s)|2ds+C(Tt)ETt|p3(s)|2ds+C(Tt)ETt|q3(s)|2ds. (4.10)

    Summing up (4.8), (4.9) and (4.10), we can get

    3i=1E |pi(t)|2+2i=1E Tt |qi(s)|2ds3i=1CE(1+|pi(T)|2)+C(Tt)3i=1ETt|pi(s)|2ds+C(Tt)3i=1ETt|qi(s)|2ds. (4.11)

    If t[Tϵ,T] with ϵ=12C, we have

    3i=1E |pi(t)|2+123i=1E Tt |qi(s)|2ds3i=1CE(1+|pi(T)|2)+C(Tt)3i=1ETt|pi(s)|2ds. (4.12)

    From the above inequality and Gronwall's inequality shows that

    3i=1Esup0tT |pi(t)|2C, 2i=1E Tt |qi(s)|2dsC, for t[Tϵ,T]. (4.13)

    Apply the same way to (4.8), (4.9) and (4.10) in [Tϵ,T], therefore, we see that (4.12) holds for all t[T2ϵ,T] by a finite number of iterations, Eq (4.7) can be recapped as follows:

    p1(t)=p1(T)+Ttb1(x(s),u(s),p(s),q(s))dsT0q1(s) dB(s)+t0 q1(s) dB(s). (4.14)

    According to the above equation, we have

    |p1(t)|2C[1+|p1(T)|2+T0(3i=1|pi(t)|2+2i=1|qi(t)|3)ds+(T0q1(s) dB(s))2+(t0q1(s) dB(s))2. (4.15)

    Furthermore, using the same method in (4.14) yields similar results of the above inequality (4.15), which combines with (4.15) and shows that

    3i=1|pi(t)|2C[1+3i=1|pi(T)|2+T0(3i=1|pi(s)|2+3i=1|qi(s)|2)ds+3i=1(T0qi(s) dB(s))2+3i=1(t0qi(s) dB(s))2. (4.16)

    Taking expectation of equation (4.16) and using Burkholder-Davis-Gundy inequality (see Theorem 1.7.3 [4]), we get

    3i=1Esup0tT|pi(t)|2C(3i=1E|pi(T)|2+3i=1ET0|pi(t)|2ds+3i=1ET0|qi(s)|2 ds). (4.17)

    By Gronwall's inequality in the above inequality to get our result (4.6).

    The proof is complete We define a metric on the admissible control domain Uad[0,T] as follows:

    d(u(t),u(t))=E[mes{t[0;T]:u(t)u(t)}] u(t),u(t)Uad, (4.18)

    where mes represents Lebesgue measure. Since U is closed, it can be shown similar to [7] that Uad is a complete metric space under d.

    Lemma 4.3. (Ekeland's principle) [16]. Let (Q,d) be a complete metric space and F():QR be a lower-semicontinuous and bounded from below. For any ε>0, we assume that uε()Q satisfies

    F(uε())infu()QF(u())+ε.

    Then there is uλ()Q such that for all λ>0 and u()Q,

    F(uλ())F(uε()),d(uλ(),uε())λ,andF(uλ())F(u())+ελd(uλ(),uε()).

    We define the Hamiltonian function [11] H(t,x(t),u(t),p(t),q(t)):[0,T]×R3+×Uad×R3+×R3+R as follows:

    H(t,x(t),u(t),p(t),q(t))=f(x(t),u(t))p(t)+σ(x(t))q(t)+L(x(t),u(t)), (4.19)

    with

    f(x(t),u(t))=(f1(x(t),u(t))f2(x(t),u(t))f3(x(t),u(t))), σ(x(t))=(σ14(x(t))σ24(x(t))σ34(x(t))),

    where fi(i=1,2,3) and σi4(i=1,2,3) are defined in (2.9), and L(x(t),u(t)) is defined in (2.11).

    Theorem 4.1. Suppose (H1),(H2) and (H3) hold. Let (xε(t),uε(t)) be an admissible pair and (pε(t),qε(t)) be the solutions of adjoint equation (4.5) corresponding to (xε(t),uε(t)). Assume H(t,x(t),u(t),p(t),q(t)) is convex, a.s. For any ε>0,

    ET0(u1(t)xε1(t)(pε3(t)pε1(t))+m(ξ(t))u2(t)xε2(t)1+η(ξ(t))xε2(t)(pε3(t)pε2(t))+12(τ1u21(t)τ2u22(t)))dtsupuε(t)Uad[0,T]ET0(uε1(t)xε1(t)(pε3(t)pε1(t))+m(ξ(t))uε2(t)xε2(t)1+η(ξ(t))xε2(t)(pε3(t)pε2(t))+12(τ1u2ε1(t)τ2u2ε2(t)))dtε, (4.20)

    then

    J(0,x0;uε(t))infu(t)Uad[0,T]J(0,x0;u(t))+Cε12.

    Proof. To estimate the term Hu(t)(t,xε(t),uε(t),pε(t),qε(t)), we define a new metric ˜d on Uad: for any ε>0, any u(t), u(t)Uad,

    ˜d(u(t),u(t))=ET0yε(t)|u(t)u(t)|dt, (4.21)

    where

    yε(t)=1+3i=1|pεi(t)|+3i=1|qεi(t)|. (4.22)

    It is easy to find that ˜d is a complete metric as a weighted L1 norm.

    According to Eq (2.11) and the definition of the Hamiltonian function H(t,x(t),u(t),p(t),q(t)), we have

    J(0,x0;uε(t))J(0,x0;u(t))=I1+I2I3, (4.23)

    with

    I1=ET0[H(t,xε(t),uε(t),pε(t),qε(t))H(t,x(t),u(t),pε(t),qε(t))]dt,I2=E[h(xε(T))h(x(T))],I3=ET0[[f(xε(t),uε(t))f(x(t),u(t))]pε(t)+[σ(xε(t))σ(x(t))]qε(t)]dt. (4.24)

    Due to the convexity of H(t,xε(t),uε(t),pε(t),qε(t)), we have

    I13i=1ET0Hxi(t)(t,xε(t),uε(t),pε(t),qε(t))(xεi(t)xi(t))dt+2i=1ET0Hui(t)(t,x(t),u(t),pε(t),qε(t))(uεi(t)ui(t))dt. (4.25)

    Similarly,

    I23i=1E[hxi(t)(xε(T))(xεi(T)xi(T))]. (4.26)

    Now, we define V function:

    V(x(t),p(t),q(t),k)=3i=1pεi(t)(xεi(t)xi(t))+3i=1lnxi(t)+(¯wk+|ˉw|)=V1(x(t),p(t),q(t))+V2(x(t))+V3(k), (4.27)

    where ˉw=(ˉw1,ˉw2,,ˉwN), |ˉw|=ˉw21++ˉw2N and ¯wk(kS) are to be determined later and the reason for |ˉw| being is to make ¯wk+|ˉw| non-negative. Using Itô's formula [4] yields

    LV1(x(t),p(t),q(t))=3i=1Hxi(t)(t,xε(t),uε(t),pε(t),qε(t))(xεi(t)xi(t))+3i=1pεi(t)|fi(xε(t),uε(t))fi(x(t),u(t))|+3i=1qεi(t)|σi4(xε(t))σi4(x(t))|, (4.28)
    LV2(x(t))=(1p(k))μ(k)x1(t)+αx2(t)x1(t)μ(k)β(k)x2(t)u1(t)+β(k)x1(t)+(1e)β(k)x3(t)(μ(k)+α(k))m(k)u2(k)1+η(k)x2(t)+p(k)μ(k)x3(t)+u1(k)x1(t)x3(t)μ(k)(1e)β(k)x2(t)+m(k)u2(k)x2(t)(1+η(k)x2(t))x3(t)12σ2(k)x22(t)+12σ2(k)x21(t)+12(1e)2σ(k)x23(t)12(1e)2σ2(k)x22(t)=K(μ(k)+12σ21(k)+(μ(k)+α(k))+12σ22(k)+(μ(k)+α(k))+12σ23(k)), (4.29)
    LV3(k)=lMαkl¯wl. (4.30)

    We set a vector Ξ=(Ξ1,Ξ2,,ΞN) with

    Ξk=μ(k)+12σ21(k)+(μ(k)+α(k))+12σ22(k)+(μ(k)+α(k))+12σ23(k). (4.31)

    Because of the generator matrix α is irreducible and Lemma 2.3 in [5], for Ξk there exists a solution

    ˉw=(¯w1,¯w2,,¯wN),

    for the following poisson systems:

    αˉwΞk=Nj=1πjΞj.

    Thus, we have

    lMαkl¯wl(μ(k)+12σ21(k)+(μ(k)+α(k))+12σ22(k)+(μ(k)+α(k))+12σ23(k))=lMπk(μ(k)+12σ21(k)+(μ(k)+α(k))+12σ22(k)+(μ(k)+α(k))+12σ23(k))=Π. (4.32)

    From Hypotheses (H4) and (H5), we get that

    LV(x(t),p(t),q(t),k)=LV1(x(t),p(t),q(t))+LV2(x(t))+LV3(k)=Π3i=1Hxi(t)(t,xε(t),uε(t),pε(t),qε(t))(xεi(t)xi(t))+3i=1pεi(t)(fi(xε(t),uε(t))fi(x(t),u(t)))+3i=1qεi(t)(σi4(xε(t))σi4(x(t)))+K3i=1Hxi(t)(t,xε(t),uε(t),pε(t),qε(t))(xεi(t)xi(t))+3i=1pεi(t)(fi(xε(t),uε(t))fi(x(t),u(t)))+3i=1qεi(t)(σi4(xε(t))σi4(x(t))). (4.33)

    Integrating both side of (4.33) from 0 to T and taking expectations, we obtain that

    3i=1E[hxi(t)(xε(T))(xεi(T)xi(T))]=3i=1ET0Hxi(t)(t,xε(t),uε(t),pε(t),qε(t))(xεi(t)xi(t))ds+3i=1ET0pεi(t)|fi(xε(t),uε(t))fi(x(t),u(t))|ds+3i=1ET0qεi(t)|σi4(xε(t))σi4(x(t))|ds.

    Hence,

    I23i=1E[hxi(t)(xε(T))(xεi(T)xi(T))]+3i=1ET0Hxi(t)(t,xε(t),uε(t),pε(t),qε(t))(xεi(t)xi(t))ds. (4.34)

    Substitute (4.25), and (4.34) into (4.24), we have

    J(0,x0;uε(t))J(0,x0;u(t))2i=1ET0τuεi(t)(uεi(t)ui(t))dt. (4.35)

    According to the definition of Hamiltonian function (4.19), we have

    ET0H(t,xε(t),u(t),pε(t),qε(t))dtsupuε(t)Uad[0,T]ET0H(t,xε(t),uε(t),pε(t),qε(t))dtε. (4.36)

    Define a function F():UadR

    F(u(t))=ET0H(t,xε(t),u(t),pε(t),qε(t))dt. (4.37)

    By means of Hypothesis (H2) and the definition of L, we learn that F() is continuous on Uad concerning the metric ˜d. Hence, from (4.36) and Lemma 4.3, if exists a ˜uε(t)Uad, then

    ˜d(uε(t),˜uε(t))ε12, and F(˜uε(t))F(u(t))+ε12˜d(u(t),˜uε(t)), u(t)Uad. (4.38)

    This shows that

    H(t,xε(t),˜uε(t),pε(t),qε(t))=minu(t)Uad[H(t,xε(t),u(t),pε(t),qε(t))+ε12yε(t)|u(t)˜uε(t)|]. (4.39)

    Using Lemma 4.3 in [16], we can get

    0u(t)H(t,xε(t),˜uε(t),pε(t),qε(t))u(t)H(t,xε(t),˜uε(t),pε(t),qε(t))+[ε12yε(t),ε12yε(t)]. (4.40)

    Since the Hamiltonian function H is differentiable in u(t) with regard to Hypothesis (H2), (4.40) shows that if exists a λε1(t)[ε12yε(t),ε12yε(t)], then

    2i=1τuεi(t)+λε1(t)=0. (4.41)

    Consequently, from (4.41) and Hypothesis (H2) and the definition of L, we get

    |Hu(t)(t,xε(t),uε(t),pε(t),qε(t))||Hu(t)(t,xε(t),uε(t),pε(t),qε(t))Hu(t)(t,xε(t),˜uε(t),pε(t),qε(t))|+|Hu(t)(t,xε(t),˜uε(t),pε(t),qε(t))|Cyε(t)|uε(t)˜uε(t)|+λε1(t)Cyε(t)|uε(t)˜uε(t)|+2ε12yε(t). (4.42)

    From the definition of ˜d of Lemma 4.2, we can obtain the conclusion according to (4.23), (4.42) and Holder's inequality.

    In the above sections, we have give the sufficient and necessary conditions of the near-optimality control of SIV epidemic model. Our next goal is to illustrate the theoretical results through the numerical solution. In the following, we will give some figures to show the results.

    Applying Milstein's method referred to [25], we have the corresponding diffuse equation of state equation (2.9) and adjoint equation (4.5) as follows:

    {Si+1=Si+[((1p(ξ(t)))μ(ξ(t))+α(ξ(t))Iiμ(ξ(t))Siβ(ξ(t))SiIiu1(t)Si)]Δtσ(ξ(t))SiIiΔtζi12σ2SiIi(ζ2i1)Δt,Ii+1=Ii+[β(ξ(t))SiIi+(1e)β(ξ(t))ViIi(μ(ξ(t))+α(ξ(t)))Iim(ξ(t))u2(t)Ii1+η(ξ(t))Ii]Δt+σ(ξ(t))SiIiΔtζi+12σ2SiIi(ζ21)Δt+(1e)σ(ξ(t))ViIiΔtζi+12σ2(ξ(t))ViIi(ζ21)Δt,Vi+1=Vi+[p(ξ(t))μ(ξ(t))μ(ξ(t))Vi(1e)β(ξ(t))ViIi+u1(t)Si+m(ξ(t))u2(t)Ii1+η(ξ(t))Ii]Δt(1e)σViIiΔtζi12(1e)2σ2ViIi(ζ2i1)Δt, (5.1)
    {p1i=p1i+1[((μ(ξ(t))+u1(t))Si+1+β(ξ(t))Ii+1)p1i+1+β(ξ(t))Ii+1p2i+1+u1(t)p3i+1σ(ξ(t))Ii+1q1i+1+σ(ξ(t))Ii+1q2i+1]Δtq1i+1Δtζi+1q21i+12(ζ2i+11)Δt,p2i=p2i+1[(α(ξ(t))β(ξ(t))Si+1)p1i+1+(β(ξ(t))Si+1+(1e)β(ξ(t))Vi+1(μ(ξ(t))+α(ξ(t)))m(ξ(t))u2(t)(1+η(ξ(t))x2(t))2)p2i+1((1e)β(ξ(t))Vi+1m(ξ(t))u2(t)(1+η(ξ(t))x2(t))2)p3i+1σ(ξ(t))Si+1q1i+1+(σ(ξ(t))Si+1+(1e)σ(ξ(t))Vi+1)q2i+1(1e)σ(ξ(t))Vi+1q3i+1]Δtq2i+1Δtζi+1q22i+12(ζ2i+11)Δt,p3i=p3i+1+[(1e)β(ξ(t))Ii+1p2i+1(μ(ξ(t))+(1e)β(ξ(t))Ii+1)p3i+1+(1e)σ(ξ(t))Ii+1q2i+1(1e)σ(ξ(t))Ii+1q3i+1]Δt. (5.2)

    where ζ2i(i=1,2,...) are not interdependent Gaussian random variables N(0,1). At below, we will present numerical simulation of the SIV model, let us assume that the Markov chain ξ(t) is on the state space S={1,2} with the generator α=(2277) and the following setting:

    When ξ(t)=1,

    p(1)=0.5,b(1)=4.0,β(1)=0.02,μ(1)=0.04,η(1)=1.03,m(1)=0.01,α(1)=0.001,α(1)=0.8,σ=0.035;

    When ξ(t)=2,

    p(2)=0.6,b(2)=5.0,β(2)=0.04,μ(2)=0.05,η(2)=1.05,m(2)=0.02,α(2)=0.002,α(2)=0.9,σ=0.036.

    We compare the results of calculations with and without control. In Figure 2, the three solution curves represent susceptible, infected and vaccinated individuals at different intervals of time. As we can see that with the change of time, the susceptible people with control drops faster than that without control. And the number of infected individuals with optimal vaccination and treatment control drops faster than that without control. The application of vaccination and treatment control give rise to the number of individuals vaccinated.

    Figure 2.  The path of S(t), I(t) and V(t) for the stochastic SIV model (2.9) with initial (S0,I0,V0)=(0.2,1.0,0.1).

    As it is indicated in Figure 3 that all of p1,p2, and p3 tend to reach zero at last, which shows a minimum value of cost function.

    Figure 3.  The path of adjoint variables p1,p2, and p3 with respect to control parameters.

    In this paper, we study the near-optimal control for stochastic SIV epidemic model with vaccination and saturated treatment using Markovian switching. We obtain the sufficient and necessary conditions for near-optimality. According to the Hamiltonian function to approximate the cost function, we reached the estimate of the error boundary of near-optimality. On the basis of the proposed and relative sections, it is advised tom take immediate effective measures to control the spread of epidemic diseases as this has great influence on infectious diseases. An illustrative numerical simulations example is presented to interpret the influence of vaccination and treatment control on dynamic behavior. Vaccination is another effective way to prevent individuals from getting infected and can be also incorporated into the optimal control problem. Some interesting questions deserve further investigation. It is worth studying more realistic but complex models, such as Lévy noise and time delays [21]. We leave this for further consideration.

    The research is supported by the Natural Science Foundation of China (Grant numbers 11661064).

    The authors declare there is no conflict of interest.



    [1] N. W. Nirwan, H. B. Ramani, Condition monitoring and fault detection in roller bearing used in rolling mill by acoustic emission and vibration analysis, Mater. Today Proc., 51 (2022), 344–354. https://doi.org/10.1016/j.matpr.2021.05.447 doi: 10.1016/j.matpr.2021.05.447
    [2] S. Rajabi, M. S. Azari, S. Santini, F. Flammini, Fault diagnosis in industrial rotating equipment based on permutation entropy, signal processing and multi-output neuro-fuzzy classifier, Expert Syst. Appl., 206 (2022), 117754. https://doi.org/10.1016/j.eswa.2022.117754 doi: 10.1016/j.eswa.2022.117754
    [3] E. A. Burda, G. V. Zusman, I. S. Kudryavtseva, A. P. Naumenko, An overview of vibration analysis techniques for the fault diagnostics of rolling bearings in machinery, Shock Vib., 2022 (2022). https://doi.org/10.1155/2022/6136231 doi: 10.1155/2022/6136231
    [4] J. Gu, Y. Peng, H. Lu, X. Chang, G. Chen, A novel fault diagnosis method of rotating machinery via VMD, CWT and improved CNN, Measurement, 200 (2022), 111635. https://doi.org/10.1016/j.measurement.2022.111635 doi: 10.1016/j.measurement.2022.111635
    [5] J. Pacheco-Chérrez, J. A. Fortoul-Díaz, F. Cortés-Santacruz, L. M. Aloso-Valerdi, D. I. Ibarra-Zarate, Bearing fault detection with vibration and acoustic signals: Comparison among different machine leaning classification methods, Eng. Fail. Anal., 139 (2022), 106515. https://doi.org/10.1016/j.engfailanal.2022.106515 doi: 10.1016/j.engfailanal.2022.106515
    [6] K. Berg-Sørensen, H. Flyvbjerg, Power spectrum analysis for optical tweezers, Rev. Sci. Instrum., 75 (2004), 594–612. https://doi.org/10.1063/1.1645654 doi: 10.1063/1.1645654
    [7] R. B. Randall, A history of cepstrum analysis and its application to mechanical problems, Mech. Syst. Signal Process., 97 (2017), 3–19. https://doi.org/10.1016/j.ymssp.2016.12.026 doi: 10.1016/j.ymssp.2016.12.026
    [8] A. R. Al-Obaidi, H. J. Towsyfyan, An experimental study on vibration signatures for detecting incipient cavitation in centrifugal pumps based on envelope spectrum analysis, J. Appl. Fluid Mech., 12 (2019), 2057–2067. https://doi.org/10.29252/JAFM.12.06.29901 doi: 10.29252/JAFM.12.06.29901
    [9] N. Peifeng, Z. Jun, Z. Gang, Study on application of wavelet transform technique to turbine generator fault diagnosis, Chin. J. Sci. Instrum., 28 (2007), 188. https://doi.org/10.19650/j.cnki.cjsi.2007.01.039 doi: 10.19650/j.cnki.cjsi.2007.01.039
    [10] P. Konar, P. Chattopadhyay, Bearing fault detection of induction motor using wavelet and support vector machines (SVMs), Appl. Soft Comput., 11 (2011), 4203–4211. https://doi.org/10.1016/j.asoc.2011.03.014 doi: 10.1016/j.asoc.2011.03.014
    [11] N. E. Huang, Z. Shen, S. R. Long, M. C. Wu, H. H. Shih, Q. Zheng, et al., The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysis, Proc. R. Soc. London, 454 (1998), 903–995. https://doi.org/10.1098/rspa.1998.0193 doi: 10.1098/rspa.1998.0193
    [12] C. Song, S. Liu, G. Han, P. Zeng, H. Yu, Q. Zheng, Edge-intelligence-based condition monitoring of beam pumping units under heavy noise in industrial internet of things for industry 4.0, IEEE Int. Things J., 10 (2023), 3037–3046. https://doi.org/10.1109/JIOT.2022.3141382 doi: 10.1109/JIOT.2022.3141382
    [13] S. Liu, C. Song, T. Wu, P. Zeng, A lightweight fault diagnosis method of beam pumping units based on dynamic warping matching and parallel deep network, IEEE Trans. Syst., Man, Cybern., 54 (2023), 1622–1632. https://doi.org/10.1109/TSMC.2023.3328731 doi: 10.1109/TSMC.2023.3328731
    [14] Q. Cui, Z. Li, J. Yang, B. Liang, Rolling bearing fault prognosis using recurrent neural network, in 2017 29th Chinese Control And Decision Conference (CCDC), (2017), 1196–1201. https://doi.org/10.1109/CCDC.2017.7978700
    [15] L. Yu, J. Qu, F. Gao, Y. Tian, A novel hierarchical algorithm for bearing fault diagnosis based on stacked LSTM, Shock Vib., 2019 (2019). https://doi.org/10.1155/2019/2756284 doi: 10.1155/2019/2756284
    [16] C. Song, P. Zeng, Z. Wang, T. Li, L. Qiao, L. Shen, Image forgery detection based on motion blur estimated using convolutional neural network, IEEE Sens. J., 19 (2019), 11601–11611. https://doi.org/10.1109/JSEN.2019.2928480 doi: 10.1109/JSEN.2019.2928480
    [17] M. Ye, X. Yan, D. Jiang, L. Xiang, N. Chen, MIFDELN: A multi-sensor information fusion deep ensemble learning network for diagnosing bearing faults in noisy scenarios, Knowl.-Based Syst., 284 (2024), 111294. https://doi.org/10.1016/j.knosys.2023.111294 doi: 10.1016/j.knosys.2023.111294
    [18] X. Yan, W. J. Yan, Y. Xu, K. V. Yuen, Machinery multi-sensor fault diagnosis based on adaptive multivariate feature mode decomposition and multi-attention fusion residual convolutional neural network, Mech. Syst. Signal Process., 202, (2023), 110664. https://doi.org/10.1016/j.ymssp.2023.11066 doi: 10.1016/j.ymssp.2023.11066
    [19] X. Yan, D. She, Y. Xu, Deep order-wavelet convolutional variational autoencoder for fault identification of rolling bearing under fluctuating speed conditions, Expert Syst. Appl., 216 (2023), 119479. https://doi.org/10.1016/j.eswa.2022.119479 doi: 10.1016/j.eswa.2022.119479
    [20] H. Liu, H. Zhao, J. Wang, S. Yuan, W. Feng, LSTM-GAN-AE: A promising approach for fault diagnosis in machine health monitoring, IEEE Trans. Instrum. Meas., 71 (2021), 1–13. https://doi.org/10.1109/TIM.2021.3135328 doi: 10.1109/TIM.2021.3135328
    [21] J. Yang, J. Liu, J. Xie, C. Wang, T. Ding, Conditional GAN and 2-D CNN for bearing fault diagnosis with small samples, IEEE Trans. Instrum. Meas., 70 (2021), 1–12. https://doi.org/10.1109/TIM.2021.3119135 doi: 10.1109/TIM.2021.3119135
    [22] G. Yang, C. Song, Z. Yang, S. Cui, Bubble detection in photoresist with small samples based on GAN augmentations and modified YOLO, Eng. Appl. Artif. Intell., 123 (2023), 106224. https://doi.org/10.1016/j.engappai.2023.106224 doi: 10.1016/j.engappai.2023.106224
    [23] C. Song, W. Xu, Z. Wang, S. Yu, Z. Ju, Analysis on the impact of data augmentation on target recognition for UAV-based transmission line inspection, Complexity, 2020 (2020). https://doi.org/10.1155/2020/3107450 doi: 10.1155/2020/3107450
    [24] O. Bohdal, Y. Tian, Y. Zong, R. Chavhan, D. Li, H. Gouk, et al., Meta omnium: A benchmark for general-purpose learning-to-learn, in 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), (2023), 7693–7703. https://doi.org/10.1109/CVPR52729.2023.00743
    [25] K. Song, J. Han, G. Cheng, J. Lu, F. Nie, Adaptive neighborhood metric learning, IEEE Trans. Pattern Anal. Mach. Intell., 44 (2022), 4591-4604. https://doi.org/10.1109/TPAMI.2021.3073587 doi: 10.1109/TPAMI.2021.3073587
    [26] Z. Wu, H. Jiang, K. Zhao, X. Li, An adaptive deep transfer learning method for bearing fault diagnosis, Measurement, 151 (2020), 107227. https://doi.org/10.1016/j.measurement.2019.107227 doi: 10.1016/j.measurement.2019.107227
    [27] J. Zhu, N. Chen, C. Shen, A new deep transfer learning method for bearing fault diagnosis under different working conditions, IEEE Sens. J., 20 (2019), 8394–8402. https://doi.org/10.1109/jsen.2019.2936932 doi: 10.1109/jsen.2019.2936932
    [28] B. Yang, Y. Lei, F. Jia, S. Xing, An intelligent fault diagnosis approach based on transfer learning from laboratory bearings to locomotive bearings, Mech. Syst. Signal Process., 122 (2019), 692–706. https://doi.org/10.1016/j.ymssp.2018.12.051 doi: 10.1016/j.ymssp.2018.12.051
    [29] X. Li, Y. Hu, M. Li, J. Zheng, Fault diagnostics between different type of components: A transfer learning approach, Appl. Soft Comput., 86, (2020), 105950. https://doi.org/10.1016/j.asoc.2019.105950 Get rights and content
    [30] Y. F. Li, M. Zuo, K. Feng, Y. J. Chen, Detection of bearing faults using a novel adaptive morphological update lifting wavelet, Chin. J. Mech. Eng., 30 (2017), 1305–1313. https://doi.org/10.1007/s10033-017-0186-1 doi: 10.1007/s10033-017-0186-1
    [31] Q. Fu, B. Jing, P. He, S. Si, Y. Wang, Fault feature selection and diagnosis of rolling bearings based on EEMD and optimized Elman_AdaBoost algorithm, IEEE Sens. J., 18 (2018), 5024–5034. https://doi.org/10.1109/JSEN.2018.2830109 doi: 10.1109/JSEN.2018.2830109
    [32] J. Zheng, S. Huang, H. Pan, J. Tong, C. Wang, Q. Liu, Adaptive power spectrum Fourier decomposition method with application in fault diagnosis for rolling bearing, Measurement, 183 (2021), 109837. https://doi.org/10.1016/j.measurement.2021.109837 doi: 10.1016/j.measurement.2021.109837
    [33] K. Feng, Q. Ni, M. Beer, H. Du, C. Li, A novel similarity-based status characterization methodology for gear surface wear propagation monitoring, Tribol. Int., 174 (2022), 107765.
    [34] K. Feng, J. C. Ji, Y. Zhang, Q. Ni, Z. Liu, M. Beer, Digital twin-driven intelligent assessment of gear surface degradation, Mech. Syst. Signal Process., 186 (2023), 109896. https://doi.org/10.1016/j.ymssp.2022.109896 doi: 10.1016/j.ymssp.2022.109896
    [35] Q. Ni, J. C. Ji, B. Halkon, K. Feng, A. K. Nandi, Physics-informed pesidual network (PIResNet) for rolling element bearing fault diagnostics, Mech. Syst. Signal Process., 200 (2023), 110544. https://doi.org/10.1016/j.ymssp.2023.110544 doi: 10.1016/j.ymssp.2023.110544
    [36] D. Peng, Z. Liu, H. Wang, Y. Qin, L. Jia, A novel deeper one-dimensional CNN with residual learning for fault diagnosis of wheelset bearings in high-speed trains, IEEE Access, 7 (2018), 10278–10293. https://doi.org/10.1109/ACCESS.2018.2888842 doi: 10.1109/ACCESS.2018.2888842
    [37] X. Peng, B. Zhang, D. Gao, Research on fault diagnosis method of rolling bearing based on 2DCNN, in 2020 Chinese Control And Decision Conference (CCDC), (2020), 693–697. https://doi.org/10.26914/c.cnkihy.2020.033919
    [38] D. Wang, Q. Guo, Y. Song, S. Gao, Y. Li, Application of multiscale learning neural network based on CNN in bearing fault diagnosis, J. Signal Process. Syst., 91 (2019), 1205–1217. https://doi.org/10.1007/s11265-019-01461-w doi: 10.1007/s11265-019-01461-w
    [39] A. Khorram, M. Khalooei, M. Rezghi, End-to-end CNN+ LSTM deep learning approach for bearing fault diagnosis, Appl. Intell., 51 (2021), 736–751. https://doi.org/10.1007/s10489-020-01859-1 doi: 10.1007/s10489-020-01859-1
    [40] W. Zhang, G. Peng, C. Li, Y. Chen, Z. Zhang, A new deep learning model for fault diagnosis with good anti-noise and domain adaptation ability on raw vibration signals, Sensors, 17, (2017), 425. https://doi.org/10.3390/s17020425 doi: 10.3390/s17020425
    [41] A. Zhang, S. Li, Y. Cui, W. Yang, R. Dong, J. Hu, Limited data rolling bearing fault diagnosis with few-shot learning, IEEE Access, 7 (2019), 110895–110904. https://doi.org/10.1109/ACCESS.2019.2934233 doi: 10.1109/ACCESS.2019.2934233
  • This article has been cited by:

    1. R.V. Bobryk, Stability analysis of a SIR epidemic model with random parametric perturbations, 2021, 143, 09600779, 110552, 10.1016/j.chaos.2020.110552
    2. Zong Wang, Qimin Zhang, Optimal vaccination strategy for a mean-field stochastic susceptible-infected-vaccinated system, 2023, 16, 1793-5245, 10.1142/S1793524522500619
    3. Songnan Liu, Zhangyi Dong, Xiaojie Xu, Dynamics of a stochastic staged progression model of HIV transmission with a hybrid switch, 2022, 15, 1793-5245, 10.1142/S1793524521500820
    4. Ryoto Himo, Masaki Ogura, Naoki Wakamiya, Iterative shepherding control for agents with heterogeneous responsivity, 2022, 19, 1551-0018, 3509, 10.3934/mbe.2022162
    5. Zong Wang, Qimin Zhang, Positivity-Preserving Numerical Method and Relaxed Control for Stochastic Susceptible–Infected–Vaccinated Epidemic Model with Markov Switching, 2023, 30, 1557-8666, 695, 10.1089/cmb.2022.0388
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

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

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

Metrics

Article views(1829) PDF downloads(174) Cited by(1)

Figures and Tables

Figures(9)  /  Tables(6)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog