Next Article in Journal
Dynamics of a Fractional-Order IDSR Rumor Propagation Model with Time Delays
Previous Article in Journal
Static Shift Correction and Fractal Characteristic Analysis of Time-Frequency Electromagnetic Data
Previous Article in Special Issue
Optimal Coordination of Directional Overcurrent Relays Using an Innovative Fractional-Order Derivative War Algorithm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fixed-Time Adaptive Synchronization of Fractional-Order Memristive Fuzzy Neural Networks with Time-Varying Leakage and Transmission Delays

1
School of Finance and Mathematics, Huainan Normal University, Huainan 232038, China
2
School of Computer Science, Huainan Normal University, Huainan 232038, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2025, 9(4), 241; https://doi.org/10.3390/fractalfract9040241
Submission received: 22 February 2025 / Revised: 6 April 2025 / Accepted: 9 April 2025 / Published: 11 April 2025

Abstract

Finite-time synchronization depends on the initial conditions of the system in question. However, the initial conditions of an actual system are often difficult to estimate or even unknown. Therefore, a more valuable and pressing problem is fixed-time synchronization (FTS). This paper addresses the issue of FTS for a specific class of fractional-order memristive fuzzy neural networks (FOMFNNs) that include both leakage and transmission delays. We have designed two distinct discontinuous control methodologies that account for these delays: a state feedback control scheme and a fractional-order adaptive control strategy. Leveraging differential inclusion theory and fractional-order differential inequalities, we derive several novel algebraic conditions that are independent of delay. These conditions ensure the FTS of drive–response FOMFNNs in the presence of leakage and transmission delays. Additionally, we provide an estimate for the upper bound of the settling time required to achieve FTS. Finally, to validate the feasibility and applicability of our theoretical findings, we present two numerical examples which are accompanied by simulations.

1. Introduction

A memristor is a kind of nonlinear resistor with a memory function. The resistance of a memristor can change with the change in the current passing through it and displays corresponding resistance characteristics, which is very similar to the changing characteristic of the synaptic weight of a biological synapse under the stimulation of biological electrical signals [1]. So far, the memristor is the most apt component for simulating a biological synapse, and an artificial neural network using memristors to simulate neural synapses is called a memristive neural network. In addition, because the memristor is nano-sized, it has a higher level of integration and has incomparable advantages in the simulation of neuronal synapses; thus, memristive neural networks have rapidly become a research hotspot. Compared with traditional artificial neural networks, memristive neural networks can better simulate the structure and function of the human brain [2]. On the other hand, fractional-order calculus has “heredity” and “memory” characteristics, which makes fractional-order neural network more accurate than traditional integer-order neural networks in describing the complex relationship between a signal’s input and output and the dynamic behaviors of a neural network, such as self-adaptation, cognition, and decision-making [3].
Due to their widespread applications, the synchronization of NNs has been intensively studied in areas such cryptography, image encryption, secure communication, etc. Synchronization time is an important evaluation index of the synchronization performance of a system, and most of the existing research focuses on asymptotic synchronization [4], exponential synchronization [5], projective synchronization [6], adaptive synchronization [7], etc., which require very long or even infinite synchronization times, limiting these synchronization schemes’ practical application, so finding a fast synchronization method is a matter of great urgency.
Finite-time synchronization (FNS) ensures that the error between systems can converge in a finite time that can be calculated using an explicit expression of the synchronization time. Zhang et al. used the comparison principle to study the FNS of the switching hopping mismatched fractional memristive NN (FMNN) of BAM [8]. Du et al. presented an FNS control method for a type of time-delayed FMNN by using the fractional Gronwall inequality [9]. Anbalagand et al. investigated the FNS of a competitive FMNN [10]. Sun et al. studied the asymptotic synchronization and FNS of an inertial FMNN with a time-varying delay [11].
In FNS, the synchronization time cannot be estimated if the initial system is unknown. But, for FTS, one can calculate the upper bound of the synchronization time under the same conditions. Therefore, FTS is studied in this work. Reference [12] also considered adaptive control in the FTS of Cohen–Grossberg NNs with pulsed memristors. Reference [13] discussed the FTS control problem of random MNNs and presented two different controller design methods. The FTS of competing MNNs with different time scales has also been reported [14]. The FTS control of quaternion-valued MNNs with discontinuous activation functions was discussed in [15]. The FTS control of MNNs with discontinuous activation functions and mixed delays was presented in [16]. The FTS of fractional-order inertial fuzzy cellular NNs with mixed time-dependent delays was studied in [17].
On the other hand, the adaptive synchronization control strategy, which can modify the control intensity at any time, can reduce the cost of control more effectively. In addition, when the dynamic characteristics of the system fluctuate within a certain range, adaptive synchronization can still ensure a good control effect. The FTS of a fractional-order memristive fuzzy NN (FOMFNN) with leakage and transmission delays [18] and the adaptive FTS of fractional fuzzy cellular NNs with a time delay [19] have recently been studied.
Various types of time delays (e.g., time-dependent delays, proportional delays, and distributed delays) are often encountered in NNs [20]. The leakage delays in the negative feedback items related to the states of NNs can destabilize the dynamics of the system, making it more of a challenge to process the leakage item [21]. So, there is significance to considering the effect of leakage delays on NNs, and [22,23,24,25] are some recent reports on this topic.
In this paper, we discuss the FTS and AFTS of FOMFNNs with time-varying leakage and transmission delays. The main highlights of this paper are listed as follows:
(i) Memristors, leakage delays, transmission delays, fuzziness, and fractional derivatives are all considered in the FTS and AFTS analyses of the proposed NNs, which complement similar studies without fuzziness, without fuzziness or a leakage delay, and without memristors or fuzziness.
(ii) Two control schemes that consider leakage and transmission delays are proposed to achieve FTS and AFTS, which include the design of a state feedback controller and a fractional-order adaptive controller.
(iii) Based on the Lyapunov functional method and some fractional-order differential inequalities, some effective criteria, according to algebraic inequalities, are derived to accomplish the FTS of the considered NNs, which are easy to put into effect in reality to avert the complex computation of matrix inequalities.
The rest of this paper is organized as follows: Section 2 presents several definitions and lemmas. Section 3 analyzes the FTS and AFTS of FOMFNNs and derives some new criteria for achieving these synchronizations. Section 4 verifies the obtained results using two numerical examples. Section 5 concludes this article.

