Next Article in Journal
On Implicit Coupled Hadamard Fractional Differential Equations with Generalized Hadamard Fractional Integro-Differential Boundary Conditions
Next Article in Special Issue
Neutral-Type and Mixed Delays in Fractional-Order Neural Networks: Asymptotic Stability Analysis
Previous Article in Journal
On the Absorbing Problems for Wiener, Ornstein–Uhlenbeck, and Feller Diffusion Processes: Similarities and Differences
Previous Article in Special Issue
Bifurcation Phenomenon and Control Technique in Fractional BAM Neural Network Models Concerning Delays
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Switching-Jumps-Dependent Quasi-Synchronization Criteria for Fractional-Order Memrisive Neural Networks

1
College of Electrical Engineering and Automation, Shandong University of Science and Technology, Qingdao 266590, China
2
College of Mathematics and Systems Science, Shandong University of Science and Technology, Qingdao 266590, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2023, 7(1), 12; https://doi.org/10.3390/fractalfract7010012
Submission received: 27 November 2022 / Revised: 20 December 2022 / Accepted: 22 December 2022 / Published: 24 December 2022

Abstract

:
This paper investigates the switching-jumps-dependent quasi-synchronization issue for fractional-order memristive neural networks (FMNNs). First, a simplied linear feedback controller is applied. Then, in terms of several fractional order differential inequalities and two kinds of Lyapunov functions, two quasi-synchronization criteria expressed by linear matrix inequality (LMI)-based form and algebraic form are established, respectively. Meanwhile, the co-designed scheme for error bound and control gain is established. Compared with the previous quasi-synchronization results, a strong assumption that the system states must be bounded is removed. Finally, some simulation examples are carried out to display the feasibility and validity of the proposed analysis methods.

1. Introduction

Neural networks have self-organization ability, fault tolerance, adaptability, fast computing speed, and strong associative ability, and they are widely used in image processing [1], fault diagnosis [2], signal processing [3], pattern recognition [4], fluid mechanics [5] and other fields with broad application prospects and are a research hotspot. A rich body of research has studied FMNNs and developed neural network models such as convolution neural network [6], Hopfield neural network [7], artificial neural network [8], fuzzy rough neural network [9], and spiking neural network [10]. In recent decades, many scholars nationally and internationally have found that fractional calculus operators have memory and non-locality [11], and they are widely used in neural networks because of these characteristics. Fractional neural networks have achieved many excellent results, such as in [12,13]. Chua [14] pioneered the concept of the memristor, which was discovered by Hui Pu Labs [15] as the fourth basic circuit element. Memristors have the characteristics of low energy consumption, high storage, small size and non-volatility. They have very similar functions to biological neuron synapses and can act as synapses of artificial neurons. Therefore, the fractional-order neural network based on a memristor is established, namely the fractional-order memristive neural network. Many excellent works on FMNNs have been studied in [16,17,18].
Synchronization is an interesting research hotspot. Up to now, some published works have been published for FMNNs. For example, the Mittag–Leffler synchronization issue has been investigated for complex-valued FMNNs by designing complex-valued adaptive controller and using fractional-order Lyapunov theory [19]. The pinging synchronization control issues have been addressed along with delay pulse FMNNs and multi-delays FMNNs in [20,21], respectively. Combining open-loop control with time-delay feedback control, the projection synchronization issue has been considered for a class of multi-delay FMNNs [22]. By designing a chatter-free sliding mode controller, the synchronization of fractional-order chaotic systems has been discussed in combination with a neural network observer [23]. Using the interval matrix method, a linear state feedback controller was constructed, and then, the quasi-synchronization problem of FMNNs was solved [24]. In [25], the error system was processed by the closure algorithm. In addition, the linear state feedback controller has been applied, and the robust synchronization of the fractional Hopfield memristive neural network has been realized. Nevertheless, almost all the mentioned works are focused on the complete synchronization. Only a few works focus on the quasi-synchronization of FMNNs in the presence of switching jumps. In addition, most existing synchronization controllers may be too complex for FMNNs. Therefore, it is necessary to study the potential mechanism of the impact of switching jumps on synchronization. However, as far as we know, this is still an outstanding issue which deserves further investigation. As such, we need to study the switching-jumps-dependent quasi-synchronization issue for FMNNs.
It is worth noting that the previous works associated with the synchronization, the stability, and the stabilization problems of FMNNs are all expressed in terms of algebraic conditions [26,27,28,29]. Nevertheless, the defect of this method is that it requires a large amount of calculation because the conditions must be checked n times one by one. To overcome this defect, the LMI-based approach, based on which and with the help of MATLAB LMI toolbox the feasible solutions can be easily obtained, is considered to be a convenient and effective method. Unfortunately, the existing LMI-based approach is not applicable to the FMNNs systems studied in this paper. To this end, two new inequalities in differential inclusion are identified and the criterion of quasi-synchronization in the form of LMIs is obtained. On the other hand, the previous works on quasi-synchronization [30] cannot be derived unless there is a strong assumption that the system states must be bounded. This implies that the trajectory boundary needs to be given beforehand. That is to say, the state estimation issue is a prerequisite for the research of dynamic systems control design. Therefore, such a problem has become particularly meaningful and achieved a lot of excellent results. However, it indeed poses a difficult and challenging problem for obtaining the real-time status information. The main reason lies in that the boundaries of chaotic systems are dependent on the initial value, and then the boundary must be recalculated as long as the initial value changes. To address this issue, we will develop a novel analysis method that is not limited by chaotic trajectories so as to implement some improved quasi-synchronization criteria.
Inspired by the above discussion, this paper mainly discusses the quasi-synchronization of FMNNs based on linear feedback control. The main contributions are listed as follows:
(1) In contrast with the previous results [24,30], a strong assumption that the system states must be bounded is removed.
(2) In view of several fractional order differential inequalities and two kinds of Lyapunov functions, two quasi-synchronous criteria given by LMIs-based form and algebraic form are developed, respectively. In addition, the co-designed scheme for the error bound and control gain is established.
In addition, some useful notations are displayed in Table 1.

