Next Article in Journal
Appearance-Based Gaze Estimation Method Using Static Transformer Temporal Differential Network
Next Article in Special Issue
Prescribed Settling Time Adaptive Neural Network Consensus Control of Multiagent Systems with Unknown Time-Varying Input Dead-Zone
Previous Article in Journal
Topological Structure and Existence of Solutions Set for q-Fractional Differential Inclusion in Banach Space
Previous Article in Special Issue
Local Lagrange Exponential Stability Analysis of Quaternion-Valued Neural Networks with Time Delays
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Results on Finite-Time Synchronization Control of Chaotic Memristor-Based Inertial Neural Networks with Time-Varying Delays

1
College of Electrical and Information Engineering, Southwest Minzu University, Chengdu 610041, China
2
Huawei Technologies Co., Ltd., Chengdu 611700, China
3
School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
4
School of Electronic Information and Electrical Engineering, Chengdu University, Chengdu 610106, China
5
Geomathematics Key Laboratory of Sichuan Province, Chengdu University of Technology, Chengdu 610059, China
6
Data Recovery Key Laboratory of Sichuan Province, College of Mathematics and Information Science, Neijiang Normal University, Neijiang 641100, China
7
School of Mathematics Sciences, University of Electronic Science and Technology of China, Chengdu 611731, China
8
Faculty of Engineering and Information Technology, Australian AI Institute, University of Technology Sydney, Ultimo, NSW 2007, Australia
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(3), 684; https://doi.org/10.3390/math11030684
Submission received: 1 January 2023 / Revised: 23 January 2023 / Accepted: 25 January 2023 / Published: 29 January 2023
(This article belongs to the Special Issue Mathematic Control and Artificial Intelligence)

Abstract

:
In this work, we are concerned with the finite-time synchronization (FTS) control issue of the drive and response delayed memristor-based inertial neural networks (MINNs). Firstly, a novel finite-time stability lemma is developed, which is different from the existing finite-time stability criteria and extends the previous results. Secondly, by constructing an appropriate Lyapunov function, designing effective delay-dependent feedback controllers and combining the finite-time control theory with a new non-reduced order method (NROD), several novel theoretical criteria to ensure the FTS for the studied MINNs are provided. In addition, the obtained theoretical results are established in a more general framework than the previous works and widen the application scope. Lastly, we illustrate the practicality and validity of the theoretical results via some numerical examples.

1. Introduction

Neural networks (NNs) have garnered considerable attention from researchers, due to being widely applied in numerous different fields, such as cryptography, model identification, and signal processing [1,2,3,4,5,6,7]. The essential issues of these applications are to research the dynamical behaviors of NNs. As a significant dynamical property, synchronization has attracted wide-scale attention in recent years [8,9,10,11,12]. However, in the existing papers, most of these published works are connected with infinite-time synchronization, such as exponential synchronization and asymptotical synchronization [13,14,15]. Considering that the lifespan of biologies and apparatus is limited, we always desire to obtain faster or even finite-time convergent speed in practice. Hence, the investigation of FTS is more meaningful [16,17,18,19]. In the meantime, compared with the infinite-time synchronization of NNs, FTS has a better convergence rate and exhibits several other desirable features.
It is well known that conventional NNs are usually presented by first-order differential equations. In 1986, Westervelt and Babcock established the NNs with an inertial item by adding the inductors into the NNs’ model, which could be described by a second-order form [20]. Inertial neural networks (INNs) have evident engineering and biological backgrounds, and the dynamical properties of INNs are more complicated than conventional NNs [21,22,23,24]. Recently, some results on the dynamical behaviors of INNs, which include periodicity, stability, dissipativity and so on, have been presented [25,26,27,28,29]. With the application of INNs to various fields such as secure communication, signal processing and image encryption [30,31,32], some further studies of the INNs are essential and significant. Meanwhile, due to the inherent communication times between the neurons and the limited switching speed of amplifiers, the time delays unavoidably exist in the process of the implementation of INNs (see Figure 1a). However, it has been proved in many previous works that the existence of time delays may cause divergence, oscillation, and even instability of the system [33,34,35]. Hence, the dynamic analysis of INNs with mixed time-varying delays (MTVDs) is necessary for their successful applications.
On the other hand, a memristor device, which is the fourth basic circuit element (see Figure 1b) successfully manufactured by HP Laboratory [36], is a perfect element to simulate the function of the neural synapse [37,38]. Adopting memristors as the synapses connection weights in the circuit of NNs has a lot of merits, including simple structure, nano-dimension, ease of integration and low power consumption [39,40]. Considering the advantages of memristors, memristor-based INNs have become a hot topic [41,42,43,44]. In [45], by using a hybrid feedback controller, novel results were acquired to insure the FTS of drive and response MINNs, and the authors deeply discuss the relationship between the estimated value of settling time and the parameter ξ i in variable substitution. In [46], the authors investigated the FTS and fixed time synchronization of MINNs by using the Lyapunov stability theory and Filippov discontinuous theory. However, so far, all authors have studied the FTS of MINN by utilizing a variable substitution method to transform MINNs’ system into a first-order form. There are hardly any articles studying the dynamical properties of MINNs by using NROD, and the existing results are just focused on infinite-time synchronization or stability. As mentioned in the papers [28,41], the variable transformation method for the discontinuous MINNs’ system may be short of rigor in practice. Hence, researching MINNs themselves directly is a better method, instead of utilizing the reduced-order method.
Motivated by the aforementioned discussions, in this work, we will investigate the MINNs with MTVDs by using a new study method and acquire several new sufficient conditions to insure the FTS for such considered systems. The main contributions are highlighted below:
  • A novel finite-time stability criterion is derived (see Lemma 2), which is different from the existing finite-time stability criteria and extends the previous results.
  • By combining finite-time control theory with a new NROD, which can study MINNs themselves directly instead of using the variable substitution method, some new theoretical criteria to ensure the FTS for the studied MINNs are developed.
  • Taking the memristors, inertial items, and MTVDs into account, the acquired theoretical results are established in a more general framework than the previous results and widens the application scope.
The remainder of this paper is organized as follows. In Section 2, the INNs model, some useful definition, and lemmas are introduced. In Section 3, new criteria for IMNNs with MTVDs derived are given. In Section 4, illustrative examples are presented to validate the effectiveness of the theoretical results. Finally, Section 5 shows the conclusions.
Notations: Let R denote the space of real numbers. C ( [ t 0 τ , t 0 ] , R ) denotes the set of all continuous functions from [ t 0 τ , t 0 ] to R . x T denotes the transpose of a vector (or a matrix) x . d i a g { } denotes a diagonal matrix. ( · ) n × n denotes a n × n matrix. | | · | | 1 are the 1-norm of a vector (or a matrix).

2. Preliminaries

