Next Article in Journal
Study of the Water Build-Up Effect Formation in Upcast Shafts
Previous Article in Journal
On the Borderline of Fields and Hyperfields
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Predefined-Time (PDT) Synchronization of Impulsive Fuzzy BAM Neural Networks with Stochastic Perturbations

by
Rouzimaimaiti Mahemuti
1,† and
Abdujelil Abdurahman
2,*,†
1
School of Information Technology and Engineering, Guangzhou College of Commerce, Guangzhou 511363, China
2
Guangzhou Huayi Electronic Technology Co., Ltd., Guangzhou 511400, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2023, 11(6), 1291; https://doi.org/10.3390/math11061291
Submission received: 9 February 2023 / Revised: 5 March 2023 / Accepted: 6 March 2023 / Published: 7 March 2023

Abstract

:
This paper focuses on the predefined-time (PDT) synchronization issue of impulsive fuzzy bidirectional associative memory neural networks with stochastic perturbations. Firstly, useful definitions and lemmas are introduced to define the PDT synchronization of the considered system. Next, a novel controller with a discontinuous sign function is designed to ensure the synchronization error converges to zero in the preassigned time. However, the sign function may cause the chattering effect, leading to undesirable results such as the performance degradation of synchronization. Hence, we designed a second novel controller to eliminate this chattering effect. After that, we obtained some sufficient conditions to guarantee the PDT synchronization of the drive–response systems by using the Lyapunov function method. Finally, three numerical simulations are provided to evaluate the validity of the theoretical results.

1. Introduction

Since bidirectional associative memory (BAM) neural network was first introduced by Kosko in 1987 [1,2], it has been widely studied due to its applicability in many fields, such as pattern recognition [3], computer-assisted learning in chemistry [4], signal processing [5], image processing [6], and other areas. Thus, it is necessary to research the stability and synchronization of chaotic nonlinear systems for their significant role in the above mentioned fields [7,8]. As shown in Figure 1, it is easy to see that, BAM neural networks are constructed by two layers of interconnected neurons [3], and this kind of structure means that BAM neural networks possess hyper-chaotic attractors.In the last decade, many studies have been conducted on the dynamical behavior analysis of BAM neural networks with or without fuzzy logic, with or without stochastic perturbations, and with or without impulse. For instance, Cao et al. studied the global asymptotic stability of delayed BAM neural networks by using the Lyapunov method [9]. In [10], the authors investigated the synchronization of memristor-based BAM neural networks by using the linear matrix inequality technique. In [11], the authors investigated the general decay synchronization of time-delayed BAM neural networks by designing a nonlinear feedback controller. However, most of the works are about infinite-time synchronization. Recently, scholars found that the convergence time of synchronization is an important issue because of its applicability in the field of engineering [12]. The finite-time (FNT) synchronization error can converge to zero in finite time. Furthermore, FNT synchronization has a faster convergence rate than infinite-time synchronization [13,14,15]. Polyakov, in [16], introduced fixed-time (FXT) synchronization in order to resolve the issue of the settling time (ST) of FNT extensively relying on initial values. A number of research works on FXT synchronization have been published in recent years [17,18]. There is no doubt that FXT synchronization has its drawbacks as well as merits, such as its ST still being relevant to the system parameters, and that the convergence time cannot be predicted in advance. Hence, it is a necessary task to analyze whether a nonlinear system can reach complete synchronization within a predefined-time (PDT). This has led to the development of a novel synchronization technique called PDT synchronization. The importance of this synchronization method lies in the fact that its ST can be determined according to needs. Recent studies have investigated this challenging research topic [19,20,21].
In many dynamical systems, fuzziness often is inevitable. Thus, the study of fuzziness in neural networks has attracted great interest over recent years. Yang et al. combined fuzzy logic with cellular networks (CNNs), and introduced fuzzy cellular networks (FCNNs) [22,23]. The construction of fuzzy min-max networks is shown in Figure 1, and for specific information refer to [24]. In [25], the authors introduced decentralized event-triggering control for the finite-time boundedness of FCNNs during a cyber-attack. FCNNs can be applied in pattern recognition and image processing techniques [26,27]. Synchronization is the most significant dynamic behavior of neural networks. Thus, there are many works that explore the synchronization of FCNNs [28,29,30,31]. For example, in [28], the authors investigated the robust synchronization of a chaotic system under fuzzy controllers. Finite-time synchronization for TS fuzzy complex dynamical networks has been considered in [30]. Duan et al. investigated the FXT synchronization neural-type BAM memristive-inertial neural networks with fuzzy logic [31].
In addition, the synchronization of neural networks with stochastic perturbations has recently attracted interest in the research community, mainly because many systems are unavoidably affected by noise and stochastic disturbance [32]. In recent years, scholars have conducted much research on the synchronization of stochastic BAM neural networks with or without fuzziness, and with or without the destabilizing impulse [19,20,33,34,35]. For example, in [20,34,35], the authors investigated FNT synchronization and FXT/PDT synchronization, respectively, for stochastic BAM neural networks and obtained novel results. In [20], the authors successfully combined the destabilizing impulse with stochastic perturbations, and obtained an ST estimation for a general impulsive system.
In [21], the authors considered the FXT/PDT stability of fuzzy neural networks with stochastic perturbations. However, the research on impulsive fuzzy BAM neural networks with stochastic perturbations is scarce. Motivated by the observations outlined above, in this paper, we consider the PDT synchronization of stochastic fuzzy impulsive BAM neural networks. The main contributions of this paper are as follows: Firstly, this is the first study to consider the PDT synchronization of BAM neural networks with stochastic perturbations, fuzzy logic and impulsive effects. Secondly, some simple PDT synchronization criteria for BAM neural networks with stochastic perturbations, fuzzy logic and general impulsive effects are designed with novel controllers. Thirdly, PDT synchronization is independent of the parameter sets and initial conditions.
We have organized the rest of this paper as follows. In the second section, some useful definitions, lemmas and the details of the considered systems will be introduced. They are important for proving the main results in the following section. In the third section, we present the design for novel controllers with and without a discontinuous sign function for the PDT synchronization of impulsive fuzzy BAM neural networks with stochastic perturbations. In the fourth section, we provide three examples to evaluate the effectiveness of the theoretical results of this paper. In the final section, we summarize this paper by providing a brief conclusion.

2. System Description and Preliminary Knowledge