2. Preliminaries and Model Description

Consider the following FMNNs as the drive system
0 D t ι ν p t = δ p ν p t + q = 1 n α p q ν q t ψ q ν q t , p = 1 , , n ,
where order 0 < ι < 1 ; ν p t denotes the state of the pth neuron; δ p > 0 denotes the system state; α p q ( ν q ( t ) ) is the memristive connection weights; and
α p q ( ν q ( t ) ) = W f   p q ι p × ι p q ,
where ι p q = 1 if p q , otherwise ι p q = 1 . W f   p q is the memductances of voltage-controlled memristors M f   p q , respectively; M f   p q is the memristor connecting ψ q ν q t and ν p t ; ψ q ( · ) is the activation functions satisfying ψ q ( 0 ) = 0 , | ψ q ( ν ) ψ q ( μ ) | ψ q | ν μ | , where ψ q is Lipschitz constant, and ν , μ R and q = 1 , , n . The initial condition ν p ( t ) = ϕ p ( t ) , for p = 1 , , n . The memristive synaptic weights α p q ν q t is represented by
α p q ν q t = α ^ p q , ν q t < T q , α ˇ p q , ν q t > T q ,
for p , q = 1 , , n , where α ^ p q , α ˇ p q , are constants and the switching jumps T q > 0 .
Accordingly, consider the response system
0 D t ι μ p t = δ p μ p t + q = 1 n α p q μ q t ψ q μ q t + u p ( t ) , p = 1 , , n ,
where u p ν ( t ) is the stabilizing control law, μ p t denotes the state of the pth neuron; and
α p q μ q t = α ^ p q , μ q t < T q , α ˇ p q , μ q t > T q ,
where T q > 0 denotes the switching jumps. The initial condition μ p ( t ) = ϑ p ( t ) , for p = 1 , , n .
Based on [31], define the multivalued maps for system (1) as
K α p q ν q t = α ^ p q , ν q t > T q , c o α ^ p q , α ˇ p q , ν q t = T q , α ˇ p q , ν q t < T q .
Clearly, c o α ^ p q , α ˇ p q = α ̲ p q , α ¯ p q for p , q = 1 , , n , where α ̲ p q = m i n α ^ p q , α ˇ p q , α ¯ p q = m a x α ^ p q , α ˇ p q .
For p = 1 , , n , the set-valued map
ν p ( t ) δ p ν p t + q = 1 n K α p q ν q t ψ q ν q t ,
is compact, nonempty and convex. In addition, it is upper semi-continuous [32].
From (1), it yields
0 D t ι ν p t δ p ν p t + q = 1 n K α p q ν q t ψ q ν q t .
Moreover, in view of the measurable selection theorem [33], there exists γ p q ν q t K α p q ν q t such that
0 D t ι ν p t = δ p ν p t + q = 1 n γ p q ν q t ψ q ν q t .
Similarly, for response system (2), define
K α p q μ q t = α ^ p q , μ q t > T q , c o α ^ p q , α ˇ p q , μ q t = T q , α ˇ p q , μ q t < T q .
Then, from (2), it yields
0 D t ι μ p t δ p μ p t + q = 1 n K α p q μ q t ψ q μ q t + u p ( t ) .
Moreover, there exists γ p q μ q t K α p q μ q t such that
0 D t ι μ p t = δ p μ p t + q = 1 n γ p q μ q t ψ q μ q t + u p ( t ) .
Let ε p ( t ) = μ p ( t ) ν p ( t ) , and the controller
u p ( t ) = k p ε p ( t ) ,
where k p > 0 , p = 1 , 2 , , n . Then, according to (4) and (6), one has
0 D t ι ε p t = ( δ p + k p ) ε p ( t ) + q = 1 n γ p q μ q t ψ q μ q t γ p q ν q t ψ q ν q t .
The initial condition is defined by ε p ( 0 ) = Φ p ( 0 ) , where Φ p ( s ) = ϑ μ p ( s ) ϑ ν p ( s ) .
Denote ν ( t ) = [ ν 1 ( t ) , , ν n ( t ) ] T , μ ( t ) = [ μ 1 ( t ) , , μ n ( t ) ] T , ε ( t ) = [ ε 1 ( t ) , , ε n ( t ) ] T , and ϕ ( s ) = [ ϕ 1 ( s ) , , ϕ n ( s ) ] T .
Remark 1. 
During the dynamic evolution of FMNN, asynchronous switching time interval (ASTI) and synchronous switching time interval (SSTI), i.e., α p q ( ν q ( t ) ) α p q ( μ q ( t ) ) and α p q ( ν q ( t ) ) = α p q ( μ q ( t ) ) , appear alternately. The drive-response systems are sometimes consistent and sometimes different. When the drive-response systems switch with consistent jumps and inconsistent initial values, it is impossible to eliminate errors for ensuring complete synchronization, because fractional nonlinear systems based on continuous controllers do not have finite time stability [34]. Therefore, the error that is not completely eliminated will result in the state of the drive-response systems not reaching the switch jump T q at the same time. This means that the drive-response systems cannot be switched synchronously, which will result in α p q ( ν q ( t ) ) α p q ( m u q ( t ) ) . In other words, ASTI will appear. On the other hand, mismatches between join weights can also lead to new synchronization errors. Therefore, the linear feedback controller cannot achieve complete synchronisation due to the total error of two different subsystems in ASTI. After analysis, ASTI plays an important role in FMNN synchronization. In fact, even if the initial value is the same, if the switch jumps are not equal, i.e., Δ T 0 , the linear feedback control systems (1)–(2) may not be able to achieve full synchronization, because ASTI does exist.
To facilitate the analysis, the following definition and lemmas are proposed.
Definition 1
([35]). The Caputo fractional derivative of order 0 < ι < 1 of a function χ ( t ) is defined as
t 0 D t ι χ ( t ) = 1 Γ ( 1 ι ) t 0 t ( t τ ) ι χ ( τ ) d τ .
Lemma 1
([36]). If continuously differentiable function h ( t ) C 1 ( [ 0 , + ) , R ) , for any ι ( 0 , 1 ) , one has
0 D t ι ν ( t ) sign ( h ( t ) ) 0 δ t ι h ( t ) .
Lemma 2
([37]). If vector ν ( t ) R n denotes a differentiable function. Then, for t t 0 , one has
1 2 t 0 D t ι ν T ( t ) P ν ( t ) ν T ( t ) P t 0 D t ι ν ( t ) ι ( 0 , 1 ] ,
where P > 0 R n × n .
Lemma 3 
([38]). The LMI
O = O 11 O 12 O 12 T O 22 < 0 ,
is equivalent to
  • O 11 < 0 , O 22 O 12 T O 11 1 O 12 < 0 ,
  • O 22 < 0 , O 11 O 12 O 22 1 O 12 T < 0 ,
