Next Article in Journal
Estimating the Rate of Convergence of the PH/M/1 Model by Reducing to Quasi-Birth-Death Processes
Previous Article in Journal
X-STATIS: A Multivariate Approach to Characterize the Evolution of E-Participation, from a Global Perspective
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fixed-Time Synchronization of Reaction-Diffusion Fuzzy Neural Networks with Stochastic Perturbations

College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(6), 1493; https://doi.org/10.3390/math11061493
Submission received: 28 February 2023 / Revised: 12 March 2023 / Accepted: 13 March 2023 / Published: 18 March 2023

Abstract

:
In this paper, we investigated the fixed-time synchronization problem of a type of reaction-diffusion fuzzy neural networks with stochastic perturbations by developing simple control schemes. First, some generalized fixed-time stability results are introduced for stochastic nonlinear systems. Based on these results, some generic fixed-time stability criteria are established and upper bounds of settling time are directly calculated by using several special functions. Then, the fixed-time synchronization of a type of reaction-diffusion fuzzy neural networks with stochastic perturbations is analysed by designing a type of controller which is more simple and thus have a better applicability. Finally, one numerical example with its Matlab simulations is provided to show the feasibility of developed theoretical results.

1. Introduction

Distributed parameter systems are kind of infinite dimensional dynamical systems described by partial differential equations, inverse differential equations or integral equations in abstract spaces. For instance, pattern dynamics in biology, the movement of electrons in non-uniform magnetic fields in physics, etc. These diffusion phenomena undoubtedly effect the stability of the system. Therefore, reaction-diffusion systems have been investigated since the 1960s, and has become a hot research topic due to their amazing applications in environment system, mechanical system, population system, and other fields [1,2,3].
In recent years, neural networks have been successfully applied in different field of application such as signal processing, parallel computing, pattern classification and nonlinear functions approximation. But these applications rely heavily on the stability, passivity, and dissipativity of the considered system. As mentioned above, the phenomenon of reaction-diffusion is common in nature. Therefore, it is of great significance to analyse the dynamical behaviours of reaction-diffusion neural networks and its application. Till now, many interesting results have emerged regarding the dynamic behavior of reaction-diffusion neural networks. For instance, in [4], several stability and passivity criteria for reaction-diffusion neural networks were established by exploiting some inequality techniques. Ref. [5] studied the asymptotic stability of reaction-diffusion neural networks with time-varying delays. In addition to the reaction-diffusion term, the influence of stochastic perturbations on the stability of the neural networks can not be ignored. As a result, many interesting results have emerged regarding the dynamic behavior of neural networks with stochastic perturbations or reaction-diffusion terms [3,6]. In [3], authors studied the exponential stability of the periodic solutions of impulsive stochastic reaction-diffusion neural networks with mixed time delays. Ref. [6] investigated the stochastic stability of delayed neural networks with local impulses. Additionally, uncertainty and fuzziness are inevitable in application of nonlinear dynamics. In order to consider the fuzziness, fuzzy cellular neural networks were proposed by Yang and Yang in 1986 [7,8]. Afterward, quite a few researchers have found that fuzzy neural networks can provide a useful paradigm for pattern recognition and image processing. Therefore, researchers have extensively considered the stability, synchronization and chaotic bifurcation of fuzzy neural networks with or without time delays, and published many excellent papers, such as [9,10,11,12,13,14], etc.
It is well known that fixed-time (FXT) synchronization or stability means that the system is global finite-time stable, and that the settling time (ST) is independent of the initial conditions of the system and can be bounded for any initial values of systems [15,16]. Compared with classical asymptotic stability, the biggest advantage of FXT stability is that it allows the system to respond to constraints in a finite time, thereby improving product quality or obtaining more reliable anti-interference ability in engineering applications, such as sliding mode controller design [17] and robot control [18]. As a result, FXT stability and synchronization of various systems has been extensively studied such as discontinuous systems [19,20], fuzzy systems [21] and impulsive systems [22], etc. However, till now, there are very few works on the study of FXT synchronization of reaction-diffusion fuzzy neural networks with stochastic perturbations.
Motivated by above discussions, in this paper, we considered the FXT synchronization of reaction-diffusion fuzzy neural networks with stochastic perturbations. The main innovations of this paper are as follows: (1) For the first time, the FXT synchronization issue of neural networks with three main factors such as reaction diffusion, fuzzy term and stochastic perturbations is considered. (2) Compared to some early published works, the introduced controller in this paper is more simple since it has only consisted of the power-law terms and not include linear term (3) The upper bound of ST is estimated more accurately by using some special function approach.
The rest of the paper is structured as follows. In Section 2, some basic definitions, corollaries, and lemmas for FXT synchronization with stochastic perturbations are presented. Section 3 gives the main results on FXT synchronization of reaction-diffusion fuzzy neural networks with stochastic perturbations. Section 4 provides one numerical example to verify the validity of obtained results. A conclusion of the paper and an outlook on the next research steps are given in Section 5.

2. Preliminaries