In this work, we consider the MINNs with MTVDs as follows:
d 2 x i ( t ) d t 2 = a i d x i ( t ) d t b i x i ( t ) + j = 1 n c i j ( x i ( t ) ) f j ( x j ( t ) ) + j = 1 n d i j ( x i ( t ) ) × f j ( x j ( t τ ( t ) ) ) + j = 1 n e i j ( x i ( t ) ) t ( t ) t f j ( x j ( s ) ) d s + I i ( t )
i { 1 , 2 , , n } , where x i ( t ) represents the state of the ith neuron, and the second derivative of x i ( t ) is called an inertial term of the system (1). a i > 0 and b i > 0 are constants. The function f j ( · ) represents the nonlinear activation function. I i ( t ) is the external input on the ith neuron. τ ( t ) and ( t ) are the discrete and distributed delay, respectively, and there exist constants τ and such that 0 τ ( t ) τ , 0 ( t ) . c i j ( x i ( t ) ) , d i j ( x i ( t ) ) and e i j ( x i ( t ) ) are memristor-based connection weights, which are given by
c i j ( x i ( t ) ) = c i j , | x i ( t ) | T i , c i j , | x i ( t ) | > T i , d i j ( x i ( t ) ) = d i j , | x i ( t ) | T i , d i j , | x i ( t ) | > T i , e i j ( x i ( t ) ) = e i j , | x i ( t ) | T i e i j , | x i ( t ) | > T i
for i , j = 1 , 2 , , n , where T i > 0 represents the switching jumps, and c i j , c i j , d i j , d i j , e i j , e i j , are known constants. Denote
c ¯ i j = max { | c i j | , | c i j | } , d ¯ i j = max { | d i j | , | d i j | } , e ¯ i j = max { | e i j | , | e i j | } , c ^ i j = max { c i j , c i j } , c ˇ i j = min { c i j , c i j } , d ^ i j = max { d i j , d i j } , d ˇ i j = min { d i j , d i j } , e ^ i j = max { e i j , e i j } , e ˇ i j = min { e i j , e i j }
and
C ¯ = c ¯ i j n × n , D ¯ = d ¯ i j n × n , E ¯ = e ¯ i j n × n , C ^ = c ^ i j n × n , C ˇ = c ˇ i j n × n , D ^ = d ^ i j n × n , D ˇ = d ˇ i j n × n , E ^ = e ^ i j n × n , E ˇ = e ˇ i j n × n .
The initial value of system (1) is given by
x i ( s ) = ϕ i ( s ) , d x i ( s ) d s = ϕ i ( s ) , t 0 0 , s [ t 0 τ , t 0 ]
where ϕ i ( s ) , ϕ i ( s ) C ( [ t 0 τ , t 0 ] , R ) , i = 1 , 2 , , n .
For the activation functions f j ( · ) , we conduct the following assumptions.
Assumption 1.
For x , y R , x y , there exist constants l j > 0 such that the activation function f j : R R satisfies | f j ( x ) f j ( y ) | l j | x y | , i = 1 , 2 , , n , i.e., the function f j satisfies the Lipschitz condition,
Assumption 2.
For x R , there exist constants M j > 0 such that the activation function f j : R R satisfies | f j ( x ) | M j , i = 1 , 2 , , n , i.e., the function f j is bounded.
Then, the response MINNs is given as follows:
d 2 y i ( t ) d t 2 = a i d y i ( t ) d t b i y i ( t ) + j = 1 n c i j ( y i ( t ) ) f j ( y j ( t ) ) + j = 1 n d i j ( y i ( t ) ) × f j ( y j ( t τ ( t ) ) ) + j = 1 n e i j ( y i ( t ) ) t ( t ) t f j ( y j ( s ) ) d s + I i ( t ) + U i ( t )
in which y i ( t ) is the state of the response MINNs and U i ( t ) is the properly designed controller; the memristor-based connection weights c i j ( y i ( t ) ) , d i j ( y i ( t ) ) , e i j ( y i ( t ) ) are defined as in (1). The initial value of system (2) is as follows:
y i ( s ) = ψ i ( s ) , d y i ( s ) d s = ψ i ( s ) , t 0 0 , s [ t 0 τ , t 0 ]
where ψ i ( s ) , ψ i ( s ) C ( [ t 0 τ , t 0 ] , R ) , i = 1 , 2 , , n .
Denote synchronization error r i ( t ) = y i ( t ) x i ( t ) . From (1) and (2), we obtain the error systems as follows:
d 2 r i ( t ) d t 2 = a i d r i ( t ) d t b i r i ( t ) + j = 1 n c i j ( y i ( t ) ) g j ( r j ( t ) ) + j = 1 n d i j ( y i ( t ) ) g j ( r j ( t τ ( t ) ) ) + j = 1 n e i j ( y i ( t ) ) t ( t ) t g j ( r j ( s ) ) d s + j = 1 n [ c i j ( y i ( t ) ) c i j ( x i ( t ) ) ] f j ( x j ( t ) ) + j = 1 n [ d i j ( y i ( t ) ) d i j ( x i ( t ) ) ] f j ( x j ( t τ ( t ) ) ) + j = 1 n [ e i j ( y i ( t ) ) e i j ( x i ( t ) ) ] t ( t ) t f j ( x j ( s ) ) d s + U i ( t )
for i = 1 , 2 , , n , where g j ( r j ( · ) ) = f j ( y j ( · ) ) f j ( x j ( · ) ) .
The synchronization error system (3) can be transformed into the vector form as
r ( t ) = A r ( t ) B r ( t ) + C y g ( r ( t ) ) + D y g ( r ( t τ ( t ) ) ) + E y t ( t ) t g ( r ( s ) ) d s + ( C y C x ) f ( x ( t ) ) + ( D y D x ) f ( x ( t τ ( t ) ) ) + ( E y E x ) t ( t ) t f ( x ( s ) ) d s + U ( t )
where
r ( t ) = r 1 ( t ) , r 2 ( t ) , , r n ( t ) T , g ( r ( · ) ) = g 1 ( r 1 ( · ) ) , g 2 ( r 2 ( · ) ) , , g n ( r n ( · ) ) T , f ( x ( · ) ) = f 1 ( x 1 ( · ) ) , f 2 ( x 2 ( · ) ) , , f n ( x n ( · ) ) T , U ( t ) = U 1 ( t ) , U 2 ( t ) , , U n ( t ) T .
and
A = diag { a 1 , a 2 , , a n } , B = diag { b 1 , b 2 , , b n } , C y = c i j ( y i ( t ) ) n × n , C x = c i j ( x i ( t ) ) n × n , D y = d i j ( y i ( t ) ) n × n , D x = d i j ( x i ( t ) ) n × n , E y = e i j ( y i ( t ) ) n × n , E x = e i j ( x i ( t ) ) n × n ,
The following definition and lemmas are given, which are helpful in proving the main results.
Definition 1.
[46] Drive and response MINNs (1) and (2) are said to be FTS, if for appropriate designed controller U i ( t ) , there exists a constant 0 < T < + , such that lim t t 0 + T r ( t ) = 0 , and r ( t ) 0 for t t 0 + T , and T is called the settling time.
Since FTS requires that the system trajectories converge to a Lyapunov equilibrium state in the finite time, the FTS is a stronger condition than the exponential or asymptotic synchronization. The following Lemma 1, which has been widely used in many previous works, gives a sufficient condition to ensure FTS.
Lemma 1.
[47] Suppose there exist a continuous positive-definite function V : D R + , and an open neighborhood χ D of the origin, such that
V ( x ( t ) ) α V η ( x ( t ) ) , x ( t ) χ { 0 } .
In which α > 0 , η ( 0 , 1 ) are constant. Then, the origin of the system is FTS, and the settling time T 1 satisfies
T 1 t 0 + V 1 η ( x ( t 0 ) ) α ( 1 η ) .
The term V ( x ( t ) ) will inevitably appear in the derivative of the Lyapunov function, which is ignored to estimate the settling time in the Lemma 1. Thus, there is room for further research to reduce the conservatism of the FTS conditions. In the following, we will derive a new lemma that takes into account the useful term V ( x ( t ) ) .
Lemma 2.
Assume there exist a positive definite continuous function V : D R + , a continuous differentiable function φ : R R + , constants k > 0 , and an open neighborhood χ D of the origin, such that for t t 0 ,
V ( x ( t ) ) k V ( x ( t ) ) φ ( t ) , x ( t ) χ { 0 }
φ ( t ) > 0 , φ ( t ) 0
Then, if t t 0 + 1 k ln k V ( x ( t 0 ) ) + φ ( t 0 ) φ ( t ) holds, the origin of system is FTS.
Proof. 
Please see Appendix A for the detailed proof of Lemma 2. □
Remark 1.
The novel FTS lemma is different from the existing finite-time stability criteria and extends the previous results. Compared with the Lemma 1, the novel Lemma 2 fully considers the information in the derivative of the Lyapunov function. Note that the settling time is not explicit; it needs to be evaluated for the specific φ ( t ) function. Next, we will provide explicit estimations of the settling time for some specific functions satisfying the condition (6).
Lemma 3.
Under the conditions in Lemma 2, and φ ( t ) = α V η ( x ( t ) ) , where α > 0 , η ( 0 , 1 ) are constant. Then, the origin of the system is FTS, and the settling-time T 2 satisfies
T 2 t 0 + ln k α V 1 η ( x ( t 0 ) ) + 1 k ( 1 η ) .
Remark 2.
It is not hard to see that φ ( t ) = α V η ( x ( t ) ) > 0 and φ ( t ) = η α V η 1 ( x ( t ) ) V ( x ( t ) ) < 0 ; thus, the condition (6) is satisfied. By the condition (5), one has V ( t ) V ( t 0 ) e k ( t t 0 ) . Thus, we have ln ( φ ( t ) ) = ln ( α V η ( x ( t ) ) ) ln ( α ) + η [ ln ( V ( t 0 ) ) k ( t t 0 ) ] . Hence, when t t 0 + ln 1 + k α V 1 η ( x ( t 0 ) ) k ( 1 η ) , one has V ( x ( t ) ) 0 . Namely, the system can achieve FTS and the settling time is bound by T 2 t 0 + ln 1 + k α V 1 η ( x ( t 0 ) ) k ( 1 η ) . Obviously, ln 1 + k α V 1 η ( x ( t 0 ) ) k ( 1 η ) / V 1 η ( x ( t 0 ) ) α ( 1 η ) < 1 , namely, T 2 < T 1 . Therefore, Lemma 3 can provide a tighter settling time estimation than Lemma 1. In Lemma 2 of [48], a similar result has been given.
Lemma 4.
Under the conditions in Lemma 2, and φ ( t ) = θ , where θ > 0 are constant. Then, the origin of the system is FTS, and the settling-time T 3 satisfies
T 3 t 0 + ln k θ V ( x ( t 0 ) ) + 1 k .
Remark 3.
Obviously, φ ( t ) = θ > 0 and φ ( t ) = 0 . Based on Lemma 2, one has T 3 t 0 + ln k θ V ( x ( t 0 ) ) + 1 k . Compared with the Lemmas 1 and 3, the derivative of the Lyapunov function in Lemma 4 does not need to have exponential terms, and the settling time is more concise and easy to test. In addition, the FTS theorem in [49] requires that the Lyapunov function satisfies V ( x ( t ) ) θ , and the settling time is T = t 0 + V ( t 0 ) θ . Obviously, if setting k = 0 , then Lemma 4 is reduced to the FTS lemma in [49]; thus, Lemma 4 is a strengthened result. Moreover, 1 k ln k V ( t 0 ) + θ θ < V ( t 0 ) θ , i.e., Lemma 4 can provide a tighter estimate value of settling time than FTS lemma in [49].
Lemma 5.
Under the conditions in Lemma 2, and φ ( t ) = ϱ e ξ ( t t 0 ) , where ϱ > 0 , 0 < ξ < k are constant. Then, the origin of the system is FTS, and the settling time T 4 is bounded by
T 4 t 0 + ln ( k ϱ V ( x ( t 0 ) ) + 1 ) k ξ .
Remark 4.
It is easy to know that φ ( t ) = ϱ e ξ ( t t 0 ) > 0 and φ ( t ) = ξ ϱ e ξ ( t t 0 ) < 0 ; thus, the condition (6) is satisfied. We have ln ( φ ( t ) ) = ln ( ϱ ) ξ ( t t 0 ) . Therefore, when t t 0 + ln ( k ϱ V ( x ( t 0 ) ) + 1 ) k ξ , one has V ( x ( t ) ) 0 . Namely, the system can realize FTS. Moreover, the settling time is bounded by T 4 t 0 + ln ( k ϱ V ( x ( t 0 ) ) + 1 ) k ξ .
Lemma 6.
(see [46]) Setting x 1 , x 2 , , x n 0 , 0 < p 1 , ; then, the following inequality holds:
i = 1 n x i p i = 1 n x i p .