where O 11 = O 11 T , O 22 = O 22 T .

3. Main Results

Theorem 1.
If the following algebraic condition
min 1 p n δ p + k p q = 1 n α q p u L p > 0
holds, then systems (1)–(2) achieve quasi-synchronization with error bound θ λ via the controller (7), where λ = min 1 p n δ p + k p q = 1 n α q p u L p , θ = p = 1 n q = 1 n Δ α p q L q T max .
Proof. 
Take the following Lyapunov function:
V ( t ) = p = 1 n | ε p ( t ) | .
or any given p , q = 1 , 2 , , n , and ν q , μ q R , one has
If ν q ( t ) < T q , μ q ( t ) < T q , then
K α p q μ q ( t ) ψ q μ q ( t ) K α p q ν q ( t ) ψ q ν q ( t ) = α ^ p q ψ q μ q ( t ) α ^ p q ψ q ν q ( t ) α ^ p q ψ q μ q ( t ) ψ q ν q ( t ) α p q u L q ε q ( t ) ,
where α p q u = max { | α ^ p q | , | α ˇ p q | } .
If ν q ( t ) > T q , μ q ( t ) > T q , then
K α p q μ q ( t ) ψ q μ q ( t ) K α p q ν q ( t ) ψ q ν q ( t ) = α ˇ p q ψ q μ q ( t ) α ˇ p q ψ q ν q ( t ) α ˇ p q ψ q μ q ( t ) ψ q ν q ( t ) α p q u L q ε q ( t ) .
If ν q ( t ) T q , μ q ( t ) T q , then
K α p q μ q ( t ) ψ q μ q ( t ) K α p q ν q ( t ) ψ q ν q ( t ) = α ˇ p q ψ q μ q ( t ) α ^ p q ψ q ν q ( t ) = α ˇ p q ψ q μ q ( t ) ψ q ν q ( t ) + α ˇ p q α ^ p q ψ q ν q ( t ) α p q u L q ε q ( t ) + α ^ p q α ˇ p q L q ν q ( t ) α p q u L q ε q ( t ) + Δ α p q L q T max .
If ν q ( t ) T q , μ q ( t ) T q , we also have
K α p q μ q ( t ) ψ q μ q ( t ) K α p q ν q ( t ) ψ q ν q ( t ) α p q u L q ε q ( t ) + Δ α p q L q T max .
Hence, one can obtain
K α p q μ q ( t ) ψ q μ q ( t ) K α p q ν q ( t ) ψ q ν q ( t ) α p q u L q ε q ( t ) + Δ α p q L q T max .
In view of Lemma 1, one has
0 δ t ι V ( t ) = δ t ι p = 1 n ε p ( t ) p = 1 n sign ε p ( t ) δ t ι ε p ( t ) = p = 1 n sign ε p ( t ) { δ p + k p ε p ( t ) + q = 1 n γ p q μ q ( t ) ψ q μ q ( t ) γ p q ν q ( t ) ψ q ν q ( t ) } p = 1 n δ p + k p ε p ( t ) + p = 1 n q = 1 n α p q u L q ε q ( t ) + p = 1 n q = 1 n Δ α p q L q T max = p = 1 n δ p + k p q = 1 n α q p u L p ε p ( t ) + p = 1 n q = 1 n Δ α p q L q T max .
Let λ = min 1 p n δ p + k p q = 1 n α q p u L p , θ = p = 1 n q = 1 n Δ α p q L q T max , T max = max { T q } . Then, one has
δ t ι V ( t ) λ p = 1 n ε p ( t ) + θ = λ V ( t ) + θ .
Based on Fractional Halanay inequality [39], it yields
ε ( t ) 1 θ λ , t + .
Obviously, the synchronization error belongs to region D, where
D = ε ( t ) : ε ( t ) 1 θ λ , t + ,
which means that the quasi-synchronization of systems (1)–(2) can be achieved with error bound θ λ . □
Theorem 2.
For given matrices P > 0 , Q 1 > 0 , Q 2 > 0 , G , a scalar λ > 0 , and
2 P C 2 G + P A ˜ L + L A ˜ T P + λ P 0 P * Q 1 0 * * Q 2 < 0 ,
holds, then the quasi-synchronization of systems (1)–(2) can be achieved with error bound θ min p p λ , where C = diag δ 1 , , δ n ,   M = diag ( M 1 , , M n ) ,   L = diag L 1 , , L n ,   θ = H T Q 2 H ,   H = Δ A L T ˜ max , T ˜ max = ( T max , ,   T max ) T ,   A ˜ = α p q u n × n ,   Δ A = Δ α p q n × n . Moreover, feedback gain K = P 1 G , P = diag p 1 , , p n and K = diag k 1 , , k n .
Proof. 
Consider the Lyapunov function
V ( t ) = | ε ( t ) | T P | ε ( t ) | .
where | ε ( t ) | = e 1 ( t ) , e 2 ( t ) , , e n ( t ) T , P = diag p 1 , p 2 , , p n
In view of Lemmas 1–3, one has
0 δ t ι V ( t ) 2 | ε ( t ) | T P 0 δ t ι | ε ( t ) | = 2 p = 1 n ε p ( t ) p p δ t ι ε p ( t ) 2 p = 1 n ε p ( t ) p p sign ε p ( t ) 0 δ t ι ε p ( t ) = 2 p = 1 n ε p ( t ) p p sign ( ε p ( t ) ) { δ p + k p ε p ( t ) + q = 1 n γ p q μ q ( t ) ψ q μ q ( t ) γ p q ν q ( t ) ψ q ν q ( t ) } 2 p = 1 n ε p ( t ) p p δ p + k p ε p ( t ) + p = 1 n q = 1 n ε p ( t ) p p γ p q μ q ( t ) ψ q μ q ( t ) γ p q ν q ( t ) ψ q ν q ( t ) 2 p = 1 n ε p ( t ) p p δ p + k p ε p ( t ) + 2 p = 1 n q = 1 n ε p ( t ) p p α p q u L q ε q ( t ) + Δ α p q L q T max = 2 p = 1 n ε p ( t ) p p δ p + k p ε p ( t ) + 2 p = 1 n q = 1 n ε p ( t ) p p α p q u L q ε q ( t ) + 2 p = 1 n q = 1 n ε q ( t ) p p Δ α p q L q T max = 2 | ε ( t ) | T P ( C + K ) | ε ( t ) | + 2 | ε ( t ) | T P A ˜ L | ε ( t ) | + 2 | ε ( t ) | T P H 2 | ε ( t ) | T P ( C + K ) | ε ( t ) | + 2 | ε ( t ) | T P A ˜ L | ε ( t ) | + | ε ( t ) | T Q 2 1 P 2 | ε ( t ) | + H T Q 2 H = | ε ( t ) | T 2 P C 2 P K + P A ˜ L + L A ˜ T P + Q 2 1 P 2 + λ P | ε ( t ) | λ | ε ( t ) | T P | ε ( t ) | + H T Q 2 H .
By Lemma 3, the LMI of Theorem 2 is equivalent to
2 P C 2 P K + P A ˜ L + L A ˜ T P + Q 2 1 P 2 + λ P < 0 .
Hence, one has
0 δ t ι V ( t ) λ | ε ( t ) | T P | ε ( t ) | + H T Q 2 H λ | ε ( t ) | T P | ε ( t ) | + θ = λ V ( t ) + θ .
Based on Fractional Halanay inequality [39], one has
V ( t ) θ λ , t + .
From V ( t ) = | ε ( t ) | T P | ε ( t ) | = p = 1 n p p ε p ( t ) 2 , one has
min p p ε ( t ) 2 2 V ( t ) max p p ε ( t ) 2 2 .
According to (9) and (10), one can obtain
min p p ε ( t ) 2 2 V ( t ) θ λ , t +
Hence, it has
ε ( t ) 2 θ min p p λ , t + ,
which means that the quasi-synchronization of systems (1)–(2) can be achieved with error bound θ min p p λ . □
Remark 2.
Because of the fractional derivative definition, some traditional methods applied for MNNs, i.e., the Lyapunov Krasovskii functional, cannot be simply used to find conclusions and apply them to FMNNs. By employing the existing LMI-based analysis techniques and by constructing an appropriate fractional Lyapunov function, the LMI-based conditions of FMNNs are given, which are easy to solve. The analysis technology in this paper provides a new idea for the research of FMNNs.