2. Preliminaries

Definition 1 
([11]). The Caputo fractional integral of order ω is defined as follows:
I ω z ( x ) = 1 Γ ( ω ) x 0 x ( x s ) ω 1 z ( s ) d s ,
where ω R + , x > x 0 , and Γ ( · ) is the Gamma function.
Definition 2 
([11]). The Caputo fractional derivative of order ω is defined as follows:
D ω t 0 C z ( x ) = 1 Γ ( m ω ) x 0 x ( x s ) m ω 1 z ( m ) ( s ) d s ,
where m R + and m 1 ω < m .
In this paper, we investigate FMCNNs with the leakage delay that follows:
D ω t 0 C p i ( t ) = α i p i ( t τ 1 ( t ) ) + r = 1 M ϕ i r ( p i ( t ) ) f r ( p r ( t ) ) + r = 1 M ψ i r ( p i ( t τ 2 ( t ) ) ) f r ( p r ( t τ 2 ( t ) ) ) + H i ( p ( t ) ) + I i p i ( υ ) = ζ i ( υ ) , υ [ t 0 τ , t 0 ] , i = 1 , , M ,
where
H i ( p ( t ) ) = r = 1 M g i r v r + r = 1 M T i r ν r + r = 1 M a i r f r ( p r ( t τ 2 ( t ) ) ) + r = 1 M S i r ν r + r = 1 M b i r f r ( p r ( t τ 2 ( t ) ) )
ϕ i r ( p i ( t ) ) = ϕ i r , | p i ( t ) | Γ i ϕ i r , | p i ( t ) | > Γ i , ψ i r ( p i ( t τ 2 ( t ) ) ) = ψ i r , | p i ( t τ 2 ( t ) ) | Γ i ψ i r , | p i ( t τ 2 ( t ) ) | > Γ i
and D ω t 0 C represents a ω -order Caputo fractional derivation where 0 < ω < 1 . f r ( · ) denotes the activation function. α i > 0 denotes the weight of the self-feedback connection. τ ( t ) is the time-dependent delay, and τ 1 ( t ) , τ 2 ( t ) [ 0 , τ ] . ϕ i r ( p i ( t ) ) and ψ i r ( p i ( t ) ) represent the memristive connection weights. g i r denotes the feedforward template; a i r , b i r and T i r , S i r represent the elements of the fuzzy feedback and backward MIN and MAX template, respectively; ⋁ and ⋀ are the fuzzy OR and AND operations, respectively; and I i is the bias value. ϕ i r , ϕ i r , ψ i r , n ψ i r are known constants, and Γ i > 0 denotes the switching jump value of the memristor. ζ i ( ι ) are the initial system values.
Remark 1. 
Compared to the systems in [18,26,27,28], System (1) is more general. It degenerates into Model [18] for constant τ 1 ( t ) and τ 2 ( t ) . It degenerates into Model [26] if the memristive weights are constants. If H i ( p ( t ) ) = 0 , it degenerates into Model [27]. If H i ( p ( t ) ) = τ 1 ( t ) = ψ i r ( p i ( t τ 2 ( t ) ) ) = 0 , it degenerates into Model [28].
Let ϕ i r = min { ϕ i r , ϕ i r } , ϕ i r + = max { ϕ i r , ϕ i r } , ψ i r = min { ψ i r , ψ i r } , and ψ i r + = max { ψ i r , ψ i r } . Based on the differential inclusion theory and measurable selection theory [29], there exist ϕ i r c o ( ϕ i r ( q i ( t ) ) ) = [ ϕ i r , ϕ i r + ] , ψ i r c o ( ψ i r ( q i ( t τ 2 ( t ) ) ) ) = [ ψ i r , ψ i r + ] such that
D ω t 0 C p i ( t ) = α i p i ( t τ 1 ( t ) ) + r = 1 M ψ i r f r ( p r ( t τ 2 ( t ) ) ) + r = 1 M ϕ i r f r ( p r ( t ) ) + H i ( p ( t ) ) + I i p i ( υ ) = ζ i ( υ ) , υ [ t 0 τ , t 0 ] , i = 1 , , M ,
The response system is given by
D ω t 0 C q i ( t ) = α i q i ( t τ 1 ( t ) ) + r = 1 M ϕ i r f r ( q r ( t ) ) + r = 1 M ψ i r f r ( q r ( t τ 2 ( t ) ) ) + H i ( q ( t ) ) + u i + I i q i ( υ ) = ξ i ( υ ) , υ [ t 0 τ , t 0 ] , i = 1 , , M ,
where
H i ( q ( t ) ) = r = 1 M g i r v r + r = 1 M T i r ν r + r = 1 M a i r f r ( q r ( t τ 2 ( t ) ) ) + r = 1 M S i r ν r + r = 1 M b i r f r ( q r ( t τ 2 ( t ) ) )
and ξ i ( υ ) represents the initial values of System (3).
By defining the synchronization error as e i ( t ) = q i ( t ) p i ( t ) , we obtain the following error system:
D ω t 0 C e i ( t ) = α i e i ( t τ 1 ( t ) ) + r = 1 M ϕ i r f r ( e r ( t ) ) + r = 1 M ψ i r f r ( e r ( t τ 2 ( t ) ) ) + r = 1 M a i r f r ( e r ( t τ 2 ( t ) ) ) + r = 1 M b i r f r ( e r ( t τ 2 ( t ) ) ) + u i ( t ) e i ( υ ) = ξ i ( υ ) ζ i ( υ ) , υ [ t 0 τ , t 0 ] , i = 1 , 2 , , M .
where
f r ( e r ( t ) ) = f r ( q r ( t ) ) f r ( p r ( t ) ) f r ( e r ( t τ 2 ( t ) ) ) = f r ( q r ( t τ 2 ( t ) ) ) f r ( p r ( t τ 2 ( t ) ) )
Definition 3. 
FTS is said to be achieved for the above drive–response systems if there exists a settling time function T ( e ( t 0 ) ) such that
lim t T ( e ( t 0 ) ) e ( t ) = 0 e ( t ) = 0 , t T ( e ( t 0 ) ) T ( e ( t 0 ) ) T max , e ( t 0 ) C n [ t 0 τ , t 0 ]
where · represents the Euclidean norm and T max is the settling time.
Assumption 1. 
For q r ( t ) , p r ( t ) R , there exists constants L r > 0 such that
| f r ( q r ( t ) ) f r ( p r ( t ) ) | L r | q r ( t ) p r ( t ) | , r = 1 , 2 , , N .
Lemma 1 
([30]). Suppose that x ( t ) C 1 [ 0 , T ] . Then,
D β 1 t 0 C D β 2 t 0 C x ( t ) = D β 1 + β 2 t 0 C x ( t ) ,
where β 1 , β 2 > 0 , β 1 + β 2 1 , and T is a positive constant.
Lemma 2 
([31]). If χ ( t ) C 1 [ t 0 , ] , 0 < ω 1 , then
D ω t 0 C | χ ( t ) | s i g n ( χ ( t ) ) t 0 C D ω χ ( t )
holds.
Lemma 3 
([32]). Let p r ( t ) , q r ( t ) , a i r , b i r R , f r : R R be a continuous function, i , r = 1 , 2 , , N . Then,
| r a i r f r ( p r ( t ) ) r a i r f r ( q r ( t ) ) | r | a i r | | f r ( p r ( t ) ) f r ( q r ( t ) ) | | r b i r f r ( p r ( t ) ) r b i r f r ( q r ( t ) ) | r | b i r | | f r ( p r ( t ) ) f r ( q r ( t ) ) |
Lemma 4 
([32]). If a 1 , a 2 , , a M 0 , μ > 1 , 0 < ν 1 , then
i a i μ M 1 μ i = 1 n a i μ , i a i ν i a i ν
Lemma 5 
([33]). If there exists a regular, positive, definite, and radially unbounded function V ( x ) : R n R and the constants a , b , δ , k > 0 and δ k > 1 meet,
V ˙ ( e ( t ) ) a V δ ( e ( t ) ) + b k , e ( t ) R n { 0 }
then we obtain V ( e ( t ) ) = 0 , t T ( e ( t 0 ) ) , while the settling time is estimated by
T ( e ( t 0 ) ) T m a x = 1 b k b a 1 δ 1 + 1 δ k 1