In this paper, we consider the following model:
d υ i ( t , x ) = [ l = 1 m D i l 2 υ i ( t , x ) x l 2 c i υ i ( t , x ) + j = 1 n a i j f j ( υ j ( t , x ) ) + j = 1 n b i j ν j + j = 1 n P i j f j ( υ j ( t , x ) ) + j = 1 n T i j ν j + j = 1 n Q i j f j ( υ j ( t , x ) ) + j = 1 n S i j ν j + I i ] d t + ρ i ( t , υ i ( t , x ) ) d w ( t ) , i = 1 , 2 , , n ,
where i I = { 1 , 2 , , n } , x = ( x 1 , x 2 , , x m ) T X R m , and X = { x | | x l | h l for l = 1 , 2 , , m } is a bounded compact set with smooth boundary X and m e s X 0 in space R m , where m e s X is the measure of the set X; D i l 0 stand for the transmission diffusion coefficients; υ i ( t , x ) corresponds to state variable of the ith neuron at time t in space x; c i denotes the passive decay rates to the i t h neuron; a i j are the connections weights among neurons; b i j are elements of fuzzy feed-forward template; f j is the activation function; T i j , S i j , P i j , Q i j respectively represent the elements of fuzzy feed-forward MIN template, fuzzy feed-forward MAX template, fuzzy feedback MIN template and fuzzy feedback MAX template; ν i and I i respectively denote the bias and input value of the ith neuron; ρ i ( t , · ) : R + × R R denotes the noise strength function; w ( t ) = ( w 1 ( t ) , w 2 ( t ) , , w ( t ) ) T is a -dimensional Brown motion defined on a complete probability space ( Ω , F , P ) ; ⋁ and ⋀ are the fuzzy OR and fuzzy AND operation, respectively.
We will study model (1) under the following Dirichlet-type boundary conditions and initial conditions:
υ i ( t , x ) = 0 , ( t , x ) ( t 0 , + ) × X , υ i ( t 0 , x ) = ϕ i ( x ) , x X ,
where ϕ i ( x ) is a bounded continuous function defined on X and satisfies compatibility condition. In this article, to investigate the FXT synchronization of system (1), we make the following assumptions:
Assumption 1 ([23]).
The activation functions f j satisfy the Lipschitz condition, i.e., there exist constants L j > 0 such that | f j ( z 1 ) f j ( z 2 ) | L j | z 1 z 2 | , z 1 , z 2 R .
Assumption 2.
For ρ ( t , · ) , there exists positive constant μ i 0 such that the inequality [ ρ i ( t , z 1 ) ρ i ( t , z 2 ) ] T [ ρ i ( t , z 1 ) ρ i ( t , z 2 ) ] μ i ( z 1 z 2 ) 2 holds true for any z 1 , z 2 R .
We give the corresponding slave system for the master system (1) as:
d ϑ i ( t , x ) = [ l = 1 m D i l 2 ϑ i ( t , x ) x l 2 c i ϑ i ( t , x ) + j = 1 n a i j f j ( ϑ j ( t , x ) ) + j = 1 n b i j ν j + j = 1 n P i j f j ( ϑ j ( t , x ) ) + j = 1 n T i j ν j + j = 1 n Q i j f j ( ϑ j ( t , x ) ) + j = 1 n S i j ν j + u i ( t , x ) ] d t + ρ i ( t , ϑ i ( t , x ) ) d w ( t ) ,
where u i ( t , x ) indicates the controller input and other parameters are the same as defined in the system (1). The boundary condition and initial value of system (2) are listed as:
ϑ i ( t , x ) = 0 , ( t , x ) ( t 0 , + ) × X , ϑ i ( t 0 , x ) = φ i ( x ) , x X .
Now consider the following general stochastic nonlinear system:
d z ( t ) = A ( z ( t ) ) d t + B ( z ( t ) ) d w ( t ) , z ( 0 ) = z 0 ,
where n 0 N + , z ( t ) R n 0 is the state variable of stochastic system (3), w ( t ) = ( w 1 ( t ) , w 2 ( t ) , , w ( t ) ) T is an -dimensional Brown motion on the probability space ( Ω , F , P ) . Functions A ( · ) : R n 0 R n 0 and B ( · ) : R n 0 R n 0 × are continuous functions and they satisfy A ( · ) = B ( · ) = 0 .
For simplicity, we let z ( t ) = z ( t , z 0 ) be the solution of system (3) which satisfies the initial condition z ( 0 ) = z 0 . The following definitions and lemmas will be used to obtain the main results of the paper:
Definition 1 ([24]).
The zero solution of system (3) is said to be FXT stable in probability, if the solution z ( t , z 0 ) exists for any initial condition of z 0 R n 0 , and the following statements are true:
(i) For any initial value z 0 ( 0 ) R n 0 , it holds that Pro { T ( z 0 , w ) < } = 1 , where T ( z 0 , w ) = inf { T 0 | z ( t , z 0 ) = 0 , t T } is called the stochastic ST.
(ii) For every pair of ϱ ( 0 , 1 ) and τ > 0 , there exists a δ = δ ( ϱ , τ ) > 0 such that P r o { | z ( t , z 0 ) | τ , t t 0 } 1 ϱ , for all | z 0 | δ .
(iii) Expectation of ST function T ( z 0 , w ) is nothing to the initial states z 0 of (3) and it is bounded by a positive constant T m a x . That is, E ( T ( z 0 , w ) ) T m a x for all z 0 R n 0 .
In this paper, let C 2 , 1 ( R + × R n 0 ; R + ) be the set of all non-negative function V ( t , z ) on R + × R n 0 its partial derivative for t continuous and second-order partial derivatives for z exist, then for each V C 2 , 1 ( R + × R n 0 ; R + ) , the operator £ V ( t , z ) is defined as:
£ V ( t , z ) = V t ( t , z ) + V z ( t , z ) f ( t , z ( t ) ) + 1 2 t r a c e [ ρ T ( t , z ( t ) ) V z z ρ ( t , z ( t ) ) ] ,
where V t ( t , z ) = V ( t , z ) t , V z ( t , z ) = V ( t , z ) z 1 , , V ( t , z ) z n 0 , V z z ( t , z ) = 2 V ( t , z ) z i z j n 0 × n 0 .
Lemma 1 ([25]).
Assume that V ( z ) : R n 0 R + is a positive definite Lyapunov function, function r ( ν ) V M 0 is continuous, where V M 0 denotes set of the bounded functions which is defined as
V M 0 = ϕ ( z ) | 0 1 ϕ ( z ) d z M , ϕ ( z ) 0 ,
where M > 0 is positive constant. For any z ( t ) = z ( t , z 0 ) with z 0 R n 0 , if the following differential inequality holds
£ V ( z ) ϕ ( V ( z ) ) ,
then the zero solution z = 0 of the system (3) is FXT stable in probability with a ST T ( z 0 , w ) which satisfies E [ T ( z 0 , w ) ] M .
Lemma 2 ([19,25,26]).
Suppose V ( z ) : R n 0 R is a C-regular function such that
£ V ( z ) k V ( z ( t ) ) α V p ( z ( t ) ) β V q ( z ( t ) ) , z ( t ) R n 0 { 0 } ,
where α > 0 , β > 0 , p > 1 and 0 < q < 1 , then the origin of system (3) is FXT stable in probability with a ST T ( z 0 , w ) which satisfy E [ T ( z 0 , w ) ] < T max , where
T max T max 1 k < 0 , T max 2 k = 0 , T max 3 0 < k < min { α , β } ,
T max 1 = 1 k τ ( 1 p ) ln 1 k β β α τ T max 2 = π ( p q ) β α τ c s c ( τ π ) , T max 3 = π c s c ( τ π ) α ( p q ) α β k 1 τ I α γ , τ , 1 τ + π c s c ( τ π ) β ( p q ) β α k τ I β γ , 1 τ , τ ,
where τ = 1 q p q , γ = α + β k . Especially when p + q = 2 , the estimation of ST can be given more precisely as E [ T ( y 0 , w ) ] < T ˜ m a x , where
T ˜ max T max 4 2 α β < k < 2 α β T max 5 k = 2 α β , T max 6 k < 2 α β ,
T max 4 = 1 p 1 2 σ π 2 + arctan k σ , T max 5 = 2 k ( p 1 ) , T max 6 = 1 ( p 1 ) σ ln k + σ k σ ,
where σ = 4 α β k 2 .
Lemma 3 ([27]).
Suppose z 1 and z 2 are two real numbers, then we have
| j = 1 n P i j f j ( z 1 ) j = 1 n P i j f j ( z 2 ) | j = 1 n | P i j | · | f j ( z 1 ) f j ( z 2 ) | , | j = 1 n Q i j f j ( z 1 ) j = 1 n Q i j f j ( z 2 ) | j = 1 n | Q i j | · f j ( z 1 ) f j ( z 2 ) .
Lemma 4 ([28]).
Let X be a cube | x l | < h l ( l = 1 , 2 , , m ) and assume that z ( x ) is a real-valued function belonging to C 1 ( X ) which vanishes on the boundary X of X, i.e, z ( x ) X = 0 . Then
X z 2 ( x ) d x h l 2 X | z x l | 2 d x , l = 1 , 2 , , m .
Lemma 5 ([29]).
If z 1 , z 2 , , z n 0 0 , 0 < η 1 < κ , then
s = 1 n 0 z s η s = 1 n 0 z s η , s = 1 n 0 z s κ m 1 κ s = 1 n 0 z s κ .