4. Numerical Examples

Example 1.
Consider a 2−neurons FMNNs (1), ι = 0.78 , ψ q ( ν q ) = t a n h ( ν q ) , q = 1 , 2 . Take δ 1 = 2.6 , δ 2 = 2.6 , T q = 1 and
α 11 ( ν 1 ) = 2.0 , | ν 1 | < 1 1.2 , | ν 1 | > 1 , α 12 ( ν 2 ) = 2.0 , | ν 2 | < 1 2.1 , | ν 2 | > 1 ,
α 21 ( ν 1 ) = 0.35 , | ν 1 | < 1 0.30 , | ν 1 | > 1 , α 22 ( ν 2 ) = 2.55 , | ν 2 | < 1 2.60 , | ν 2 | > 1 .
Assume that the response system (2) is different from the drive system only by switching jumps T q = 0.1 , q = 1 , 2 , and ϑ ν ( s ) = ϑ μ ( s ) = ( 0.8 , 0.5 ) T .
Figure 1a,b show the state trajectories of drive-response systems, respectively. Taking k 1 = 12.5958 , k 2 = 4.7486 , by simple calculation, one has T max = 1 ,
λ = min 1 p n δ p + k p q = 1 n α q p u L p = 2.6486 ,
θ = p = 1 n q = 1 n Δ α p q L q T max = 1 .
In view of Theorem 1, the quasi-synchronization can be achieved for systems (1)–(2) in the presence of error bound ε ( t ) 1 θ λ = 0.3776 , which is verified by Figure 2. From Figure 3, one can conclude that the synchronization error can be influenced by Δ T .
Example 2.
Consider a 3−neuron FMNN (1), ι = 0.85 , ψ q ( ν q ) = t a n h ( ν q ) . Set δ 1 = 2.2 , δ 2 = 1.2 , δ 3 = 1.8 , ϑ ν ( s ) = ( 1 , 0.5 , 0.7 ) T , T q = 1 , q = 1 , 2 , 3 , and
α 11 ( ν 1 ) = 2.2 , | ν 1 | T q 2 , | ν 1 | > T q , α 12 ( ν 2 ) = 2 , | ν 2 | T q 2.1 , | ν 2 | > T q ,
α 13 ( ν 3 ) = 2 , | ν 3 | T q 1.8 , | ν 3 | > T q , α 21 ( ν 1 ) = 0.8 , | ν 1 | T q 0.6 , | ν 1 | > T q ,
α 22 ( ν 2 ) = 5.71 , | ν 2 | T q 5.68 , | ν 2 | > T q , α 23 ( ν 3 ) = 1.15 , | ν 3 | T q 1.1 , | ν 3 | > T q ,
α 31 ( ν 1 ) = 4.75 , | ν 1 | T q 4.5 , | ν 1 | > T q , α 32 ( ν 2 ) = 1 , | ν 2 | T q 0.8 , | ν 2 | > T q ,
α 33 ( ν 3 ) = 1.2 , | ν 3 | T q 1.25 , | ν 3 | > T q .
Assume that the response system (2) is different from the drive system only by switching jumps T q = 0.2 , q = 1 , 2 , 3 .
Figure 4a,b display the state trajectories of systems (1)–(2) with ϑ ν ( s ) = ( 1.5 , 0.6 , 0.3 ) T and ϑ μ ( s ) = ( 1.5 , 5.1 , 4.6 ) T , respectively.
Taking λ = 6 , the values of P , G , Q 1 , Q 2 , K are given by solving the LMI in Theorem 2.
P = 0.4924 0 0 0 0.7393 0 0 0 0.3226 ,
G = 4.1480 0 0 0 8.2232 0 0 0 3.4612 ,
Q 1 = Q 2 = 5.3417 0 0 0 5.3417 0 0 0 5.3417 ,
K = P 1 G = 8.4243 0 0 0 11.1226 0 0 0 10.7301 .
By simple calculation, one has
H = Δ A L T ˜ max = ( 0.2 , 0.03 , 0.05 ) T ,
θ = H T Q 2 H 2 = 0.2137 .
Based on Theorem 2, the quasi-synchronization can be ensured for systems (1)–(2) with error bound ε ( t ) 2 θ min p p λ = 0.3322 , which is verified by Figure 5.