3. Main Results

In this paper, two kinds of synchronization controllers are designed; one is feedback controller, and the other is adaptive controller. Both can make the considered neural network achieve fixed-time synchronization. The first controller is as follows:
u i ( t ) = δ i e i ( t ) sign ( e i ( t ) ) θ i | e i ( t τ 1 ( t ) ) | + η i | e i ( t τ 2 ( t ) ) | + γ i ( λ i D ω 1 t 0 C | e i ( t ) | ) l + σ i
The second controller is as follows:
u i ( t ) = δ i ( t ) e i ( t ) sign ( e i ( t ) ) ( θ i ( t ) | e i ( t τ 1 ( t ) ) | + η i ( t ) | e i ( t τ 2 ( t ) ) | + γ i ( λ i D ω 1 t 0 C | e i ( t ) | ) l + σ i ) δ ˙ i ( t ) = λ i κ i | e i ( t ) | ϵ 1 2 l δ i ( t ) δ i ^ 2 l 1 θ ˙ i ( t ) = λ i ϱ i | e i ( t τ 1 ( t ) ) | ϵ 2 2 l θ i ( t ) θ i ^ 2 l 1 η ˙ i ( t ) = λ i ρ i | e i ( t τ 2 ( t ) ) | ϵ 3 2 l η i ( t ) η i ^ 2 l 1
where s i g n ( · ) is the symbolic function and l > 1 , δ i > 0 , σ i > 0 , θ i > 0 , η i > 0 , γ i > 0 are the constants to be ascertained. λ i , κ i , ϱ i , ρ i , ϵ 1 , ϵ 2 , ϵ 3 are appropriate constants, δ ^ i , θ ^ i , η ^ i are adaptive constants, and δ i ( t ) , θ i ( t ) , η i ( t ) denote adaptive control gains.
Remark 2. 
The feedback control scheme (5) and adaptive control scheme (6) are different from the existing state feedback schemes in [26] and adaptive control schemes in [27], respectively. Both Controllers (5) and (6) contain a leakage delay and transmission delay, and Controller (6) also allows for fractional derivative behavior, which can reduce the control cost by using state information. In (5) and (6), the terms with time delays are used to remove the time delays, and the term σ r sign ( e r ( t ) ) is a mixed term that can improve the speed of the response.
Theorem 1. 
Under Assumption 1, Systems (2) and (3) can achieve fixed-time synchronization using Controller (5), if there exist some positive numbers θ i , δ i , η i such that
θ i α i δ i L i λ i r = 1 M λ r | ϕ r i | η i L i λ i r = 1 M λ r | ψ r i | + | a r i | + | b r i |
for i = 1 , 2 , , M . Furthermore, the settling time T max can be calculated using the following equation:
T max = 1 Θ ( l 1 ) Θ Λ M 1 l 1 l
where Λ = min 1 i M { λ i γ i } and Θ = i = 1 M λ i σ i .
Proof. 
Given the Lyapunov function (9)
V ( e ( t ) ) = i λ i D ω 1 t 0 C | e i ( t ) |
V ( e ( t ) ) 0 and if and only if e ( t ) = 0 , V ( e ( t ) ) = 0 . Then, the derivative of ( ) can be calculated by using Lemma 1.
V ˙ ( e ( t ) ) = D ω t 0 C D 1 ω t 0 C V ( e ( t ) ) = D ω t 0 C D 1 ω t 0 C i λ i D ω 1 t 0 C | e i ( t ) | = D ω t 0 C D 1 ω t 0 C D ω 1 t 0 C i λ i | e i ( t ) | = i D ω t 0 C | e i ( t ) |
Based on Lemma 2 and (4),
V ˙ ( e ( t ) ) i λ i sign ( e i ( t ) ) D ω t 0 C e i ( t ) = i λ i sign ( e i ( t ) ) { α i e i ( t τ 1 ( t ) ) + r ϕ i r f r ( e r ( t ) ) + r ψ i r f r ( e r ( t τ 2 ( t ) ) ) + i a i r f r ( e r ( t τ 2 ( t ) ) ) + r b i r f r ( e r ( t τ 2 ( t ) ) ) + u i ( t ) } i λ i α i | e i ( t τ 1 ( t ) ) | + i r λ i | ϕ i r f r ( e r ( t ) ) | + i r λ i | ψ i r f r ( e r ( t τ 2 ( t ) ) ) | + i λ i | r a i r f r ( e r ( t τ 2 ( t ) ) ) | + i λ i | r b i r f r ( e r ( t τ 2 ( t ) ) ) | + i λ i sign ( e i ( t ) ) u i ( t ) .
Using Assumption 1 and Lemma 3, we obtain
i r λ i | ϕ i r f r ( e r ( t ) ) | i r λ i L r | ϕ i r | | e r ( t ) | ,
i r λ i | ψ i r f r ( e r ( t τ 2 ( t ) ) ) | i r λ i L r | ψ i r | | e r ( t τ 2 ( t ) ) | ,
i λ i | r a i r f r ( e r ( t τ 2 ( t ) ) ) | i r λ i L r | a i r | | e r ( t τ 2 ( t ) ) | ,
i λ i | r b i r f r ( e r ( t τ 2 ( t ) ) ) | i r λ i L r | b i r | | e r ( t τ 2 ( t ) ) | .
By substituting (11)–(14) into (10),
V ˙ ( e ( t ) ) i λ i α i | e i ( t τ 1 ( t ) ) | + i r λ i L r | ϕ i r | | e r ( t ) | + i r λ r L i ( | ψ i r | + | a i r | + | b i r | ) | e i ( t τ 2 ( t ) ) | + i λ i sign ( e i ( t ) ) u i ( t )
From Formula (5), we obtain
i λ i sign ( e i ( t ) ) u i ( t ) = i λ i θ i | e i ( t τ 1 ( t ) ) | + η i | e i ( t τ 2 ( t ) ) | i λ i γ i ( λ i D ω 1 t 0 C | e i ( t ) | ) l i λ i σ i .
Combining (15) and (16), one finds that
V ˙ ( e ( t ) ) i λ i ( α i θ i ) | e i ( t τ 1 ( t ) ) | i δ i r λ r L i | ϕ r i | λ i λ i | e i ( t ) | + i r λ r L i ( | ψ r i | + | a r i | + | b r i | ) η i λ i | e i ( t τ 2 ( t ) ) | i λ i γ i ( λ i D ω 1 t 0 C | e i ( t ) | ) l i λ i σ i .
From (7), we obtain
V ˙ ( e ( t ) ) i λ i γ i λ i D ω 1 t 0 C | e i ( t ) | l i λ i σ i
Thus,
V ˙ ( e ( t ) ) Λ i λ i D ω 1 t 0 C | e i ( t ) | l Θ
where Λ = min 1 i N { λ i γ i } and Θ = i λ i σ i . From Lemma 4,
V ˙ ( e ( t ) ) Λ M 1 l V ( e ( t ) ) l Θ
Assume k = 1 in Lemma 5. By using the fixed-time stability of the origin, we can calculate T max as follows:
T max = 1 Θ ( l 1 ) Θ Λ M 1 l 1 l
Remark 3. 
Asymptotic stability has been widely studied in the dynamics of nonlinear systems. But in practical applications, people usually expect the system to be in a stable state for a certain duration, which makes asymptotic stability no longer applicable. From this, the concepts of time-limited stability and fixed-time stability emerged. Compared to finite-time stability, fixed-time stability has been improved based on its definition; that is, the upper bound of the system’s stability time is not affected by the initial state of the system. This has significant practical significance, as the initial state of actual systems is often difficult or even impossible to obtain.
Remark 4. 
The adaptive controller in (6) can ascertain unknown model parameters from the input and output information and is extremely robust against external interference and uncertainties. It is not easy to choose the feedback control parameters δ i , θ i , and η i for Controller (5), so the FTS of the driving response system will be achieved using the adaptive scheme.
Theorem 2. 
Under Assumption 1, Systems (2) and (3) can achieve fixed-time synchronization through Controller (6) if there exist some positive numbers λ i , κ i , ϱ i , ρ i , σ i , ϵ 1 , ϵ 2 , ϵ 3 , θ ^ i , δ ^ i , and η ^ i such that the following conditions hold:
θ ^ i α i δ ^ i L i λ i r = 1 M λ r | ϕ r i | η ^ i L i λ i r = 1 M λ r | ψ r i | + | a r i | + | b r i |
for i = 1 , 2 , , M . Furthermore, the settling time T max can be calculated using the following equation:
T max = 1 Θ ( l 1 ) Θ Ω M 1 l 1 l
where Ω = min 1 i M { λ i γ i , κ i l 1 ϵ 1 l , ϱ i l 1 ϵ 2 l , ρ i l 1 ϵ 3 l } and Θ = i = 1 M λ i σ i .
Proof. 
Given Lyapunov Function (22),
V ( e ( t ) ) = i λ i D ω 1 t 0 C | e i ( t ) | + i 1 2 κ i ( δ i ( t ) δ i ^ ) 2 + i 1 2 ϱ i ( θ i ( t ) θ i ^ ) 2 + i 1 2 ρ i ( η i ( t ) η i ^ ) 2
by deriving V ( e ( t ) ) along (4) and using Lemma 2, we obtain
V ˙ ( e ( t ) ) i λ i sign ( e i ( t ) ) D ω t 0 C e i ( t ) + i 1 κ i ( δ i ( t ) δ ^ i ) δ i ˙ ( t ) + i 1 ϱ i ( θ i ( t ) θ ^ i ) θ i ˙ ( t ) + i 1 ρ i ( η i ( t ) η ^ i ) η i ˙ ( t )
By combining Formulas (15), (23), and (6), one can obtain
V ˙ ( e ( t ) ) i λ i ( α i θ ^ i ) | e i ( t τ 1 ( t ) ) | i δ ^ i r λ r L i | ϕ r i | λ i λ i | e i ( t ) | + i r λ r L i ( | ψ r i | + | a r i | + | b r i | ) λ i η ^ i | e i ( t τ 2 ( t ) ) | i λ i γ i λ i D ω 1 t 0 C | e i ( t ) | l i κ i l 1 ϵ 1 l 1 2 κ i ( δ i ( t ) δ i ^ ) 2 l i ϱ i l 1 ϵ 2 l 1 2 ϱ i ( θ i ( t ) θ i ^ ) 2 l i ρ i l 1 ϵ 3 l 1 2 ρ i ( η i ( t ) η i ^ ) 2 l i λ i σ i
From (20), we know that
V ˙ ( e ( t ) ) i λ i γ i λ i D ω 1 t 0 C | e i ( t ) | l i κ i l 1 ϵ 1 l 1 2 κ i ( δ i ( t ) δ i ^ ) 2 l i ϱ i l 1 ϵ 2 l 1 2 ϱ i ( θ i ( t ) θ i ^ ) 2 l i ρ i l 1 ϵ 3 l 1 2 ρ i ( η i ( t ) η i ^ ) 2 l i λ i σ i
Let Ω = min 1 i M { λ i γ i , κ i l 1 ϵ 1 l , ϱ i l 1 ϵ 2 l , ρ i l 1 ϵ 3 l } . Using Lemma 4 yields
V ˙ ( e ( t ) ) Ω ( i λ i D ω 1 t 0 C | e i ( t ) | l + i 1 2 κ i ( δ i ( t ) δ i ^ ) 2 l + i 1 2 ϱ i ( θ i ( t ) θ i ^ ) 2 l + i 1 2 ρ i ( η i ( t ) η i ^ ) 2 l ) i λ i σ i Ω M 1 l V ( e ( t ) ) l Θ
Assume k = 1 in Lemma 5. By using the fixed-time stability of the origin, we determine T max as follows:
T max = 1 Θ ( l 1 ) Θ Ω M 1 l 1 l
Remark 5. 
The settling time in this paper is based on Lemma 5, and the algorithm of the settling time in Lemma 5 itself is an optimized result. In fact, in the proof of Lemma 1, an estimation of the settling time is given by
T s 0 + 1 ( a ω δ + b ) k d ω = 0 r 1 ( a ω δ + b ) k d ω + r + 1 ( a ω δ + b ) k d ω 0 r 1 b k d ω + r + 1 a k ω δ k d ω = r b k + 1 a k ( δ k 1 ) r 1 δ k
where r is an arbitrary positive number. To give a less conservative and more accurate estimation of T s , let
φ ( r ) = r b k + 1 a k ( δ k 1 ) r 1 δ k
Then,
φ ˙ ( r ) = 1 b k + 1 a k ( δ k 1 ) r δ k
which shows that φ ( r ) reaches its minimum value φ ^ , given by
φ ^ = 1 b k b a 1 δ 1 + 1 δ k 1
On the other hand, we can optimize the estimation of the settling time by choosing suitable parameters a , b , k , δ for different applications. In fact, if a > b e and δ = ln b a ln b a + 1 , a less conservative estimation of the settling time function T s can be obtained by
T s T m a x = ln b a b b a 1 + 1 ln b a .