3. Main Results

In this section, we will derive some criteria to guarantee the FXT synchronization between master-slave systems (1) and (2). First, let e i ( t , x ) = ϑ i ( t , x ) υ i ( t , x ) be the synchronization error between master system (1) and slave system (2). In addition, according to the boundary conditions of (1) and (2), one has e i ( t , x ) = 0 for ( t , x ) ( t 0 , + ) × X , thus the error dynamical system can be listed as follows:
d e i ( t , x ) = [ l = 1 m D i l 2 e i ( t , x ) x l 2 c i e i ( t , x ) + j = 1 n a i j g j ( e j ( t , x ) ) + j = 1 n P i j g j ( e j ( t , x ) ) + j = 1 n Q i j g j ( e j ( t , x ) ) + u i ( t , x ) ] d t + ρ ˜ i ( t , e i ( t , x ) ) d w ( t ) ,
where g j ( e j ( t , x ) ) = f j ( ϑ j ( t , x ) ) f j ( υ j ( t , x ) ) , ρ ˜ i ( t , e i ( t , x ) ) = ρ i ( t , ϑ i ( t , x ) ) ρ i ( t , υ i ( t , x ) ) .
Now, to achieve FXT synchronization aim, we deign the controller u i ( t , x ) in slave system (2) as follows:
u i ( t , x ) = γ i e i [ δ ] ( t , x ) λ i e i [ θ ] ( t , x ) ,
where γ i > 0 , λ i > 0 , δ and θ are positive constants such that 0 < δ < 1 , θ > 1 , and
e i [ r ] ( t , x ) s i g n ( e i ( t , x ) ) | e i ( t , x ) | r , r > 0 .
Denote
k i = η i 2 c i + μ i + j = 1 m [ ( | a i j | + | P i j | + | Q i j | ) L j ) + ( | a j i | + | P j i | + | Q j i | ) L i ) ] ,
where η i = l = 1 m 2 D i l h l 2 , then the following theorem can be derived via the FXT controller (9).
Theorem 1.
Assume that the Assumptions 1 and 2 are satisfied, and the control parameters γ i and λ i in (9) satisfy the following condition
max i = 1 n { k i } < min { Λ 1 , Λ 2 } ,
then the master-slave systems (1) and (2) can achieve FXT synchronization in probability via controller (9), and it ST can be estimated by T m a x , where T m a x is defined in (6) with the parameters Λ 1 = 2 min i = 1 n { γ i } , Λ 2 = 2 n 1 θ 2 min i = 1 n { λ i } , α = 2 γ , β = 2 n 1 θ 2 λ , p = 1 + δ 2 , q = 1 + θ 2 , γ = min i { γ i } and λ = min i { λ i } .
Proof. 
Consider the following Lyapunov function:
V ( t ) = X i = 1 n e i 2 ( t , x ) d x .
Calculating the derivative of £ V ( t ) along the solution of system (8), we have
£ V ( t ) = X [ i = 1 n l = 1 m 2 e i ( t , x ) D i l 2 e i ( t , x ) x l 2 i = 1 n 2 e i ( t , x ) c i e i ( t , x ) + i = 1 n j = 1 n 2 e i ( t , x ) a i j g j ( e j ( t , x ) ) + i = 1 n 2 e i ( t , x ) j = 1 n P i j g j ( e j ( t , x ) ) + i = 1 n 2 e i ( t , x ) j = 1 n Q i j g j ( e j ( t , x ) ) i = 1 n 2 e i ( t , x ) γ i e i [ δ ] ( t , x ) i = 1 n 2 e i ( t , x ) λ i e i [ θ ] ( t , x ) + t r a c e ρ ˜ i T ( t , e i ( t , x ) ) ρ ˜ i ( t , e i ( t , x ) ) ] d x .
By the Green formula and boundary condition, one can has
X 2 e i ( t , x ) l = 1 m D i l 2 e i ( t , x ) x l 2 d x = 2 X e i ( t , x ) · D i l e i ( t , x ) x l l = 1 m d x = 2 X · e i ( t , x ) D i l e i ( t , x ) x l l = 1 m d x 2 X D i l e i ( t , x ) x l l = 1 m · e i ( t , x ) d x = 2 X e i ( t , x ) D i l e i ( t , x ) x l l = 1 m d S 2 X l = 1 m D i l e i ( t , x ) x l 2 d x = 2 X l = 1 m D i l e i ( t , x ) x l 2 d x ,
where D i l e i ( t , x ) x l l = 1 m = D i 1 e i ( t , x ) x 1 , , D i m e i ( t , x ) x m T , and = x 1 , , x m T is the gradient operator.
From Lemma 4
X 2 e i ( t , x ) l = 1 m D i l 2 e i ( t , x ) x l 2 d x = 2 X l = 1 m D i l e i ( t , x ) x l 2 d x l = 1 m 2 D i l h l 2 X e i 2 ( t , x ) d x = η i X e i 2 ( t , x ) d x ,
in which η i = l = 1 m 2 D i l h l 2 .
Using the Assumption 1 and inequality 2 z 1 z 2 z 1 2 + z 2 2 for any z 1 > 0 , z 2 > 0 , one has
i = 1 n j = 1 n 2 e i ( t , x ) a i j g j e j ( t , x ) i = 1 n j = 1 n 2 | e i ( t , x ) | | a i j | | g j ( e j ( t , x ) ) | i = 1 n j = 1 n 2 L j | a i j | | e i ( t , x ) | | e j ( t , x ) | i = 1 n j = 1 n L j | a i j | e i 2 ( t , x ) + e j 2 ( t , x ) i = 1 n j = 1 n L j | a i j | + L i | a j i | e i 2 ( t , x ) .
Similarly, by Lemma 3, we get
i = 1 n 2 e i ( t , x ) j = 1 n P i j g j e j ( t , x )   i = 1 n j = 1 n L j | P i j | + L i | P j i | e i 2 ( t , x ) ,
i = 1 n 2 e i ( t , x ) j = 1 n Q i j g j e j ( t , x )   i = 1 n j = 1 n L j | Q i j | + L i | Q j i | e i 2 ( t , x ) .
Also, by simple observation, we can have
i = 1 n 2 e i ( t , x ) γ i e i [ δ ] ( t , x ) = i = 1 n 2 γ i | e i ( t , x ) | 1 + δ ,
i = 1 n 2 e i ( t , x ) λ i e i [ θ ] ( t , x ) = i = 1 n 2 λ i | e i ( t , x ) | 1 + θ .
Finally, by Assumption 2, one can has
t r a c e ρ i T ( t , e i ( t , x ) ) ρ i ( t , e i ( t , x ) ) i = 1 n μ i e i 2 ( t , x ) .
Then in the view of (13)–(19), we obtain
£ ( V ( t ) ) X i = 1 n ( η i 2 c i + μ i + j = 1 n L j | Q i j | + j = 1 n L i | Q j i | + j = 1 n L j | P i j | + j = 1 n L i | P j i | + j = 1 n L j | a i j | + j = 1 n L i | a j i | ) e i 2 ( t , x ) d x 2 X i = 1 n γ i | e i ( t , x ) | 1 + δ d x 2 X i = 1 n λ i | e i ( t , x ) | 1 + θ d x X k i i = 1 n e i 2 ( t , x ) d x 2 X i = 1 n γ i | e i ( t , x ) | 1 + δ d x 2 X i = 1 n λ i | e i ( t , x ) | 1 + θ d x .
Furthermore, by Lemma 5, we have
X i = 1 n | e i ( t , x ) | 1 + δ d x X i = 1 n e i 2 ( t , x ) d x 1 + δ 2 = V 1 + δ 2 ( t ) ,
X i = 1 n | e i ( t , x ) | 1 + θ d x n 1 θ 2 X i = 1 n e i 2 ( t , x ) d x 1 + θ 2 = n 1 θ 2 V 1 + θ 2 ( t ) .
Furthermore, since γ i and λ i are positive, in view of (21) and (22), we can obtain
£ ( V ( t ) ) X k i i = 1 n e i 2 ( t , x ) d x 2 γ i X i = 1 n e i 2 ( t , x ) d x 1 + δ 2 2 λ i n 1 θ 2 X i = 1 n e i 2 ( t , x ) d x 1 + θ 2 k V ( t ) 2 γ V 1 + δ 2 ( t ) 2 n 1 θ 2 λ V 1 + θ 2 ( t ) ,
where k = max i n { k i } , γ = min i n { γ i } > 0 and λ = min i n { λ i } > 0 .
Let α = 2 γ , β = 2 n 1 θ 2 λ , p = 1 + δ 2 and q = 1 + θ 2 , then from the inequality (10) we get that k < min { α , β } . Therefore, based on Lemma 2, the master-slave systems (1) and (2) will realize FXT synchronization with the ST T m a x , which is given in (6). The proof is completed. □
Corollary 1.
Assume that the inequality (10), Assumptions 1 and 2 holds true. If δ + θ = 2 and k < 2 γ λ , where the control gains k , γ and λ are introduced in Theorem 1, then the master-slave systems (1) and (2) will realize FXT synchronization in probability with the ST T ˜ m a x , where T ˜ m a x is given in (7).
If the elements of fuzzy feedback MIN template and fuzzy feedback MAX template are removed from system (1), i.e., b i j = P i j = Q i j = T i j = S i j = 0 , then it is reduced to the following form
d υ i ( t , x ) = l = 1 m D i l 2 υ i ( t , x ) x l 2 c i υ i ( t , x ) + j = 1 n a i j f j ( υ i ( t , x ) ) + I i d t + ρ i ( t , υ i ( t , x ) ) d w ( t ) .
Accordingly, the corresponding slave system (2) degenerates as
d ϑ i ( t , x ) = l = 1 m D i l 2 ϑ i ( t , x ) x l 2 c i ϑ i ( t , x ) + j = 1 n a i j f j ( ϑ i ( t , x ) ) + I i + u i ( t , x ) d t + ρ i ( t , ϑ i ( t , x ) ) d w ( t ) .
For this case, we denote
k ˜ i = η i 2 c i + μ i + j = 1 n | a i j | L j + | a j i | L i .
Then, from Theorem 1 and Corollary 1, we can have the following Corollary.
Corollary 2.
Suppose that Assumptions 1 and 2 hold true. If the control parameters γ i and λ i in the controller (9) satisfy the condition (10), where k i is substituted by above given k i ˜ , then the master-slave systems (24) and (25) can achieve FXT synchronization in probability under the controller (9), and its ST is bounded by T m a x . Especially, if δ + θ = 2 and k max i { k ˜ i } < 2 γ λ , where γ and λ are defined in Theorem 1, then the systems (24) and (25) will achieve FXT synchronization with the ST T ˜ m a x , where T ˜ m a x is introduced in (7).
When the synchronization errors approach to 0, the discontinuous signum function in (9) may bring some poor chattering effects. To reduce or suppress this undesired influence, now we will achieve the FXT synchronization between master-slave systems (1) and (2) by introducing the following novel controller
u i ( t , x ) = γ i e i δ 1 δ 2 ( t , x ) λ i e i θ 1 θ 2 ( t , x ) ,
where γ i 0 , λ i > 0 , and δ 1 , δ 2 , θ 1 , θ 2 are positive odd integers satisfying δ 1 < δ 2 and θ 1 > θ 2 .
Theorem 2.
The systems (1) and (2) will achieve FXT synchronization in probability via the continuous controller (26), and its ST can be bounded by T m a x , as if Assumptions 1 and 2 hold true and the control gains γ i and λ i of (26) satisfy the inequality of (10). Especially, if δ 1 θ 2 + δ 2 θ 1 = 2 δ 2 θ 2 and k < 2 γ λ , where parameters k , γ and λ are introduced in Theorem 1, then the master-slave systems (1) and (2) will achieve FXT synchronization in probability with the ST T ˜ m a x , where T m a x and T ˜ m a x are given in (6) and (7) respectively, and their parameters are defined as α = 2 γ , β = 2 λ n θ 2 θ 1 2 θ 2 , p = δ 1 + δ 2 2 δ 2 and q = θ 1 + θ 2 2 θ 2 .
Proof. 
Similar to the proof of Theorem 1, we construct the Lyapunov function as V ( t ) = X i = 1 n e i 2 ( t , x ) d x , then we have
£ V ( t ) = X [ i = 1 n l = 1 m 2 e i ( t , x ) D i l 2 e i ( t , x ) x l 2 i = 1 n 2 e i ( t , x ) c i e i ( t , x ) + i = 1 n j = 1 n 2 e i ( t , x ) a i j g j ( e i ( t , x ) ) + i = 1 n 2 e i ( t , x ) j = 1 n P i j g j ( e j ( t , x ) ) + i = 1 n 2 e i ( t , x ) j = 1 n Q i j g j ( e j ( t , x ) ) i = 1 n 2 e i ( t , x ) γ i e i δ 1 δ 2 ( t , x ) i = 1 n 2 e i ( t , x ) λ i e i θ 1 θ 2 ( t , x ) ) + t r a c e ρ ˜ i T ( t , e i ( t , x ) ) ρ ˜ i ( t , e i ( t , x ) ) ] d x .
From Lemma 5, we get
X i = 1 n 2 e i ( t , x ) γ i e i δ 1 δ 2 ( t , x ) d x 2 min i = 1 n { γ i } X i = 1 n e i δ 1 + δ 2 δ 2 ( t , x ) d x = 2 γ X i = 1 n e i δ 1 + δ 2 δ 2 ( t , x ) d x 2 γ X i = 1 n e i 2 ( t , x ) d x δ 1 + δ 2 2 δ 2 = 2 γ V δ 1 + δ 2 2 δ 2 ( t ) ,
X i = 1 n 2 e i ( t , x ) λ i e i θ 1 θ 2 ( t , x ) d x 2 min i = 1 n { λ i } X i = 1 n e i θ 1 + θ 2 θ 2 ( t , x ) d x = 2 λ X i = 1 n e i θ 1 + θ 2 θ 2 ( t , x ) d x 2 λ n θ 2 θ 1 2 θ 2 X i = 1 n e i 2 ( t , x ) d x θ 1 + θ 2 2 θ 2 = 2 λ n θ 2 θ 1 2 θ 2 V θ 1 + θ 2 2 θ 2 ( t ) .
Then in view of (13)–(19), (28) and (29), we can obtain
£ ( V ( t ) ) X i = 1 n ( η i 2 c i + μ i + j = 1 n L j | Q i j | + j = 1 n L i | Q j i | + j = 1 n L j | P i j | + j = 1 n L i | P j i | + j = 1 n L j | a i j | + j = 1 n L i | a j i | ) e i 2 ( t , x ) d x 2 γ V δ 1 + δ 2 2 δ 2 ( t ) 2 n θ 2 θ 1 2 θ 2 λ V θ 1 + θ 2 2 θ 2 ( t ) k V ( t ) 2 γ V δ 1 + δ 2 2 δ 2 ( t ) 2 λ n θ 2 θ 1 2 θ 2 V θ 1 + θ 2 2 θ 2 ( t ) ,
where k = max i n { k i } .
Thus, based on Lemma 2, the master system (1) and slave system (2) will realize FXT synchronization in probability via controller (26) with the ST T m a x . Especially, when δ 1 θ 2 + δ 2 θ 1 = 2 δ 2 θ 2 ( for p + q = 2 ) and max i { k i } < 2 min i { γ i } × min i { λ i } n θ 2 θ 1 2 θ 2 (for k < 2 γ λ ) , then the master system (1) and the slave system (2) will achieve FXT synchronization in probability with ST T ˜ m a x , where T ˜ m a x is given in (7). □
From the results of Corollary 2 and Theorem 2, we can also obtain the following Corollary.
Corollary 3.
Assume that the Assumptions 1 and 2 are satisfied and control parameters γ i and λ i in (26) satisfy the condition (10), where k i is substituted by k i ˜ , then the systems (24) and (25) can be FXT synchronized under the continuous controller (26), and its ST is bounded by T m a x . Especially, when δ 1 θ 2 + δ 2 θ 1 = 2 δ 2 θ 2 and k max i { k ˜ i } < 2 γ λ , then the master-slave systems (24) and (25) can achieve FXT synchronized in probability via the continuous controller (26) with ST T ˜ m a x , where T ˜ m a x is introduced in (7), and its parameters are defined as α = 2 γ , β = 2 λ n θ 2 θ 1 2 θ 2 , p = δ 1 + δ 2 2 δ 2 and q = θ 1 + θ 2 2 θ 2 .
Remark 1.
In the previous studies [21,23,27,30,31,32], authors achieved FXT synchronization of deterministic fuzzy neural networks by employing a controller that uses a discontinuous signum function. However, this may bring poor chattering effects when synchronization errors approach to 0, and this may somewhat influences the synchronization property of the original master-slave systems. In Theorem 2 and Corollary 3, to overcome this sophisticated issue, we introduce a novel controller which does not use a signum function.
Remark 2.
In the previous studies [23,27,30,31,32,33], authors achieved FXT synchronization of various types of fuzzy neural networks with memristors, stochastic perturbations, or discontinuous neuron activations. However, till now there are seldom results on the FXT synchronization of fuzzy neural networks with reaction-diffusion terms. In this paper, for the first time, we have considered this issue by designing two types of controllers that did not include linear feedback term, but the results of previous works [27,30,31,32,33] were based on the controllers that use the linear feedback term as a main component. From this point, we can see that the obtained results of this paper are more general and thus have better applicability.