5. Conclusions

This paper investigates the switching-jumps-dependent quasi-synchronization problem for FMNNs. To derive the quasi-synchronization criteria, a simple linear feedback controller is applied. To obtain the improved results, a strong assumption that the system states must be bounded is removed. In combination with several fractional-order differential inequalities and two kinds of Lyapunov functions, two quasi-synchronous criteria expressed by LMIs-based conditions and algebraic conditions are derived, respectively. Finally, the theoretical results are verified by two numerical examples.

Author Contributions

Conceptualization, Y.F. and M.L.; methodology, Y.F. and M.L.; validation, Y.F., Z.W. and M.L.; software, Y.F.; writing—original draft preparation, Y.F.; writing—review and editing, Y.F., Z.W., M.L.; supervision, Y.F.; funding acquisition, Y.F. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the NNSF of China under Grants 62003794.

Data Availability Statement

Not applicable.

Acknowledgments

We would like to express our great appreciation to the editors and reviewers.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
ASTIasynchronous switching time interval
FMNNsfractional-order memristive neural networks
SSTIasynchronous switching time interval
LMIlinear matrix inequality

References

  1. Xu, X.; Tan, M.; Corcoran, B.; Wu, J.; Boes, A.; Nguyen, T.G.; Chu, S.T.; Little, B.E.; Hicks, D.G.; Morotti, R.; et al. 11 TOPS photonic convolutional accelerator for optical neural networks. Nature 2021, 589, 44–51. [Google Scholar] [CrossRef]
  2. Xu, X.; Cao, D.; Zhou, Y.; Gao, J. Application of neural network algorithm in fault diagnosis of mechanical intelligence. Mech. Syst. Signal Process. 2020, 141, 106625. [Google Scholar] [CrossRef]
  3. Yao, Q.; Wang, R.; Fan, X.; Liu, J.; Li, Y. Multi-class arrhythmia detection from 12-lead varied-length ECG using attention-based time-incremental convolutional neural network. Inf. Fusion 2020, 53, 174–182. [Google Scholar] [CrossRef]
  4. Wang, M.; Yan, Z.; Wang, T.; Cai, P.; Gao, S.; Zeng, Y.; Wan, C.; Wang, H.; Pan, L.; Yu, J.; et al. Gesture recognition using a bioinspired learning architecture that integrates visual data with somatosensory data from stretchable sensors. Nat. Electron. 2020, 3, 563–570. [Google Scholar] [CrossRef]
  5. Raissi, M.; Yazdani, A.; Karniadakis, G.E. Hidden fluid mechanics: Learning velocity and pressure fields from flow visualizations. Science 2020, 367, 1026–1030. [Google Scholar] [CrossRef] [PubMed]
  6. Sun, Y.; Xue, B.; Zhang, M.; Yen, G.G. Evolving deep convolutional neural networks for image classification. IEEE Trans. Evol. Comput. 2020, 24, 394–407. [Google Scholar] [CrossRef] [Green Version]
  7. Wang, J.; Wang, J.; Han, Q. Multivehicle task assignment based on collaborative neurodynamic optimization with discrete hopfield networks. IEEE Trans. Neural Netw. Learn. Syst. 2021, 32, 5274–5286. [Google Scholar] [CrossRef]
  8. Kim, B.; Lee, S.; Kim, J. Inverse design of porous materials using artificial neural networks. Sci. Adv. 2020, 6, 1–7. [Google Scholar] [CrossRef] [Green Version]
  9. Cao, B.; Zhao, J.; Lv, Z.; Gu, Y.; Yang, P.; Halgamuge, S.K. Multiobjective evolution of fuzzy rough neural network via distributed parallelism for stock prediction. IEEE Trans. Fuzzy Syst. 2020, 28, 939–952. [Google Scholar] [CrossRef]
  10. Zhang, X.; Zhuo, Y.; Luo, Q.; Wu, Z.; Midya, R.; Wang, Z.; Song, W.; Wang, R.; Upadhyay, N.K.; Fang, Y.; et al. An artificial spiking afferent nerve based on Mott memristors for neurorobotics. Nat. Commun. 2020, 11, 51. [Google Scholar] [CrossRef] [PubMed]
  11. Si, X.; Wang, Z.; Song, Z.; Zhang, Z. Asymptotic Stabilization of Delayed Linear Fractional-Order Systems Subject to State and Control Constraints. Fractal Fract. 2022, 6, 67. [Google Scholar] [CrossRef]
  12. Yousefpour, A.; Jahanshahi, H.; Munoz-Pacheco, J.M.; Bekiros, S.; Wei, Z. A fractional-order hyper-chaotic economic system with transient chaos. Chaos Solitons Fractals 2020, 130, 109400. [Google Scholar] [CrossRef]
  13. Tuan, L.A. Neural observer and adaptive fractional-order back-stepping fast terminal sliding mode control of RTG cranes. IEEE Trans. Ind. Electron. 2021, 68, 434–442. [Google Scholar] [CrossRef]
  14. Chua, L. Memristor-The missing circuit element. IEEE Trans. Circuit Theory 1971, 18, 507–519. [Google Scholar] [CrossRef]
  15. Strukov, D.B.; Snider, G.S.; Stewart, D.R.; Williams, R.S. The missing memristor found. Nature 2008, 453, 80–83. [Google Scholar] [CrossRef]
  16. Chen, C.; Zhu, S.; Wei, Y.; Chen, C. Finite-Time stability of delayed memristor-based fractional-order neural networks. IEEE Trans. Cybern. 2020, 50, 1607–1616. [Google Scholar] [CrossRef]
  17. Chen, L.; Huang, T.; Machado, J.; Lopes, M.; Chai, Y.; Wu, R. Delay-dependent criterion for asymptotic stability of a class of fractional-order memristive neural networks with time-varying delays. Neural Netw. 2019, 118, 289–299. [Google Scholar] [CrossRef]
  18. Song, C.; Cao, J.; Abdel-Aty, M. New Results on Robust Synchronization for Memristive Neural Networks with Fractional Derivatives via Linear Matrix Inequality. Fractal Fract. 2022, 6, 585. [Google Scholar] [CrossRef]
  19. Chen, J.; Chen, B.; Zeng, Z. Global asymptotic stability and adaptive ultimate Mittag-Leffler synchronization for a fractional-order complex-valued memristive neural networks with delays. IEEE Trans. Syst. Man Cybern. Syst. 2019, 49, 2519–2535. [Google Scholar] [CrossRef]
  20. Jia, J.; Zeng, Z.; Wang, F. Pinning synchronization of fractional-order memristor-based neural networks with multiple time-varying delays via static or dynamic coupling. J. Frankl. Inst. 2021, 358, 895–933. [Google Scholar] [CrossRef]
  21. 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]
  22. Gu, Y.; Yu, Y.; Wang, H. Projective synchronization for fractional-order memristor-based neural networks with time delays. Neural Comput. Appl. 2019, 31, 6039–6054. [Google Scholar] [CrossRef]
  23. Xiong, P.; Jahanshahi, H.; Alcaraz, R.; Chu, Y.; Gómez-Aguilar, J.F.; Alsaadi, F.E. Spectral entropy analysis and synchronization of a multi-stable fractional-order chaotic system using a novel neural network-based chattering-free sliding mode technique. Chaos Solitons Fractals 2021, 144, 110576. [Google Scholar] [CrossRef]
  24. Fan, Y.; Huang, X.; Wang, Z.; Li, Y. Global dissipativity and quasi-synchronization of asynchronous updating fractional-order memristor-based neural networks via interval matrix method. J. Frankl. Inst. 2018, 355, 5998–6025. [Google Scholar] [CrossRef]
  25. Liu, S.; Yu, Y.; Zhang, S. Robust synchronization of memristor-based fractional-order Hopfield neural networks with parameter uncertainties. Neural Comput. Appl. 2019, 31, 3533–3542. [Google Scholar] [CrossRef]
  26. Wu, A.; Zeng, Z. Global Mittag-Leffler stabilization of fractional-order memristive neural networks. IEEE Trans. Neural Netw. Learn. Syst. 2017, 28, 206–217. [Google Scholar] [CrossRef] [PubMed]
  27. Bao, H.; Park, J.H.; Cao, J. Adaptive synchronization of fractional-order memristor-based neural networks with time delay. Nonlinear Dyn. 2015, 82, 1343–1354. [Google Scholar] [CrossRef]
  28. Chen, L.; Cao, J.; Wu, R.; Machado, J.T.; Lopes, A.M.; Yang, H. Stability and synchro- nization of fractional-order memristive neural networks with multiple delays. Neural Netw. 2017, 94, 76–85. [Google Scholar] [CrossRef]
  29. Zhang, L.; Yang, Y. Lag synchronization for fractional-order memristive neural networks via period intermittent control. Nonlinear Dyn. 2017, 89, 367–381. [Google Scholar] [CrossRef]
  30. Huang, T.; Li, C.; Yu, W.; Chen, G. Synchronization of delayed chaotic systems with parameter mismatches by using intermittent linear state feedback. Nonlinearity 2009, 22, 569–584. [Google Scholar] [CrossRef]
  31. Filippov, A.F. Differential Equations with Discontinuous Righthand Sides; Kluwer Academic Publishers: Boston, MA, USA, 1988. [Google Scholar]
  32. Henderson, J.; Ouahab, A. Fractional functional differential inclusions with finite delay. Nonlinear Anal. 2009, 70, 2091–2105. [Google Scholar] [CrossRef]
  33. Aubin, J.P.; Cellina, A. Differential Inclusions: Set-Valued Maps and Viability Theory; Springer: Berlin, Germany, 1984. [Google Scholar]
  34. Shen, J.; Lam, J. Non-existence of finite-time stable equilibria in fractional-order nonlinear systems. Automatica 2014, 50, 547–551. [Google Scholar] [CrossRef]
  35. Fan, Y.; Huang, X.; Wang, Z. Local Stabilization of Delayed Fractional-Order Neural Networks Subject to Actuator Saturation. Fractal Fract. 2022, 6, 451. [Google Scholar] [CrossRef]
  36. 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]
  37. Duarte-Mermoud, M.A.; Aguila-Camacho, N.; Gallegos, J.A.; Castro-Linares, R. Using general quadratic Lyapunov functions to prove Lyapunov uniform stability for fractional order systems. Commun. Nonlinear Sci. Numer. Simul. 2015, 22, 650–659. [Google Scholar] [CrossRef]
  38. Clarke, F.H.; Ledyaev, Y.S.; Stern, R.J.; Wolenski, P.R. Nonsmooth Analysis and Control Theory; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2008. [Google Scholar]
  39. Wang, D.; Xiao, A.; Liu, H. Dissipativity and stability analysis for fractional functional differential equations. Fract. Calc. Appl. Anal. 2015, 18, 1399–1422. [Google Scholar] [CrossRef]