3. Main Results

On the basis of the Lyapunov functions’ approach and finite-time control theory, we will directly study the FTS from MINNs themselves instead of utilizing the reduced-order method.
We define the delay-dependent feedback controller U ( t ) , as follows:
U ( t ) = s g n ( r ( t ) ) [ Λ r ¯ ( t ) + Θ r ¯ ( t ) + D ¯ L r ¯ ( t τ ( t ) ) + β + E ¯ L t ( t ) t r ¯ ( s ) d s + ξ r ¯ ( t ) μ + ξ r ¯ ( t ) μ ]
in which s g n ( r ( t ) ) = diag sign ( r 1 ( t ) ) , sign ( r 2 ( t ) ) , , sign ( r n ( t ) ) , r ¯ ( t ) = ( | r 1 ( t ) | , | r 2 ( t ) | , , | r n ( t ) | ) T , r ¯ ( · ) = | r 1 ( · ) | , | r 2 ( · ) | , , | r n ( · ) | T , L = diag l 1 , l 2 , , l n . Λ = diag { λ 1 , λ 2 , , λ n } , Θ = diag θ 1 , θ 2 , , θ n , β = β 1 , β 2 , , β n T , r ¯ ( t ) μ = ( | r 1 ( t ) | μ , | r 2 ( t ) | μ , , | r n ( t ) | μ ) T , r ¯ ( t ) μ = | r 1 ( t ) | μ , | r 2 ( t ) | μ , , | r n ( t ) | μ T , and λ i , θ i , β i > 0 ( i = 1 , 2 , , n ) , ξ > 0 , 0 < μ < 1 are constants,
Theorem 1.
Suppose Assumptions 1 and 2 hold. If λ i , θ i ( i = 1 , 2 , , n ) and β satisfy
λ i > 1 a i , θ i > b i + l i j = 1 n c ¯ j i , | | β | | 1 > | | ( C ^ C ˘ ) M | | 1 + | | ( D ^ D ˘ ) M | | 1 + | | ( E ^ E ˘ ) M | | 1 ,
then the drive-response system (1) and (2) can be synchronized in a finite time under the controller (7). Moreover, the settling time
T t 0 + ln 1 + a ξ 2 V ( t 0 ) 1 μ 2 a ( 1 μ ) .
where a = min { λ , θ } , and λ = min 1 i n { λ i + a i 1 } , θ = min 1 i n θ i b i l i j = 1 n c ¯ j i .
Proof. 
Please see Appendix B for a detailed proof of Theorem 1. □
Theorem 2.
Suppose Assumptions 1 and 2 hold. If λ i , θ i ( i = 1 , 2 , , n ) and β satisfy
λ i > 1 a i , θ i > b i + l i j = 1 n c ¯ j i , | | β | | 1 > | | ( C ^ C ˘ ) M | | 1 + | | ( D ^ D ˘ ) M | | 1 + | | ( E ^ E ˘ ) M | | 1 ,
then the drive-response MINNs (1) and (2) are synchronized in a finite time under the controller (7). Moreover, the settling time
T t 0 + V ( t 0 ) 1 μ ξ ( 1 μ ) .
Proof. 
Please see Appendix C for a detailed proof of Theorem 2. □
Remark 5.
Obviously,
ln 1 + a ξ V ( t 0 ) 1 μ a ( 1 μ ) / V ( t 0 ) 1 μ ξ ( 1 μ ) = ln 1 + a ξ V ( t 0 ) 1 μ a ξ V ( t 0 ) 1 μ < 1
Therefore, ln 1 + a ξ V ( t 0 ) 1 μ a ( 1 μ ) < V ( t 0 ) 1 μ ξ ( 1 μ ) , i.e., Theorem 1 can give a tighter estimate value of settling time than Theorem 2. Theorem 1 is a strengthened result. However, Theorem 2 has fewer parameters than Theorem 1 and is easier to test. Therefore, we can adopt the Theorem 1 or the Theorem 2 in actual applications.
Next, we propose the following delay-dependent feedback control scheme:
U ( t ) = sgn ( r ( t ) ) Λ r ¯ ( t ) + Θ r ¯ ( t ) + D ¯ L r ¯ ( t τ ( t ) ) + E ¯ L t ( t ) t r ¯ ( s ) d s + β .
Theorem 3.
Suppose Assumptions 1 and 2 hold. If λ i , θ i ( i = 1 , 2 , , n ) and β satisfy
λ i > 1 a i , θ i > b i + l i j = 1 n c ¯ j i , | | β | | 1 > | | ( C ^ C ˘ ) M | | 1 + | | ( D ^ D ˘ ) M | | 1 + | | ( E ^ E ˘ ) M | | 1 ,
then the drive-response MINNs (1) and (2) can achieve FTS with the controller (10). Moreover, the settling time
T t 0 + 1 a ln a V ( t 0 ) + β * β * .
Proof. 
Please see Appendix D for a detailed proof of Theorem 3. □
Remark 6.
Compared with Theorem 1 (or Theorem 2), we can observe that the controller of Theorem 3 does not need to have an exponential term, and the drive-response MINNs (1) and (2) can also achieve FTS, which can effectively simplify the controller. In addition, the controller (10) is easier to implement and operate in the actual application. In addition, the settling time in Theorem 3 is more concise and easier to test than Theorem 2 (or Theorem 3).
Moreover, we propose the following delay-dependent feedback control scheme:
U ( t ) = sgn ( r ( t ) ) Λ r ¯ ( t ) + Θ r ¯ ( t ) + D ¯ L r ¯ ( t τ ( t ) ) + E ¯ L t ( t ) t r ¯ ( s ) d s + β + Δ e μ ( t t 0 ) .
where Δ = ( δ 1 , δ 2 , , δ n ) T and δ i > 0 ( i = 1 , 2 , , n ) , μ > 0 are constants.
Theorem 4.
Suppose Assumptions 1 and 2 hold. If λ i , θ i ( i = 1 , 2 , , n ) and β satisfy
λ i > 1 a i , θ i > b i + l i j = 1 n c ¯ j i , μ < a , | | β | | 1 > | | ( C ^ C ˘ ) M | | 1 + | | ( D ^ D ˘ ) M | | 1 + | | ( E ^ E ˘ ) M | | 1 ,
then, the drive-response MINNs (1) and (2) can achieve FTS with the controller (12). Moreover, the settling time
T t 0 + 1 a μ ln a V ( t 0 ) + ω ω .
Proof. 
Please see Appendix E for a detailed proof of Theorem 4. □
Remark 7.
Up to now, in several earlier papers [44,45,46], which discussed the FTS of MINNs, the theoretical criteria have been acquired basically by utilizing the reduced-order method. As is known to all, the variable transformation method for the discontinuous MINNs system may be short of rigor in practice. In this work, we directly study the MINNs themselves without using the reduced-order method, and several novel sufficient conditions to insure the FTS for the considered MINNs are developed.
Remark 8.
Unlike the INNs without memristor [15,17,18], the MNNs without inertial term [8,13] and the INNs with discrete or constant delays [15,17,18,44,45,46], this work takes into account the memristors, inertial items and MTVDs. Our considered MINNs is more general. Hence, the results in this work are acquired in a more general framework than the previous results, which widens the application scope.