4. Numerical Simulations

This section validates the effectiveness of Theorems 1 and 2 through two numerical examples.
Example 1. 
Take the drive–response systems
D ω t 0 C p i ( t ) = α i p i ( t τ 1 ( t ) ) + r = 1 3 ϕ i r ( p i ( t ) ) f r ( p r ( t ) ) + r = 1 3 ψ i r ( p i ( t τ 2 ( t ) ) ) f r ( p r ( t τ 2 ( t ) ) ) + H i ( p ( t ) ) + I i p i ( υ ) = ζ i ( υ ) , υ [ τ , t 0 ] , i = 1 , 2 , 3 ,
where
H i ( p ( t ) ) = r = 1 3 g i r v r + r = 1 3 T i r ν r + r = 1 3 a i r f r ( p r ( t τ 2 ( t ) ) ) + r = 1 3 S i r ν r + r = 1 3 b i r f r ( p r ( t τ 2 ( t ) ) )
with following system parameters:
Γ 1 = Γ 2 = Γ 3 = 1 , α 1 = α 2 = α 3 = 1 , l = 1.8 , ω = 0.95 ϕ 11 = 2.0 , ϕ 12 = 1 , ϕ 13 = 1.8 , ϕ 21 = 0.8 , ϕ 22 = 1.5 , ϕ 23 = 1.0 , ϕ 31 = 1.1 , ϕ 32 = 2.0 , ϕ 33 = 1.5 , ϕ 11 = 2.2 , ϕ 12 = 1.2 , ϕ 13 = 2.0 , ϕ 21 = 1.0 , ϕ 22 = 1.8 , ϕ 23 = 1.5 , ϕ 31 = 1.0 , ϕ 32 = 1.7 , ϕ 33 = 2.0 ψ 11 = 2.0 , ψ 12 = 0.5 , ψ 13 = 1.5 , ψ 21 = 2.5 , ψ 22 = 5.0 , ψ 23 = 2.5 ψ 31 = 2.4 , ψ 32 = 2.0 , ψ 33 = 4.5 , ψ 11 = 1.5 , ψ 12 = 1.0 , ψ 13 = 2.0 ψ 21 = 2.2 , ψ 22 = 4.5 , ψ 23 = 3.0 , ψ 31 = 2.0 , ψ 32 = 18 , ψ 33 = 5 a 11 = a 13 = a 22 = a 23 = a 31 = a 32 = 0.1 , a 12 = a 21 = 0.2 , a 33 = 0.1 b 11 = b 13 = b 22 = b 31 = 0.2 , b 12 = b 21 = 0.2 , b 23 = b 32 = 0.1 , b 33 = 0.1 S 11 = S 22 = S 33 = 0.1 , S 12 = S 13 = S 21 = S 23 = S 31 = S 32 = 0.1 T 11 = T 22 = T 33 = 0.1 , T 12 = T 13 = T 21 = T 23 = T 31 = T 32 = 0.1 g i r = 1.0 , v r = 1 , i , r = 1 , 2.3
Let f i ( p ( t ) ) = t a n h ( | p ( t ) | ) 1 , I i = 0.1 , L i = 1 , i = 1 , 2 , 3 , τ 1 ( t ) = t a n h ( t ) , and τ 2 ( t ) = e t 1 + e t . The initial values of System (27) are ζ 1 ( υ ) = 0.3 , ζ 2 ( υ ) = 0.6 , ζ 3 ( υ ) = 0.2 , υ [ τ ( t ) , 0 ] .
The response system is
D ω t 0 C q i ( t ) = α i q i ( t τ 1 ( t ) ) + r = 1 3 ϕ i r ( q i ( t ) ) f r ( q r ( t ) ) + r = 1 3 ψ i r ( q i ( t τ 2 ( t ) ) ) f r ( q r ( t τ 2 ( t ) ) ) + H i ( q ( t ) ) + u i + I i q i ( υ ) = ξ i ( υ ) , υ [ τ , t 0 ] , i = 1 , 2 , 3 ,
where
H i ( q ( t ) ) = r = 1 3 g i r v r + r = 1 3 T i r ν r + r = 1 3 a i r f r ( q r ( t τ 2 ( t ) ) ) + r = 1 3 S i r ν r + r = 1 3 b i r f r ( q r ( t τ 2 ( t ) ) )
The parameters are the same as those in System (27). The initial values of System (29) are ξ 1 ( υ ) = 0.3 , ξ 2 ( υ ) = 0.6 , ξ 3 ( υ ) = 0.2 , υ [ τ ( t ) , 0 ] .
According to Theorem 1, the control parameters θ i , δ i , η i , i = 1 , 2 , 3 should satisfy
θ i α i δ i L i λ i r = 1 3 λ r | ϕ r i | η i L i λ i r = 1 3 λ r | ψ r i | + | a r i | + | b r i |
Here, we choose
η 1 = 5.5 , η 2 = 6.2 , η 3 = 6.7 , θ 1 = θ 2 = θ 3 = 1.0 , δ 1 = δ 2 = δ 3 = 10.7 γ 1 = γ 2 = γ 3 = 4 σ 1 = σ 2 = σ 3 = 0.01 λ 1 = λ 2 = λ 3 = 1.0
Figure 1 and Figure 2 present the state trajectories of Systems (27) and (29) with and without a controller. No synchronization can be achieved without a controller. But, synchronization is achieved within a finite time with a controller (5). In addition, according to Theorem 1, T max = 1.6874 can be computed using Formula (8). Therefore, Theorem 1 is effective.
Example 2. 
For System (27), the system’s parameter selection is as follows:
Γ 1 = Γ 2 = Γ 3 = 1 , α 1 = α 2 = α 3 = 1 , l = 1.8 , ω = 0.9 ϕ 11 = 2.0 , ϕ 12 = 1.1 , ϕ 13 = 2.1 , ϕ 21 = 1.1 , ϕ 22 = 1.8 , ϕ 23 = 1.3 , ϕ 31 = 1.2 , ϕ 32 = 1.7 , ϕ 33 = 2.1 , ϕ 11 = 2.1 , ϕ 12 = 1.0 , ϕ 13 = 1.8 , ϕ 21 = 0.8 , ϕ 22 = 1.5 , ϕ 23 = 1.0 , ϕ 31 = 1.1 , ϕ 32 = 2.1 , ϕ 33 = 1.5 ψ 11 = 1.8 , ψ 12 = 1.1 , ψ 13 = 2.1 , ψ 21 = 2.2 , ψ 22 = 4.5 , ψ 23 = 3.1 ψ 31 = 2.1 , ψ 32 = 1.8 , ψ 33 = 5.1 , ψ 11 = 2.1 , ψ 12 = 0.5 , ψ 13 = 1.8 ψ 21 = 2.5 , ψ 22 = 5.1 , ψ 23 = 2.5 , ψ 31 = 2.4 , ψ 32 = 2.1 , ψ 33 = 4.5 a 11 = a 13 = a 22 = a 23 = a 31 = a 32 = 0.1 , a 12 = a 21 = 0.2 , a 33 = 0.1 b 11 = b 13 = b 22 = b 31 = 0.2 , b 12 = b 21 = 0.2 , b 23 = b 32 = 0.1 , b 33 = 0.1 S i r = 0.1 , T i r = 0.1 , g i r = 1.0 , v r = 1.0 , i , r = 1 , 2.3
Let f i ( p ( t ) ) = t a n h ( | p ( t ) | ) 1 , I i = 0.1 , L i = 1 , i = 1 , 2 , 3 . τ 1 ( t ) = t a n h ( t ) , τ 2 ( t ) = e t 1 + e t . The initial values of System (27) are ζ 1 ( υ ) = 1 , ζ 2 ( υ ) = 0.6 , ζ 3 ( υ ) = 0.2 , υ [ τ ( t ) , 0 ] .
The parameters of Response System (29) are the same as those in System (27). The initial values of System (29) are ξ 1 ( υ ) = 1 , ξ 2 ( υ ) = 0.6 , ξ 3 ( υ ) = 0.8 , υ [ τ ( t ) , 0 ] .
According to Theorem 2, the control gains θ ^ i , δ ^ i , η ^ i , i = 1 , 2 , 3 should satisfy
θ ^ i α i δ ^ i L i λ i r = 1 M λ r | ϕ r i | η ^ i L i λ i r = 1 M λ r | ψ r i | + | a r i | + | b r i |
Here, we choose
θ ^ 1 = 1.0 , θ ^ 2 = 2.0 , θ ^ 3 = 3.0 , δ ^ 1 = 4.4 , δ ^ 2 = 6.0 , δ ^ 3 = 6.5 , η ^ 1 = 8.0 , η ^ 2 = 9.2 , η ^ 3 = 11.0 , γ 1 = γ 2 = γ 3 = 2 , σ 1 = σ 2 = σ 3 = 0.1 λ 1 = λ 2 = λ 3 = 1.0 , κ 1 = κ 2 = κ 3 = 1 , ρ 1 = ρ 2 = ρ 3 = 3 , ϱ 1 = ϱ 2 = ϱ 3 = 2 , ϵ 1 = 3 , ϵ 2 = 4 , ϵ 3 = 5 .
Let θ ^ i ( 0 ) = 1 , δ ^ i ( 0 ) = 1 , η ^ i ( 0 ) = 1 , and i = 1 , 2 , 3 ,
Figure 3 and Figure 4 depict the state trajectories of Systems (27) and (29) with and without a controller. No synchronization can be achieved without a controller. But, synchronization is achieved within a finite time with a controller (6). In addition, according to Theorem 2, T max = 0.8913 when using Formula (21). As shown in Figure 5 and Figure 6, the adaptive control gains κ i ( t ) and θ i r ( t ) , ( i , r = 1 , 2 , 3 ) converge to certain values within a finite time. Therefore, Theorem 2 is effective.

5. Conclusions

In this paper, the FTS and AFTS of FOMFNNs with leakage and transmission delays were investigated. Under a Filippov-like fractional-order differential inclusions theory and set-valued map, applying the Lyapunov functional method and the fractional-order differential inequalities allowed us to establish several new and useful criteria to achieve FTS and AFTS for FOMFNNs with leakage and transmission delays. In addition, the settling time is also presented. Finally, two numerical examples and their simulations are provided to demonstrate the validity of the obtained results. Future works will focus on the study of the described performance synchronization control for FOMFNNs with leakage and transmission delays.

Author Contributions

Conceptualization, Y.S.; methodology, Y.S. and Y.L.; writing—original draft preparation, Y.S.; writing—review and editing, Y.L.; numerical simulation, L.L. All authors have read and agreed to the published version of the manuscript.

Funding

This work was partially supported by the Program for Innovative Research Team in Universities of Anhui Province (2022AH010085), the Natural Science Foundation of Anhui Province (2008085MF200), the Natural Science Foundation in Universities of Anhui Province (2023AH051542), and the Key Research and Development Plan Project Foundation of Huainan (2021A248).

Data Availability Statement

The data presented in this study are available in the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Struko, D.; Snider, G.; Stewart, D. The missing memristor found. Nature 2008, 453, 80–83. [Google Scholar] [CrossRef] [PubMed]
  2. Yao, P.; Wu, H.; Gao, B.; Tang, J.; Zhang, Q.; Zhang, W.; Yang, J.J.; Qian, H. Fully hardware-implemented memristor convolutional neural network. Nature 2020, 577, 641–646. [Google Scholar] [CrossRef] [PubMed]
  3. Chen, J.; Zeng, Z.; Jiang, P. Global Mittag-Leffler stability and synchronization of memristor-based fractional-order neural networks. Neural Netw. 2014, 51, 1–8. [Google Scholar] [CrossRef] [PubMed]
  4. Zhang, J.; Lu, J.; Jin, X.; Yang, X.Y. Novel results on asymptotic stability and synchronization of fractional-order memristive neural networks with time delays: The 0 < δ ≤ 1 case. Neural Netw. 2023, 167, 680–691. [Google Scholar]
  5. 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]
  6. Ding, Z.; Chen, C.; Wen, S.; Li, S.; Wang, L. Lag projective synchronization of nonidentical fractional delayed memristive neural networks. Neurocomputing 2022, 469, 138–150. [Google Scholar] [CrossRef]
  7. Li, H.; Cao, J.; Hu, C.; Zhang, L.; Jiang, H. Adaptive control-based synchronization of discrete-time fractional-order fuzzy neural networks with time-varying delays. Neural Netw. 2023, 168, 59–73. [Google Scholar] [CrossRef]
  8. Zhang, L.; Yang, Y. Finite time impulsive synchronization of fractional order memristive BAM neural networks. Neurocomputing 2020, 384, 213–224. [Google Scholar] [CrossRef]
  9. Du, F.; Lu, J. New criterion for finite-time synchronization of fractional order memristor-based neural networks with time delay. Appl. Math. Comput. 2021, 389, 125616. [Google Scholar] [CrossRef]
  10. Anbalagan, P.; Ramachandran, R.; Alzabut, J.; Hincal, E.; Niezabitowski, M. Improved results on finite-time passivity and synchronization problem for fractional-order memristor-based competitive neural networks: Interval matrix approach. Fractal Fract. 2022, 6, 36. [Google Scholar] [CrossRef]
  11. Sun, Y.; Liu, Y.; Liu, L. Asymptotic and finite-time synchronization of fractional-order memristor-based inertial neural networks with time-varying delay. Fractal Fract. 2022, 6, 350. [Google Scholar] [CrossRef]
  12. Wei, R.; Cao, J.; Alsaedi, A. Fixed-time synchronization of memristive Cohen-Grossberg neural networks with impulsive effects. Int. J. Control Autom. Syst. 2018, 16, 2214–2224. [Google Scholar] [CrossRef]
  13. Ren, H.; Peng, Z.; Gu, Y. Fixed-time synchronization of stochastic memristor-based neural networks with adaptive control. Neural Netw. 2020, 130, 165–175. [Google Scholar] [CrossRef] [PubMed]
  14. Zhao, Y.; Ren, S.; Kurths, J. Finite-time and fixed-time synchronization for a class of memristor-based competitive neural networks with different time scales. Chaos Solitons Fractals 2021, 148, 111033. [Google Scholar] [CrossRef]
  15. Wei, R.; Cao, J.; Gorbachev, S. Fixed-time control for memristor-based quaternion-valued neural networks with discontinuous activation functions. Cogn. Comput. 2023, 15, 50–60. [Google Scholar] [CrossRef]
  16. Jia, T.; Chen, X.; Yao, X.; Zhao, F.; Qiu, J. Adaptive fixed-time synchronization of delayed memristor-based neural networks with discontinuous activations. CMES-Comput. Model. Eng. Sci. 2023, 134, 221–239. [Google Scholar] [CrossRef]
  17. Sun, Y.; Liu, Y.; Liu, L. Fixed-time synchronization for fractional-order cellular inertial fuzzy neural networks with mixed time-varying delays. Fractal Fract. 2024, 8, 97. [Google Scholar] [CrossRef]
  18. Zhao, F.; Jian, J.; Wang, B. Finite-time synchronization of fractional-order delayed memristive fuzzy neural networks. Fuzzy Sets Syst. 2023, 467, 108578. [Google Scholar] [CrossRef]
  19. Du, F.; Lu, J. Adaptive finite-time synchronization of fractional-order delayed fuzzy cellular neural networks. Fuzzy Sets Syst. 2023, 466, 108480. [Google Scholar] [CrossRef]
  20. Jian, J.; Duan, L. Finite-time synchronization for fuzzy neutral-type inertial neural networks with time-varying coefficients and proportional delays. Fuzzy Sets Syst. 2020, 381, 51–67. [Google Scholar] [CrossRef]
  21. Gopalsamy, K. Leakage delays in BAM. J. Math. Anal. Appl. 2007, 325, 1117–1132. [Google Scholar] [CrossRef]
  22. Alia, M.; Narayanana, G.; Sarohab, S.; Priya, B.; Thakur, G.K. Finite-time stability analysis of fractional-order memristive fuzzy cellular neural networks with time delay and leakage term. Math. Comput. Simul. 2021, 185, 468–485. [Google Scholar]
  23. Yan, H.; Qiao, Y.; Duan, L.; Miao, J. New results of quasi-projective synchronization for fractional-order complex-valued neural networks with leakage and discrete delays. Chaos Solitons Fractals 2022, 159, 112121. [Google Scholar] [CrossRef]
  24. Zhu, M.; Wang, B.; Wu, Y. Stability and Hopf bifurcation for a quaternion-valued three-neuron neural network with leakage delay and communication delay. J. Frankl. Inst. 2023, 360, 12969–12989. [Google Scholar] [CrossRef]
  25. Yuan, S.; Wang, Y.; Zhang, X. Global exponential synchronization of switching neural networks with leakage time-varying delays. Commun. Nonlinear Sci. Numer. Simul. 2024, 133, 107979. [Google Scholar] [CrossRef]
  26. Zhang, H.; Cheng, J.; Zhang, H.; Zhang, W.; Cao, J. Quasi-uniform synchronization of Caputo type fractional neural networks with leakage and discrete delays. Chaos Solitons Fractals 2021, 152, 11432. [Google Scholar] [CrossRef]
  27. Kao, Y.; Li, Y.; Park, J.; Chen, X. Mittag-Leffler synchronization of delayed fractional memristor neural networks via adaptive control. IEEE Trans. Neural Netw. Learn. Syst. 2021, 32, 2279–2284. [Google Scholar] [CrossRef] [PubMed]
  28. Yang, S.; Yu, J.; Hu, C.; Jiang, H. Finite-time synchronization of memristive neural networks with fractional-order. IEEE Trans. Syst. Man Cybern. Syst. 2021, 51, 3739–3750. [Google Scholar] [CrossRef]
  29. Filippov, A. Differential Equations with Discontinuous Righthand Sides; Kluwer Academic Publishers: Boston, MA, USA, 1988. [Google Scholar]
  30. Li, C.; Deng, W. Remarks on fractional derivatives. Aied Math. Comput. 2007, 187, 777–784. [Google Scholar] [CrossRef]
  31. Zhang, S.; Yu, Y.; Wang, H. Mittag-Leffler stability of fractional-order hopfield neural networks. Nonlinear Anal. Hybrid Syst. 2015, 16, 104–121. [Google Scholar] [CrossRef]
  32. 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. Frankl. Inst. 2018, 355, 6780–6809. [Google Scholar] [CrossRef]
  33. 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]
Figure 1. State trajectories of p i ( t ) , q i ( t ) , and e i ( t ) without controller.
Figure 1. State trajectories of p i ( t ) , q i ( t ) , and e i ( t ) without controller.
Fractalfract 09 00241 g001
Figure 2. State trajectories of p i ( t ) , q i ( t ) , and e i ( t ) with controller.
Figure 2. State trajectories of p i ( t ) , q i ( t ) , and e i ( t ) with controller.
Fractalfract 09 00241 g002aFractalfract 09 00241 g002b
Figure 3. State trajectories of p i ( t ) , q i ( t ) , and e i ( t ) without controller.
Figure 3. State trajectories of p i ( t ) , q i ( t ) , and e i ( t ) without controller.
Fractalfract 09 00241 g003
Figure 4. State trajectories of p i ( t ) , q i ( t ) , and e i ( t ) with controller.
Figure 4. State trajectories of p i ( t ) , q i ( t ) , and e i ( t ) with controller.
Fractalfract 09 00241 g004
Figure 5. State trajectories of control gains δ i ( t ) , i = 1 , 2 , 3 .
Figure 5. State trajectories of control gains δ i ( t ) , i = 1 , 2 , 3 .
Fractalfract 09 00241 g005
Figure 6. State trajectories of control gains θ i ( t ) and η i ( t ) , i = 1 , 2 , 3 .
Figure 6. State trajectories of control gains θ i ( t ) and η i ( t ) , i = 1 , 2 , 3 .
Fractalfract 09 00241 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