Figure 1. (a) Time responses of ν 1 ( t ) , ν 2 ( t ) ; (b) μ 1 ( t ) , μ 2 ( t ) .
Figure 1. (a) Time responses of ν 1 ( t ) , ν 2 ( t ) ; (b) μ 1 ( t ) , μ 2 ( t ) .
Fractalfract 07 00012 g001
Figure 2. Error bound and ε ( t ) 1 of Example 1.
Figure 2. Error bound and ε ( t ) 1 of Example 1.
Fractalfract 07 00012 g002
Figure 3. ε ( t ) 1 with different Δ T .
Figure 3. ε ( t ) 1 with different Δ T .
Fractalfract 07 00012 g003
Figure 4. (a) Time responses of ν p ( t ) ; (b) μ p ( t ) , p = 1 , 2 , 3 .
Figure 4. (a) Time responses of ν p ( t ) ; (b) μ p ( t ) , p = 1 , 2 , 3 .
Fractalfract 07 00012 g004
Figure 5. Error bound and ε ( t ) 1 of Example 2.
Figure 5. Error bound and ε ( t ) 1 of Example 2.
Fractalfract 07 00012 g005
Table 1. Notations and Descriptions.
Table 1. Notations and Descriptions.
NotationDescription
λ max ( Q ) the maximum eigenvalue of matrix Q
Q T ( or Q 1 ) transpose (or inverse) of matrix Q
*the symmetric element
Q > 0 Q is a positive
(or Q 0 ) definite (or semi-definite) matrix
diag(…)a block diagonal matrix
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

Fan, Y.; Wei, Z.; Li, M. Switching-Jumps-Dependent Quasi-Synchronization Criteria for Fractional-Order Memrisive Neural Networks. Fractal Fract. 2023, 7, 12. https://doi.org/10.3390/fractalfract7010012

AMA Style

Fan Y, Wei Z, Li M. Switching-Jumps-Dependent Quasi-Synchronization Criteria for Fractional-Order Memrisive Neural Networks. Fractal and Fractional. 2023; 7(1):12. https://doi.org/10.3390/fractalfract7010012

Chicago/Turabian Style

Fan, Yingjie, Zhongliang Wei, and Meixuan Li. 2023. "Switching-Jumps-Dependent Quasi-Synchronization Criteria for Fractional-Order Memrisive Neural Networks" Fractal and Fractional 7, no. 1: 12. https://doi.org/10.3390/fractalfract7010012

Article Metrics

Back to TopTop