4. Illustrative Example

Example 1.
Consider the two-neuron drive MINNs with MTVDs, as follows:
d 2 x i ( t ) d t 2 = a i d x i ( t ) d t b i x i ( t ) + j = 1 2 c i j ( x i ( t ) ) f j ( x j ( t ) ) + j = 1 2 d i j ( x i ( t ) ) × f j ( x j ( t τ ( t ) ) ) + j = 1 2 e i j ( x i ( t ) ) t ( t ) t f j ( x j ( s ) ) d s + I i ( t )
i = 1 , 2 , where a 1 = 2.52 , a 2 = 3.14 , b 1 = 3.39 , b 2 = 3.78 , and the activation functions f 1 ( · ) = f 2 ( · ) = t a n h ( · ) , τ ( t ) = ( t ) = e t 1 + e t , I 1 ( t ) = 5 s i n ( t ) , I 2 ( t ) = 5 c o s ( t ) . We can clearly observe that the functions f 1 and f 2 satisfy Assumption 1 and 2 with l 1 = l 2 = 1 , M 1 = M 2 = 1 , and 0 τ ( t ) , ( t ) 1 . The memristor-based connection weights take the following forms:
c 11 ( x 1 ( t ) ) = 5.21 , | x 1 ( t ) | T 1 , 3.48 , | x 1 ( t ) | > T 1 , c 12 ( x 1 ( t ) ) = 4.25 , | x 1 ( t ) | T 1 , 5.37 , | x 1 ( t ) | > T 1 , c 21 ( x 2 ( t ) ) = 3.37 , | x 2 ( t ) | T 2 , 2.62 , | x 2 ( t ) | > T 2 , c 22 ( x 2 ( t ) ) = 4.63 , | x 2 ( t ) | T 2 , 3.77 , | x 2 ( t ) | > T 2 , d 11 ( x 1 ( t ) ) = 2.59 , | x 1 ( t ) | T 1 , 5.47 , | x 1 ( t ) | > T 1 , d 12 ( x 1 ( t ) ) = 3.56 , | x 1 ( t ) | T 1 , 4.28 , | x 1 ( t ) | > T 1 , d 21 ( x 2 ( t ) ) = 2.07 , | x 2 ( t ) | T 2 , 3.69 , | x 2 ( t ) | > T 2 , d 22 ( x 2 ( t ) ) = 4.37 , | x 2 ( t ) | T 2 , 4.92 , | x 2 ( t ) | > T 2 , e 11 ( x 1 ( t ) ) = 4.36 , | x 1 ( t ) | T 1 , 2.55 , | x 1 ( t ) | > T 1 , e 12 ( x 1 ( t ) ) = 2.33 , | x 1 ( t ) | T 1 , 5.47 , | x 1 ( t ) | > T 1 , e 21 ( x 2 ( t ) ) = 3.78 , | x 2 ( t ) | T 2 , 5.64 , | x 2 ( t ) | > T 2 , e 22 ( x 2 ( t ) ) = 4.39 , | x 2 ( t ) | T 2 , 5.24 , | x 2 ( t ) | > T 2 .
where T 1 = 3 , T 2 = 10 . The initial value of system (14) are x 1 ( 0 ) = 3.8 , x 1 ( 0 ) = 7.8 , x 2 ( 0 ) = 2.5 , x 2 ( 0 ) = 22.3 . The corresponding response MINNs as follows:
d 2 y i ( t ) d t 2 = a i d y i ( t ) d t b i y i ( t ) + j = 1 2 c i j ( y i ( t ) ) f j ( y j ( t ) ) + j = 1 2 d i j ( y i ( t ) ) × f j ( y j ( t τ ( t ) ) ) + j = 1 2 e i j ( y i ( t ) ) t ( t ) t f j ( y j ( s ) ) d s + I i ( t ) + U i ( t )
where i = 1 , 2 , the initial value of system (15) are y 1 ( 0 ) = 2.6 , y 1 ( 0 ) = 8.35 , y 2 ( 0 ) = 2.3 , y 2 ( 0 ) = 24.4 , and the controllers U i ( t ) are defined in (7). The drive and response MINNs (14) and (15) and their synchronization error system without controller are given in Figure 2 and Figure 3, which imply that drive-response MINNs will not achieve synchronization as time increases.
Obviously, we can obtain that 1 a 1 = 1.52 , 1 a 2 = 2.14 , b 1 + l 1 j = 1 2 c ¯ j 1 = 11.97 , b 2 + l 2 j = 1 2 c ¯ j 2 = 13.78 , and | | ( C ^ C ˘ ) M | | 1 = 32.70 , | | ( D ^ D ˘ ) M | | 1 = 30.95 , | | ( E ^ E ˘ ) M | | 1 = 33.76 , so we have | | β | | 1 > 97.41 . Choose λ 1 = λ 2 = 1 , θ 1 = θ 2 = 15 , β 1 = β 2 = 50 , ξ = 1.5 and μ = 0.8 , then the condition in Theorem 1 or Theorem 2 is satisfied. According to Theorem 1 or Theorem 2, the drive MINNs (14) and the response MINNS (15) can achieve FTS with the controller (14), and the estimated value of settling time T 7.77 or T 4.36 .  Figure 4 shows the synchronization error trajectories of drive-response MINNs (14) and (15) under the controller (7). The drive-response MINNs are successfully synchronized in the finite time. Therefore, the correctness of Theorems 1 and 2 is certified.
Example 2.
Consider the two-neuron drive MINNs with MTVDs, as follows:
d 2 x i ( t ) d t 2 = a i d x i ( t ) d t b i x i ( t ) + j = 1 2 c i j ( x i ( t ) ) f j ( x j ( t ) ) + j = 1 2 d i j ( x i ( t ) ) × f j ( x j ( t τ ( t ) ) ) + j = 1 2 e i j ( x i ( t ) ) t ( t ) t f j ( x j ( s ) ) d s + I i ( t )
i = 1 , 2 , where a 1 = 1.32 , a 2 = 1.43 , b 1 = 1.57 , b 2 = 1.33 , and the activation functions f 1 ( · ) = f 2 ( · ) = t a n h ( · ) , τ ( t ) = ( t ) = e t 1 + e t , I 1 ( t ) = s i n ( t ) , I 2 ( t ) = c o s ( t ) . We can clearly observe that the functions f 1 and f 2 satisfy Assumption 1 and 2 with l 1 = l 2 = 1 , M 1 = M 2 = 1 , and 0 τ ( t ) , ( t ) 1 . The memristor-based connection weights take the following forms:
c 11 ( x 1 ( t ) ) = 1.15 , | x 1 ( t ) | T 1 , 1.34 , | x 1 ( t ) | > T 1 , c 12 ( x 1 ( t ) ) = 1.44 , | x 1 ( t ) | T 1 , 1.53 , | x 1 ( t ) | > T 1 , c 21 ( x 2 ( t ) ) = 1.83 , | x 2 ( t ) | T 2 , 1.47 , | x 2 ( t ) | > T 2 , c 22 ( x 2 ( t ) ) = 1.28 , | x 2 ( t ) | T 2 , 1.66 , | x 2 ( t ) | > T 2 , d 11 ( x 1 ( t ) ) = 1.73 , | x 1 ( t ) | T 1 , 1.48 , | x 1 ( t ) | > T 1 , d 12 ( x 1 ( t ) ) = 1.27 , | x 1 ( t ) | T 1 , 1.19 , | x 1 ( t ) | > T 1 , d 21 ( x 2 ( t ) ) = 1.63 , | x 2 ( t ) | T 2 , 1.38 , | x 2 ( t ) | > T 2 , d 22 ( x 2 ( t ) ) = 1.55 , | x 2 ( t ) | T 2 , 1.82 , | x 2 ( t ) | > T 2 , e 11 ( x 1 ( t ) ) = 1.14 , | x 1 ( t ) | T 1 , 1.52 , | x 1 ( t ) | > T 1 , e 12 ( x 1 ( t ) ) = 1.57 , | x 1 ( t ) | T 1 , 1.46 , | x 1 ( t ) | > T 1 , e 21 ( x 2 ( t ) ) = 1.35 , | x 2 ( t ) | T 2 , 1.86 , | x 2 ( t ) | > T 2 , e 22 ( x 2 ( t ) ) = 1.74 , | x 2 ( t ) | T 2 , 1.58 , | x 2 ( t ) | > T 2 .
where T 1 = 1 , T 2 = 1 . The initial value of system (16) are x 1 ( 0 ) = 0.8 , x 1 ( 0 ) = 4.8 , x 2 ( 0 ) = 1.5 , x 2 ( 0 ) = 1.8 . The corresponding response MINNs are as follows:
d 2 y i ( t ) d t 2 = a i d y i ( t ) d t b i y i ( t ) + j = 1 2 c i j ( y i ( t ) ) f j ( y j ( t ) ) + j = 1 2 d i j ( y i ( t ) ) × f j ( y j ( t τ ( t ) ) ) + j = 1 2 e i j ( y i ( t ) ) t ( t ) t f j ( y j ( s ) ) d s + I i ( t ) + U i ( t )
where i = 1 , 2 , the initial value of system (17) are y 1 ( 0 ) = 0.6 , y 1 ( 0 ) = 3.65 , y 2 ( 0 ) = 1.3 , y 2 ( 0 ) = 1.3 , and the controllers U i ( t ) are defined in (10). When the controllers U i ( t ) = 0 , the drive and response MINNs (16) and (17) and its synchronization error system are given in Figure 5 and Figure 6, which imply that drive-response MINNs will not achieve synchronization as time increases.
According to Theorem 3, we can obtain that 1 a 1 = 0.32 , 1 a 2 = 0.43 , b 1 + l 1 j = 1 2 c ¯ j 1 = 4.74 , b 2 + l 2 j = 1 2 c ¯ j 2 = 4.52 , and | | ( C ^ C ˘ ) M | | 1 = 8.82 , | | ( D ^ D ˘ ) M | | 1 = 6.33 , | | ( E ^ E ˘ ) M | | 1 = 9.30 , ; thus, we have | | β | | 1 > 24.45 . Then, choose λ 1 = λ 2 = 1 , θ 1 = θ 2 = 5 , and β 1 = 10 , β 2 = 16 , ; the error systems with the controller are shown in Figure 7,and the settling time T 4.48 . It is easy to observe from Figure 7 that the drive-response MINNs (16) and (17) are successfully synchronization in the finite time with the controller (10); thus, the practicality and validity of Theorem 3 are shown.