Here, we consider the following fuzzy impulsive BAM neural networks with stochastic perturbations,
d x i ( t ) = [ a i x i ( t ) + j = 1 m b i j h j ( y j ( t ) ) + j = 1 m T i j ν j + j = 1 m α i j h j ( y j ( t ) ) + j = 1 m S i j ν j + j = 1 m β i j h j ( y j ( t ) ) + I i ] d t + ϱ i ( t , x i ( t ) ) d ω ( t ) , t t τ , d y j ( t ) = [ a ¯ j y j ( t ) + i = 1 n b ¯ j i g i ( x i ( t ) ) + i = 1 n T j i ν ¯ i + i = 1 n α ¯ j i g i ( x i ( t ) ) + i = 1 n S j i ν ¯ i + i = 1 n β ¯ j i g i ( x i ( t ) ) + J j ] d t + ϱ ¯ j ( t , y j ( t ) ) d ω ( t ) , t t τ , Δ x i ( t τ ) = x i ( t τ + ) x i ( t τ ) = ( ξ i 1 ) x i ( t τ ) , Δ y j ( t τ ) = y j ( t τ + ) y j ( t τ ) = ( ζ j 1 ) y j ( t τ ) ,
where τ N , i I { 1 , 2 , , n } , j J { 1 , 2 , , m } , and n and m are the number of neurons of the neural fields X U and Y U , respectively. x i ( t ) R and y j ( t ) R correspond to the state variables of the ith neuron of X U and jth neuron of Y U at time t, respectively. Positive constants a i and a ¯ j stand for the self-inhibition rate of the ith neuron of X U and jth neuron of Y U , respectively. Constants b i j and b ¯ j i represent the synaptic connection weights. ⋁ and ⋀ are the fuzzy OR and AND operations, respectively. α i j and α ¯ i j , β i j and β ¯ i j denote the fuzzy feedback MIN and MAX template, respectively. T i j and S i j represent the elements of the fuzzy feed-forward MIN and MAX template, respectively. I i and J J , ν ¯ i and ν j are the bias and input of the ith neuron of X U and jth neuron of Y U , respectively. h j ( · ) and g i ( · ) correspond to neuron activation functions. ϱ i ( t , · ) : R + × R R and ϱ ¯ j ( t , · ) : R + × R R represent the noise intensity functions. ω ( t ) is a one dimensional Brownian motion provided on a complete probability space ( Ω , F , P ) with a natural filtration { F t } t 0 generated by ω ( t ) . ξ i and ζ j are positive constants. x i ( t τ ) x i ( t τ ) and y j ( t τ ) y j ( t τ ) as t t τ 0 , x i ( t τ + ) = lim t t τ + 0 x i ( t ) , y i ( t τ + ) = lim t t τ + 0 y i ( t ) , for all τ N , stand for the jumps at the impulse moment t τ , and { t τ , τ = 1 , 2 , } is a strictly increasing sequence such that lim τ + t τ = + . The initial conditions of system (1) are as follows:
x i ( 0 ) = x i 0 , i I , y j ( 0 ) = y j 0 , j J .
Throughout the paper, we assume that
Assumption 1.
For any i I , j J , the neuron activation functions h j ( · ) and g i ( · ) satisfy the Lipschitz condition; that is, for all μ 1 , μ 2 R , there exist positive constants L j h and L i g such that
| h j ( μ 1 ) h j ( μ 2 ) | L j h | μ 1 μ 2 | , | g i ( μ 1 ) g i ( μ 2 ) | L i g | μ 1 μ 2 | .
Assumption 2.
For any i I , j J , the noise intensity functions ϱ i ( t , · ) , and ϱ ¯ j ( t , · ) satisfy following inequalities for all μ 1 , μ 2 R ,
[ ϱ i ( t , μ 1 ) ϱ i ( t , μ 2 ) ] [ ϱ i ( t , μ 1 ) ϱ i ( t , μ 2 ) ] η i ( μ 1 μ 2 ) 2 , [ ϱ ¯ j ( t , μ 1 ) ϱ ¯ j ( t , μ 2 ) ] [ ϱ ¯ j ( t , μ 1 ) ϱ ¯ j ( t , μ 2 ) ] η ¯ j ( μ 1 μ 2 ) 2 ,
where η i and η ¯ j are positive constants.
The response system of the drive system (1) is obtained as follows:
d x ˜ i ( t ) = [ a i x ˜ i ( t ) + j = 1 m b i j h j ( y ˜ j ( t ) ) + j = 1 m T i j ν j + j = 1 m α i j h j ( y ˜ j ( t ) ) + j = 1 m S i j ν j + j = 1 m β i j h j ( y ˜ j ( t ) ) + I i + u i ( t ) ] d t + ϱ i ( t , x ˜ i ( t ) ) d ω ( t ) , t t τ , d y ˜ j ( t ) = [ a ¯ j y ˜ j ( t ) + i = 1 n b ¯ j i g i ( x ˜ i ( t ) ) + i = 1 n T j i ν ¯ i + i = 1 n α ¯ j i g i ( x ˜ i ( t ) ) + i = 1 n S j i ν ¯ i + i = 1 n β ¯ j i g i ( x ˜ i ( t ) ) + J j + v j ( t ) ] d t + ϱ ¯ j ( t , y ˜ j ( t ) ) d ω ( t ) , t t τ , Δ x ˜ i ( t τ ) = x ˜ i ( t τ + ) x ˜ i ( t τ ) = ( ξ i 1 ) x ˜ i ( t τ ) , Δ y ˜ j ( t τ ) = y ˜ j ( t τ + ) y ˜ j ( t τ ) = ( ζ j 1 ) y ˜ j ( t τ ) ,
where x ˜ i ( t ) R and y ˜ j ( t ) R are the state variables of the system (2). u i ( t ) and v j ( t ) denote the controllers, which will be designed in the next section, where i I , j J . The initial conditions of the system (2) are as follows:
x ˜ i ( 0 ) = x ˜ i 0 , i I , y ˜ j ( 0 ) = y ˜ j 0 , j J .
Let e i ( t ) = x ˜ i ( t ) x i ( t ) and z j ( t ) = y ˜ j ( t ) y j ( t ) , then the error system between (1) and (2) can be written as follows:
d e i ( t ) = [ a i e i ( t ) + j = 1 m b i j h ˜ j ( z j ( t ) ) + j = 1 m α i j h ˜ j ( z j ( t ) ) + j = 1 m β i j h ˜ j ( z j ( t ) ) + u i ( t ) ] d t + σ i ( t , e i ( t ) ) d ω ( t ) , t t τ , d z j ( t ) = [ a ¯ j z j ( t ) + i = 1 n b ¯ j i g ˜ i ( e i ( t ) ) + i = 1 n α ¯ j i g ˜ i ( e i ( t ) ) + i = 1 n β ¯ j i g ˜ i ( e i ( t ) ) + v j ( t ) ] d t + σ ¯ j ( t , z j ( t ) ) d ω ( t ) , t t τ , Δ e i ( t τ ) = e i ( t τ + ) e i ( t τ ) = ( ξ i 1 ) e i ( t τ ) , Δ z j ( t τ ) = z j ( t τ + ) z j ( t τ ) = ( ζ j 1 ) z j ( t τ ) ,
where
h ˜ j ( z j ( t ) ) = h j ( y ˜ j ( t ) h j ( y j ( t ) ) , g ˜ i ( e i ( t ) ) = g i ( x ˜ i ( t ) g i ( x i ( t ) ) , σ i ( t , e i ( t ) ) = ϱ i ( t , x ˜ i ( t ) ) ϱ i ( t , x i ( t ) ) , σ ¯ j ( t , z j ( t ) ) = ϱ ¯ j ( t , y ˜ j ( t ) ) ϱ ¯ j ( t , y j ( t ) ) ,
for i I , j J .
Consider the following stochastic nonlinear impulsive system
d ϕ ( t ) = Θ ( t , ϕ ( t ) ) d t + σ ( t , ϕ ( t ) ) d ω ( t ) , ϕ ( 0 ) = ϕ 0 , t t τ , Δ ϕ | t = t τ = Λ ( t τ , ϕ ( t τ ) ) , t τ N ,
where Λ : R + × R n = R n is a locally Lipschitzian continuous function with Λ ( t , 0 ) = 0 . ω ( t ) R indicates the Brownian motion. Θ ( · ) : R + × R n R n and σ ( · ) : R + × R n R n are the continuous functions provided in advance that satisfy f ( 0 ) = 0 and σ ( 0 ) = 0 . ϕ ( t ) R n is the state vector of the system.
Definition 1.
([36]) Assume that there exist positive constants N 0 and ν τ such that
t 2 t 1 ν τ N 0 N κ ( t 1 , t 2 ) t 2 t 1 ν τ + N 0 ,
where N κ ( t 1 , t 2 ) corresponds to the number of impulsive moments in the time interval ( t 1 , t 2 ) . Then, ν τ is the average impulse interval of the impulse sequence κ = { t τ } τ N .
Definition 2.
([37]) The zero solution of a stochastic nonlinear system (4) is FXT stable in probability, if solution ϕ ( t , ϕ 0 ) with initial condition ϕ 0 R n satisfies
1. 
For any initial condition ϕ 0 ( 0 ) R n , there exists an ST function T ( ϕ 0 , κ ) = inf { t | ϕ ( t , ϕ 0 ) = 0 } such that P r o { T ( ϕ 0 , κ ) < } = 1 ;
2. 
Stability in probability: for every pair of ε ( 0 , 1 ) and v > 0 , there exists a δ = δ ( ε , v ) > 0 , such that P r o { | ϕ ( t , ϕ 0 ) | } v , for all t 0 } 1 ε , whenever | ϕ 0 | < δ ;
3. 
The mathematical expectation of T ( ϕ 0 , κ ) is bounded by a constant T ε > 0 , such that E ( T ( ϕ 0 , κ ) ) T ε for any ϕ 0 R n .
Definition 3.
([21]) If the zero solution of a stochastic system (4) is FXT stochastic stable and satisfies T ( ϕ 0 , κ ) T c for all initial values ϕ 0 R n , where T c > 0 is a given constant, then the zero solution of (4) is thought to be PDT stable in probability.
Lemma 1.
([38]) For any γ i j R , u j , u ¯ j R , the following inequality holds true:
| j = 1 n γ i j u j j = 1 n γ i j u ¯ j | j = 1 n ( | γ i j | · | u j u ¯ j | ) , | j = 1 n γ i j u j j = 1 n γ i j u ¯ j | j = 1 n ( | γ i j | · | u j u ¯ j | ) .
Lemma 2.
([39]) Assume ϱ i > 0 for i = 1 , 2 , , , 0 < ξ 1 , ς > 1 ; then,
i = 1 ϱ i ξ ( i = 1 ϱ i ) ξ , i = 1 ϱ i ς 1 ς ( i = 1 ϱ i ) ς .
Lemma 3.
([20]) If there exists a Lyapunov function V ( t , ϕ ( t ) ) , such that
1. 
ε 1 ϕ ( t ) 2 V ( t , ϕ ( t ) ) ε 2 ϕ ( t ) 2 , t R + , ϕ R n ;
2. 
£ V ( t , ϕ ( t ) ) T 0 T c K V ( t , ϕ ( t ) ) μ V δ ( t , ϕ ( t ) ) λ V γ ( t , ϕ ( t ) ) , t t τ , V ( t + , ϕ ( t τ + ) ) Λ V ( t τ , ϕ ( t τ ) ) , t = t τ ,
where T c is the PDT parameter, T 0 is given as T 0 = 1 λ ( γ 1 ) ϖ + π 2 μ ( 1 δ ) , ϖ = Λ τ 0 ( 1 γ ) sign ( 1 Λ ) , π = Λ τ 0 ( 1 δ ) sign ( 1 Λ ) . ε 1 , ε 2 , K , μ , λ , Λ , δ , γ are positive scalars, 0 < δ < 1 , γ > 1 and K < min { μ , λ , T c T 0 ( ln Λ ν τ ) } , then the system (4) is PDT stable in probability with PDT T c .
Remark 1.
FXT synchronization has many privileges as described in previous literature [17,18,20]. For instance, In [20], the authors indicated the ST estimation of FXT synchronization for the system (4) as
T 1 = 1 η ( 1 γ ) ln 1 η λ ϖ + 1 η ( 1 δ ) ln μ μ η π 2 ,
where η = K ¯ + ln Λ ν τ , K ¯ < min { μ , λ , ln Λ ν τ } , all other parameters are defined in Lemma 3 of this paper. Compared with previous works, PDT synchronization is independent of the parameter sets and initial conditions, and the ST estimation can be determined according to the actual needs. Therefore, synchronization can be completed within the preassigned time via novel controllers. In Section 4, we will compare T 1 and T c via numerical simulations.

3. Main Results

In this paper, the external control inputs u i ( t ) and v j ( t ) are designed as follows:
u i = T 0 T c ( θ i | e i ( t ) | p + ϑ i | e i ( t ) | q ) s i g n ( e i ( t ) ) , v j = T 0 T c ( ϵ j | z j ( t ) | p + ς j | z j ( t ) | q ) s i g n ( z j ( t ) ) ,
where θ i , ϑ i , ϵ j , ς j are positive scalars for i I and j J . p and q are positive numbers, such that 0 < p < 1 and q > 1 .
By defining
r i = 2 a i + η i + j = 1 m ( L j h ( | b i j | + | α i j | + | β i j | ) + L i g ( | b ¯ j i | + | α ¯ j i | + | β ¯ j i | ) ) , s j = 2 a ¯ j + η ¯ j + i = 1 n ( L j h ( | b i j | + | α i j | + | β i j | ) + L i g ( | b ¯ j i | + | α ¯ j i | + | β ¯ j i | ) ) ,
for i I and j J , we obtain the following theorem.
Theorem 1.
Suppose that Assumptions 1 and 2 hold true, then system (2) can be PDT stochastic synchronized with the system (1) under the controller (7) if the following inequality holds:
k < min { ψ , φ , T c T 0 ln ζ ν τ } ,
where k = T c T 0 max { max i I { r i } , max j J { s j } } , ψ = 2 min { min i I { θ i } , min j J { ϵ j } } , φ = 2 3 q 2 min { n 1 q 2 min i I { ϑ i } , m 1 q 2 min j J { ς j } } , ζ = max { max i I { ξ i 2 } , max j J { ζ j 2 } } . T c is the PDT parameter, and T 0 is written as T 0 = 2 φ ( q 1 ) ϖ + 2 π 2 ψ ( 1 p ) , ϖ = ζ τ 0 1 q 2 s i g n ( 1 ζ ) , π = ζ τ 0 1 p 2 s i g n ( 1 ζ ) .
Proof of Theorem 1.
Consider the following Lyapunov function:
V ( t ) = V 1 ( t ) + V 2 ( t ) ,
where
V 1 ( t ) = i = 1 n e i 2 ( t ) V 2 ( t ) = j = 1 m z j 2 ( t ) .
One can easily calculate the £ V 1 ( t ) along the system (3) for t t τ as follows:
£ V 1 ( t ) = i = 1 n 2 e i ( t ) [ a i e i ( t ) + j = 1 m b i j h ˜ j ( z j ( t ) ) + j = 1 m α i j h ˜ j ( z j ( t ) ) + j = 1 m β i j h ˜ j ( z j ( t ) ) T 0 T c ( θ i | e i ( t ) | p + ϑ i | e i ( t ) | q ) s i g n ( e i ( t ) ) ] + σ i T ( t , e i ( t ) ) σ i ( t , e i ( t ) ) .
By applying Assumption 1 and inequality 2 c d c 2 + d 2 for any constants c and d, the following inequality holds true:
i = 1 n j = 1 m 2 e i ( t ) b i j h ˜ j ( z j ( t ) ) i = 1 n j = 1 m 2 L j h | b i j | | e i ( t ) | | z j ( t ) | i = 1 n j = 1 m L j h | b i j | ( e i 2 ( t ) + z j 2 ( t ) ) .
According to Lemma 1 and Assumption 1, we obtain
i = 1 n 2 e i ( t ) j = 1 m α i j h ˜ j ( z j ( t ) ) i = 1 n 2 e i ( t ) j = 1 m α i j h ˜ j ( z j ( t ) ) i = 1 n j = 1 m L j h | α i j | ( e i 2 ( t ) + z j 2 ( t ) ) .
Similarly, one can obtain
i = 1 n 2 e i ( t ) j = 1 m β i j h ˜ j ( z j ( t ) ) i = 1 n j = 1 m L j h | β i j | ( e i 2 ( t ) + z j 2 ( t ) ) .
Next, consider
i = 1 n 2 e i ( t ) [ T 0 T c θ i | e i ( t ) | p s i g n ( e i ( t ) ) ] = i = 1 n [ 2 T 0 T c θ i s i g n ( e i ( t ) ) e i ( t ) | e i ( t ) | p ] = i = 1 n [ 2 T 0 T c θ i | e i ( t ) | p + 1 ] .
Similar to (15), we have the following:
i = 1 n 2 e i ( t ) [ T 0 T c ϑ i | e i ( t ) | q s i g n ( e i ( t ) ) ] = i = 1 n [ 2 T 0 T c ϑ i | e i ( t ) | q + 1 ] .
Finally, according to Assumption 2, we have
i = 1 n σ i T ( t , e i ( t ) ) σ i ( t , e i ( t ) ) i = 1 n η i e i 2 ( t ) .
Introducing Equations (12)–(17) into (11), we obtain
£ V 1 ( t ) i = 1 n [ ( 2 a i + η i ) e i 2 ( t ) + j = 1 m L j h ( | b i j | + | α i j | + | β i j | ) ( e i 2 ( t ) + z j 2 ( t ) ) 2 T 0 T c ( θ i | e i ( t ) | p + 1 + ϑ i | e i ( t ) | q + 1 ) ] .
Similarly, for V 2 ( t ) , it is not hard to verify that
£ V 2 ( t ) j = 1 m [ ( 2 a ¯ j + η ¯ j ) z j 2 ( t ) + i = 1 n L i g ( | b ¯ j i | + | α ¯ j i | + | β ¯ j i | ) ( e i 2 ( t ) + z j 2 ( t ) ) 2 T 0 T c ( ϵ j | z j ( t ) | p + 1 + ς j | z j ( t ) | q + 1 ) ] .
Therefore, one can obtain
£ V ( t ) = £ V 1 ( t ) + £ V 2 ( t ) i = 1 n [ 2 a i + η i + j = 1 m ( L j h ( | b i j | + | α i j | + | β i j | ) + L i g ( | b ¯ j i | + | α ¯ j i | + | β ¯ j i | ) ) ] e i 2 ( t ) + j = 1 m [ 2 a ¯ i + η ¯ i + j = 1 m ( L j h ( | b i j | + | α i j | + | β i j | ) + L i g ( | b ¯ j i | + | α ¯ j i | + | β ¯ j i | ) ) ] z j 2 ( t ) i = 1 n 2 T 0 T c θ i | e i ( t ) | p + 1 j = 1 m 2 T 0 T c ϵ j | z j ( t ) | p + 1 i = 1 n 2 T 0 T c ϑ i | e i ( t ) | q + 1 j = 1 m 2 T 0 T c ς j | z j ( t ) | q + 1 .
Applying Lemma 2, we can obtain
£ V ( t ) max i I { r i } i = 1 n e i 2 ( t ) + max j J { s j } j = 1 m z j 2 ( t ) 2 T 0 T c min i I { θ i } i = 1 n e i 2 ( t ) p + 1 2 + min j J { ϵ j } j = 1 m z j 2 ( t ) p + 1 2 + n 1 q 2 min i I { ϑ i } i = 1 n e i 2 ( t ) q + 1 2 + m 1 q 2 min j J { ς j } j = 1 m z j 2 ( t ) q + 1 2 T 0 T c [ T c T 0 max { max i I { r i } , max j J { s j } } V ( t ) 2 min { min i I { θ i } , min j J { ϵ j } } V p + 1 2 ( t ) 2 min { n 1 q 2 min i I { ϑ i } , m 1 q 2 min j J { ς j } } 2 1 q 2 V q + 1 2 ( t ) ] .
Then, we can deduce that
£ V ( t ) T 0 T c [ k V ( t ) ψ V p + 1 2 ( t ) φ V q + 1 2 ( t ) ] .
When t = t τ , by using the impulse condition of the system (3), it follows that
V ( t τ + ) = V 1 ( t τ + ) + V 2 ( t τ + ) = i = 1 n e i 2 ( t τ + ) + j = 1 m z j 2 ( t τ + ) = i = 1 n ξ i 2 e i 2 ( t τ ) + j = 1 m ζ j 2 z j 2 ( t τ ) max { max i I { ξ i 2 } , max j J { ζ j 2 } } ( i = 1 n e i 2 ( t τ ) + j = 1 m z j 2 ( t τ ) ) = ζ V ( t τ ) ,
thus, in view of Equations (20) and (21), from Lemma 3, the drive-response systems (1) and (2) achieve PDT stochastic synchronization with PDT T c under the controller (7). The proof is completed. □
Remark 2.
It is well-known that designing a controller is vital for the synchronization study of neural network systems. The simple controller can save on the control cost. Compared with [19], the novel controller we designed in this paper is simpler because it consists of only two terms, and we can still reach the PDT synchronization of the drive-response system for (1) and (2) with high quality. Thus, the controller in this paper has greater applicability.
We considered the PDT synchronization of impulsive fuzzy BAM neural networks with stochastic effects in Theorem 1. If there is no fuzzy effect in drive systems (1) and (2), they become
d x i ( t ) = [ a i x i ( t ) + j = 1 m b i j h j ( y j ( t ) ) + I i ] d t + ϱ i ( t , x i ( t ) ) d ω ( t ) , t t τ , d y j ( t ) = [ a ¯ j y j ( t ) + i = 1 n b ¯ j i g i ( x i ( t ) ) + J j ] d t + ϱ ¯ j ( t , y j ( t ) ) d ω ( t ) , t t τ , Δ x i ( t τ ) = x i ( t τ + ) x i ( t τ ) = ( ξ i 1 ) x i ( t τ ) , Δ y j ( t τ ) = y j ( t τ + ) y j ( t τ ) = ( ζ j 1 ) y j ( t τ ) ,
d x ˜ i ( t ) = [ a i x ˜ i ( t ) + j = 1 m b i j h j ( y ˜ j ( t ) ) + I i + u i ( t ) ] d t + ϱ i ( t , x ˜ i ( t ) ) d ω ( t ) , t t τ , d y ˜ j ( t ) = [ a ¯ j y ˜ j ( t ) + i = 1 n b ¯ j i g i ( x ˜ i ( t ) ) + J j + v j ( t ) ] d t + ϱ ¯ j ( t , y ˜ j ( t ) ) d ω ( t ) , t t τ , Δ x ˜ i ( t τ ) = x ˜ i ( t τ + ) x ˜ i ( t τ ) = ( ξ i 1 ) x ˜ i ( t τ ) , Δ y ˜ j ( t τ ) = y ˜ j ( t τ + ) y ˜ j ( t τ ) = ( ζ j 1 ) y ˜ j ( t τ ) ,
relevant results regarding the PDT synchronization of the above systems are considered in Theorem 2, Corollarys 3 and 4 in [20]. If there are no stochastic perturbations in the original system (1) and (2), we obtain the following drive system:
d x i ( t ) = [ a i x i ( t ) + j = 1 m b i j h j ( y j ( t ) ) + j = 1 m T i j ν j + j = 1 m α i j h j ( y j ( t ) ) + j = 1 m S i j ν j + j = 1 m β i j h j ( y j ( t ) ) + I i ] d t + ϱ i ( t , x i ( t ) ) d ω ( t ) , t t τ , d y j ( t ) = [ a ¯ j y j ( t ) + i = 1 n b ¯ j i g i ( x i ( t ) ) + i = 1 n T j i ν ¯ i + i = 1 n α ¯ j i g i ( x i ( t ) ) + i = 1 n S j i ν ¯ i + i = 1 n β ¯ j i g i ( x i ( t ) ) + J j ] d t + ϱ ¯ j ( t , y j ( t ) ) d ω ( t ) , t t τ , Δ x i ( t τ ) = x i ( t τ + ) x i ( t τ ) = ( ξ i 1 ) x i ( t τ ) , Δ y j ( t τ ) = y j ( t τ + ) y j ( t τ ) = ( ζ j 1 ) y j ( t τ ) ,
with the corresponding response system
d x ˜ i ( t ) = [ a i x ˜ i ( t ) + j = 1 m b i j h j ( y ˜ j ( t ) ) + j = 1 m T i j ν j + j = 1 m α i j h j ( y ˜ j ( t ) ) + j = 1 m S i j ν j + j = 1 m β i j h j ( y ˜ j ( t ) ) + I i + u i ( t ) ] d t d y ˜ j ( t ) = [ a ¯ j y ˜ j ( t ) + i = 1 n b ¯ j i g i ( x ˜ i ( t ) ) + i = 1 n T j i ν ¯ i + i = 1 n α ¯ j i g i ( x ˜ i ( t ) ) + i = 1 n S j i ν ¯ i + i = 1 n β ¯ j i g i ( x ˜ i ( t ) ) + J j + v j ( t ) ] d t Δ x ˜ i ( t τ ) = x ˜ i ( t τ + ) x ˜ i ( t τ ) = ( ξ i 1 ) x ˜ i ( t τ ) , Δ y ˜ j ( t τ ) = y ˜ j ( t τ + ) y ˜ j ( t τ ) = ( ζ j 1 ) y ˜ j ( t τ ) .
Now, we denote
r ¯ i = 2 a i + j = 1 m ( L j h ( | b i j | + | α i j | + | β i j | ) + L i g ( | b ¯ j i | + | α ¯ j i | + | β ¯ j i | ) ) , s ¯ j = 2 a ¯ j + i = 1 n ( L j h ( | b i j | + | α i j | + | β i j | ) + L i g ( | b ¯ j i | + | α ¯ j i | + | β ¯ j i | ) ) , k ¯ = max max i I { r ¯ i } , max j J { s ¯ j } ,
to obtain the following result.
Corollary 1.
Suppose that Assumption 1 holds true, and the control gains θ i , ϑ i , ϵ j and ς j satisfy the inequality k ¯ < min ψ , φ , ln ζ ν τ , then the drive-response systems (25) and (24) will achieve PDT stochastic synchronization under the controller (7).
The discontinuity of the sign function in the controller (7) most likely results in a chattering effect when the error tends to zero. To avoid this kind of problem, we construct a novel continuous controller:
u i = T ¯ 0 T c ( θ i ( e i ( t ) ) p 1 p 2 + ϑ i ( e i ( t ) ) q 1 q 2 ) , v j = T ¯ 0 T c ( ϵ j ( z j ( t ) ) p 1 p 2 + ς j ( z j ( t ) ) q 1 q 2 ) ,
for further study of the PDT synchronization between the drive system (1) and response system (2). Where i I , j J , θ i , ϑ i , ϵ j and ς j are non-negative constants, and p 1 , p 2 , q 1 , q 2 are odd integers satisfying p 1 < p 2 and q 1 > q 2 , T c is the PDT parameter, T ¯ 0 is written as T ¯ 0 = 2 q 2 φ ¯ ( q 1 q 2 ) ϖ ¯ + 2 p 2 π ¯ 2 ψ ( p 2 p 1 ) , ϖ ¯ = ζ τ 0 q 2 q 1 2 q 2 s i g n ( 1 ζ ) , π ¯ = ζ τ 0 p 2 p 1 2 p 2 s i g n ( 1 ζ ) , φ ¯ = 2 3 q 2 q 1 2 q 2 min { n q 2 q 1 2 q 2 min i I { ϑ i } , m q 2 q 1 2 q 2 min j J { ς j } } . k, ψ and ζ are the same as defined in Theorem 1, and similar to Theorem 1, we have the following results.
Theorem 2.
Assume that Assumptions 1 and 2 hold true, and the control gains θ i , ϑ i , ϵ j , ς j satisfy the inequality k < min ψ , φ ¯ , T c T ¯ 0 ln ζ ν τ ; the response system (2) can then be PDT stochastic synchronized with the drive system (1) under the controller (26).
Proof of Theorem 2.
Similar to Theorem 1, consider the Lyapunov function given in (9) and (10); using this, we can calculate the £ V 1 ( t ) along the system (3) via the controller as follows:
£ V 1 ( t ) = i = 1 n 2 e i ( t ) [ a i e i ( t ) + j = 1 m b i j h ˜ j ( z j ( t ) ) + j = 1 m α i j h ˜ j ( z j ( t ) ) + j = 1 m β i j h ˜ j ( z j ( t ) ) T ¯ 0 T c ( θ i ( e i ( t ) ) p 1 p 2 + ϑ i ( e i ( t ) ) q 1 q 2 ) ] + σ i T ( t , e i ( t ) ) σ i ( t , e i ( t ) ) .
By using Lemma 2,
2 T ¯ 0 T c i = 1 n θ i ( e i ( t ) ) p 1 p 2 2 T ¯ 0 T c min i I { θ i } i = 1 n ( e i ( t ) ) p 1 + p 2 p 2 2 T ¯ 0 T c min i I { θ i } i = 1 n e i 2 ( t ) p 1 + p 2 2 p 2 .
Using the same method, we can obtain
2 T ¯ 0 T c i = 1 n ϑ i ( e i ( t ) ) q 1 q 2 2 T ¯ 0 T c min i I { ϑ i } n q 2 q 1 2 q 2 i = 1 n e i 2 ( t ) q 1 + q 2 2 q 2 .
Then, by substituting (12)–(14), (17), (28) and (29) into (27), one can find that
£ V 1 ( t ) i = 1 n [ ( 2 a i η i ) e i 2 ( t ) + j = 1 m L j h ( | b i j | + | α i j | + | β i j | ) ( e i 2 ( t ) + z j 2 ( t ) ) 2 T ¯ 0 T c min i I { θ i } i = 1 n e i 2 ( t ) p 1 + p 2 2 p 2 2 T ¯ 0 T c min i I { ϑ i } n q 2 q 1 2 q 2 i = 1 n e i 2 ( t ) q 1 + q 2 2 q 2 .
Similarly, for V 2 ( t ) , it is not hard to verify that
£ V 2 ( t ) j = 1 m ( 2 a ¯ j η ¯ j ) z j 2 ( t ) + i = 1 n L i g ( | b ¯ j i | + | α ¯ j i | + | β ¯ j i | ) ( e i 2 ( t ) + z j 2 ( t ) ) 2 T ¯ 0 T c min j J { ϵ j } j = 1 m z j 2 ( t ) p 1 + p 2 2 p 2 2 T ¯ 0 T c min j J { ς j } m q 2 q 1 2 q 2 j = 1 m z j 2 ( t ) q 1 + q 2 2 q 2 .
Therefore, we obtain
£ V ( t ) T ¯ 0 T c T c T ¯ 0 max { max i I { r i } , max j J { s j } } V ( t ) 2 min { min i I { θ i } , min j J { ϵ j } } V p 1 + p 2 2 p 2 ( t ) 2 min { n q 2 q 1 2 q 2 min i I { ϑ i } , m q 2 q 1 2 q 2 min j J { ς j } } 2 q 2 q 1 2 q 2 V q 1 + q 2 2 q 2 ( t ) . = T ¯ 0 T c [ k V ( t ) ψ V p 1 + p 2 2 p 2 ( t ) φ ¯ V q 1 + q 2 2 q 2 ( t ) ] .
In view of (21) and (32) and Lemma 3, the drive–response systems (1) and (2) reach PDT stochastic synchronization within the PDT T c with the controller (26). The proof of Theorem 2 is completed. □
Corollary 2.
Suppose that Assumption 1 holds true, and the control gains θ i , ϑ i , ϵ j , ς j satisfy inequality k ¯ < min ψ , φ ¯ , T c T ¯ 0 ln ζ ν τ , then the drive–response systems (25) and (24) will then achieve PDT stochastic synchronization under the controller (26).
Remark 3.
In [40,41], the authors achieved the FXT and PDT synchronization of neural networks by designing a controller that contains the discontinuous sign function. However, this function may lead to the degradation of synchronization performance by causing the chattering effect when synchronization tends to zero. To respond to this problem, in Theorem 2 and Corollary 2, we designed a novel continuous controller, which does not include a discontinuous sign function.

4. Numerical Examples and Simulations

In this section, to validate the effectiveness of the theoretical results in this paper, we use Python software to run the numerical simulations by applying Euler–Maruyama method [42].
Example 1.
For n = m = 2 , consider the following impulsive fuzzy BAMNNs with stochastic perturbations
d x i ( t ) = [ a i x i ( t ) + j = 1 2 b i j h j ( y j ( t ) ) + j = 1 2 T i j ν j + j = 1 2 α i j h j ( y j ( t ) ) + j = 1 2 S i j ν j + j = 1 2 β i j h j ( y j ( t ) ) + I i ] d t + ϱ i ( t , x i ( t ) ) d ω ( t ) , t t τ , d y j ( t ) = [ a ¯ j y j ( t ) + i = 1 2 b ¯ j i g i ( x i ( t ) ) + i = 1 2 T j i ν ¯ i + i = 1 2 α ¯ j i g i ( x i ( t ) ) + i = 1 2 S j i ν ¯ i + i = 1 2 β ¯ j i g i ( x i ( t ) ) + J j ] d t + ϱ ¯ j ( t , y j ( t ) ) d ω ( t ) , t t τ , Δ x i ( t τ ) = x i ( t τ + ) x i ( t τ ) = ( ξ i 1 ) x i ( t τ ) , Δ y j ( t τ ) = y j ( t τ + ) y j ( t τ ) = ( ζ j 1 ) y j ( t τ ) ,
where i { 1 , 2 } , j { 1 , 2 } , and parameters of the system (33) are taken as
{ a i } = 12.48 12.18 , { a ¯ j } = 11.404 11.01 , { b i j } = 2.48 0.98 0.54 2.1 ,
{ b ¯ j i } = 2.12 1.08 0.28 2.42 , { α i j } = 0.4 0.6 0.6 0.4 ,
{ α ¯ j i } = 0.6 0.6 0.6 0.5 , { β i j } = 0.6 0.48 0.6 0.5 , { ξ i } = 0.48 0.48 ,
{ β ¯ j i } = 0.6 0.6 0.48 0.5 , { I i } = { J j } = 0 0 , { ζ j } = 1.48 1.48 ,
with h 1 ( u ) = h 2 ( u ) = 1.2 cos ( u ) and g 1 ( u ) = g 2 ( u ) = 1.2 cos ( u ) . ϱ 1 ( u ) = ϱ 2 ( u ) = 0.4 u and ϱ ¯ 1 ( u ) = ϱ ¯ 2 ( u ) = 0.2 u . As a result, system (33) has a chaotic attractor with initial condition x 1 ( 0 ) = 0.05 , x 2 ( 0 ) = 0.15 , y 1 ( 0 ) = 0.02 , y 2 ( 0 ) = 0.8 , as shown in Figure 2.
The corresponding response system of (35) is given as
d x ˜ i ( t ) = [ a i x ˜ i ( t ) + j = 1 2 b i j h j ( y ˜ j ( t ) ) + j = 1 2 T i j ν j + j = 1 2 α i j h j ( y ˜ j ( t ) ) + j = 1 2 S i j ν j + j = 1 2 β i j h j ( y ˜ j ( t ) ) + I i + u i ( t ) ] d t + ϱ i ( t , x ˜ i ( t ) ) d ω ( t ) , t t τ , d y ˜ j ( t ) = [ a ¯ j y ˜ j ( t ) + i = 1 2 b ¯ j i g i ( x ˜ i ( t ) ) + i = 1 2 T j i ν ¯ i + i = 1 2 α ¯ j i g i ( x ˜ i ( t ) ) + i = 1 2 S j i ν ¯ i + i = 1 2 β ¯ j i g i ( x ˜ i ( t ) ) + J j + v j ( t ) ] d t + ϱ ¯ j ( t , y ˜ j ( t ) ) d ω ( t ) , t t τ , Δ x ˜ i ( t τ ) = x ˜ i ( t τ + ) x ˜ i ( t τ ) = ( ξ i 1 ) x ˜ i ( t τ ) , Δ y ˜ j ( t τ ) = y ˜ j ( t τ + ) y ˜ j ( t τ ) = ( ζ j 1 ) y ˜ j ( t τ ) ,
where a i , a ¯ j , b i j , b ¯ j i , α i j , α ¯ j i , β i j , β ¯ j i , T i j , S i j , ν j , ν ¯ i for i I 1 { 1 , 2 } , j J 1 { 1 , 2 } are provided in system (33). It is not difficult to check that k 1 = max i I 1 { r i } = 8.84 , k 2 = max j J 1 { s j } = 8.824 , k = T c T 0 max { k 1 , k 2 } = 6.5211 , L j h = L i g = 1.2 , η i = η ¯ j = 1 for i I 1 , j J 1 . By choosing PDT as T c = 1.85 , then the Assumption 1, Assumption 2 and condition k < min { ψ , φ , T c T 0 ln ζ ν τ }   = min { 2.6 , 1.7148 , 5.7945 } in Theorem 1 are satisfied with θ 1 = θ 2 = 1.3 , ϑ 1 = ϑ 2 = 1.8 , ϵ 1 = ϵ 2 = 1.3 , ς 1 = ς 2 = 1.6 , p = 0.3 and q = 1.9 . Therefore, according to Theorem 1, the drive–response systems (33) and (34) have a synchronized within PDT T c = 1.85 which is less than T 0 = 2.5033 and T 1 = 2.0305 under controller (7), where T 1 is the ST estimation for FXT synchronization, as provided in Equation (6). The results are shown in Figure 3.
Example 2.
For n = m = 3 , consider the following impulsive fuzzy BAMNNs with stochastic perturbations
d x i ( t ) = [ a i x i ( t ) + j = 1 3 b i j h j ( y j ( t ) ) + j = 1 3 T i j ν j + j = 1 3 α i j h j ( y j ( t ) ) + j = 1 3 S i j ν j + j = 1 3 β i j h j ( y j ( t ) ) + I i ] d t + ϱ i ( t , x i ( t ) ) d ω ( t ) , t t τ , d y j ( t ) = [ a ¯ j y j ( t ) + i = 1 3 b ¯ j i g i ( x i ( t ) ) + i = 1 3 T j i ν ¯ i + i = 1 3 α ¯ j i g i ( x i ( t ) ) + i = 1 3 S j i ν ¯ i + i = 1 3 β ¯ j i g i ( x i ( t ) ) + J j ] d t + ϱ ¯ j ( t , y j ( t ) ) d ω ( t ) , t t τ , Δ x i ( t τ ) = x i ( t τ + ) x i ( t τ ) = ( ξ i 1 ) x i ( t τ ) , Δ y j ( t τ ) = y j ( t τ + ) y j ( t τ ) = ( ζ j 1 ) y j ( t τ ) ,
where i { 1 , 2 , 3 } , j { 1 , 2 , 3 } , and the parameters of the system (35) are used as follows:
{ a i } = 8.58 7.384 7.02 { a ¯ j } = 5.24 4.52 3.6 { b i j } = 2.672 2.656 2 2.74 2 2.624 2 2.74 2.624
{ b ¯ j i } = 2.915 3.1 2.265 2.86 1.435 2.725 2.8 2.46 1.725 { α i j } = 0.6 0.6 0.4 0.6 0.4 0.2 0.6 0.2 0.4
{ α ¯ j i } = 0.54 0.46 0.4 0.78 0.54 0.45 0.68 0.48 0.54 { β i j } = 0.6 0.56 0.4 0.6 0.6 0.5 0.6 0.48 0.54
{ β ¯ j i } = 0.6 0.26 0.48 0.4 0.5 0.6 0.6 0.52 0.48 { I i } = { J j } = 0 0 0 { ξ i } = { ζ j } = 0.58 0.58 0.58
with h 1 ( u ) = h 2 ( u ) = h 3 ( u ) = 1.2 cos ( u ) and g 1 ( u ) = g 2 ( u ) = g 3 ( u ) = 1.2 cos ( u ) . ϱ 1 ( u ) = ϱ 2 ( u ) = ϱ 3 ( u ) = 0.2 u and ϱ ¯ 1 ( u ) = ϱ ¯ 2 ( u ) = ϱ ¯ 3 ( u ) = 0.2 u . As a result, system (35) has a chaotic attractor with initial condition x 1 ( 0 ) = 0.03 , x 2 ( 0 ) = 0.01 , x 3 ( 0 ) = 0.3 , y 1 ( 0 ) = 0.06 , y 2 ( 0 ) = 0.005 and y 3 ( 0 ) = 0.5 , as shown in Figure 4.
The corresponding response system of (35) is given as
d x ˜ i ( t ) = [ a i x ˜ i ( t ) + j = 1 m b i j h j ( y ˜ j ( t ) ) + j = 1 m T i j ν j + j = 1 m α i j h j ( y ˜ j ( t ) ) + j = 1 m S i j ν j + j = 1 m β i j h j ( y ˜ j ( t ) ) + I i + u i ( t ) ] d t + ϱ i ( t , x ˜ i ( t ) ) d ω ( t ) , t t τ , d y ˜ j ( t ) = [ a ¯ j y ˜ j ( t ) + i = 1 n b ¯ j i g i ( x ˜ i ( t ) ) + i = 1 n T j i ν ¯ i + i = 1 n α ¯ j i g i ( x ˜ i ( t ) ) + i = 1 n S j i ν ¯ i + i = 1 n β ¯ j i g i ( x ˜ i ( t ) ) + J j + v j ( t ) ] d t + ϱ ¯ j ( t , y ˜ j ( t ) ) d ω ( t ) , t t τ , Δ x ˜ i ( t τ ) = x ˜ i ( t τ + ) x ˜ i ( t τ ) = ( ξ i 1 ) x ˜ i ( t τ ) , Δ y ˜ j ( t τ ) = y ˜ j ( t τ + ) y ˜ j ( t τ ) = ( ζ j 1 ) y ˜ j ( t τ ) ,
where a i , a ¯ j , b i j , b ¯ j i , α i j , α ¯ j i , β i j , β ¯ j i , T i j , S i j , ν j , ν ¯ i for i I 2 { 1 , 2 , 3 } , j J 2 { 1 , 2 , 3 } are provided in system (35). It is not difficult to verify that k 1 = max i I 2 { r i } = 16.5292 , k 2 = max j J 2 { s j } = 15.7776 , k = T c T 0 max { k 1 , k 2 } = 8.1882 , L j h = L i g = 1.2 , η i = η ¯ j = 0.1 for i I 2 , j J 2 . By choosing PDT as T c = 0.5 , then the Assumption 1, Assumption 2 and condition k < min { ψ , φ , T c T 0 ln ζ ν τ } in Theorem 1 are satisfied with θ 1 = θ 2 = θ 3 = 4.2 , ϑ 1 = ϑ 2 = ϑ 3 = 6.3 , ϵ 1 = ϵ 2 = ϵ 3 = 4.2 , ς 1 = ς 2 = ς 3 = 6.2 , p = 0.45 and q = 1.45 . Therefore, according to Theorem 1, the drive–response systems (35) and (36) are synchronized PDT T c = 0.5 with less than T 0 = 1.0093 and T 1 = 0.7758 under controller (7), where T 1 is given by (6). The results are shown in Figure 5.
Example 3.
For n = m = 3 , consider the drive–response systems (35) and (36), given in Example 2, via controller (26). Here, p 1 = 3 , p 2 = 7 , q 1 = 13 , and q 2 = 9 , and the other parameters are the same as those given in Example 2. Thus, according to Theorem 2, the drive–response systems (35) and (36) have a synchronized PDT T c = 0.5 of less than T ¯ 0 = 0.9971 and T 1 = 0.7606 under controller (26), as shown in Figure 6.
Remark 4.
We performed three numerical simulations including two- and three-dimensional cases. The specific information is shown in Table 1. We can easily see that the ST estimations of the PDT synchronization can be preassigned according to the actual needs, and are, furthermore, more accurate than the ST estimations in previous works [19,20,21,33,40]. Two-dimensional and three-dimensional numerical simulations are disputed in Example 1 and Example 2, respectively, for the drive–response systems (1) and (2) under controller (7). In Example 2 and Example 3, we used different controllers (7) and (26), respectively, for drive–response systems (35) and (36). The difference between Example 2 and Example 3 is discussed in Remark 3.
Remark 5.
From the results of Examples 1, 2 and 3, we can see that the preassigned time T c is always less than the T 0 in Theorem 1 and T ¯ 0 in Theorem 2. This implies that we are able to predefine the time of synchronization of the drive–response systems. Furthermore, the preassigned time T c is more accurate than the ST estimation T 1 introduced in Remark 1. From this view, compared to these previous works [19,20,21,33,40], the results in this paper are more applicable.
Remark 6.
From Figure 2 and Figure 4, we can see that the BAM neural network has hyper-chaotic attractors, and it also has good construction and higher associative memory capabilities. Because the higher chaotic properties of BAM neural networks can provide strong security, it can be employed in the field of image encryption and signal transmission.

5. Conclusions

In this paper, we investigated the PDT synchronization of impulsive fuzzy BAM neural networks with stochastic perturbations. First, we introduced some relevant results for PDT synchronization, fuzziness and stochastic neural networks. Then, based on these previous works, we combined impulse effect, fuzziness and stochastic perturbations for BAM neural networks. Next, a type of novel controller is designed for the considered system. After that, some sufficient conditions are obtained to ensure the PDT synchronization of the drive–response systems by using the Lyapunov function method. Finally, three numerical examples are provided to show the effectiveness of the obtained theoretical results of the proposed model. In future work, we may focus on the FXT/PDT synchronization of BAM neural networks with reaction–diffusion terms, as this area of research is important because of its practical applicability in certain fields [43,44].

Author Contributions

Conceptualization, R.M. and A.A.; Validation, A.A. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the China Postdoctoral Science Foundation (Grant No. 2022M710885).

Data Availability Statement

There is no data associated with this paper.

Conflicts of Interest

The authors declare that they have no any competing interests regarding the publication of this article.

References

  1. Kosko, B. Adaptive bi-directional associative memories. Appl. Opt. 1987, 26, 4947–4960. [Google Scholar] [CrossRef] [Green Version]
  2. Kosko, B. Bi-directional associative memories. IEEE Trans. Syst. Man. Cybern. 1988, 18, 49–60. [Google Scholar] [CrossRef] [Green Version]
  3. Hasan, S.M.R.; Siong, N.K. A VLSI BAM neural network chip for pattern recognition applications. In Proceedings of the ICNN’95—International Conference on Neural Networks, Perth, WA, Australia, 27 November–1 December 1995; pp. 164–168. [Google Scholar]
  4. Chau, F.T.; Cheung, B.; Tam, K.Y.; Li, L.K. Application of a bi-directional associative memory (BAM) network in computer assisted learning in chemistry. Computer Chem. 1994, 18, 359–362. [Google Scholar] [CrossRef]
  5. Wang, L.; Jiang, M.; Liu, R.; Tang, X. Comparison BAM and discrete Hopfield networks with CPN for processing of noisy data. In Proceedings of the 2008 9th International Conference on Signal Processing, Beijing, China, 26–29 October 2008; pp. 1708–1711. [Google Scholar]
  6. Wang, W.; Wang, X.; Luo, X. Finit-time projective synchronization of memristor-based BAM neural networks and applications in image encryption. IEEE Access 2018, 6, 56457–56476. [Google Scholar] [CrossRef]
  7. Konnur, R. Synchronization-based approach for estimating all model parameters of chaotic systems. Phy. Rev. E. 2003, 67, 027204. [Google Scholar] [CrossRef] [Green Version]
  8. Rakkiyappan, R.; Latha, V.P.; Zhu, Q.; Yao, Z. Exponential synchronization of Markovian jumping chaotic neural networks with sampled-data and saturating actuators. Nonlinear Anal. Hybrid Syst. 2017, 24, 28–44. [Google Scholar] [CrossRef]
  9. Cao, J. Global asymptotic stability of delayed bi-directional associative memory. Appl. Math. Comput. 2003, 142, 333–339. [Google Scholar]
  10. Mathiyalagan, K.; Park, J.H.; Sakthivel, R. Synchronization for delayed memristive BAM neural networks using impulsive control with random nonlinearities. Appl. Math. Comput. 2015, 259, 967–979. [Google Scholar] [CrossRef]
  11. Sader, M.; Abdurahman, A.; Jiang, H.J. General decay synchronization of delayed BAM neural networks via nonlinear feedback control. Appl. Math. and Comput. 2018, 337, 302–314. [Google Scholar] [CrossRef]
  12. Hong, Y.; Huang, J. Finite-time control for robot manipulators. Syst. Control Lett. 2002, 46, 243–253. [Google Scholar] [CrossRef]
  13. Bhat, S.P.; Bernstein, D.S. Finite-time stability of homogeneous systems. In Proceedings of the American Control Conference, Albuquerque, NM, USA, 6 June 1997; Volume 4, pp. 2513–2514. [Google Scholar]
  14. Jiang, M.; Wang, S.; Mei, J.; Shen, Y. Finite-time synchronization control of a class of memristor-based recurrent neural networks. Neural Netw. 2014, 63, 133–140. [Google Scholar] [CrossRef] [PubMed]
  15. Velmurugan, G.; Rakkiyappan, R.; Cao, J. Finite-time synchronization of fractional-order memristor-based neural networks with time delays. Neural Netw. 2016, 73, 36–46. [Google Scholar] [CrossRef]
  16. Polyakov, A. Nonlinear feedback design for fixed-time stabilization of linear control systems. IEEE Trans. Autom. Control 2012, 57, 2106–2110. [Google Scholar] [CrossRef] [Green Version]
  17. Wan, Y.; Cao, J.; Wen, G. Robust fixed-time synchronization of delayed Cohen-Grossberg neural networks. Neural Netw. 2016, 73, 86–94. [Google Scholar] [PubMed]
  18. Hu, H.; Gao, B.; Xu, L. Finite-Time and Fixed-Time Attractiveness for Nonlinear Impulsive Systems. IEEE Tans. Autom. Control 2022, 67, 5586–5593. [Google Scholar] [CrossRef]
  19. Wang, Q.; Zhao, H.; Liu, A.; Li, L.; Niu, S.; Chen, C. Predefined-Time Synchronization of Stochastic Memristor-Based Bidirectional Associative Memory Neural Networks With Time-Varying Delays. IEEE Trans. Cogn. Devel. Sys. 2022, 14, 1584–1593. [Google Scholar] [CrossRef]
  20. You, J.; Abdurahman, A.; Sadik, H. Fixed/Predefined-Time synchronization of complex-valued stochastic BAM neural networks with stabilizing and destabilizing impulse. Mathematics 2022, 10, 4384. [Google Scholar] [CrossRef]
  21. Abudusaimaiti, M.; Abdurahman, A.; Jiang, H. Fixed/predefined-time synchronization of fuzzy neural networks with stochastic perturbations. Chaos Solitons Fractals 2022, 154, 111596. [Google Scholar] [CrossRef]
  22. Yang, T.; Yang, L.; Wu, C.; Chua, L. Fuzzy cellular neural networks: Theory. In Proceedings of the IEEE International Workshop on Cellular Neural Networks and Applications, Seville, Spain, 24–26 June 1996; pp. 181–186. [Google Scholar]
  23. Yang, T.; Yang, L.; Wu, C.; Chua, L. Fuzzy cellular neural networks: Applications. In Proceedings of the IEEE International Workshop on Cellular Neural Networks and Applications, Seville, Spain, 24–26 June 1996; pp. 225–230. [Google Scholar]
  24. Quteishat, A.; Lim, C.P.; Tan, K.S. A modified fuzzy min–max neural network with a genetic-algorithm-based rule extractor for pattern classification. IEEE trans. Syst. Man Cybern. 2010, 40, 641–650. [Google Scholar] [CrossRef]
  25. Kanakalakshmi, S.; Sakthivel, R.; Karthick, S.A.; Leelamani, A.; Parivallal, A. Finite-time decentralized event-triggering non-fragile control for fuzzy neural networks with cyber-attack and energy constraints. Eur. J. Control 2021, 57, 135–146. [Google Scholar] [CrossRef]
  26. Zhang, H.; Liu, J.; Ma, D.; Wang, Z. Data-core-based fuzzy min–max neural network for pattern classification. IEEE Trans. Neural Networks 2011, 2212, 2339–2352. [Google Scholar] [CrossRef] [PubMed]
  27. Kadak, U. Multivariate fuzzy neural network interpolation operators and applications to image processing. Expert Syst. Appl. 2022, 206, 117771. [Google Scholar]
  28. Li, S.; Hernández, M.A.B. Robust synchronization of chaotic systems with novel fuzzy rule-based controllers. Inform. Sci. 2019, 481, 604–615. [Google Scholar]
  29. Wang, P.; Li, X.; Wang, N.; Li, Y.; Shi, K.; Lu, J. Almost periodic synchronization of quaternion-valued fuzzy cellular neural networks with leakage delays. Fuzzy Sets Syst. 2022, 426, 46–65. [Google Scholar] [CrossRef]
  30. Gunasekaran, N.; Saravanakumar, R.; Joo, Y.; Kim, H. Finite-time synchronization of sampled-data T–S fuzzy complex dynamical networks subject to average dwell-time approach. Fuzzy Sets Syst. 2019, 374, 40–59. [Google Scholar]
  31. Duan, L.; Li, J. Fixed-time synchronization of fuzzy neutral-type BAM memristive inertial neural networks with proportional delays. Inform. Sci. 2021, 576, 522–541. [Google Scholar] [CrossRef]
  32. Li, X.; Song, S. Research on synchronization of chaotic delayed neural networks with stochastic perturbation using impulsive control method. Commun. Nonlinear Sci. Numer. Simulat. 2014, 19, 3892–3900. [Google Scholar] [CrossRef]
  33. Gu, H. Mean square exponential stability in high-order stochastic impulsive BAM neural networks with time-varying delays. Neurocomputing 2011, 74, 720–729. [Google Scholar] [CrossRef]
  34. Zhang, Y.; Li, L.; Peng, H.; Xiao, J.; Yang, Y.; Zheng, M.; Zhao, H. Finite-time synchronization for memristor-based BAM neural networks with stochastic perturbations and time-varying delays. Int. J. Robust Nonlinear Control 2018, 28, 5118–5139. [Google Scholar]
  35. Abdurahman, A.; Abudusaimaiti, M.; Jiang, H. Fixed/predefined-time lag synchronization of complex-valued BAM neural networks with stochastic perturbations. Appl. Math. Comp. 2023, 444, 127811. [Google Scholar]
  36. Lee, L.; Liu, Y.; Liang, J.; Cai, X. Finite time stability of nonlinear impulsive systems and its applications in sampled-data systems. ISA Trans. 2015, 57, 172–178. [Google Scholar] [PubMed]
  37. Yin, J.; Khoo, S.; Man, Z. Finite-time stability and instability of stochastic nonlinear systems. Automatica 2011, 47, 2671–2677. [Google Scholar]
  38. Zheng, M.; Li, L.; Peng, H.; Xiao, J.; Yang, Y.; Zhang, Y.; Zhao, H. Fixed-time synchronization of memristor-based fuzzy cellular neural network with time-varying delay. J. Franklin I. 2018, 355, 6780–6809. [Google Scholar] [CrossRef]
  39. Hardy, G.H.; Littlewood, J.E.; Polya, G. Inequalities; Cambridge University Press: Cambridge, UK, 1952. [Google Scholar]
  40. Kong, F.; Zhu, Q.; Sakthivel, R. Finite-time and fixed-time synchronization control of fuzzy cohen-grossberg neural networks. Fuzzy Sets Syst. 2020, 394, 87–109. [Google Scholar] [CrossRef]
  41. Cui, W.; Wang, Z.; Jin, W. Fixed-time synchronization of markovian jump fuzzy cellular neural networks with stochastic disturbance and time-varying delays. Fuzzy Sets Syst. 2021, 411, 68–84. [Google Scholar] [CrossRef]
  42. Higham, D.J. An algorithmic introduction to numerical simulation of stochastic differential equations. SIAM Rev. 2001, 43, 525–546. [Google Scholar]
  43. Bao, T.; Xu, Y. Global asymptotic stability of BAM neural networks with distributed delays and reaction–diffusion terms. Chaos Solitons Fractals 2006, 27, 134–1354. [Google Scholar]
  44. Hu, D.; Tan, J.; Shi, K.; Ding, K. Switching synchronization of reaction-diffusion neural networks with time-varying delays. Chaos Solitons Fractals 2022, 155, 111766. [Google Scholar]
Figure 1. The construction of BAM neural networks (left) and fuzzy min-max neural networks (right).
Figure 1. The construction of BAM neural networks (left) and fuzzy min-max neural networks (right).
Mathematics 11 01291 g001
Figure 2. The chaotic attractor of the system (33).
Figure 2. The chaotic attractor of the system (33).
Mathematics 11 01291 g002
Figure 3. Evaluation of synchronization errors for Example 1.
Figure 3. Evaluation of synchronization errors for Example 1.
Mathematics 11 01291 g003
Figure 4. The chaotic attractor of the system (35).
Figure 4. The chaotic attractor of the system (35).
Mathematics 11 01291 g004
Figure 5. Evaluation of synchronization errors for Example 2.
Figure 5. Evaluation of synchronization errors for Example 2.
Mathematics 11 01291 g005
Figure 6. Evaluation of synchronization errors for Example 3.
Figure 6. Evaluation of synchronization errors for Example 3.
Mathematics 11 01291 g006
Table 1. Comparison of examples.
Table 1. Comparison of examples.
ExampleSystemDimensionController T c T 1 ξ i ζ j
1(33)2(7)1.852.03050.481.48
2(35)3(7)0.50.77580.580.58
3(35)3(26)0.50.76060.580.58
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Mahemuti, R.; Abdurahman, A. Predefined-Time (PDT) Synchronization of Impulsive Fuzzy BAM Neural Networks with Stochastic Perturbations. Mathematics 2023, 11, 1291. https://doi.org/10.3390/math11061291

AMA Style

Mahemuti R, Abdurahman A. Predefined-Time (PDT) Synchronization of Impulsive Fuzzy BAM Neural Networks with Stochastic Perturbations. Mathematics. 2023; 11(6):1291. https://doi.org/10.3390/math11061291

Chicago/Turabian Style

Mahemuti, Rouzimaimaiti, and Abdujelil Abdurahman. 2023. "Predefined-Time (PDT) Synchronization of Impulsive Fuzzy BAM Neural Networks with Stochastic Perturbations" Mathematics 11, no. 6: 1291. https://doi.org/10.3390/math11061291

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop