Next Article in Journal
A Case Study of Accident Analysis and Prevention for Coal Mining Transportation System Based on FTA-BN-PHA in the Context of Smart Mining Process
Previous Article in Journal
Ultrasound Computed Tomography Reflection Imaging with Coherence-Factor Beamforming for Breast Tumor Early Detection
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Finite-Time Adaptive Synchronization and Fixed-Time Synchronization of Fractional-Order Memristive Cellular Neural Networks with Time-Varying Delays

1
School of Computer Science, Huainan Normal University, Huainan 232038, China
2
School of Finance and Mathematics, Huainan Normal University, Huainan 232038, China
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(7), 1108; https://doi.org/10.3390/math12071108
Submission received: 24 February 2024 / Revised: 23 March 2024 / Accepted: 2 April 2024 / Published: 7 April 2024
(This article belongs to the Special Issue Theory, Modeling and Applications of Fractional-Order Systems)

Abstract

:
Asymptotic synchronization requires continuous external control of the system, which is unrealistic considering the cost of control. Adaptive control methods have strong robustness to uncertainties such as disturbances and unknowns. On the other hand, for finite-time synchronization, if the initial value of the system is unknown, the synchronization time of the finite-time synchronization cannot be estimated. This paper explores the finite-time adaptive synchronization (FTAS) and fixed-time synchronization (FDTS) of fractional-order memristive cellular neural networks (FMCNNs) with time-varying delays (TVD). Utilizing the properties and principles of fractional order, we introduce a novel lemma. Based on this lemma and various analysis techniques, we establish new criteria to guarantee FTAS and FDTS of FMCNNs with TVD through the implementation of a delay-dependent feedback controller and fractional-order adaptive controller. Additionally, we estimate the upper bound of the synchronization setting time. Finally, numerical simulations are conducted to confirm the validity of the finite-time and fixed-time stability theorems.

1. Introduction

Memristive neural networks (MNNs) have garnered significant research interest due to their applications in various fields, including image processing, combinatorial optimization, and artificial intelligence (see [1,2,3]). Differing from traditional neural networks, MNNs are an enhanced version where conventional resistors are substituted with memristors. It is well established that a memristor is a type of resistor possessing memory capabilities, and it can memorize the route through an electric charge [4]. This category of dynamical systems is characterized by state-dependent switched discontinuous systems, which can readily result in complex behaviors and switching uncertainties. Therefore, the dynamical analysis of MNNs is a crucial area of study in both theoretical and applied contexts (see [5,6]). It is widely acknowledged that fractional-order neural networks possess numerous advantages over their integer-order counterparts. Subsequently, fractional-order neural networks have garnered significant interest from researchers, leading to a wealth of insightful findings regarding their dynamical behaviors (see [7,8,9]).
Cellular neural networks (CNNs) are large-scale nonlinear analog circuits that process signals in real time. CNNs are composed of regularly spaced cells. However, as the number of cells in the CNNs increases, the circuit structure of the CNNs becomes complex, which can make it inconvenient to update the weight templates. If memristors are used to implement synaptic connections within the CNNs, it can reduce area consumption and power consumption, and the conditions for updating weights become simpler. Due to the inherent memory characteristics of memristors, the information processing capabilities of the memristor cellular neural networks (MCNNs) are enhanced (see [10,11]).
Fractional calculus is an extension of integer calculus. It is characterized by taking into account the current state and all previous states, exhibiting a memory property. It is widely used as a mathematical tool in fields such as pattern recognition, information processing, robot control, physics, statistics, and more. In practical applications, the fractional order is often used to establish neural network models (see [12,13,14,15,16]).
In the practical application of neural networks, the processing and transmission of signals between neurons are limited by the switching speed of amplifiers. A time delay is inevitable, which affects the stability of the neural network and leads to divergence, instability, and oscillation of the network system. Delays include constant delays and time-varying delays, which are considered more effective than constant delays in establishing neural network systems. Neural networks with TVD are more capable of solving complex practical problems (see [17,18,19,20]).
Synchronization refers to the dynamic behavior wherein a system, through processes of driving and responding, achieves a state of congruence after a specified duration. Synchronous technology, with its potential applications in medicine, information science, optimization computing, and automatic control, has garnered significant attention in recent years. It assumes multiple forms, for instance, asymptotical synchronization [21,22], exponential synchronization [23,24], robust synchronization [25], finite-time synchronization [26,27,28,29,30,31], fixed-time synchronization [32,33,34,35], and so on. In practical applications, due to objective constraints, we usually hope to achieve synchronization of the neural network drive response within a limited time. Furthermore, the finite-time and fixed-time control techniques have also demonstrated superior interference suppression performance and robustness.
In recent years, there have been significant advancements in the study of finite-time synchronization (FTS) for memristive neural network systems. For instance, see [36,37,38,39,40,41,42,43]. Li et al. [36] investigated FTS for a class of drive-response FMNNs with discontinuous activation functions. Li et al. [37] explored the FTS and FDTS of coupled MNNs with discontinuous feedback functions. Li et al. [38] discussed the FTAS and FTS of MNNs with discontinuous activation functions and mixed time-varying delays. Zhang et al. [39] studied the FTS of fractional-order complex-valued MNNs with delay. Guo et al. [40] proposed FTS of drive-response inertial MNNs with time delay. Wei et al. [41], utilizing interval-matrix-based methods, investigated the FTS/FTDS of delayed inertial MNNs. Gong et al. [42] focused on the FTS problem of fuzzy MNNs with time delay. Zhao et al. [43] investigated FTS for a class of FOMFNNs with leakage and transmission delays.
However, independent of initial conditions, finite-time synchronous control methods cannot ensure the system’s convergence within a predetermined time frame. When the initial state information is unknown, the application of these methods becomes restricted by the lack of initial conditions. Researchers have initiated investigations into the issue of the FDTS control problem and have attained preliminary findings. For instance, Arslan et al. [44] investigated the controller design problem for FTDS of fractional-order memristive complex-valued BAM neural networks. Wang et al. [45], utilizing a fractional-order sliding-mode control method, investigated the FDTS control problem of MNNs. Xiao et al. [46] discussed the FDTS control problem of memristive neural networks with delay. Wang et al. [47], utilizing impulsive effects via the novel fixed-time stability theorem, investigated the FDTS control problem of memristive neural networks with delay. Although MNNs have achieved good results in finite-time synchronization and fixed-time synchronization, there is still a lack of research on finite-time and fixed-time synchronization of FMNNs, especially for FMNNs with mixed time-varying delays, which has driven our investigation.
As far as the author knows, the FTAS and FDTS of FMCNNs with TVD have not been fully studied. The main contributions of this article are summarized as follows:
  • For the first time, the FTAS and FDTS of FMCNNs with TVD are studied. In practical applications, FTAS and FDTS are more general and practical than finite-time synchronization and asymptotic synchronization;
  • By constructing a nonlinear feedback controller and choosing a simple Lyapunov function, some sufficient conditions which are easy to verify are obtained to ensure the finite-time and fixed-time stability of FMCNNs and the FTAS and FDTS of the drive-response FMCNNs systems;
  • The theoretical results obtained are more general and can improve or supplement previous results effectively. Moreover, the existing FMCNNs model with no fuzzy logic, no time-varying delay, and no memristor can all be regarded as the special case of our model;
  • The settling time in this paper is easy to estimate. In addition, compared with the classical results, the estimation bound of the settling time given in our paper is more accurate and effective. Numerical examples are given to demonstrate the effectiveness of the proposed approaches.
This study examines the FTAS and FTS of FMCNNs with TVD. By harnessing the properties and principles inherent to fractional-order systems, a novel lemma is introduced. Building upon this lemma and employing various analytical techniques, new criteria are formulated to ensure FTAS and FTS of FMCNNs with TVD. This is achieved through the application of a feedback controller and a fractional-order adaptive controller. Furthermore, an estimation of the upper bound for the synchronization setting time is provided.
The rest of this paper is organized as follows. Several preliminaries will be provided in Section 2, and theoretical results will be derived in Section 3 and Section 4. In Section 5, numerical simulations will be given to verify the obtained theoretical results. A conclusion will be presented in Section 6.
Notations: In this paper, the symbols can be elucidated as follows: R represents the set of real numbers; N represents the set of natural numbers; Z + represents a set of positive integers; R m denotes a m-dimensional vector space; C m [ a , b ] is used to denote the set of continuous functions with an n-th-order derivative on the interval [ a , b ] .

2. Preliminaries and Model Description

In this article, the system model is defined by the Caputo fractional order. Some basic definitions, lemmas, and assumptions about fractional calculus are introduced.
Definition 1
([48]). The Caputo fractional integral of the function χ ( t ) is defined as follows:
D ω t 0 C χ ( t ) = 1 Γ ( ω ) t 0 t ( t v ) ω 1 χ ( v ) d v ,
where ω > 0 , t > t 0 , Γ ( · ) is the gamma function.
Definition 2
([48]). The Caputo fractional derivative of the function χ ( t ) is defined as follows:
D ω t 0 C   χ ( t ) = 1 Γ ( n ω ) t 0 t ( t v ) n ω 1 χ ( n ) ( v ) d v ,
where t > t 0 , ω ( n 1 , n ] , n Z + . If ω ( 0 , 1 ] . Then,
D ω t 0 C   χ ( t ) = 1 Γ ( 1 ω ) t 0 t χ ( v ) ( t v ) ω d v .
Lemma 1
([49]). If ω γ 0 , the following equation always holds:
D ω t 0 C   D γ χ ( t ) = D ω γ t 0 C χ ( t )
When ω = γ ,
D ω t 0 C   D γ χ ( t ) = χ ( t )
Lemma 2
([49]). Denote m = [ ω ] + 1 for ω N or n = ω for ω N . If χ ( t ) C m [ a , b ] , then Equation(4) holds.
D ω t 0 C D ω χ ( t ) = χ ( t ) k = 0 n 1 χ k ( ω ) k ! ( χ ( t ) ω ) k
Obviously, if 0 < ω < 1 and χ ( t ) C 1 [ a , b ] , then
D ω t 0 C D ω χ ( t ) = χ ( t ) χ ( ω )
Lemma 3
([50]). If χ ( t ) C 1 [ t 0 , ] , 0 < ω 1 , then Equation (5) holds.
D ω t 0 C   | χ ( t ) | s i g n ( χ ( t ) ) t 0 C D ω χ ( t )
Lemma 4
([51]). For β R . If χ ( t ) C 1 [ t 0 , ] , 0 < ω 1 , Equation (6) holds.
D ω t 0 C   ( χ ( t ) β ) 2 2 ( χ ( t ) β ) t 0 C D ω χ ( t )
Lemma 5
([52]). If α 1 , α 2 , , α M 0 , 0 < ν 1 , μ > 1 , then Equation (7) holds.
k = 1 M α k μ M 1 μ k = 1 M a k μ , k = 1 M α k ν k = 1 M α k ν .
Lemma 6
([9]). If there exists a positive-definite function V ( Δ ( t ) ) : R m R which satisfies the inequality
D ω t 0 C   V ( Δ ( t ) ) γ
where γ > 0 is a constant, then the origin is finite-time stable for all t T m a x . T m a x is given by:
T m a x = t 0 + ( Γ ( 1 + ω ) V ( Δ ( t 0 ) ) γ ) 1 ω
Lemma 7
([35]). If there exists a positive-definite function V ( Δ ( t ) ) : R m R which satisfies the inequality
V ˙ ( Δ ( t ) ) a V δ ( Δ ( t ) ) + b k , Δ ( t ) R m 0
where a , b , δ , k > 0 are constants and δ k > 1 , then the origin is fixed-time stable for all t T m a x . T m a x is given by:
T max = 1 b k b a 1 δ 1 + 1 δ k 1
Next, we consider an FMCNN with mixed time-varying delays as follows:
D ω t 0 C   p i ( t ) = α i p i ( t ) + r = 1 M ϕ i r ( p i ( t ) ) f r ( p r ( t ) ) + r = 1 M ψ i r ( p i ( t ) ) f r ( p r ( t τ ( t ) ) ) + ε r = 1 M d i r g r ( q r ( t ) ) + I i p i ( υ ) = ζ i ( υ ) , υ [ τ , t 0 ] , i = 1 , , M ,
where p i ( t ) represents the corresponding state. α i > 0 denotes the self-feedback connection weight. ε represents the interaction weight. d i r represents the interaction structure. f r ( · ) is the activation function. g r ( · ) is an interaction function. τ ( t ) denotes time-varying delay, and τ ( t ) [ 0 , τ ] , ϕ i r ( p i ( t ) ) , and ψ i r ( p i ( t ) ) represent the memristive connection weights. I i represents the bias value, and
ϕ i r ( p i ( t ) ) = F i r C i × s i r , ψ i r ( p i ( t ) ) = F i r * C i × s i r , s i r = 1 , i r 1 , i = r
where F i r , F i r * represent the memory resistance value of the memristors E i r , E i r * , respectively. Here, E i r , E i r * indicate the memristor between f r ( p r ( t ) ) and p i ( t ) and f r ( p r ( t τ ( t ) ) ) and p i ( t ) , respectively. Based on the characteristics of the memristor, we set the following values for the memristor’s jumps:
ϕ i r ( p i ( t ) ) = ϕ i r , | p i ( t ) | Γ i ϕ i r , | p i ( t ) | > Γ i ψ i r ( p i ( t ) ) = ψ i r , | p i ( t ) | Γ i ψ i r , | p i ( t ) | > Γ i
where Γ i > 0 is the switching jump value of the memristor, and ϕ i r , ϕ i r , ψ i r , ψ i r are known constants. ζ i ( υ ) represents the initial values of system (12).
The response system is described as follows:
D ω t 0 C   q i ( t ) = α i q i ( t ) + r = 1 M ϕ i r ( q i ( t ) ) f r ( q r ( t ) ) + r = 1 M ψ i r ( q i ( t ) ) f r ( q r ( t τ ( t ) ) ) + ε r = 1 M d ^ i r g r ( p r ( t ) ) + I i + u i ( t ) q i ( υ ) = ξ i ( υ ) , υ [ τ , t 0 ] , i = 1 , , M ,
where d ^ represents the interaction structure. u i ( t ) is the control input, and
ϕ i r ( q i ( t ) ) = ϕ i r , | q i ( t ) | Γ i ϕ i r , | q i ( t ) | > Γ i ψ i r ( q i ( t ) ) = ψ i r , | q i ( t ) | Γ i ψ i r , | q i ( t ) | > Γ i
where ξ i ( υ ) represents the initial values of system (13).
Let Δ i ( t ) = q i ( t ) p i ( t ) be the synchronization error. Then, the error system is described as follows:
D 0 ω t 0 C Δ i ( t ) = α i Δ i ( t ) + G i ( t ) + u i ( t ) Δ i ( υ ) = ξ i ( υ ) ζ i ( υ ) , υ [ τ , t 0 ] , i = 1 , 2 , , M .
where
G i ( t ) = r = 1 M ϕ i r ( q i ( t ) ) f r ( q r ( t ) ) r = 1 M ϕ i r ( p i ( t ) ) f r ( p r ( t ) ) + r = 1 M ψ i r ( q i ( t ) ) f r ( q r ( t τ ( t ) ) ) r = 1 M ψ i r ( p i ( t ) ) f r ( p r ( t τ ( t ) ) )
Assumption 1.
For μ , υ R , there exists constants Q r , Q r > 0 such that
| f r ( μ ) f r ( υ ) | Q r | μ υ | , | g r ( μ ) g r ( υ ) | Q r | μ υ | , r = 1 , 2 , , M .
Assumption 2.
There exists constants S r , S r > 0 , such that | f r ( · ) | S r , | g r ( · ) | S r , r = 1 , 2 , , M .
Lemma 8.
If Assumptions 1 and 2 satisfy, then Equation (15) holds.
| G i ( t ) | r = 1 M [ ( ϕ ˜ i r Q r + ε d ˜ i r Q r ) | Δ r ( t ) | + | ϕ i r ϕ i r | S r + ψ ˜ i r Q r | Δ r ( t τ ( t ) ) | + | ψ i r ψ i r | S r + ε | d ^ i r d i r | S r ]
where ϕ ˜ i r = m a x { | ϕ i r | , | ϕ i r | } , ψ ˜ i r = m a x { | ψ i r | , | ψ i r | } , d ˜ i r = m a x { | d ^ i r | , | d i r | } , i , r = 1 , 2 , , M .
Proof. 
G i ( t ) = r = 1 M ϕ i r ( q i ( t ) ) f r ( q r ( t ) ) r = 1 M ϕ i r ( q i ( t ) ) f r ( p r ( t ) ) + r = 1 M ϕ i r ( q i ( t ) ) f r ( p r ( t ) ) r = 1 M ϕ i r ( p i ( t ) ) f r ( p r ( t ) ) + r = 1 M ψ i r ( q i ( t ) ) f r ( q r ( t τ ( t ) ) ) r = 1 M ψ i r ( q i ( t ) ) f r ( p r ( t τ ( t ) ) ) + r = 1 M ψ i r ( q i ( t ) ) f r ( p r ( t τ ( t ) ) ) r = 1 M ψ i r ( p i ( t ) ) f r ( p r ( t τ ( t ) ) ) + ε r = 1 M d ^ i r g r ( p r ( t ) ) ε r = 1 M d i r g r ( q r ( t ) ) = r = 1 M ϕ i r ( q i ( t ) ) [ f r ( q r ( t ) ) f r ( p r ( t ) ) ] + r = 1 M [ ϕ i r ( q i ( t ) ) ϕ i r ( p i ( t ) ) ] f r ( p r ( t ) ) + r = 1 M ψ i r ( q i ( t ) ) [ f r ( q r ( t τ ( t ) ) ) f r ( p r ( t τ ( t ) ) ) ] + r = 1 M [ ψ i r ( q i ( t ) ) ψ i r ( p i ( t ) ) ] f r ( p r ( t τ ( t ) ) ) + ε r = 1 M d ^ i r g r ( p r ( t ) ) r = 1 M d i r g r ( q r ( t ) )
due to
r = 1 M d ^ i r g r ( p r ( t ) ) r = 1 M d i j g r ( q r ( t ) ) = r = 1 M d ^ i j g r ( p r ( t ) ) r = 1 M d i r g r ( p r ( t ) ) + r = 1 M d i r g r ( p r ( t ) ) r = 1 M d i r g r ( q r ( t ) )
or
r = 1 M d ^ i r g r ( p r ( t ) ) r = 1 M d i r g r ( q r ( t ) ) = r = 1 M d ^ i r g r ( p r ( t ) ) r = 1 M d ^ i r g r ( q r ( t ) ) + r = 1 M d ^ i r g r ( q r ( t ) ) r = 1 M d i r g r ( q r ( t ) )
Based on Assumptions 1 and 2, we can obtain the following:
| G i ( t ) | r = 1 M [ ϕ ˜ i r Q r | Δ r ( t ) | + | ϕ i r ϕ i r | S r + ψ ˜ i r Q r | Δ r ( t τ ( t ) ) | + | ψ i r ψ i r | S r + ε | d ^ i r d i r | S r + ε d ˜ i r Q r | Δ r ( t ) | ] = r = 1 M [ ( ϕ ˜ i r Q r + ε d ˜ i r Q r ) | Δ r ( t ) | + | ϕ i r ϕ i r | S r + ψ ˜ i r Q r | Δ r ( t τ ( t ) ) | + | ψ i r ψ i r | S r + ε | d ^ i r d i r | S r ]
This completes the proof. □

3. Finite-Time Adaptive Synchronization Control

In this section, we discuss the finite-time synchronization of FMCNNs (12) and (13). To achieve the finite-time synchronization between (12) and (13), the controller is designed as:
u i ( t ) = κ i Δ i ( t ) s i g n ( Δ i ( t ) ) r = 1 M θ i r | Δ r ( t τ ( t ) ) | δ i s i g n ( Δ i ( t ) )
and
u i ( t ) = κ i ( t ) Δ i ( t ) s i g n ( Δ i ( t ) ) r = 1 M θ i r ( t ) | Δ r ( t τ ( t ) ) | δ i s i g n ( Δ i ( t ) ) D ω t 0 C   κ i ( t ) = λ i | Δ i ( t ) | 1 2 ( κ i ( t ) κ ^ i ) D ω t 0 C   θ i r ( t ) = ρ i | Δ i ( t τ ( t ) ) | 1 2 ( θ i r ( t ) θ ^ i r )
where κ i > 0 , δ i > 0 , θ i r > 0 , λ i > 0 , ρ i > 0 , κ ^ i , θ ^ i r are adaptive constants. κ i ( t ) , θ i r ( t ) are the adaptive control gains. s i g n ( · ) is the symbolic function.
Remark 1.
The feedback controller (16) and adaptive controller (17) are different. The controller (17) has fractional derivative behavior and can reduce control costs by using state information. In (16) and (17), the terms with time-varying delays are to remove the time delays, and the control gain δ i can improve the fast response. When δ i is greater, the system synchronization error will oscillate.
Theorem 1.
If Assumptions 1 and 2 hold, and control gains κ i , θ i r , δ i satisfy κ i α i + r = 1 M ( ϕ ˜ r i Q r + ε d ˜ r i Q r ) , θ i r ψ ˜ i r Q r , δ i > r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r ) , i , r = 1 , 2 , , M , then FMCNNs (12) and (13) can realize finite-time synchronization under the feedback controller (16). Furthermore, the upper bound time for synchronization is calculated by (18).
T m a x = t 0 + Γ ( 1 + ω ) V ( t 0 ) i = 1 M min 1 i M { c i } 1 ω .
Proof. 
Consider the Lyapunov function:
V ( Δ i ( t ) ) = i = 1 M | Δ i ( t ) |
Using Lemma 3, we calculate the fractional derivative of (18).
D ω t 0 C   V ( Δ ( t ) ) = i = 1 M D ω t 0 C   | Δ i ( t ) | i = 1 M s i g n ( Δ i ( t ) ) D ω t 0 C   Δ i ( t ) = i = 1 M s i g n ( Δ i ( t ) ) [ α Δ i ( t ) + G i ( t ) + u i ( t ) ] = i = 1 M α i | Δ i ( t ) | + i = 1 M s i g n ( Δ i ( t ) ) G i ( t ) + i = 1 M s i g n ( Δ i ( t ) ) u i ( t ) i = 1 M α i | Δ i ( t ) | + i = 1 M | G i ( t ) | + i = 1 M s i g n ( Δ i ( t ) ) u i ( t )
Using Lemma 8, we obtain
D ω t 0 C   V ( Δ ( t ) ) i = 1 M α i | Δ i ( t ) | + i = 1 M r = 1 M ( ϕ ˜ i r Q r + ε d ˜ i r Q r ) | Δ r ( t ) | i = 1 M κ i | Δ i ( t ) | i = 1 M | s i g n ( Δ i ( t ) ) | r = 1 M θ i r | Δ r ( t τ ( t ) ) | i = 1 M δ i | s i g n ( Δ i ( t ) ) | + i = 1 M r = 1 M [ | ϕ i r ϕ i r | S r + ψ ˜ i r Q r | Δ r ( t τ ( t ) ) | + | ψ i r ψ i r | S r + ε | d ^ i r d i r | S r ] = i = 1 M ( α i + r = 1 M ( ϕ ˜ r i Q r + ε d ˜ r i Q r ) κ i ) | Δ i ( t ) | + i = 1 M r = 1 M ( ψ ˜ i r Q r θ i r ) | Δ r ( t τ ( t ) ) | + i = 1 M r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r ) + ε | d ^ r i d r i | S r δ i
While
κ i α i + r = 1 M ( ϕ ˜ r i Q r + ε d ˜ r i Q r ) , θ i r ψ ˜ i r Q r , δ i > r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r ) ,
we obtain
D ω t 0 C   V ( Δ ( t ) ) i = 1 M c i | s i g n ( Δ i ( t ) ) | i = 1 M min 1 i M { c i }
where c i = δ i r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r ) > 0 . According to Lemma 6, we obtain Equation (18). This completes the proof.
Remark 2.
The feedback controller (16) includes two parts: u i 1 ( t ) = κ i Δ i ( t ) s i g n ( Δ i ( t ) ) r = 1 M θ i r | Δ r ( t τ ( t ) ) | and u i 2 ( t ) = δ i s i g n ( Δ i ( t ) ) . Here, the feedback controller u i 1 ( t ) can realize synchronization of FMCNNs (12) and (13); however, we cannot estimate the upper bound time for synchronization by the controller u i 1 ( t ) . To realize the FMCNNs (12) and (13), we need the controller u i 2 ( t ) .
Remark 3.
In fact, the adaptive control method has strong robustness to external interference and unknown uncertainties and can identify the unknown parameters in the model according to the input and output data. In the control scheme (16), the feedback control parameters κ i and θ i r are not easy to choose, so the following considers the use of adaptive control to achieve finite-time synchronization of the driving response system.
Theorem 2.
If Assumptions 1 and 2 hold, and control gains κ ^ i , θ ^ i r , δ i satisfy κ ^ i α i + r = 1 M ( ϕ ˜ r i Q r + ε d ˜ r i Q r ) , θ i r ψ ˜ i r Q r , θ ^ i r ψ ˜ i r Q r , δ i > r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r ) , i , r = 1 , 2 , , M , then FMCNNs (12) and (13) can realize finite-time synchronization under the adaptive controller (17). Furthermore, the upper bound time for synchronization is calculated by (18).
Proof. 
Consider the Lyapunov function:
V ( Δ i ( t ) ) = i = 1 M | Δ i ( t ) | + i = 1 M 1 2 λ i ( κ i ( t ) κ ^ i ) 2 + i = 1 M r = 1 M 1 2 ρ i ( θ i r ( t ) θ ^ i r ) 2
Using Lemmas 3, 4, and 8, we calculate the fractional derivative of (22).
D ω t 0 C   V ( Δ ( t ) ) i = 1 M s i g n ( Δ i ( t ) ) D ω t 0 C   Δ i ( t ) + i = 1 M 1 λ i ( κ i ( t ) κ ^ i ) D ω t 0 C   κ i ( t ) + i = 1 M r = 1 M 1 ρ i ( θ i r ( t ) θ ^ i r ) D ω t 0 C   θ i r ( t )
Combining (16), (20), and (23), one can obtain:
D ω t 0 C   V ( Δ ( t ) ) i = 1 M ( α i + r = 1 M ( ϕ ˜ r i Q r + ε d ˜ i r Q r ) κ ^ i ) | Δ i ( t ) | + i = 1 M r = 1 M ( ψ ˜ i r Q r θ ^ i r ) | Δ r ( t τ ( t ) ) | + i = 1 M r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r δ i ) i = 1 M 1 2 λ i ( κ i ( t ) κ ^ i ) 2 i = 1 M r = 1 M 1 2 ρ i ( θ i r ( t ) θ ^ i r ) 2
While
κ ^ i α i + r = 1 M ( ϕ ˜ r i Q r + ε d ˜ r i Q r ) , θ ^ i r ψ ˜ i r Q r , δ i > r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r )
we obtain
D ω t 0 C   V ( Δ ( t ) ) r = 1 M [ ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r ) ] i = 1 M min 1 i M { c i }
where c i = δ i r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r ) > 0 . According to Lemma 6, we obtain Equation (18). This completes the proof.
Remark 4.
It is worth noting that, theoretically, the upper bound T m a x can be obtained based on Equation (17) in Theorem 1 or Theorem 2. One can see that T m a x depends not only on the relevant initial state V ( t 0 ) , but also on the fractional order ω and control gain δ i .
Remark 5.
It should be noted that, for finite-time synchronization, if the initial value of the system is unknown, the synchronization time of finite-time synchronization cannot be estimated. However, for fixed-time synchronization, even if the initial value of the system is unknown, the upper bound of the synchronization time can still be estimated. Therefore, we will study FMCNN fixed-time synchronization next.

4. Fixed-Time Synchronization Control

In this section, we discuss the fixed-time synchronization of FMCNNs (12) and (13). To achieve the fixed-time synchronization between (12) and (13), the controller is designed as:
u i ( t ) = κ i Δ i ( t ) s i g n ( Δ i ( t ) ) δ i + r = 1 M θ i r | Δ r ( t τ ( t ) ) | + η i D ω 1 t 0 C | Δ i ( t ) | ι
where κ i > 0 , δ i > 0 , θ i r > 0 , η i > 0 , ι > 1 , and s i g n ( · ) is the symbolic function.
Theorem 3.
If Assumptions 1 and 2 hold, and control gains κ i , δ i , θ i r satisfy κ i α i + r = 1 M ϕ ˜ i r Q i , δ i > r = 1 M ( | ϕ i r ϕ i r | S r + | ψ i r ψ i r | S r ) , θ i r ψ ˜ i r Q r , i , r = 1 , 2 , , M , then FMCNNs (12) and (13) can realize fixed-time synchronization under controller (26). Furthermore, the settling time can be calculated by:
T * T max = 1 Θ ( ι 1 ) Θ Λ M ι l 1 ι
where Λ = min 1 i M η i , Θ = i = 1 M min 1 i M { c i } , ι > 1 .
Proof. 
Consider the Lyapunov function:
V ( Δ ( t ) ) = i = 1 M D ω 1 t 0 C | Δ i ( t ) |
Obviously, V ( Δ ( t ) ) 0 and V ( Δ ( t ) ) = 0 if and only if Δ ( t ) = 0 .
Using Lemmas 1 and 2, we calculate the derivative of (28).
V ˙ ( Δ ( t ) ) = D ω t 0 C   D 1 ω t 0 C V ( Δ ( t ) ) = D ω t 0 C   D 1 ω t 0 C i = 1 M D ω 1 t 0 C | Δ i ( t ) | = D ω t 0 C   D 1 ω t 0 C D ω 1 t 0 C i = 1 M | Δ i ( t ) | = i = 1 M D ω t 0 C   | Δ i ( t ) | i = 1 M s i g n ( Δ i ( t ) ) D ω t 0 C   Δ i ( t )
Similar to in the proof of Theorem 1, we choose to meet the conditions
κ i α i + r = 1 M ( ϕ ˜ r i Q r + ε d ˜ r i Q r ) , θ i r ψ ˜ i r Q r , δ i > r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r ) ,
and, according to Lemma 5, we obtain the following inequality:
V ˙ ( Δ ( t ) ) i = 1 M min 1 i M { c i } i = 1 M η i D ω 1 t 0 C | Δ i ( t ) | ι
where c i = δ i r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r ) > 0 .
When Λ = min 1 i M η i , Θ = i = 1 M min 1 i M { c i } , we obtain:
V ˙ ( Δ ( t ) ) Θ Λ M 1 ι ( V ( Δ i ( t ) ) ) ι
Let k = 1 in Lemma 7. It is known that the origin is fixed-time stable, and the settling time T * can be calculated by:
T * T max = 1 Θ ( ι 1 ) Θ Λ M 1 ι 1 ι
Remark 6.
In this paper, the settling time T * is calculated based on Lemma 7, and the algorithm of Lemma 7 itself is an optimization result. Actually, the estimation of time T * is determined by the following equation:
T * 0 + 1 ( α x μ + β ) k d x = 0 r 1 ( α x μ + β ) k d x + r + 1 ( α x μ + β ) k d x 0 r 1 β k d x + r + 1 α k x μ k d x = r β k + 1 α k ( μ k 1 ) r 1 μ k
where r represents an arbitrary positive number. Let
W ( r ) = r β k + 1 α k ( μ k 1 ) r 1 μ k
Then,
W ˙ ( r ) = 1 β k + 1 α k ( μ k 1 ) r μ k
which indicates that W ( r ) can reach its minimum value, which can be calculated by the following formula:
W ^ = 1 β k β α 1 μ 1 + 1 μ k 1
In order to refine the estimation of the settling time, it is imperative to select appropriate parameters α , β , k , μ in applications. Actually, if α > β and μ = ln β α ln β α + 1 , the estimated value of T * can be obtained using the following formula:
T * T max = ln β α β β α 1 + 1 ln β a l p h a .

5. Numerical Simulations

To validate the obtained theoretical results, some numerical simulations will be provided next.
Example 1.
Consider the drive system:
D ω t 0 C   p i ( t ) = α i p i ( t ) + r = 1 3 ϕ i r ( p i ( t ) ) f r ( p r ( t ) ) + r = 1 3 ψ i r ( p i ( t ) ) f r ( p r ( t τ ( t ) ) ) + ε r = 1 3 d i r g r ( q r ( t ) ) + I i , i = 1 , 2 , 3 ,
The system parameter selection is as follows:
Γ 1 = Γ 2 = Γ 3 = 1 , α 1 = α 2 = α 3 = 1 , ε = 0.2 , ω = 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 d 11 = 1.0 , d 12 = 2.0 , d 13 = 1.5 , d 21 = 2.0 , d 22 = 1.0 , d 23 = 0.5 d 31 = 0.5 , d 32 = 2.0 , d 33 = 1.0 , d ^ 11 = 1.0 , d ^ 12 = 1.0 , d ^ 13 = 1.0 d ^ 21 = 1.0 , d ^ 22 = 1.0 , d ^ 23 = 1.0 , d ^ 31 = 1.0 , d ^ 32 = 1.0 , d ^ 33 = 1.0
Let f i ( p ( t ) ) = t a n h ( | p ( t ) | ) 1 , g i ( p ( t ) ) = t a n h ( p ( t ) ) , I i = 0.1 , S i = S i = 1 , Q i = Q i = 1 , i = 1 , 2 , 3 . τ ( t ) = e t 1 + e t . The initial values of system (29) are ζ 1 ( υ ) = 0.3 , ζ 2 ( υ ) = 0.6 , ζ 3 ( υ ) = 0.3 , υ [ τ ( t ) , 0 ] .
The response system is:
D ω t 0 C   q i ( t ) = α i q i ( t ) + r = 1 3 ϕ i r ( q i ( t ) ) f r ( q r ( t ) ) + r = 1 3 ψ i r ( q i ( t ) ) f r ( q r ( t τ ( t ) ) ) + ε r = 1 3 d ^ i r g r ( p r ( t ) ) + I i + u i ( t ) , i = 1 , 2 , 3 .
The parameters are the same as in the system (29). The initial values of system (31) are ξ 1 ( υ ) = 0.3 , ξ 2 ( υ ) = 0.6 , ξ 3 ( υ ) = 0.3 , υ [ τ ( t ) , 0 ] .
According to Theorem 1, control parameters κ i , δ i , θ i r , i , r = 1 , 2 , 3 should satisfy
κ i α i + r = 1 M ( ϕ ˜ r i Q r + ε d ˜ r i Q r ) , θ i r ψ ˜ i r Q r , δ i > r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r ) ,
Here, we choose
κ 1 = 5.5 , κ 2 = 6.2 , κ 3 = 6.7 , δ 1 = 3.0 , δ 2 = 2.5 , δ 3 = 3.5 θ 11 = 3.0 , θ 12 = 1.3 , θ 13 = 2.5 , θ 21 = 2.6 , θ 22 = 5.2 , θ 23 = 3.1 , θ 31 = 2.5 , θ 32 = 2.1 , θ 33 = 5.1 ,
Figure 1 illustrates the phase trajectories of system (29) in two-dimensional state space without controller. Figure 2 show the state trajectories of systems (29) and (31) without controller. Figure 2 indicates that they have not reached synchronization without controller. Figure 3 show the state trajectories of systems (29) and (31) with controller. Figure 3 shows the state trajectories of the error system with controller. Figure 3 indicates that they can achieve synchronization within a finite time under this controller (16). Furthermore, according to Theorem 1, T max = 4.2117 can be computed using Formula (18). This sufficiently confirms that Theorem 2 is effective.
Example 2.
For system (29), the system parameter selection is as follows:
Γ 1 = Γ 2 = Γ 3 = 1 , α 1 = α 2 = α 3 = 1 , ε = 0.2 , ω = 0.9 ϕ 11 = 1.8 , ϕ 12 = 1 , ϕ 13 = 1.6 , ϕ 21 = 0.8 , ϕ 22 = 1.1 , ϕ 23 = 1.0 , ϕ 31 = 1.1 , ϕ 32 = 2.0 , ϕ 33 = 1.5 , ϕ 11 = 2.0 , ϕ 12 = 0.9 , ϕ 13 = 1.8 , ϕ 21 = 1.1 , ϕ 22 = 1.2 , ϕ 23 = 1.3 , ϕ 31 = 1.2 , ϕ 32 = 1.7 , ϕ 33 = 2.1 ψ 11 = 1.1 , ψ 12 = 0.5 , ψ 13 = 0.8 , ψ 21 = 1.4 , ψ 22 = 1.5 , ψ 23 = 0.5 ψ 31 = 1.4 , ψ 32 = 1.0 , ψ 33 = 1.2 , ψ 11 = 0.8 , ψ 12 = 0.7 , ψ 13 = 1.2 ψ 21 = 1.1 , ψ 22 = 0.5 , ψ 23 = 0.6 , ψ 31 = 1.7 , ψ 32 = 1.2 , ψ 33 = 1.5 d 11 = 1.0 , d 12 = 2.0 , d 13 = 1 , d 21 = 1.5 , d 22 = 1.0 , d 23 = 0.5 d 31 = 0.5 , d 32 = 1 , d 33 = 1.0 , d ^ 11 = 0.5 , d ^ 12 = 0.5 , d ^ 13 = 0.5 d ^ 21 = 0.5 , d ^ 22 = 0.5 , d ^ 23 = 0.5 , d ^ 31 = 0.5 , d ^ 32 = 0.5 , d ^ 33 = 0.5
Let f i ( p ( t ) ) = t a n h ( | p ( t ) | ) 1 , g i ( p ( t ) ) = t a n h ( p ( t ) ) , I i = 0.1 , S i = S i = 1 , Q i = Q i = 1 , i = 1 , 2 , 3 . τ ( t ) = e t 1 + e t . The initial values of system (29) are ζ 1 ( υ ) = 1 , ζ 2 ( υ ) = 0.6 , ζ 3 ( υ ) = 0.2 , υ [ τ ( t ) , 0 ] .
The parameters of response system (31) are the same as in system (29). The initial values of system (31) are ξ 1 ( υ ) = 1 , ξ 2 ( υ ) = 0.6 , ξ 3 ( υ ) = 0.8 , υ [ τ ( t ) , 0 ] .
According to Theorem 2, control gains κ i , δ i , θ i r , λ i , ρ i , i , r = 1 , 2 , 3 should satisfy
κ ^ i α i + r = 1 M ( ϕ ˜ r i Q r + ε d ˜ r i Q r ) , θ ^ i r ψ ˜ i r Q r , δ i > r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r )
Here, we choose
κ ^ 1 = 4.4 , κ ^ 2 = 5.8 , κ ^ 3 = 6.5 , θ ^ 11 = 2.0 , θ ^ 12 = 1.0 , θ ^ 13 = 2.3 , θ ^ 21 = 1.5 , θ ^ 22 = 4.8 , θ ^ 23 = 4.0 , θ ^ 31 = 3.6 , θ ^ 32 = 2.8 , θ ^ 33 = 5.2 , δ 1 = 2.8 , δ 2 = 3.0 , δ 3 = 3.5 , λ 1 = λ 2 = λ 3 = 1 , ρ 1 = ρ 2 = ρ 3 = 1
Let κ i ( 0 ) = 1 , θ i r ( 0 ) = 0.1 , i , r = 1 , 2 , 3 .
Figure 4 illustrates the phase trajectories of system (29) in two-dimensional state space without controller. Figure 5 show the state trajectories of systems (29) and (31) without controller. Figure 5 indicates that they have not reached synchronization without controller. Figure 6 show the state trajectories of systems (29) and (31) with controller. Figure 6 shows the state trajectories of the error system with controller. Figure 6 indicates that they can achieve synchronization within a finite time under this controller (17). Furthermore, according to Theorem 2, T max = 4.8839 can be computed using Formula (18). Figure 7 and Figure 8 indicate the time response trajectory of the adaptive control gains κ i ( t ) and θ i r ( t ) , ( i , r = 1 , 2 , 3 ) . This clearly indicates that the adaptive control gains κ i ( t ) , θ i r ( t ) converge to some values within a finite time. This sufficiently confirms that Theorem 2 is effective.
Example 3.
For system (29), the system parameter selection is as follows:
Γ 1 = Γ 2 = Γ 3 = 1 , α 1 = α 2 = α 3 = 1 , ε = 0.2 , ω = 0.95 ϕ 11 = 2.5 , ϕ 12 = 2 , ϕ 13 = 3 , ϕ 21 = 2.2 , ϕ 22 = 1.8 , ϕ 23 = 2.4 , ϕ 31 = 2.2 , ϕ 32 = 2.4 , ϕ 33 = 3.6 , ϕ 11 = 2.6 , ϕ 12 = 2.2 , ϕ 13 = 3.4 , ϕ 21 = 2.6 , ϕ 22 = 2.2 , ϕ 23 = 2.2 , ϕ 31 = 2.8 , ϕ 32 = 2.2 , ϕ 33 = 3.2 ψ 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.0 d 11 = 1.0 , d 12 = 2.0 , d 13 = 1.5 , d 21 = 2.0 , d 22 = 1.0 , d 23 = 0.5 d 31 = 0.5 , d 32 = 2 , d 33 = 1.0 , d ^ 11 = 1.0 , d ^ 12 = 1.0 , d ^ 13 = 1.0 d ^ 21 = 1.0 , d ^ 22 = 1.0 , d ^ 23 = 1.0 , d ^ 31 = 1.0 , d ^ 32 = 1.0 , d ^ 33 = 1.0
Let f i ( p ( t ) ) = t a n h ( | p ( t ) | ) 1 , g i ( p ( t ) ) = t a n h ( p ( t ) ) , I i = 0.1 . τ ( t ) = e t 1 + e t . The initial values of system (29) are ζ 1 ( υ ) = 0.2 , ζ 2 ( υ ) = 0.4 , ζ 3 ( υ ) = 0.6 , υ [ τ ( t ) , 0 ] .
The parameters of response system (31) are the same as in system (29). The initial values of system (31) are ξ 1 ( υ ) = 0.2 , ξ 2 ( υ ) = 0.4 , ξ 3 ( υ ) = 0.6 , υ [ τ ( t ) , 0 ] .
According to Theorem 3, control gains κ i , δ i , θ i r , η i , i , r = 1 , 2 , 3 should satisfy
κ i α i + r = 1 M ( ϕ ˜ r i Q r + ε d ˜ r i Q r ) , θ i r ψ ˜ i r Q r , δ i > r = 1 M ( | ϕ r i ϕ r i | S r + | ψ r i ψ r i | S r + ε | d ^ r i d r i | S r ) ,
Here, we choose
κ 1 = 5.5 , κ 2 = 6.2 , κ 3 = 6.7 , δ 1 = 2.5 , δ 2 = 2.6 , δ 3 = 3.5 θ 11 = 2.5 , θ 12 = 1.5 , θ 13 = 2.5 , θ 21 = 2.6 , θ 22 = 5.4 , θ 23 = 3.2 , θ 31 = 2.8 , θ 32 = 2.2 , θ 33 = 5.2 , η 1 = η 2 = η 3 = 0.5 , ι = 1.5
Figure 9 illustrates the phase trajectories of system (29) in two-dimensional state space without controller. Figure 10 show the state trajectories of systems (29) and (31) without controller. Figure 10 indicates that they have not reached synchronization without controller. Figure 11 show the state trajectories of systems (29) and (31) with controller. Figure 11 shows the state trajectories of the error system with controller. Figure 11 indicates that they can achieve synchronization before a fixed time point under this controller (26). Furthermore, according to Theorem 3, T max = 4.7425 can be computed using Formula (27). This sufficiently confirms that Theorem 3 is effective.

6. Conclusions

This paper explores the finite-time adaptive synchronization and fixed-time synchronization of FMCNNs with TVD. Utilizing the properties and principles of fractional order, we introduce a novel lemma. Based on this lemma and various analysis techniques, we establish new criteria to guarantee FTAS and FDTS of FMCNNs with TVD through the implementation of a delay-dependent feedback controller and fractional-order adaptive controller. Additionally, we estimate the upper bound of the synchronization setting time. Finally, numerical simulations are conducted to confirm the validity of the finite-time and fixed-time stability theorems. The results of the numerical simulations substantiate the validity of the conclusions presented in this paper. In future work, based on the research results of this article, we will further study the synchronization problem of discrete-time FMCNNs with TVD.

Author Contributions

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

Funding

This work was partly supported by the Natural Science Foundation of Anhui Province (2008085MF200), the Program for Innovative Research Team in Universities of Anhui Province (2022AH010085), the University Natural Science Foundation of Anhui Province (KJ2021A0970), the National Natural Science Foundation of China (61403157), and the Research and Development Plan Project Foundation of Huainan (2021A248).

Data Availability Statement

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

Acknowledgments

The authors would like to thank the anonymous referees and reviewers for their helpful comments, which have significantly improved the quality of the presentation.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Yang, X.; Ho, D.W. Synchronization of delayed memristive neural networks: Robust analysis approach. IEEE Trans. Cybern. 2015, 46, 3377–3387. [Google Scholar] [CrossRef]
  2. Wen, S.; Zeng, Z.; Huang, T.; Zhang, Y. Exponential adaptive lag synchronization of memristive neural networks via fuzzy method and applications in pseudorandom number generators. IEEE Trans. Fuzzy Syst. 2013, 22, 1704–1713. [Google Scholar] [CrossRef]
  3. Hu, X.; Feng, G.; Duan, S.; Liu, L. A memristive multilayer cellular neural network with applications to image processing. IEEE Trans. Neural Netw. Learn. Syst. 2016, 28, 1889–1901. [Google Scholar] [CrossRef]
  4. Chua, L. Memristor-the missing circuit element. IEEE Trans. Circuit Theory 1971, 18, 507–519. [Google Scholar] [CrossRef]
  5. Ali, M.S.; Hymavathi, M.; Senan, S.; Shekher, V.; Arik, S. Global asymptotic synchronization of impulsive fractional-order complex-valued memristor-based neural networks with time varying delays. Commun. Nonlinear Sci. Numer. Simul. 2019, 78, 104869. [Google Scholar]
  6. Li, N.; Zheng, W.X. Synchronization criteria for inertial memristor-based neural networks with linear coupling. Neural Netw. 2018, 106, 260–270. [Google Scholar] [CrossRef]
  7. Wu, K.; Jian, J. Non-reduced order strategies for global dissipativity of memristive neutral-type inertial neural networks with mixed time-varying delays. Neurocomputing 2021, 436, 174–183. [Google Scholar] [CrossRef]
  8. Zhang, T.; Jian, J. New results on synchronization for second-order fuzzy memristive neural networks with time-varying and infinite distributed delays. Knowl.-Based Syst. 2021, 230, 107397. [Google Scholar] [CrossRef]
  9. 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]
  10. Zhang, X.; Jiang, W. Construction of flux-controlled memristor and circuit simulation based on smooth cellular neural networks module. IET Circuits Devices Syst. 2018, 12, 263–270. [Google Scholar] [CrossRef]
  11. Ascoli, A.; Messaris, I.; Tetzlaff, R.; Chua, L.O. Theoretical foundations of memristor cellular nonlinear networks: Stability analysis with dynamic memristors. IEEE Trans. Circuits Syst. I Regul. Pap. 2019, 67, 1389–1401. [Google Scholar] [CrossRef]
  12. Song, C.; Cao, J. Dynamics in fractional-order neural networks. Neurocomputing 2014, 142, 494–498. [Google Scholar] [CrossRef]
  13. Wang, H.; Yu, Y.; Wen, G. Stability analysis of fractional-order Hopfield neural networks with time delays. Neural Netw. 2014, 55, 98–109. [Google Scholar] [CrossRef]
  14. Ma, Z.; Ma, H. Adaptive fuzzy backstepping dynamic surface control of strict-feedback fractional-order uncertain nonlinear systems. IEEE Trans. Fuzzy Syst. 2020, 28, 122–133. [Google Scholar] [CrossRef]
  15. Zhang, Q.; Lu, J. Bounded real lemmas for singular fractional-order systems: The 1 < α < 2 case. IEEE Trans. Circuits Syst. II Express Briefs 2021, 68, 732–736. [Google Scholar]
  16. Shafiya, M.; Nagamani, G.; Dafik, D. Global synchronization of uncertain fractional-order BAM neural networks with time delay via improved fractional-order integral inequality. Math. Comput. Simul. 2022, 191, 168–186. [Google Scholar] [CrossRef]
  17. Yan, S.; Gu, Z.; Nguang, S. Memory-event-triggered H output control of neural networks with mixed delays. IEEE Trans. Neural Netw. Learn. Syst. 2022, 33, 6905–6915. [Google Scholar] [CrossRef] [PubMed]
  18. 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]
  19. Li, H.L.; Zhang, L.; Hu, C.; Jiang, H.; Cao, J. Global Mittag-Leffler synchronization of fractional-order delayed quaternion-valued neural networks: Direct quaternion approach. Appl. Math. Comput. 2020, 373, 125020. [Google Scholar] [CrossRef]
  20. 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, 111432. [Google Scholar] [CrossRef]
  21. Tong, D.; Zhang, L.; Zhou, W.; Zhou, J.; Xu, Y. Asymptotical synchronization for delayed stochastic neural networks with uncertainty via adaptive control. Int. J. Control Autom. Syst. 2016, 14, 706–712. [Google Scholar] [CrossRef]
  22. Xiong, X.; Zhang, Z. Asymptotic synchronization of conformable fractional-order neural networks by L’Hopital’s rule. Chaos Solitons Fractals 2023, 173, 113665. [Google Scholar] [CrossRef]
  23. Guo, Z.; Gong, S.; Yang, S.; Huang, T. Global exponential synchronization of multiple coupled inertial memristive neural networks with time-varying delay via nonlinear coupling. Neural Netw. 2018, 108, 260–271. [Google Scholar] [CrossRef]
  24. Zhang, T.; Jian, J. Quantized intermittent control tactics for exponential synchronization of quaternion-valued memristive delayed neural networks. ISA Trans. 2022, 126, 288–299. [Google Scholar] [CrossRef] [PubMed]
  25. Zheng, C.; Cao, J. Robust synchronization of coupled neural networks with mixed delays and uncertain parameters by intermittent pinning control. Neurocomputing 2014, 141, 153–159. [Google Scholar] [CrossRef]
  26. Duan, L.; Wei, H.; Huang, L. Finite-time synchronization of delayed fuzzy cellular neural networks with discontinuous activations. Fuzzy Sets Syst. 2019, 361, 56–70. [Google Scholar] [CrossRef]
  27. Li, H.L.; Cao, J.; Jiang, H.; Alsaedi, A. Graph theory-based finite-time synchronization of fractional-order complex dynamical networks. J. Frankl. Inst. 2018, 355, 5771–5789. [Google Scholar] [CrossRef]
  28. Lu, J.; Guo, Y.; Ji, Y.; Fan, S. Finite-time synchronization for different dimensional fractional-order complex dynamical networks. Chaos Solitons Fractals 2020, 130, 109433. [Google Scholar] [CrossRef]
  29. Shanmugam, S.; Narayanan, G.; Rajagopal, K.; Ali, M.S. Finite-time synchronization of complex-valued neural networks with reaction-diffusion terms: An adaptive intermittent control approach. Neural Comput. Appl. 2024, 36, 7389–7404. [Google Scholar] [CrossRef]
  30. He, X.; Wang, Y.; Li, T.; Kang, R.; Zhao, Y. Novel Controller Design for Finite-Time Synchronization of Fractional-Order Nonidentical Complex Dynamical Networks under Uncertain Parameters. Fractal Fract. 2024, 8, 155. [Google Scholar] [CrossRef]
  31. Xiao, J.; Wu, L.; Wu, A.; Zeng, Z.; Zhang, Z. Novel controller design for finite-time synchronization of fractional-order memristive neural networks. Neurocomputing 2022, 512, 494–502. [Google Scholar] [CrossRef]
  32. Duan, L.; Li, J. Fixed-time synchronization of fuzzy neutral-type BAM memristive inertial neural networks with proportional delays. Inf. Sci. 2021, 576, 522–541. [Google Scholar] [CrossRef]
  33. Polyakov, A. Nonlinear feedback design for fixed-time stabilization of linear control systems. IEEE Trans. Autom. Control 2011, 57, 2106–2110. [Google Scholar] [CrossRef]
  34. Cheng, Y.; Hu, T.; Xu, W.; Zhang, X.; Zhong, S. Fixed-time synchronization of fractional-order complex-valued neural networks with time-varying delay via sliding mode control. Neurocomputing 2022, 505, 339–352. [Google Scholar] [CrossRef]
  35. 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]
  36. Li, X.; Fang, J.A.; Zhang, W.; Li, H. Finite-time synchronization of fractional-order memristive recurrent neural networks with discontinuous activation functions. Neurocomputing 2018, 316, 284–293. [Google Scholar] [CrossRef]
  37. Li, J.; Jiang, H.; Hu, C.; Alsaedi, A. Finite/fixed-time synchronization control of coupled memristive neural networks. J. Frankl. Inst. 2019, 356, 9928–9952. [Google Scholar] [CrossRef]
  38. Li, X.; Zhang, W.; Fang, J. Finite-time synchronization of memristive neural networks with discontinuous activation functions and mixed time-varying delays. Neurocomputing 2019, 340, 99–109. [Google Scholar] [CrossRef]
  39. Zhang, Y.; Deng, S. Finite-time projective synchronization of fractional-order complex-value d memristor-base d neural networks with delay. Chaos Solitons Fractals 2019, 128, 176–190. [Google Scholar] [CrossRef]
  40. Guo, Z. Finite-time synchronization of inertial memristive neural networks with time delay via delay-dependent control. Neurocomputing 2018, 293, 100–107. [Google Scholar] [CrossRef]
  41. Wei, F.; Chen, G.; Zeng, Z.; Gunasekaran, N. Finite/fixed-time synchronization of inertial memristive neural networks by interval matrix method for secure communication. Neural Netw. 2023, 167, 168–182. [Google Scholar] [CrossRef] [PubMed]
  42. Gong, S.; Guo, Z.; Wen, S. Finite-time synchronization of TS fuzzy memristive neural networks with time delay. Fuzzy Sets Syst. 2023, 459, 67–81. [Google Scholar] [CrossRef]
  43. 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]
  44. Arslan, E.; Narayanan, G.; Ali, M.S.; Arik, S.; Saroha, S. Controller design for finite-time and fixed-time stabilization of fractional-order memristive complex-valued BAM neural networks with uncertain parameters and time-varying delays. Neural Netw. 2020, 130, 60–74. [Google Scholar] [CrossRef] [PubMed]
  45. Wang, W.; Jia, X.; Wang, Z.; Luo, X.; Li, L.; Kurths, J.; Yuan, M. Fixed-time synchronization of fractional order memristive MAM neural networks by sliding mode control. Neurocomputing 2020, 401, 364–376. [Google Scholar] [CrossRef]
  46. Xiao, J.; Hu, Y.; Zeng, Z.; Wu, A.; Wen, S. Fixed/predefined-time synchronization of memristive neural networks based on state variable index coefficient. Neurocomputing 2023, 560, 126849. [Google Scholar] [CrossRef]
  47. Wang, D.; Li, L. Fixed-time synchronization of delayed memristive neural networks with impulsive effects via novel fixed-time stability theorem. Neural Netw. 2023, 163, 75–85. [Google Scholar] [CrossRef]
  48. Podlubny, I. Fractional Differential Equations; Academic Press: New York, NY, USA, 1999. [Google Scholar]
  49. Lakshmikantham, V.; Vatsala, A. Basic theory of fractional differential equations. Nonlinear Anal. 2008, 69, 2677–2682. [Google Scholar] [CrossRef]
  50. Zhang, S.; Yu, Y.; Wang, H. Mittag-Leffler stability of fractional-order hopfield neural networks. Nonlin. Anal. Hybrid Syst. 2015, 16, 104–121. [Google Scholar] [CrossRef]
  51. Yu, J.; Hu, C.; Jiang, H. Corrigendum to Projective synchronization for fractional neural networks. Neural Netw. 2015, 67, 152–154. [Google Scholar] [CrossRef]
  52. Kong, F.; Zhu, Q.; Sakthivel, R. Finite-time and fixed-time synchronization analysis of fuzzy Cohen-Grossberg neural networks with piecewise activations and parameter uncertainties. Eur. J. Control 2020, 56, 179–190. [Google Scholar] [CrossRef]
Figure 1. Phase trajectories of (29) in two–dimensional spaces.
Figure 1. Phase trajectories of (29) in two–dimensional spaces.
Mathematics 12 01108 g001
Figure 2. State trajectories of p i ( t ) , q i ( t ) , and Δ i ( t ) without controller.
Figure 2. State trajectories of p i ( t ) , q i ( t ) , and Δ i ( t ) without controller.
Mathematics 12 01108 g002
Figure 3. State trajectories of p i ( t ) , q i ( t ) , and Δ i ( t ) with controller.
Figure 3. State trajectories of p i ( t ) , q i ( t ) , and Δ i ( t ) with controller.
Mathematics 12 01108 g003
Figure 4. Phase trajectories of (29) in two–dimensional spaces.
Figure 4. Phase trajectories of (29) in two–dimensional spaces.
Mathematics 12 01108 g004
Figure 5. State trajectories of p i ( t ) , q i ( t ) , and Δ i ( t ) without controller.
Figure 5. State trajectories of p i ( t ) , q i ( t ) , and Δ i ( t ) without controller.
Mathematics 12 01108 g005
Figure 6. State trajectoriesof p i ( t ) , q i ( t ) , and Δ i ( t ) with controller.
Figure 6. State trajectoriesof p i ( t ) , q i ( t ) , and Δ i ( t ) with controller.
Mathematics 12 01108 g006
Figure 7. State trajectories of control gains κ i ( t ) , i = 1 , 2 , 3 .
Figure 7. State trajectories of control gains κ i ( t ) , i = 1 , 2 , 3 .
Mathematics 12 01108 g007
Figure 8. State trajectories of control gains θ i r ( t ) , i , r = 1 , 2 , 3 .
Figure 8. State trajectories of control gains θ i r ( t ) , i , r = 1 , 2 , 3 .
Mathematics 12 01108 g008
Figure 9. Phase trajectories of (29) in two-dimensional spaces.
Figure 9. Phase trajectories of (29) in two-dimensional spaces.
Mathematics 12 01108 g009
Figure 10. State trajectories of p i ( t ) , q i ( t ) , and Δ i ( t ) without controller.
Figure 10. State trajectories of p i ( t ) , q i ( t ) , and Δ i ( t ) without controller.
Mathematics 12 01108 g010
Figure 11. State trajectories of p i ( t ) , q i ( t ) , and Δ i ( t ) with controller.
Figure 11. State trajectories of p i ( t ) , q i ( t ) , and Δ i ( t ) with controller.
Mathematics 12 01108 g011
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

Liu, Y.; Sun, Y. Finite-Time Adaptive Synchronization and Fixed-Time Synchronization of Fractional-Order Memristive Cellular Neural Networks with Time-Varying Delays. Mathematics 2024, 12, 1108. https://doi.org/10.3390/math12071108

AMA Style

Liu Y, Sun Y. Finite-Time Adaptive Synchronization and Fixed-Time Synchronization of Fractional-Order Memristive Cellular Neural Networks with Time-Varying Delays. Mathematics. 2024; 12(7):1108. https://doi.org/10.3390/math12071108

Chicago/Turabian Style

Liu, Yihong, and Yeguo Sun. 2024. "Finite-Time Adaptive Synchronization and Fixed-Time Synchronization of Fractional-Order Memristive Cellular Neural Networks with Time-Varying Delays" Mathematics 12, no. 7: 1108. https://doi.org/10.3390/math12071108

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