4. Numerical Examples and Simulations

In this section, we will provide one example to illustrate the effectiveness of the theoretical results derived above.
Example 1.
For n = 3 , consider the following reaction-diffusion fuzzy neural networks with stochastic perturbations
d υ i ( t , x ) = [ l = 1 3 D i l 2 υ i ( t , x ) x l 2 c i υ i ( t , x ) + j = 1 3 a i j f j ( υ i ( t , x ) ) + j = 1 3 b i j ν j + j = 1 3 P i j f j ( υ j ( t , x ) ) + j = 1 3 T i j ν j + j = 1 3 Q i j f j ( υ j ( t , x ) ) + j = 1 3 S i j ν j + I i ] d t + ρ i ( t , υ i ( t , x ) ) d w ( t ) ,
where the activation function f j ( r ) = t a n h r , D i l = 1 , h l = 5 , ρ i ( t , r ) = 0.15 r , c i = 1.128 , the other parameters are assumed as a 11 = 1.815 , a 12 = 4.6464 , a 13 = 4.6464 , a 21 = 4.6464 , a 22 = 1.5972 , a 23 = 6.3888 , a 31 = 4.6464 , a 32 = 6.3888 , a 33 = 1.452 , P 11 = 0.12 , P 12 = 0.18 , P 13 = 0.24 , P 21 = 0.24 , P 22 = 0.12 , P 23 = 1.92 , P 31 = 0.18 , P 32 = 0.336 , P 33 = 0.24 , Q 11 = 0.18 , Q 12 = 2.268 , Q 13 = 0.81 , Q 21 = 0.18 , Q 22 = 0.36 , Q 23 = 0.576 , Q 31 = 0.468 , Q 32 = 0.936 , Q 33 = 0.18 , b i j = T i j = S i j = 0 and I i = 0 for i , j , l = 1 , 2 , 3 . Its corresponding slave system is described as
d ϑ i ( t , x ) = [ l = 1 3 D i l 2 ϑ i ( t , x ) x l 2 c i ϑ i ( t , x ) + j = 1 3 a i j f j ( ϑ i ( t , x ) ) + j = 1 3 b i j ν j + j = 1 3 P i j f j ( ϑ j ( t , x ) ) + j = 1 3 T i j ν j + j = 1 3 Q i j f j ( ϑ j ( t , x ) ) + j = 1 3 S i j ν j + I i + u i ( t , x ) ] d t + ρ i ( t , ϑ i ( t , x ) ) d w ( t ) ,
where u i ( t , x ) is the controller and other parameters D i l , c i , a i j , b i j , P i j , T i j , Q i j , S i j , I i and ϱ i ( · , · ) , i , j = 1 , 2 , 3 are defined in system (31). Figure 1, Figure 2 and Figure 3 show the MATLAB simulations of the system (31) with initial values υ 1 = 0.0517 , υ 2 = 0.2146 , υ 3 = 0.4863 , j = 1 , 2 , 3 which indicates that system (31) has a chaotic attractor.
On the basis of the parameters given above, choosing γ 1 = γ 2 = γ 3 = 6 , λ 1 = λ 2 = λ 3 = 6.3 , p = 0.4 and q = 1.9 . It is not difficult to check that k 1 = 6.056 , k 2 = 9.8028 , k 3 = 10.0224 and L i = 1 for i = 1 , 2 , 3 . Since k = m a x { k 1 , k 2 , k 3 } = 10.0224 , then condition (10) of Theorem 1 holds true. Thus, we can get from Theorem 1 that the slave and master systems (31) and (32) are FXT synchronized in probability with the ST via controller (9). The corresponding simulation results are given in Figure 4, Figure 5 and Figure 6.