Sun, Y.; Liu, Y.; Liu, L. Fixed-Time Adaptive Synchronization of Fractional-Order Memristive Fuzzy Neural Networks with Time-Varying Leakage and Transmission Delays. Fractal Fract. 2025, 9, 241. https://doi.org/10.3390/fractalfract9040241

AMA Style

Sun Y, Liu Y, Liu L. Fixed-Time Adaptive Synchronization of Fractional-Order Memristive Fuzzy Neural Networks with Time-Varying Leakage and Transmission Delays. Fractal and Fractional. 2025; 9(4):241. https://doi.org/10.3390/fractalfract9040241

Chicago/Turabian Style

Sun, Yeguo, Yihong Liu, and Lei Liu. 2025. "Fixed-Time Adaptive Synchronization of Fractional-Order Memristive Fuzzy Neural Networks with Time-Varying Leakage and Transmission Delays" Fractal and Fractional 9, no. 4: 241. https://doi.org/10.3390/fractalfract9040241

APA Style

Sun, Y., Liu, Y., & Liu, L. (2025). Fixed-Time Adaptive Synchronization of Fractional-Order Memristive Fuzzy Neural Networks with Time-Varying Leakage and Transmission Delays. Fractal and Fractional, 9(4), 241. https://doi.org/10.3390/fractalfract9040241

Article Metrics

Back to TopTop