5. Conclusions

In this work, novel sufficient conditions to guarantee the FTS for the studied MINNs have been given. Moreover, the novel finite-time stability criterion proposed in this paper is completely different from the existing ones, and it enriches the analytical tools for studying FTS. In addition, we directly investigated the FTS from the MINNs themselves without utilizing the variable substitution method widely used in the previous literature, which does not change the order of the second-order MINNs. Finally, several numerical examples have also been provided to demonstrate the validity of the novel research results. New useful study methods and theoretical results of this paper have widened the existing results, and this can be extended to many dynamical systems, such as nonlinear impulsive systems, and coupled neural networks, which are our possible future research topics.

Author Contributions

Conceptualization, J.W. and K.S.; methodology, S.W.; software, Y.T.; validation, J.W., Y.T., L.H., K.S., S.Z. and S.W.; formal analysis, L.H.; investigation, J.W.; writing—original draft preparation, J.W.; writing—review and editing, J.W. and K.S.; supervision, Y.T. and S.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Fundamental Research Funds for the Central Universities, Southwest Minzu University (2019NQN07), Opening Fund of Geomathematics Key Laboratory of Sichuan Province (scsxdz2018zd04 and scsxdz2020zd01), National Nature Science Foundation (62073270 and 62206168), Sichuan Science and Technology Program under Grant Nos. 21YYJC0469 and 23ZDYF0645.

Data Availability Statement

Not applicable.

Conflicts of Interest

No conflict of interest exists in the submission of this manuscript, and the manuscript was approved by all authors for publication. We declare that the work described is original research that has not been previously published and is not under consideration for publication elsewhere, either in whole or in part. All the listed authors have approved the enclosed manuscript.

Appendix A

Proof of Lemma 2.
Multiplying both sides of (5) with e k t has
d [ V ( x ( t ) ) e k t ] d t φ ( t ) e k t .
Integrating (A1) over [ t 0 , t ] yields
V ( t , x ( t ) ) e k t V ( t 0 , x ( t 0 ) ) e k t 0 t 0 t φ ( s ) e k s d s
On the basis of Integration by parts, one has
t 0 t φ ( s ) e k s d s = t 0 t 1 k φ ( s ) e k s d s t 0 t 1 k φ ( s ) e k s d s = 1 k φ ( t ) e k t 1 k φ ( t 0 ) e k t 0 t 0 t 1 k φ ( s ) e k s d s
By the conditions (6), substituting (A3) into (A2), we have
0 V ( x ( t ) V ( x ( t 0 ) ) + φ ( t 0 ) k e k ( t 0 t ) φ ( t ) k .
When t t 0 + 1 k ln k V ( x ( t 0 ) ) + φ ( t 0 ) φ ( t ) holds, we have V ( x ( t ) ) 0 . Then, the proof is completed. □

Appendix B

Proof of Theorem 1.
We adopt the following Lyapunov functions:
V ( t ) = | | r ( t ) | | 1 + | | r ( t ) | | 1 = sign ( r ( t ) ) T r ( t ) + sign ( r ( t ) ) T r ( t ) .
where
sign ( r ( t ) ) = sign ( r 1 ( t ) ) , sign ( r 2 ( t ) ) , , sign ( r n ( t ) ) T , sign ( r ( t ) ) = sign ( r 1 ( t ) ) , sign ( r 2 ( t ) ) , , sign ( r n ( t ) ) T .
By the system (3), we have
V ( t ) = sign ( r ( t ) ) T r ( t ) + sign ( r ( t ) ) T [ A r ( t ) B r ( t ) + C y g ( r ( t ) ) + D y g ( r j ( t τ ( t ) ) ) + E y t ( t ) t g ( r ( s ) ) d s + ( C y C x ) f ( x ( t ) ) + ( D y D x ) f ( x ( t τ ( t ) ) ) + ( E y E x ) t ( t ) t f ( x ( s ) ) d s + U ( t ) ] .
Obviously, sign ( r ( t ) ) T r ( t ) = i = 1 n sign ( r i ( t ) ) r i ( t ) | | r ( t ) | | 1 , sign ( r ( t ) ) T [ A r ( t ) ] = i = 1 n a i | r i ( t ) | = | | A r ( t ) | | 1 , sign ( r ( t ) ) T [ B r ( t ) ] = i = 1 n sign ( r i ( t ) ) b i r i ( t ) | | B r ( t ) | | 1 . By Assumption 1, we can derive that
sign ( r ( t ) ) T C y g ( r ( t ) ) = i = 1 n j = 1 n sign ( r i ( t ) ) c i j ( y i ( t ) ) g j ( r j ( t ) ) i = 1 n j = 1 n | c i j ( y i ( t ) ) | · | g j ( r j ( t ) ) | i = 1 n j = 1 n c ¯ i j l j | r j ( t ) | = | | C ¯ L r ( t ) | | 1 .
Similar to (A6), we obtain that sign ( r ( t ) ) T D y g ( r j ( t τ ( t ) ) ) | | D ¯ L r ( t τ ( t ) ) | | 1 ,
sign ( r ( t ) ) T E y t ( t ) t g ( r ( s ) ) d s | | E ¯ L t ( t ) t r ¯ ( t ) d s | | 1 . By Assumption 2, we acquire
sign ( r ( t ) ) T ( C y C x ) f ( x ( t ) ) = i = 1 n j = 1 n sign ( r i ( t ) ) [ c i j ( y i ( t ) ) c i j ( x i ( t ) ) ] f j ( x j ( t ) ) i = 1 n j = 1 n | c i j ( y i ( t ) ) c i j ( x i ( t ) ) | · | f j ( x j ( t ) ) | i = 1 n j = 1 n ( c ^ i j c ˘ i j ) M j = | | ( C ^ C ˘ ) M | | 1 .
where M = M 1 , M 2 , , M n T . Similarly, we have sign ( r ( t ) ) T ( D y D x ) f ( x ( t τ ( t ) ) ) | | ( D ^ D ˘ ) M | | 1 , sign ( r ( t ) ) T ( E y E x ) t ( t ) t f ( x ( s ) ) d s | | ( E ^ E ˘ ) M | | 1 . It is easy to derive that
sign ( r ( t ) ) T U ( t ) = | | Λ r ( t ) | | 1 | | Θ r ( t ) | | 1 | | D ¯ L r ( t τ ( t ) ) | | 1 | | E ¯ L t ( t ) t r ¯ ( t ) d s | | 1 | | β | | 1 ξ i = 1 n | r i ( t ) | μ ξ i = 1 n | r i ( t ) | μ .
Therefore,
V ( t ) | | Λ r ( t ) | | 1 + | | A r ( t ) | | 1 | | r ( t ) | | 1 ( | | Θ r ( t ) | | 1 | | B r ( t ) | | 1 | | C ¯ L r ( t ) | | 1 ) ( | | β | | 1 | | ( C ^ C ˘ ) M | | 1 | | ( D ^ D ˘ ) M | | 1 | | ( E ^ E ˘ ) M | | 1 ) ξ i = 1 n | r i ( t ) | μ ξ i = 1 n | r i ( t ) | μ λ i = 1 n | r i ( t ) | θ i = 1 n | r i ( t ) | β * ξ i = 1 n | r i ( t ) | μ ξ i = 1 n | r i ( t ) | μ a V ( t ) ξ i = 1 n | r i ( t ) | μ ξ i = 1 n | r i ( t ) | μ .
where λ = min 1 i n { λ i + a i 1 } > 0 , θ = min 1 i n θ i b i l i j = 1 n c ¯ j i > 0 , β * = | | β | | 1 | | ( C ^ C ˘ ) M | | 1 + | | ( D ^ D ˘ ) M | | 1 + | | ( E ^ E ˘ ) M | | 1 > 0 , and a = min { λ , θ }
According to Lemma 6, one has
V ( t ) a V ( t ) ξ i = 1 n | r i ( t ) | μ ξ i = 1 n | r i ( t ) | μ = a V ( t ) ξ | | r ( t ) | | 1 μ + | | r ( t ) | | 1 μ a V ( t ) ξ V ( t ) μ .
Based on Lemma 3, the drive MINNs (1) and response MINNs (2) can realize FTS. What is more, the settling time
T t 0 + ln 1 + a ξ V ( t 0 ) 1 μ a ( 1 μ ) .
This proof is completed. □

Appendix C

Proof of Theorem 2.
The proofs are similar to the Theorem 1. From (A10), we have V ( t ) ξ V ( t ) μ . Based on Lemma 1, the drive MINNs (1) and response MINNs (2) can realize FTS. Moreover, the settling time T t 0 + V ( t 0 ) 1 μ ξ ( 1 μ ) . This proof is completed. □

Appendix D

Proof of Theorem 3.
We construct a Lyapunov function, as follows:
V ( t ) = | | r ( t ) | | 1 + | | r ( t ) | | 1 = sign ( r ( t ) ) T r ( t ) + sign ( r ( t ) ) T r ( t ) .
By the system (3), we have
V ( t ) = sign ( r ( t ) ) T r ( t ) + sign ( r ( t ) ) T [ A r ( t ) B r ( t ) + C y g ( r ( t ) ) + D y g ( r j ( t τ ( t ) ) ) + E y t ( t ) t g ( r ( s ) ) d s + ( C y C x ) f ( x ( t ) ) + ( D y D x ) f ( x ( t τ ( t ) ) ) + ( E y E x ) t ( t ) t f ( x ( s ) ) d s + U ( t ) ] .
Similarly, we can derive that
V ( t ) | | A r ( t ) | | 1 | | r ( t ) | | 1 + | | B r ( t ) | | 1 + | | C ¯ L r ( t ) | | 1 + | | D ¯ L r ( t τ ( t ) ) | | 1 + | | E ¯ L t ( t ) t r ¯ ( t ) d s | | 1 + ( | | ( C ^ C ˘ ) M | | 1 + | | ( D ^ + D ˘ ) M | | 1 + | | ( E ^ E ˘ ) M | | 1 ) + sign ( r ( t ) ) T U ( t ) .
It is easy to deduce that
sign ( r ( t ) ) T U ( t ) = | | Λ r ( t ) | | 1 | | Θ r ( t ) | | 1 | | D ¯ L r ( t τ ( t ) ) | | 1 | | E ¯ L t ( t ) t r ¯ ( t ) d s | | 1 | | β | | 1 .
Therefore,
V ( t ) | | Λ r ( t ) | | 1 + | | A r ( t ) | | 1 | | r ( t ) | | 1 | | Θ r ( t ) | | 1 | | B r ( t ) | | 1 | | C ¯ L r ( t ) | | 1 | | β | | 1 | | ( C ^ C ˘ ) M | | 1 | | ( D ^ D ˘ ) M | | 1 | | ( E ^ E ˘ ) M | | 1 = i = 1 n θ i b i l i j = 1 n c ¯ j i | r i ( t ) | β * i = 1 n ( λ i + a i 1 ) | r i ( t ) | λ i = 1 n | r i ( t ) | θ i = 1 n | r i ( t ) | β * a V ( t ) β *
By Lemma 4, the FTS between the drive MINNs (1) and the response MINN (3) under the controller (10) is realized. Moreover, the settling time is
T t 0 + 1 a ln a V ( t 0 ) + β * β * .
The proof is completed. □

Appendix E

Proof of Theorem 4.
We construct a Lyapunov function, as follows:
V ( t ) = | | r ( t ) | | 1 + | | r ( t ) | | 1 = sign ( r ( t ) ) T r ( t ) + sign ( r ( t ) ) T r ( t ) .
Similar to the proof of Theorem 3, we can derive that
V ( t ) | | Λ r ( t ) | | 1 + | | A r ( t ) | | 1 | | r ( t ) | | 1 ( | | Θ r ( t ) | | 1 | | B r ( t ) | | 1 | | C ¯ L r ( t ) | | 1 ) ( | | β | | 1 | | ( C ^ C ˘ ) M | | 1 | | ( D ^ D ˘ ) M | | 1 | | ( E ^ E ˘ ) M | | 1 ) | | Δ e μ ( t t 0 ) | | 1 a V ( t ) ω e μ ( t t 0 )
where ω = i = 1 n δ i .
By Lemma 5, the FTS between the drive MINNs (1) and the response MINN (3) under the controller (12) is realized. In addition, the settling time is
T t 0 + 1 a μ ln a V ( t 0 ) + ω ω .
The proof is completed. □

References

  1. Chong, E.K.P.; Hui, S.; Zak, S.H. An analysis of a class of neural networks for solving linear programming problems. IEEE Trans. Autom. Control 1999, 44, 1995–2006. [Google Scholar] [CrossRef]
  2. Lee, T.H.; Trinh, H.M.; Park, J.H. Stability Analysis of Neural Networks with Time-Varying Delay by Constructing Novel Lyapunov Functionals. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 4238–4247. [Google Scholar] [CrossRef]
  3. Chen, J.; Park, J.H.; Xu, S. Stability Analysis for Neural Networks with Time-Varying Delay via Improved Techniques. IEEE Trans. Cybern. 2019, 49, 4495–4500. [Google Scholar] [CrossRef] [PubMed]
  4. Zhang, C.; He, Y.; Jiang, L.; Wu, M. Stability Analysis for Delayed Neural Networks Considering Both Conservativeness and Complexity. IEEE Trans. Neural Netw. Learn. Syst. 2016, 27, 1486–1501. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  5. Dong, S.; Zhong, S.; Shi, K.; Kang, W.; Cheng, J. Further improved results on non-fragile H performance state estimation for delayed static neural networks. Neurocomputing 2019, 356, 9–20. [Google Scholar] [CrossRef]
  6. Kiannejad, M.; Salehizadeh, M.R.; Oloomi-Buygi, M.; Baringo, L. A stochastic offering approach for photovoltaic power plants in day-ahead and balancing markets. Int. J. Electr. Power Energy Syst. 2023, 147, 108841. [Google Scholar] [CrossRef]
  7. Kiannejad, M.; Salehizadeh, M.R.; Oloomi-Buygi, M. Two-stage ANN-based bidding strategy for a load aggregator using decentralized equivalent rival concept. IET Gener. Transm. Distrib. 2021, 15, 56–70. [Google Scholar] [CrossRef]
  8. 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]
  9. Hua, L.; Zhong, S.; Shi, K.; Zhang, X. Further results on finite-time synchronization of delayed inertial memristive neural networks via a novel analysis method. Neural Netw. 2020, 127, 47–57. [Google Scholar] [CrossRef]
  10. 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]
  11. Liu, Y.; Tong, L.; Lou, J.; Lu, J.; Cao, J. Sampled-Data Control for the Synchronization of Boolean Control Networks. IEEE Trans. Cybern. 2019, 49, 726–732. [Google Scholar] [CrossRef] [PubMed]
  12. Hua, L.; Zhu, H.; Shi, K.; Zhong, S.; Tang, Y.; Liu, Y. Novel Finite-Time Reliable Control Design for Memristor-Based Inertial Neural Networks with Mixed Time-Varying Delays. IEEE Trans. Circuits Syst. I Regul. Pap. 2021, 68, 1599–1609. [Google Scholar] [CrossRef]
  13. Zhang, R.; Park, J.H.; Zeng, D.; Liu, Y.; Zhong, S. A new method for exponential synchronization of memristive recurrent neural networks. Inf. Sci. 2018, 466, 152–169. [Google Scholar] [CrossRef]
  14. Zhang, G.; Zeng, Z.; Ning, D. Novel results on synchronization for a class of switched inertial neural networks with distributed delays. Inf. Sci. 2020, 511, 114–126. [Google Scholar] [CrossRef]
  15. Zhang, R.; Zeng, D.; Park, J.H.; Liu, Y.; Zhong, S. Quantized Sampled-Data Control for Synchronization of Inertial Neural Networks with Heterogeneous Time-Varying Delays. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 6385–6395. [Google Scholar] [CrossRef] [PubMed]
  16. Guan, C.; Fei, Z.; Karimi, H.R.; Shi, P. Finite-Time Synchronization for Switched Neural Networks via Quantized Feedback Control. IEEE Trans. Syst. Man Cybern. Syst. 2021, 51, 2873–2884. [Google Scholar] [CrossRef]
  17. Zhang, Z.; Cao, J. Novel Finite-Time Synchronization Criteria for Inertial Neural Networks with Time Delays via Integral Inequality Method. IEEE Trans. Neural Netw. Learn. Syst. 2019, 30, 1476–1485. [Google Scholar] [CrossRef]
  18. Alimi, A.M.; Aouiti, C.; Assali, E.A. Finite-time and fixed-time synchronization of a class of inertial neural networks with multi-proportional delays and its application to secure communication. Neurocomputing 2019, 332, 29–43. [Google Scholar] [CrossRef]
  19. Hua, L.; Zhu, H.; Zhong, S.; Zhang, Y.; Shi, K.; Kwon, O.M. Fixed-Time Stability of Nonlinear Impulsive Systems and Its Application to Inertial Neural Networks. IEEE Trans. Neural Netw. Learn. Syst. 2022, 1–12. [Google Scholar] [CrossRef]
  20. Babcock, K.; Westervelt, R. Stability and dynamics of simple electronic neural networks with added inertia. Phys. D Nonlinear Phenom. 1986, 23, 464–469. [Google Scholar] [CrossRef]
  21. Babcock, K.; Westervelt, R. Dynamics of simple electronic neural networks. Phys. D Nonlinear Phenom. 1987, 28, 305–316. [Google Scholar] [CrossRef]
  22. Wheeler, D.W.; Schieve, W. Stability and chaos in an inertial two-neuron system. Phys. D Nonlinear Phenom. 1997, 105, 267–284. [Google Scholar] [CrossRef]
  23. Angelaki, D.E.; Correia, M.J. Models of membrane resonance in pigeon semicircular canal type II hair cells. Biol. Cybern. 1991, 65, 1–10. [Google Scholar] [CrossRef]
  24. Tani, J. Model-based learning for mobile robot navigation from the dynamical systems perspective. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 1996, 26, 421–436. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  25. Yunquan, K.; Chunfang, M. Stability and existence of periodic solutions in inertial BAM neural networks with time delay. Neural Comput. Appl. 2013, 23, 1089–1099. [Google Scholar] [CrossRef]
  26. Xiao, Q.; Huang, T.; Zeng, Z. Global Exponential Stability and Synchronization for Discrete-Time Inertial Neural Networks with Time Delays: A Timescale Approach. IEEE Trans. Neural Netw. Learn. Syst. 2019, 30, 1854–1866. [Google Scholar] [CrossRef] [PubMed]
  27. 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]
  28. Zhang, G.; Zeng, Z. Stabilization of Second-Order Memristive Neural Networks with Mixed Time Delays via Nonreduced Order. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 700–706. [Google Scholar] [CrossRef]
  29. Zhang, G.; Zeng, Z.; Hu, J. New results on global exponential dissipativity analysis of memristive inertial neural networks with distributed time-varying delays. Neural Netw. 2018, 97, 183–191. [Google Scholar] [CrossRef]
  30. Lakshmanan, S.; Prakash, M.; Lim, C.P.; Rakkiyappan, R.; Balasubramaniam, P.; Nahavandi, S. Synchronization of an Inertial Neural Network with Time-Varying Delays and Its Application to Secure Communication. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 195–207. [Google Scholar] [CrossRef]
  31. Xu, C.; Zhang, Q. Existence and global exponential stability of anti-periodic solutions for BAM neural networks with inertial term and delay. Neurocomputing 2015, 153, 108–116. [Google Scholar] [CrossRef]
  32. Prakash, M.; Balasubramaniam, P.; Lakshmanan, S. Synchronization of Markovian jumping inertial neural networks and its applications in image encryption. Neural Netw. 2016, 83, 86–93. [Google Scholar] [CrossRef] [PubMed]
  33. Wang, Q.; Perc, M.; Duan, Z.; Chen, G. Impact of delays and rewiring on the dynamics of small-world neuronal networks with two types of coupling. Phys. A Stat. Mech. Its Appl. 2010, 389, 3299–3306. [Google Scholar] [CrossRef]
  34. Wang, Q.; Chen, G.; Perc, M. Synchronous Bursts on Scale-Free Neuronal Networks with Attractive and Repulsive Coupling. PLoS ONE 2011, 6, e15851. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  35. Guo, D.; Wang, Q.; Perc, M. Complex synchronous behavior in interneuronal networks with delayed inhibitory and fast electrical synapses. Phys. Rev. E 2012, 85, 061905. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  36. Strukov, D.B.; Snider, G.S.; Stewart, D.R.; Williams, R.S. The missing memristor found. Nature 2008, 453, 80–83. [Google Scholar] [CrossRef]
  37. Jo, S.H.; Chang, T.; Ebong, I.; Bhadviya, B.B.; Mazumder, P.; Lu, W. Nanoscale memristor device as synapse in neuromorphic systems. Nano Lett. 2010, 10, 1297–1301. [Google Scholar] [CrossRef]
  38. Corinto, F.; Forti, M. Memristor Circuits: Flux–Charge Analysis Method. IEEE Trans. Circuits Syst. I Regul. Pap. 2016, 63, 1997–2009. [Google Scholar] [CrossRef] [Green Version]
  39. Kim, H.; Sah, M.P.; Yang, C.; Roska, T.; Chua, L.O. Neural Synaptic Weighting with a Pulse-Based Memristor Circuit. IEEE Trans. Circuits Syst. I Regul. Pap. 2012, 59, 148–158. [Google Scholar] [CrossRef]
  40. Duan, S.; Hu, X.; Dong, Z.; Wang, L.; Mazumder, P. Memristor-Based Cellular Nonlinear/Neural Network: Design, Analysis, and Applications. IEEE Trans. Neural Netw. Learn. Syst. 2015, 26, 1202–1213. [Google Scholar] [CrossRef] [PubMed]
  41. Zhang, G.; Hu, J.; Zeng, Z. New Criteria on Global Stabilization of Delayed Memristive Neural Networks with Inertial Item. IEEE Trans. Cybern. 2020, 50, 2770–2780. [Google Scholar] [CrossRef] [PubMed]
  42. Sheng, Y.; Huang, T.; Zeng, Z.; Li, P. Exponential Stabilization of Inertial Memristive Neural Networks with Multiple Time Delays. IEEE Trans. Cybern. 2021, 51, 579–588. [Google Scholar] [CrossRef] [PubMed]
  43. Gong, S.; Yang, S.; Guo, Z.; Huang, T. Global exponential synchronization of inertial memristive neural networks with time-varying delay via nonlinear controller. Neural Netw. 2018, 102, 138–148. [Google Scholar] [CrossRef] [PubMed]
  44. Guo, Z.; Gong, S.; Huang, T. Finite-time synchronization of inertial memristive neural networks with time delay via delay-dependent control. Neurocomputing 2018, 293, 100–107. [Google Scholar] [CrossRef]
  45. Huang, D.; Jiang, M.; Jian, J. Finite-time synchronization of inertial memristive neural networks with time-varying delays via sampled-date control. Neurocomputing 2017, 266, 527–539. [Google Scholar] [CrossRef]
  46. Wei, R.; Cao, J.; Alsaedi, A. Finite-time and fixed-time synchronization analysis of inertial memristive neural networks with time-varying delays. Cogn. Neurodyn. 2018, 12, 121–134. [Google Scholar] [CrossRef]
  47. Tang, Y. Terminal sliding mode control for rigid robots. Automatica 1998, 34, 51–56. [Google Scholar] [CrossRef]
  48. Shen, Y.; Huang, Y. Uniformly Observable and Globally Lipschitzian Nonlinear Systems Admit Global Finite-Time Observers. IEEE Trans. Autom. Control 2009, 54, 2621–2625. [Google Scholar] [CrossRef]
  49. Forti, M.; Grazzini, M.; Nistri, P.; Pancioni, L. Generalized Lyapunov approach for convergence of neural networks with discontinuous or non-Lipschitz activations. Phys. D Nonlinear Phenom. 2006, 214, 88–99. [Google Scholar] [CrossRef]
Figure 1. System constitution and four fundamental elements.
Figure 1. System constitution and four fundamental elements.
Mathematics 11 00684 g001
Figure 2. The drive-response MINNs without the controller.
Figure 2. The drive-response MINNs without the controller.
Mathematics 11 00684 g002
Figure 3. The synchronization error system without the controller.
Figure 3. The synchronization error system without the controller.
Mathematics 11 00684 g003
Figure 4. The synchronization error system with the controller.
Figure 4. The synchronization error system with the controller.
Mathematics 11 00684 g004
Figure 5. The drive-response MINNs without the controller.
Figure 5. The drive-response MINNs without the controller.
Mathematics 11 00684 g005
Figure 6. The synchronization error system without the controller.
Figure 6. The synchronization error system without the controller.
Mathematics 11 00684 g006
Figure 7. The synchronization error system with the controller.
Figure 7. The synchronization error system with the controller.
Mathematics 11 00684 g007
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

Wang, J.; Tian, Y.; Hua, L.; Shi, K.; Zhong, S.; Wen, S. New Results on Finite-Time Synchronization Control of Chaotic Memristor-Based Inertial Neural Networks with Time-Varying Delays. Mathematics 2023, 11, 684. https://doi.org/10.3390/math11030684

AMA Style

Wang J, Tian Y, Hua L, Shi K, Zhong S, Wen S. New Results on Finite-Time Synchronization Control of Chaotic Memristor-Based Inertial Neural Networks with Time-Varying Delays. Mathematics. 2023; 11(3):684. https://doi.org/10.3390/math11030684

Chicago/Turabian Style

Wang, Jun, Yongqiang Tian, Lanfeng Hua, Kaibo Shi, Shouming Zhong, and Shiping Wen. 2023. "New Results on Finite-Time Synchronization Control of Chaotic Memristor-Based Inertial Neural Networks with Time-Varying Delays" Mathematics 11, no. 3: 684. https://doi.org/10.3390/math11030684

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