5. Conclusions

In this paper, the FXT synchronization issue of reaction-diffusion fuzzy neural networks with stochastic perturbations is analysed via using some inequality techniques and designing two types of novel controllers. It is worth to mention that the considered model in this paper is very general since it combines fuzzy logic, reaction-diffusion and stochastic perturbations. In addition, the introduced controller in this paper is much simpler since it does not include linear term, which was commonly used in most of the previous published works. We believe that the methods used in this paper can provide some insights to analyse the FXT synchronization of other types of reaction diffusion neural networks with complex-valued coefficients and impulsive effects. In future work, we will analyse the FXT synchronization of discontinuous reaction–diffusion BAM neural networks with stochastic perturbation and impulsive effects due to their applicability in symmetry-related problems.

Author Contributions

H.S.: Writing, Methodology and Visualization. A.A.: Visualization, Review, Editing and Funding acquisition. R.T.: Review and Editing. All authors have read and agreed to the published version of the manuscript.

Funding

This work was funded by the National Natural Science Foundation of China (Grant no. 62266042) and the Basic Research Program of Tianshan Talent Plan of Xinjiang, China (Grant no. 2022TSYCJU0005).

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. Serrano-Gotarredona, T.; Linares-Barranco, B. Log-domain implementation of complex dynamics reaction-diffusion neural networks. IEEE Trans. Neural Netw. 2003, 14, 1337–1355. [Google Scholar] [CrossRef]
  2. Wu, J. Theory and Applications of Partial Functional Differential Equations; Spriger: New York, NY, USA, 1996. [Google Scholar]
  3. Zhang, W.; Li, J.; Chen, M. Dynamical behaviors of impulsive stochastic reaction-diffusion neural networks with mixed time delays. Abstr. Appl. Anal. 2012, 2012, 309–323. [Google Scholar] [CrossRef] [Green Version]
  4. Wang, J.L.; Wu, H.N.; Guo, L. Passivity and stability analysis of reaction-diffusion neural networks with Dirichlet boundary conditions. IEEE Trans. Neural Netw. 2011, 22, 2105–2116. [Google Scholar] [CrossRef] [PubMed]
  5. Ma, Q.; Feng, G.; Xu, S. Delay-dependent stability criteria for reaction-diffusion neural networks with time-varying delays. IEEE Trans. Cybern. 2013, 43, 1913–1920. [Google Scholar] [CrossRef] [PubMed]
  6. Zhang, W.; Tang, Y.; Wong, W.K.; Miao, Q. Stochastic stability of delayed neural networks with local impulsive effects. IEEE Trans. Neural Netw. Learn. Syst. 2015, 26, 2336–2345. [Google Scholar] [CrossRef]
  7. Yang, T.; Yang, L.B.; Wu, C.W.; Chua, L.O. Fuzzy cellular neural networks: Theory. Proc. IEEE Int. Workshop Cell. Neural Netw. Appl. 1996, 1996, 181–186. [Google Scholar]
  8. Yang, T.; Yang, L.B.; Wu, C.W.; Chua, L.O. Fuzzy cellular neural networks: Applications. Proc. IEEE Int. Workshop Cell. Neural Netw. Appl. 1996, 1996, 225–230. [Google Scholar]
  9. Yao, X.; Liu, X.; Zhong, S. Exponential stability and synchronization of memristor-based fractional-order fuzzy cellular neural networks with multiple delays. Neurocomputing 2021, 419, 239–250. [Google Scholar] [CrossRef]
  10. Muhammadhaji, A.; Abdurahman, A. General decay synchronization for fuzzy cellular neural networks with time-varying delays. Int. J. Nonlinear Sci. Numer. Simul. 2019, 20, 551–560. [Google Scholar] [CrossRef]
  11. Hoomod, H.K.; Ali, A.A. Fuzzy-cellular neural network for face recognition HCI authentication. J. Physics: Conf. Ser. 2018, 1003, 012033. [Google Scholar] [CrossRef] [Green Version]
  12. Yang, G. New results on the stability of fuzzy cellular neural networks with time-varying leakage delays. Neural Comput. Appl. 2014, 25, 709–1715. [Google Scholar] [CrossRef]
  13. Li, Y.; Gault, R.; McGinnity, T.M. Probabilistic, recurrent, fuzzy neural network for processing noisy time-series data. IEEE Trans. Neural Netw. Learn. Syst. 2022, 33, 4851–4860. [Google Scholar] [CrossRef]
  14. Wang, Y.; Ishibuchi, H.; Er, M.J.; Zhu, J. Unsupervised multilayer fuzzy neural networks for image clustering. Inf. Sci. 2023, 622, 682–709. [Google Scholar] [CrossRef]
  15. Cao, J.; Li, R. Fixed-time synchronization of delayed memristor-based recurrent neural networks. Sci. China Inf. Sci. 2017, 60, 032201. [Google Scholar] [CrossRef]
  16. Wan, Y.; Cao, J.; Wen, G.; Yu, W. Robust fixed-time synchronization of delayed Cohen-Grossberg neural networks. Neural Netw. 2016, 73, 86–94. [Google Scholar] [CrossRef] [PubMed]
  17. Xiong, J.; Zhang, G.; Wang, J.; Yan, T. Improved sliding mode control for finite-time synchronization of nonidentical delayed recurrent neural networks. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 2209–2216. [Google Scholar] [CrossRef]
  18. Galicki, M. Finite-time control of robotic manipulators. Automatica 2015, 51, 49–54. [Google Scholar] [CrossRef]
  19. Hu, C.; He, H.; Jiang, H. Fixed/preassigned-time synchronization of complex networks via improving fixed-time stability. IEEE Trans. Cybern. 2021, 51, 2882–2892. [Google Scholar] [CrossRef]
  20. Hu, C.; Jiang, H. Special functions-based fixed-time estimation and stabilization for dynamic systems. IEEE Trans. Syst. Man, Cybern. Syst. 2022, 52, 3251–3262. [Google Scholar] [CrossRef]
  21. Kong, F.; Zhu, Q.; Huang, T. New fixed-time stability lemmas and applications to the discontinuous fuzzy inertial neural networks. IEEE Trans. Fuzzy Syst. 2021, 29, 3711–3722. [Google Scholar] [CrossRef]
  22. Li, H.; Li, C.; Huang, T.; Ouyang, D. Fixed-time stability and stabilization of impulsive dynamical systems. J. Frankl. Inst. 2017, 354, 8626–8644. [Google Scholar] [CrossRef]
  23. Abudusaimaiti, M.; Abdurahman, A.; Jiang, H.; Hu, C. Fixed/predefined-time synchronization of fuzzy neural networks with stochastic perturbations. Chaos Solitons Fractals 2022, 154, 111–596. [Google Scholar] [CrossRef]
  24. Lu, N.; Wu, X.; Feng, J.; Xu, Y. Fixed-time synchronization in probability of drive-response networks with discontinous nodes and noise disturbance. Nonlinear Dyn. 2019, 97, 297–311. [Google Scholar]
  25. Yu, J.; Li, J.; Yu, S. Fixed-time stability theorem of stochastic nonlinear systems. Int. J. Control. 2018, 92, 2194–2200. [Google Scholar] [CrossRef]
  26. Abdurahman, A.; Jiang, H.; Hu, C. Improved fixed-time stability results and application to synchronization of discontinuous neural networks with state-dependent switching. Int. J. Robust Nonlinear Control. 2021, 31, 5725–5744. [Google Scholar] [CrossRef]
  27. 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. Franklen Inst. 2018, 355, 6780–6809. [Google Scholar] [CrossRef]
  28. Lu, G.J. Global exponential stability and periodicity of reaction-diffusion delayed recurrent neural networks with Dirichlet boundary conditions. Chao, Solitins Fractals 2008, 35, 116–125. [Google Scholar] [CrossRef]
  29. Hardy, G.; Littlewood, J.; Polya, G. Inequalities, 2nd ed.; Cambridge University Press: Cambridge, UK, 1952. [Google Scholar]
  30. Sun, Y.; Liu, Y. Fixed-time synchronization of delayed fractional-order memristor-based fuzzy cellular neural networks. IEEE Access 2020, 8, 165951–165962. [Google Scholar] [CrossRef]
  31. 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]
  32. 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]
  33. Liu, Y.; Sun, Y. Fixed-time synchronization of fuzzy cellular neural networks with time-varying delays and discontinuous activations. IEEE Access 2020, 8, 65801–65811. [Google Scholar] [CrossRef]
Figure 1. Time valuation of υ 1 ( t , x ) in system (31).
Figure 1. Time valuation of υ 1 ( t , x ) in system (31).
Mathematics 11 01493 g001
Figure 2. Time valuation of υ 2 ( t , x ) in system (31).
Figure 2. Time valuation of υ 2 ( t , x ) in system (31).
Mathematics 11 01493 g002
Figure 3. Time valuation of υ 3 ( t , x ) in system (31).
Figure 3. Time valuation of υ 3 ( t , x ) in system (31).
Mathematics 11 01493 g003
Figure 4. Time evaluation of synchronization error of e 1 ( t , x ) .
Figure 4. Time evaluation of synchronization error of e 1 ( t , x ) .
Mathematics 11 01493 g004
Figure 5. Time evaluation of synchronization error of e 2 ( t , x ) .
Figure 5. Time evaluation of synchronization error of e 2 ( t , x ) .
Mathematics 11 01493 g005
Figure 6. Time evaluation of synchronization error of e 3 ( t , x ) .
Figure 6. Time evaluation of synchronization error of e 3 ( t , x ) .
Mathematics 11 01493 g006
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

Sadik, H.; Abdurahman, A.; Tohti, R. Fixed-Time Synchronization of Reaction-Diffusion Fuzzy Neural Networks with Stochastic Perturbations. Mathematics 2023, 11, 1493. https://doi.org/10.3390/math11061493

AMA Style

Sadik H, Abdurahman A, Tohti R. Fixed-Time Synchronization of Reaction-Diffusion Fuzzy Neural Networks with Stochastic Perturbations. Mathematics. 2023; 11(6):1493. https://doi.org/10.3390/math11061493

Chicago/Turabian Style

Sadik, Hayrengul, Abdujelil Abdurahman, and Rukeya Tohti. 2023. "Fixed-Time Synchronization of Reaction-Diffusion Fuzzy Neural Networks with Stochastic Perturbations" Mathematics 11, no. 6: 1493. https://doi.org/10.3390/math11061493

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