Next Article in Journal
A Hybrid Stochastic Deterministic Algorithm for Solving Unconstrained Optimization Problems
Next Article in Special Issue
A Novel Bio-Inspired Motion Direction Detection Mechanism in Binary and Grayscale Background
Previous Article in Journal
The Existence and Uniqueness of Riccati Fractional Differential Equation Solution and Its Approximation Applied to an Economic Growth Model
Previous Article in Special Issue
A Novel Artificial Visual System for Motion Direction Detection in Grayscale Images
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Novel Synchronization Conditions for the Unified System of Multi-Dimension-Valued Neural Networks

1
School of Electronic Information and Electrical Engineering, Chengdu University, Chengdu 610106, China
2
Guangxi Key Lab of Multi-Source Information Mining & Security, Guangxi Normal University, Guilin 541004, China
3
College of Chemistry and Chemical Engineering, Southwest Petroleum University, Chengdu 610050, China
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(17), 3031; https://doi.org/10.3390/math10173031
Submission received: 29 July 2022 / Revised: 14 August 2022 / Accepted: 19 August 2022 / Published: 23 August 2022
(This article belongs to the Special Issue Dynamics in Neural Networks)

Abstract

:
This paper discusses the novel synchronization conditions about the unified system of multi-dimension-valued neural networks (USOMDVNN). First of all, the general model of USOMDVNN is successfully set up, mainly on the basis of multidimensional algebra, Kirchhoff current law, and neuronal property. Then, the concise Lyapunov–Krasovskii functional (LKF) and switching controllers are constructed for the USOMDVNN. Moreover, the new inequalities, whose variables, together with some parameters, are employed in a concise and unified form whose variables can be translated into special ones, such as real, complex, and quaternion. It is worth mentioning that the useful parameters really make some contributions to the construction of the concise LKF, the design of the general controllers, and the acquisition of flexible criteria. Further, we acquire the newer criteria mainly by employing Lyapunov analysis, constructing new LKF, applying two unified inequalities, and designing nonlinear controllers. Particularly, the value of the fixed time is less than the other ones in some existing results, owing to the adjustable parameters. Finally, three multidimensional simulations are presented, to demonstrate the availability and progress of the achieved acquisitions.

1. Introduction

Since the 1980s, neural networks have been playing a key role in more and more areas such as image compression, signal processing, artificial intelligence, and so on [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18]. However, as application demand increases, the usual neural networks based on lower algebra inevitably show their weaknesses or even powerlessness in some complicated and advanced fields. Fortunately, the application areas of neural networks develop rapidly because of the progress made by higher algebra, and concepts such as complex or quaternion are introduced to construct USOMDVNN [4,8,9,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43].
In the real synchronous control system, the signal transmission sometimes needs to depend on the general communication network. For example, these include secure communication in wireless networks, robot cooperation in harsh environments, and multi-agent distributed formation control. The system of neural networks based on multi-dimension is employed to the networked synchronous control system for modeling and analysis. More applications can be realized through the remote control and remote operation of the control system. In addition, more and more researchers have employed the synchronization of complex dynamic networks in information science, power systems, and biological systems, and so on [2,3,4,5,6,7,17,18]. Both the structure and function of the brain’s nervous system can be simulated by more complex dynamic networks with multi-dimension at different levels. Meanwhile, some researchers have applied more complex dynamic networks with multi-dimension in planning the robotic path, collaboratively controlling unmanned aerial vehicles, and searching satellite formation. Naturally, there is an innovative idea for combining neural networks with higher algebra to build complex neural networks that can simultaneously have more in-depth improvement.
Recently, some researchers have focused on various dynamics of neural networks with real algebra [13,16,44], neural networks in the area of the complex field [8,32,33], or neural networks in the quaternion field [4,9,19,20,21,22,23,24,25,26]. Among the various dynamical behaviors, stability is the basic one that receives close attention from more scholars [4,19,20]. Particularly, owing to the definition of master–slave synchronization, the research of the master system’s synchronization with the slave one is equal to the discussion about the stability of the related error system with the master–slave systems.Therefore, many researchers have investigated the different kinds of synchronization criteria on the various systems of USOMDVNN [22,23,24,25,26]. Asymptotic synchronization and exponential synchronization are both considered as infinite-time synchronization, whose essence indicates that synchronization can just be finished, as long as the time verges to infinity [19,20,21,29,30,31]. Different with the above two kinds of synchronization, finite-time synchronization [23] owns absolute advantages in practical engineering applications. For finite-time synchronization, synchronization could be realized in a certain amount of time, which depends on the initial value. However, the certain amount of time can not be estimated without the accurate initial value. In 2012, Polyakov, in [11], put forward the thought of fixed-time synchronization, which indicates that the master systems can synchronize with the slave ones in a finite time without the precise initial value. That is, the finite time has the fixed upper bound for the discussed system under any initial conditions. Very recently, on one hand, many researchers have devoted themselves to deriving the fixed time with the tighter upper bound, by establishing some formulas [12,13,45]. On the other hand, because the basic commutative law can not be directly applied in the quaternion multiplication, many researchers have focused on studying different methods such as separation or nonseparation in solving the unavoidable difficulty [4,5,19,20]. The research about different dynamics in the system of USOMDVNN with many methods is still meaningful and worthy of much attention, as Liu et al. in [19] has said. Focusing on the previous results on the special systems of RVNN [13,16,44], CVNN [8,29,35,36], and QVNN [21,22,23], it is not difficult to find out that some analyses, especially those based on the separation of the systems of CVNN and QVNN, may inevitably increase the amount of calculation. Therefore, we need the search for the concise LKF and switching controllers for the novel synchronization criteria, including both asymptotic synchronization and the fixed-time one about the unified system of USOMDVNN.
Motivated by the above investigation and research, we put forward a unified analysis on globally asymptotic synchronization and fixed-time synchronization for USOMDVNN in this paper. First of all, the general model of USOMDVNN is successfully constructed, mainly on the basis of multidimensional algebra, Kirchhoff current law, and neuronal feature. Then, the new inequalities with some parameters are applied in a unified form whose variable can be translated into its special one, such as real, complex, and quaternion. It is worth mentioning that the useful parameters really make some contributions to the novel structure of the concise LKF, the new construction of the switching controllers, and the easy acquisition of the flexible criteria. Further, we acquire the newer criteria mainly by employing Lyapunov analysis, constructing new LKF, applying two unified inequalities, and designing novel controllers. It is worth mentioning that the concrete value of the fixed time is less than the other ones in the existing results, owing to the adjustable parameters. The following points are the the main contributions of this paper.
(1) The unified model of the investigated USOMDVNN is generally set up.
(2) Owing to the new establishment of the extended derivative of the absolute value function and the new application of the generalized Cauchy–Schwarz inequality, the concise LKF is successfully constructed and is used to solve the problem of non-commutativity for multidimensional multiplication.
(3) Inspired by the previous work [25,26], both the newly constructed LKF and the derived criteria contain the flexible parameters ϖ ˘ p , and the novelly designed controllers involve the adjustable parameters ϖ ˘ p . By adjusting the values of ϖ ˘ p properly, the LKF can become multiple, the relevant conditions both in Theorems 1 and 2 can become flexible, and the controllers in Theorem 2 can reach the smaller synchronization fixed time T ˘ τ .
Notations: The sets of all p × q -dimensional matrices that own multidimensional algebra are denoted as M p × q . Define the multi-dimension-valued variable z ˘ ( t ) as follows.
z ˘ ( t ) = z ˘ R ( t ) + i z ˘ I ( t ) + j z ˘ J ( t ) + k z ˘ K ( t ) ) , z ˘ ( t ) Q , z ˘ R ( t ) + i z ˘ I ( t ) , z ˘ ( t ) C , z ˘ R ( t ) , z ˘ ( t ) R .
Correspondingly, the derivative of variable z ˘ ( t ) in the multi-dimension-valued form is regarded to be multi-dimension formed by the derivatives of every element z ˘ M ( t ) (M can be equal to be R , I , J or K; M can be equal to be R or I; or M can be equal to be R) of the multi-dimension variable z ˘ ( t ) with respect to t:
z ˘ ˙ ( t ) = z ˘ ˙ R ( t ) + i z ˘ ˙ I ( t ) + j z ˘ ˙ J ( t ) + k z ˘ ˙ K ( t ) , z ˘ ( t ) Q , z ˘ ˙ R ( t ) + i z ˘ ˙ I ( t ) , z ˘ ( t ) C , z ˘ ˙ R ( t ) , z ˘ ( t ) R .
More specific descriptions can be found in the previous works [25,26].

2. Model Description and Preliminaries

First of all, we give the general master system of USOMDVNN as follows.
x ˘ ˙ m ( t ) = c ˘ m x ˘ m ( t ) + n = 1 q a ˘ m n f ˘ n ( x ˘ n ( t ) ) + I ˘ m ( t ) ,
where t 0 , m , n = 1 , 2 , , q , x ˘ ( t ) = ( x ˘ 1 ( t ) , x ˘ 2 ( t ) , , x ˘ q ( t ) ) T M q , x ˘ m ( t ) stands for the state variable of the m-th neuron; c ˘ m > 0 , c ˘ m R ( m = 1 , 2 , , q ) describes the decay matrix; the external input vector is denoted as I ˘ ( t ) = ( I ˘ 1 , I ˘ 2 , , I ˘ q ) T M q ; the corresponding multi-dimension-valued activation functions are expressed by f ˘ ( x ˘ ( t ) ) = ( f ˘ 1 ( x ˘ 1 ( t ) ) , f ˘ 2 ( x ˘ 2 ( t ) ) , , f ˘ q ( x ˘ q ( t ) ) ) T M q .
The relevant slave system of USOMDVNN can be similarly established as follows,
y ˘ ˙ m ( t ) = c ˘ m y ˘ m ( t ) + n = 1 q a ˘ m n f ˘ n ( y ˘ n ( t ) ) + I ˘ m ( t ) + J ˘ m ( t ) ,
where, t 0 , m = 1 , 2 , , q , n = 1 , 2 , , q ; y ˘ ( t ) = ( y ˘ 1 ( t ) , y ˘ 2 ( t ) , , y ˘ q ( t ) ) T M q stands for the state variable of the m-th neuron; c ˘ m > 0 , c ˘ m R ( m = 1 , 2 , , p ) describes the corresponding decay matrix; J ˘ m ( t ) denotes the subsequently designed controllers.
Generally, design the switching controllers as follows,
J ˘ m ( t ) = | k ˘ m | z ˘ m ( t ) , s o m e z ˘ m * ( t ) = 0 , | k ˘ m | z ˘ m ( t ) | l ˘ m | ( ω ˘ m ) 2 s i g n ( z ˘ m ( t ) ) | z ˘ m * ( t ) | β ˘ 1 | z ˘ m ( t ) | β ˘ | m ˘ m | ( ω ˘ m ) 2 s i g n ( z ˘ m ( t ) ) | z ˘ m * ( t ) | γ ˘ 1 | z ˘ m ( t ) | γ ˘ , a n y z ˘ m * ( t ) 0 .
where, m = 1 , 2 , , q , 0 < β ˘ < 1 , γ ˘ > 1 , k ˘ m , l ˘ m , m ˘ m ; ω ˘ m stand for the gains of the above controllers, and all can be any nonzero constants.
Denote z ˘ m ( t ) = y ˘ m ( t ) x ˘ m ( t ) . According to the above master system and slave one, we can obtain the following general error one:
z ˘ ˙ m ( t ) = c ˘ m z ˘ m ( t ) + n = 1 q a ˘ m n f ˘ n ( z ˘ n ( t ) ) + J ˘ m ( t ) ,
where, z ˘ ( t ) = ( z ˘ 1 ( t ) , z ˘ 2 ( t ) , , z ˘ q ( t ) ) T M q , f ˘ n ( z ˘ n ( t ) ) = f ˘ n ( y ˘ n ( t ) ) f ˘ n ( x ˘ n ( t ) ) .
Definition 1
([19]). The error system of USOMDVNN (3) is defined to achieve the globally asymptotical stability if l i m t + z ˘ 1 = 0 .
Definition 2
([23]). The error system of USOMDVNN (3) is considered to achieve the finite-time stability if l i m t T ( z ˘ ( 0 ) ) z ˘ 1 = 0 and z ˘ 1 = 0 for t > T ˘ ( z ˘ ( 0 ) ) , where, T ˘ ( z ˘ ( 0 ) ) is a constant and T ˘ ( z ˘ ( 0 ) ) > 0 . Moreover, the finite setting time is denoted as T ˘ ( z ˘ ( 0 ) ) .
Definition 3
([13]). The error system of USOMDVNN (3) is regarded to achieve the fixed-time stability, if the following conditions hold: (1) The error system of USOMDVNN (3) can achieve the finite-time stability; (2) Let T ˘ τ is a positive and fixed constant. Then, there exists T ˘ ( z ˘ ( 0 ) ) < T ˘ τ , for any z ˘ ( 0 ) . Moreover, T ˘ τ is defined to be the fixed time.
Assumption 1.
Assume that the activation functions f ˘ n ( · ) could satisfy the basic inequality f ˘ n ( y ˘ ) f ˘ n ( x ˘ ) λ ˘ n y ˘ x ˘ , where n = 1 , 2 , , q , λ ˘ n > 0 .
Lemma 1
([11]). Suppose V ˘ ( · ) : R q R + 0 to be a radially continuous and unbounded function, and satisfy: (1) V ˘ ( z ˘ ( t ) ) = 0 z ˘ ( t ) = 0 ; (2) Any solution z ˘ ( t ) of the error system of USOMDVNN (3) meets D + V ˘ ( z ˘ ( t ) ) ϑ ˘ V ˘ β ˘ ( z ˘ ( t ) ) υ ˘ V ˘ γ ˘ ( z ˘ ( t ) ) , for ϑ ˘ > 0 , υ ˘ > 0 , 0 < β ˘ < 1 and γ ˘ > 1 , where D + V ˘ ( z ˘ ( t ) ) stands for the upper right-hand Dini differential of V ˘ ( z ˘ ( t ) ) . Then, the error system of USOMDVNN (3) can achieve the fixed-time stability and the concrete fixed time T ˘ τ = ( ϑ ˘ ( 1 β ˘ ) ) 1 + ( υ ˘ ( γ ˘ 1 ) ) 1 .
Lemma 2
([27] (Extended Cauchy-Schwarz Inequality)). For any X ˘ , Y ˘ M , μ ˘ Y ˘ ν ˘ X ˘ + ( ν ˘ X ˘ ) * ( μ ˘ Y ˘ ) * ξ ˘ μ ˘ 2 Y ˘ Y ˘ * + 1 ξ ˘ ν ˘ 2 X ˘ * X ˘ , where, μ ˘ , ν ˘ R , ξ ˘ R ( ξ ˘ > 0 ) are all constants.
Lemma 3
([26] (Extended Differential of Absolute Value Function)). If z ˘ ( t ) C 1 ( [ t 0 , + ) , M ) , c R , then d | a z ˘ ( t ) | d t = | c | s i g n ( z ˘ ( t ) ) · z ˘ ˙ ( t ) , t t 0 , where the symbol · describes the dot product between the two vectors.
Lemma 4
([28]). If ε ˘ m 0   ( m = 1 , 2 , , p ) , 0 < ι ˘ 1 , κ ˘ > 1 , then m = 1 p ε ˘ m ι ˘ ( m = 1 p ε ˘ m ) ι ˘ , m = 1 p ε ˘ m κ ˘ n 1 κ ˘ ( m = 1 p ε ˘ m ) κ ˘ .

3. Main Results

Generally, design the switching controllers as follows.
J ˘ m ( t ) = | k ˘ m | z ˘ m ( t ) , s o m e z ˘ m * ( t ) = 0 , | k ˘ m | z ˘ m ( t ) | l ˘ m | ( ω ˘ m ) 2 s i g n ( z ˘ m ( t ) ) | z ˘ m * ( t ) | β ˘ 1 | z ˘ m ( t ) | β ˘ | m ˘ m | ( ω ˘ m ) 2 s i g n ( z ˘ m ( t ) ) | z ˘ m * ( t ) | γ ˘ 1 | z ˘ m ( t ) | γ ˘ , a n y z ˘ m * ( t ) 0 .
where, m = 1 , 2 , , q , 0 < β ˘ < 1 , γ ˘ > 1 , k ˘ m , l ˘ m , m ˘ m ; ω ˘ m stand for the gains of the above controllers, and all can be any nonzero constants.
When some z ˘ m * ( t ) = 0 , m = 1 or m = 2 , …, or m = q , we just design the linear controllers as follows.
J ˘ m ( t ) = | k ˘ m | z ˘ m ( t ) ,
where, k ˘ m ( m = 1 , 2 , , q ) describe the corresponding gains of the above linear controllers and k ˘ m 0 .
When any z ˘ m * ( t ) 0 , we design
J ˘ m ( t ) = | k ˘ m | z ˘ m ( t ) | l ˘ m | ( ϖ ˘ m ) 2 s i g n ( z ˘ m ( t ) ) | z ˘ m * ( t ) | β ˘ 1 | z ˘ m ( t ) | β ˘ | m ˘ m | ( ϖ ˘ m ) 2 s i g n ( z ˘ m ( t ) ) | z ˘ m * ( t ) | γ ˘ 1 | z ˘ m ( t ) | γ ˘ ,
where, m = 1 , 2 , , q , 0 < β ˘ < 1 , γ ˘ > 1 , k ˘ m , l ˘ m , m ˘ m , and ϖ ˘ m describe the gains of the nonlinear controllers, and all can be any nonzero constants.
Remark 1.
Compared to the precious work in [25], the above switching controllers not only contain linear ones, but also include nonlinear ones. The key contribution of the controllers can solve the singularity, which may generate in the similar ones of [25]. In fact, it is worth noting that, as the condition 0 < β ˘ < 1 , the variable z ˘ m * ( t ) contains the power ( β ˘ 1 ), and a singularity may exist when the variable is equal to 0. However, as long as the variable is not equal to 0, there will be no singularity. Therefore, the newly designed controllers can help realize both the globally asymptotical synchronization and the fixed-time one, which will be discussed in the next theorems and shown in the simulations.
Next, we discuss two kinds of the synchronization according to the above values of the switching controllers (4).

3.1. Globally Asymptotical Synchronization of USOMDVNN

According to the switching controllers (4), when some z ˘ m * ( t ) = 0 , m = 1 or m = 2 , …, or m = q , we just design the linear controllers as follows.
J ˘ m ( t ) = | k ˘ m | z ˘ m ( t ) ,
where, k ˘ m ( m = 1 , 2 , , q ) describe the corresponding gains of the above linear controllers and k ˘ m 0 .
Theorem 1.
Under Assumption 1, if there exist constants ϖ ˘ m 0 , k ˘ m 0 , l ˘ m 0 , m ˘ m 0 , ρ ˘ > 0 , 0 < β ˘ < 1 , γ ˘ > 1 , λ ˘ m > 0 , and σ ˘ > 0 , such that
σ ˘ = max 1 m p { 2 c ˘ m 2 | k ˘ m | + n ρ ˘ | ϖ ˘ m | + λ ˘ m 2 ρ ˘ ( ϖ ˘ m ) 2 n = 1 q | ϖ ˘ n | a ˘ n m * a ˘ n m } < 0 , m = 1 , 2 , , q , n = 1 , 2 , , q ,
then the master system of USOMDVNN (1) can reach globally asymptotical synchronization with the slave system of USOMDVNN (3) under the linear controllers (5).
Proof. 
The concise LKF in vector form can be constructed as follows
V ˘ ( t ) = | ϖ ˘ * Z ˘ * | · | ϖ ˘ Z ˘ | ,
where,
ϖ ˘ = ( ϖ ˘ 1 , ϖ ˘ 2 , , ϖ ˘ q ) R q
Z ˘ = ( z ˘ 1 ( t ) , z ˘ 2 ( t ) , , z ˘ q ( t ) ) T M q
Z ˘ * = ( z ˘ 1 * ( t ) , z ˘ 2 * ( t ) , , z ˘ q * ( t ) ) T M q .
According to the basic differential of the absolute value function, we have
D + V ˘ ( t ) = ( m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | ) = m = 1 p ( | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | )
= m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ m z ˘ m ( t ) | + m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | .
Based on new Lemma 3, it follows
D + V ˘ ( t ) = m = 1 q | ϖ ˘ m * | s g n ( z ˘ m * ( t ) ) z ˘ ˙ m * ( t ) | ϖ ˘ m z ˘ m ( t ) | + m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m | s g n ( z ˘ m ( t ) ) z ˘ ˙ m ( t ) .
According to the error system (3), it can hold
D + V ˘ ( t ) m = 1 q | ϖ ˘ m * | s g n ( z ˘ m * ( t ) ) [ c ˘ m z ˘ m * ( t ) + n = 1 q f ˘ n * ( z ˘ n * ( t ) ) a ˘ m n * | k ˘ m | z ˘ m * ( t ) ] | ϖ ˘ m z ˘ m ( t ) | + m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m | s g n ( z ˘ m ( t ) ) [ c ˘ m z ˘ m ( t ) + n = 1 q a ˘ m n f ˘ n ( z ˘ n ( t ) ) | k ˘ m | z ˘ m ( t ) ] .
That is,
D + V ˘ ( t ) m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | [ 2 c ˘ m 2 | k ˘ m | ] + m = 1 q | ϖ ˘ m * | n = 1 q | f ˘ n * ( z ˘ n * ( t ) ) a ˘ m n * | | ϖ ˘ m z ˘ m ( t ) | + m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m | n = 1 q | a ˘ m n f ˘ n ( z ˘ n ( t ) ) | ]
By employing Lemma 2, we can see there exist ρ ˘ > 0 , such that
f ˘ n * ( z * ˘ n ( t ) ) a ˘ m n * ϖ ˘ m z ˘ m ( t ) + ϖ ˘ m * z ˘ m * ( t ) a ˘ m n f ˘ n ( z ˘ n ( t ) ) ρ ˘ ( ϖ ˘ m ) 2 z ˘ m * ( t ) z ˘ m ( t ) + 1 ρ ˘ f ˘ n * ( z * ˘ n ( t ) ) a ˘ m n a ˘ m n * f ˘ n ( z ˘ n ( t ) ) .
Then, it goes
D + V ˘ ( t ) m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | [ 2 c ˘ m 2 | k ˘ m | ] + m = 1 q | ϖ ˘ m * | n = 1 q [ ρ ˘ ( ϖ ˘ m ) 2 z ˘ m * ( t ) z ˘ m ( t ) + 1 ρ ˘ f ˘ n * ( z * ˘ n ( t ) ) a ˘ m n a ˘ m n * f ˘ n ( z ˘ n ( t ) ) ] = m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | [ 2 c ˘ m 2 | k ˘ m | + n ρ ˘ | ϖ ˘ m | + λ m 2 ρ ˘ ( ϖ ˘ m ) 2 n = 1 q | ϖ ˘ n | a q p * a q p ]
Based on the conditions of Theorem 1, it can be easily obtained that
D + V ˘ ( t ) σ ˘ V ˘ ( t ) .
Based on Definition 1 and Lemma 1, if and only if every component of z ˘ m ( t ) = 0 ( m = 1 , 2 , , q ), then Z ˘ = ( z ˘ 1 ( t ) , z ˘ 2 ( t ) , , z ˘ q ( t ) ) T M q = 0 and V ˘ ( t ) = 0 . If Z ˘ 0 , then D + V ˘ ( t ) < 0 . It can be concluded that the error system of USOMDVNN (3) can reach globally asymptotical stability with the linear controllers (5). □

3.2. Fixed-Time Synchronization of USOMDVNN

According to the switching controllers (4), when any z ˘ m * ( t ) 0 , we design
J ˘ m ( t ) = | k ˘ m | z ˘ m ( t ) | l ˘ m | ( ϖ ˘ m ) 2 s i g n ( z ˘ m ( t ) ) | z ˘ m * ( t ) | β ˘ 1 | z ˘ m ( t ) | β ˘ | m ˘ m | ( ϖ ˘ m ) 2 s i g n ( z ˘ m ( t ) ) | z ˘ m * ( t ) | γ ˘ 1 | z ˘ m ( t ) | γ ˘ ,
where, m = 1 , 2 , , q , 0 < β ˘ < 1 , γ ˘ > 1 , k ˘ m , l ˘ m , m ˘ m , and ϖ ˘ m describe the gains of the nonlinear controllers and all can be any nonzero constants.
Theorem 2.
Under Assumption 1, if there exist constants ϖ ˘ m 0 , k ˘ m 0 , l ˘ m 0 , m ˘ m 0 , ρ ˘ > 0 , 0 < β ˘ < 1 , γ ˘ > 1 , λ ˘ m > 0 , and σ ˘ > 0 , such that
σ ˘ = max 1 m p { 2 c ˘ m 2 | k ˘ m | + n ρ ˘ | ϖ ˘ m | + λ ˘ m 2 ρ ˘ ( ϖ ˘ m ) 2 n = 1 q | ϖ ˘ n | a ˘ n m * a ˘ n m } < 0 , m = 1 , 2 , , q , n = 1 , 2 , , q ,
then under the nonlinear controllers (11), the master system of USOMDVNN (1) and the slave system of USOMDVNN (3) can achieve fixed-time synchronization with each other. In addition, the concrete fixed time is
T ˘ τ = ( ϑ ˘ ( 1 β ˘ ) ) 1 + ( υ ˘ ( γ ˘ 1 ) ) 1 ,
where, ϑ ˘ = min 1 m q { 2 | ϖ ˘ m | 4 2 β ˘ | l ˘ m | } , υ ˘ = min 1 m q { 2 | ϖ ˘ m | 4 2 γ ˘ | m ˘ m | } q 1 γ ˘ .
Proof. 
The same concise LKF in vector form can be constructed as follows,
V ˘ ( t ) = | ϖ ˘ * Z ˘ * | · | ϖ ˘ Z ˘ | ,
where,
ϖ ˘ = ( ϖ ˘ 1 , ϖ ˘ 2 , , ϖ ˘ q ) R q ,
Z ˘ = ( z ˘ 1 ( t ) , z ˘ 2 ( t ) , , z ˘ q ( t ) ) T M q ,
Z ˘ * = ( z ˘ 1 * ( t ) , z ˘ 2 * ( t ) , , z ˘ q * ( t ) ) T M q .
According to the basic differential of the absolute value function, we have
D + V ˘ ( t ) = ( m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | ) = m = 1 p ( | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | )
= m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ m z ˘ m ( t ) | + m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | .
Based on new Lemma 3, it follows:
D + V ˘ ( t ) = m = 1 q | ϖ ˘ m * | s g n ( z ˘ m * ( t ) ) z ˘ ˙ m * ( t ) | ϖ ˘ m z ˘ m ( t ) | + m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m | s g n ( z ˘ m ( t ) ) z ˘ ˙ m ( t ) .
According to the error system (3), it can hold
D + V ˘ ( t ) m = 1 q | ϖ ˘ m * | s g n ( z ˘ m * ( t ) ) [ c ˘ m z ˘ m * ( t ) + n = 1 q f ˘ n * ( z ˘ n * ( t ) ) a ˘ m n * | k ˘ m | z ˘ m * ( t ) | l ˘ m | ( ϖ ˘ m ) 2 s i g n ( z ˘ m * ( t ) ) | z ˘ m ( t ) | β ˘ 1 | z ˘ m * ( t ) | β ˘ | m ˘ m | ( ϖ ˘ m ) 2 s i g n ( z ˘ m * ( t ) ) | z ˘ m ( t ) | γ ˘ 1 | z ˘ m * ( t ) | γ ˘ ] | ϖ ˘ m z ˘ m ( t ) | + m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m | s g n ( z ˘ m ( t ) ) [ c ˘ m z ˘ m ( t ) + n = 1 q a ˘ m n f ˘ n ( z ˘ n ( t ) ) | k ˘ m | z ˘ m ( t ) | l ˘ m | ( ϖ ˘ m ) 2 s i g n ( z ˘ m ( t ) ) | z ˘ m * ( t ) | β ˘ 1 | z ˘ m ( t ) | β ˘ | m ˘ m | ( ϖ ˘ m ) 2 s i g n ( z ˘ m ( t ) ) | z ˘ m * ( t ) | γ ˘ 1 | z ˘ m ( t ) | γ ˘ ] .
That is,
D + V ˘ ( t ) m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | [ 2 c ˘ m 2 | k ˘ m | ] + m = 1 q | ϖ ˘ m * | n = 1 q | f ˘ n * ( z ˘ n * ( t ) ) a ˘ m n * | | ϖ ˘ m z ˘ m ( t ) | + m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m | n = 1 q | a ˘ m n f ˘ n ( z ˘ n ( t ) ) | + m = 1 q | ϖ ˘ m * | [ | l ˘ m | ( ϖ ˘ m ) 2 | z ˘ m ( t ) | β ˘ 1 | z ˘ m * ( t ) | β ˘ m ˘ m | ( ϖ ˘ m ) 2 | z ˘ m * ( t ) | γ ˘ 1 | z ˘ m ( t ) | γ ˘ ] | ϖ ˘ m z ˘ m ( t ) | + m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m | [ | l ˘ m | ( ϖ ˘ m ) 2 | z ˘ m * ( t ) | β ˘ 1 | z ˘ m ( t ) | β ˘ | m ˘ m | ( ϖ ˘ m ) 2 | z ˘ m * ( t ) | γ ˘ 1 | z ˘ m ( t ) | γ ˘ ]
By applying Lemma 2, we can obtain that there exist ρ ˘ > 0 , such that
f ˘ n * ( z * ˘ n ( t ) ) a ˘ m n * ϖ ˘ m z ˘ m ( t ) + ϖ ˘ m * z ˘ m * ( t ) a ˘ m n f ˘ n ( z ˘ n ( t ) ) ρ ˘ ( ϖ ˘ m ) 2 z ˘ m * ( t ) z ˘ m ( t ) + 1 ρ ˘ f ˘ n * ( z * ˘ n ( t ) ) a ˘ m n a ˘ m n * f ˘ n ( z ˘ n ( t ) ) .
In addition, it can easily hold that
D + V ˘ ( t ) m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | [ 2 c ˘ m 2 | k ˘ m | ] + m = 1 q | ϖ ˘ m * | n = 1 q [ ρ ˘ ( ϖ ˘ m ) 2 z ˘ m * ( t ) z ˘ m ( t ) + 1 ρ ˘ f ˘ n * ( z * ˘ n ( t ) ) a ˘ m n a ˘ m n * f ˘ n ( z ˘ n ( t ) ) ] + 2 m = 1 p ϖ ˘ m 2 [ | l ˘ m | ( ϖ ˘ m ) 2 | z ˘ m ( t ) | β ˘ | z ˘ m * ( t ) | β ˘ m ˘ m | ( ϖ ˘ m ) 2 | z ˘ m * ( t ) | γ ˘ | z ˘ m ( t ) | γ ˘ ] = m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | [ 2 c ˘ m 2 | k ˘ m | + n ρ ˘ | ϖ ˘ m | + λ m 2 ρ ˘ ( ϖ ˘ m ) 2 n = 1 q | ϖ ˘ n | a q p * a q p ] 2 m = 1 q | ϖ ˘ m | 4 2 β ˘ | l ˘ m | ( | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | ) β ˘ 2 m = 1 q | ϖ ˘ m | 4 2 γ ˘ | m ˘ m | ( | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | ) γ ˘
Based on the conditions of Theorem 2, it can be obtained that
D + V ˘ ( t ) min 1 m q { 2 | ϖ ˘ m | 4 2 β ˘ | l ˘ m | } m = 1 p ( | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | ) β ˘ min 1 m q { 2 | ϖ ˘ m | 4 2 γ ˘ | m ˘ m | } m = 1 p ( | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | ) γ ˘ .
Because the conditions 0 < β ˘ < 1 and γ ˘ > 1 hold, it is easy to obtain that D + V ˘ ( t ) ϑ ˘ ( | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | ) β ˘ υ ˘ ( | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | ) γ ˘ . Based on Lemma 1 and under the nonlinear controllers (11), it can be concluded thatthe error system of USOMDVNN (3) can achieve the fixed-time stability and also can obtain the concrete fixed time T ˘ τ = ( ϑ ˘ ( 1 β ˘ ) ) 1 + ( υ ˘ ( γ ˘ 1 ) ) 1 .
Remark 2.
To derive the criteria for the two kinds of synchronization problem for USOMDVNN (3), there are main mathematical difficulties: (1) the establishment of the unified system; (2) the construction of the new LKF; (3) the act of the varied coefficients; (4) the new design of the switching controllers; (5) the different simulations of the USOMDVNN, as the algebra is different.
Remark 3.
When there may be some variable z ˘ m ( t ) = 0 of the error system of USOMDVNN, (3), the common linear controllers (5) are applied to realize the globally asymptotical synchronization of the error system of USOMDVNN (3); When there is any variable z ˘ m ( t ) 0 , the new nonlinear controllers (11) are employed to achieve the fixed-time synchronization of the error system of USOMDVNN (3). In fact, the variable z ˘ m ( t ) is almost not equal to 0. Therefore, the accomplished synchronization is almost the fixed-time one. In addition, compared to the conditions in Theorems 1 and 2, it is easy to find that the basic criteria are the same. That is to say, whether the criteria for the globally asymptotical synchronization or for the fixed-time synchronization, it is newer. Particularly, the criteria for the fixed-time synchronization not only contains the foundation condition of synchronization, but also includes the concrete time of synchronization.
Remark 4.
Compared with the recently constructed LKF in [21,22,23], the novelty of the new LKF V ˘ ( t ) = | ϖ ˘ * Z ˘ * | · | ϖ ˘ Z ˘ | lies in the following aspects: (1) the vector form makes the LKF more concise and general; (2) the number of the useful coefficients can be reduced; (3) the method to solve the added coefficients becomes more extensive. Mainly employing Lemmas 2 and 3, the useful parameters such as ϖ ˘ and ρ ˘ can be used to establish more proper criteria. Moreover, owing to the application of the above new lemmas, the useful parameters can be properly adjusted in order to make the derived criteria more multiple, more flexible, less computative, and less conservative. Compared to the designed controllers in [21,22,23], the controllers in this paper are more general and more useful because of the adjustable coefficients ϖ ˘ m . If the value of ϖ ˘ is zero, the controllers reduce to be the same ones as in [21,22,23]. Moreover, by adjusting the values of ϖ ˘ m , k ˘ m , l ˘ m , and m ˘ m comprehensively, we can derive the the final tighter fixed time of synchronization while the same one can not be obtained in [21,22,23].
Remark 5.
Compared to the results in [5,8,13], there are the following advantages in our paper: (1) The generalization of the unified model of USOMDVNN (1) lies in that it contains RVNN, CVNN, and QVNN, while the model in [5] just contains the system of QVNN; the system in [8] is just considered to be CVNN and the model in [13] only includes the system of RVNN; (2) To solve the difficulty in quaternion multiplication, in this paper we employ the direct method, which can reduce the unnecessary computation burden that can be caused in the separation of QVNN in [5]; (3) The designed controllers in our paper are newer, more flexible, and less complicated than the ones in [5,8]. Moreover, by designing the controllers with some adjustable parameters properly, we can obtain the results in less fixed time than the results in [8,13].
Remark 6.
Inspired by the new methods in [23,25], we have extended the above results and have successfully established the inner relationship between the novel LKF, the new controllers, and the final criteria in this paper. We have desined the common coefficients ϖ ˘ m in the specific LKF V ˘ ( t ) = m = 1 q | ϖ ˘ m * z ˘ m * ( t ) | | ϖ ˘ m z ˘ m ( t ) | , the nonlinear controllers J ˘ m ( t ) = | k ˘ m | z ˘ m ( t ) | l ˘ m | ( ϖ ˘ m ) 2   s i g n ( z ˘ m ( t ) ) | z ˘ m * ( t ) | β ˘ 1 | z ˘ m ( t ) | β ˘ | m ˘ m | ( ϖ ˘ m ) 2 s i g n ( z ˘ m ( t ) ) | z ˘ m * ( t ) | γ ˘ 1 | z ˘ m ( t ) | γ ˘ , and the final criteria max 1 m p { 2 c m 2 | k ˘ m | + n ρ ˘ | ϖ ˘ m | + λ m 2 ρ ˘ ( ϖ ˘ m ) 2 n = 1 q | ϖ ˘ n | a n m * a n m } < 0 .

4. Numerical Simulation

In this part, three numerical simulations will be supported to demonstrate the above theoretical results and compare the criteria with some existing results.
Example 1.
The following master system of QVNN with 2-neuron is considered.
x ˘ ˙ m ( t ) = c ˘ m x ˘ m ( t ) + I ˘ m ( t ) + n = 1 2 a ˘ m n f ˘ n ( x ˘ n ( t ) ) ,
where, x ˘ m ( t ) Q , c ˘ 1 = 6 , c ˘ 2 = 4 , f ˘ m ( x ˘ m ( t ) ) = 0.1 ( t a n h ( x ˘ m ( t ) ) 1 ) , λ ˘ m = 0.1 , a ˘ 11 = 3 4 i + 8 j 9 k , a ˘ 12 = 2 + 2 i 6 j + 7 k , a ˘ 21 = 5 3 i 5 j 3 k , a ˘ 22 = 1 + i 8 j + 2 k , I ˘ 1 ( t ) = [ s i n ( t ) + i s i n ( t ) + j s i n ( t ) + k s i n ( t ) ] , I ˘ 2 ( t ) = [ c o s ( t ) + i c o s ( t ) + j c o s ( t ) + k c o s ( t ) ] .
The corresponding slave system of QVNN with 2-neuron
y ˘ ˙ m ( t ) = c ˘ m y ˘ m ( t ) + I ˘ m ( t ) + n = 1 2 a ˘ m n f ˘ n ( y ˘ n ( t ) ) + J ˘ m ( t ) ,
where, y ˘ m ( t ) Q , c ˘ 1 = 6 , c ˘ 2 = 4 , f ˘ m ( y ˘ m ( t ) ) = 0.1 ( t a n h ( y ˘ m ( t ) ) 1 ) , λ ˘ m = 0.1 , I ˘ 1 ( t ) = [ s i n ( t ) + i s i n ( t ) + j s i n ( t ) + k s i n ( t ) ] , I ˘ 2 ( t ) = [ c o s ( t ) + i c o s ( t ) + j c o s ( t ) + k c o s ( t ) ] , and the switching controllers are desined in (4) where, β ˘ = 0.5 , γ ˘ = 1.5 , m = 1 , 2 , k ˘ 1 = k ˘ 2 = ± 6 , l ˘ 1 = l ˘ 2 = ± 1 , m ˘ 1 = m ˘ 2 = ± 1 .
Let ρ ˘ = 1 . Because the value of ϖ ˘ m varies, the acquired criteria are diverse and not just one. Here, the following two conditions of the values of ϖ ˘ 1 and ϖ ˘ 2 are discussed, and the final values of fixed time T ˘ τ are listed in Table 1 according to Theorems 1 and 2, respectively:
(1) Condition 1: ϖ ˘ 1 = ± 1 , ϖ ˘ 2 = ± 1 ,
(2) Condition 2: ϖ ˘ 1 = ± 2 , ϖ ˘ 2 = ± 2 .
In addition, we simulate the corresponding state change diagrams of the different systems of USOMDVNN (18) and (18) in 30 random initial values from Figure 1, Figure 2, Figure 3, Figure 4, Figure 5, Figure 6, Figure 7, Figure 8, Figure 9, Figure 10, Figure 11 and Figure 12. (From Figure 1, Figure 2, Figure 3, Figure 4, Figure 5, Figure 6, Figure 7, Figure 8, Figure 9, Figure 10, Figure 11 and Figure 12, x m and y m denote x ˘ m and y ˘ m , respectively.) From Figure 1, Figure 2, Figure 3 and Figure 4, the divided momentary error phase diagrams for the four elements between for the variable x ˘ of (18) and y ˘ of (19) in 30 random initial values for globally asymptotical synchronization are presented. From Figure 5, Figure 6, Figure 7 and Figure 8, the divided momentary error phase diagrams for the four elements between for the variable x ˘ of (18) and y ˘ of (19) in 30 random initial values for the fixed-time synchronization are presented. From Figure 9, Figure 10, Figure 11 and Figure 12, the mixed momentary error phase diagrams for the four elements between for the variable x ˘ of (18) and y ˘ of (19) in 30 random initial values for the above two kinds of synchronization are presented.
Figure 1. Instantaneous error states for the R part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for asymptotical synchronization.
Figure 1. Instantaneous error states for the R part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for asymptotical synchronization.
Mathematics 10 03031 g001
Figure 2. Instantaneous error states for the I part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for asymptotical synchronization.
Figure 2. Instantaneous error states for the I part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for asymptotical synchronization.
Mathematics 10 03031 g002
Table 1. The related values under two cases.
Table 1. The related values under two cases.
Condition σ ˘ T ˘ τ
1−16.372.4142
2−15.1850.8321
Remark 7.
In this example, we just give two choices about the values of ϖ ˘ m . As the value of ϖ ˘ m changes, the final criteria vary accordingly. Obviously, the two conditions are satisfied, and the two criteria have been derived and the different values of T ˘ τ have been acquired. Moreover, by comparison with the results in Table 1, we can judge that the value of T ˘ τ under condition 2 is less than the one under condition 1. This indicates that the parameter ϖ ˘ m has really played an important part in adjusting the final results. That is, as we adjust the values of ϖ ˘ m properly, the final value of T ˘ τ can be less and less, in order to satisfy the application need of engineering.
Figure 3. Instantaneous error states for the J part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for asymptotical synchronization.
Figure 3. Instantaneous error states for the J part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for asymptotical synchronization.
Mathematics 10 03031 g003
Remark 8.
From Figure 1, Figure 2, Figure 3 and Figure 4, we show the state trajectories of the error system under linear controllers, and the globally asymptotical synchronization has been realized. From Figure 5, Figure 6, Figure 7 and Figure 8, we demonstrate that the state trajectories of the error system under the nonlinear controllers and the fixed-time synchronization have been achieved. Moreover, we can find that the final time for asymptotical synchronization is more than the one for fixed-time synchronization. This indicates that the nonlinear controllers are both novel and effective. In general, the designed controller (4) is a newly switching one that not only plays an important part in the common synchronization problem, but also has an effect on the popular fixed-time one.
Example 2.
The following 2-neuron CVNN is considered to be the same as in Ding et al. [8],
x ˘ ˙ m ( t ) = c ˘ m x ˘ m ( t ) + I ˘ m ( t ) + n = 1 2 a ˘ m n f ˘ n ( x ˘ n ( t ) ) ,
where x ˘ m ( t ) C , c ˘ 1 = 1.2 , c ˘ 2 = 1.1 , a ˘ 11 R = 2 , a ˘ 12 R = 1 , a ˘ 21 R = 1 , a ˘ 22 R = 0.8 , a ˘ 11 I = 1.2 , a ˘ 12 I = 4.5 , a ˘ 21 I = 1.7 , a ˘ 22 I = 0.9 , I ˘ 1 ( t ) = s i n t i 2 c o s t , I ˘ 2 ( t ) = 3 c o s ( t + 1 ) + i s i n ( t 1 ) , f ˘ m ( x ˘ m ( t ) ) = 1 e x ˘ R m 1 + e x ˘ R m + 0.4 s i g n ( x ˘ R m ) + i ( 1 1 + e x ˘ I m + 0.4 s i g n ( x ˘ I m ) ) , λ ˘ m = 0.5 , m = 1 , 2 .
The corresponding 2-neuron slave system of CVNN,
y ˘ ˙ m ( t ) = c ˘ m y ˘ m ( t ) + I ˘ m ( t ) + q = 1 2 a ˘ m n f ˘ n ( y ˘ n ( t ) ) + J ˘ m ( t ) ,
where y ˘ m ( t ) C , c ˘ 1 = 1.2 , c ˘ 2 = 1.1 , a ˘ 11 R = 2 , a ˘ 12 R = 1 , a ˘ 21 R = 1 , a ˘ 22 R = 0.8 , a ˘ 11 I = 1.2 , a ˘ 12 I = 4.5 , a ˘ 21 I = 1.7 , a ˘ 22 I = 0.9 , I ˘ 1 ( t ) = s i n t i 2 c o s t , I ˘ 2 ( t ) = 3 c o s ( t + 1 ) + i s i n ( t 1 ) , f ˘ m ( y ˘ m ( t ) ) = 1 e y ˘ R m 1 + e y ˘ R m + 0.4 s i g n ( y ˘ R m ) + i ( 1 1 + e y ˘ I m + 0.4 s i g n ( y ˘ I m ) ) , λ ˘ m = 0.5 , and the switching controllers are desined in (4), where, β ˘ = 0.8 , γ ˘ = 1.5 , m = 1 , 2 , k ˘ 1 = ± 6 , k ˘ 2 = ± 6 , l ˘ 1 = ± 1 , l ˘ 2 = ± 1 , m ˘ 1 = ± 1 , m ˘ 2 = ± 1 .
Let ρ ˘ = 1 and ρ ˘ = 2 , respectively. Because of the changed values of ϖ ˘ m , the acquired criteria are diverse, and not just one. Here, the following two conditions of the values of the ϖ ˘ 1 and ϖ ˘ 2 are discussed for Theorems 1 and 2, respectively:
(1) Condition 1: ϖ ˘ 1 = ± 1 , ϖ ˘ 2 = ± 1 , ρ ˘ = 1 .
(2) Condition 2: ϖ ˘ 1 = ± 2 , ϖ ˘ 2 = ± 2 , ρ ˘ = 2 .
By simple calculation, we obtain the corresponding values under the above two cases in Table 2 and Table 3. It is easily seen that we acquire the corresponding criteria and compare the fixed time T ˘ τ with the results in [8] under different conditions.
Figure 4. Instantaneous error states for the K part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for asymptotical synchronization.
Figure 4. Instantaneous error states for the K part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for asymptotical synchronization.
Mathematics 10 03031 g004
Figure 5. Instantaneous error states for the R part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for fixed-time synchronization.
Figure 5. Instantaneous error states for the R part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for fixed-time synchronization.
Mathematics 10 03031 g005
Example 3.
Consider the same 2-neuron RVNN, as in Chen et al. [13],
x ˘ ˙ m ( t ) = c ˘ m x ˘ m ( t ) + I ˘ m ( t ) + n = 1 2 a ˘ m n f ˘ n ( x ˘ n ( t ) ) ,
where x ˘ m ( t ) R , c ˘ 1 = 0.9 , c ˘ 2 = 1.1 , a ˘ 11 = 2 , a ˘ 12 = 0.1 , a ˘ 21 = 5 , a ˘ 22 = 4.5 , I ˘ 1 ( t ) = s i n t , I ˘ 2 ( t ) = c o s t , f ˘ m ( x ˘ m ( t ) ) = 0.5 ( | ( x ˘ m ( t ) + 1 | + | x ˘ m ( t ) 1 | ) , λ ˘ m = 1 , m = 1 , 2 .
The corresponding 2-neuron slave system of RVNN:
y ˘ ˙ m ( t ) = c ˘ m y ˘ m ( t ) + I ˘ m ( t ) + n = 1 2 a ˘ m n f ˘ n ( y ˘ n ( t ) ) + J ˘ m ( t ) ,
where y ˘ m ( t ) R , c ˘ 1 = 0.9 , c ˘ 2 = 1.1 , a ˘ 11 = 2 , a ˘ 12 = 0.1 , a ˘ 21 = 5 , a ˘ 22 = 4.5 , I ˘ 1 ( t ) = s i n t , I ˘ 2 ( t ) = c o s t , f ˘ m ( y ˘ m ( t ) ) = 0.5 ( | ( y ˘ m ( t ) + 1 | + | y ˘ m ( t ) 1 | ) , λ ˘ m = 1 , and the switching controllers are desined in (4), where, β ˘ = 0.5 , γ ˘ = 1.5 , m = 1 , 2 , k ˘ 1 = ± 6 , k ˘ 2 = ± 8 , l ˘ 1 = ± 1 , l ˘ 2 = ± 8 , m ˘ 1 = ± 1 , m ˘ 2 = ± 2 .
Let ρ ˘ = 4 and ρ ˘ = 2 , respectively. Due to the different values of ϖ ˘ m , the acquired criteria are diverse and not just one. Here, the following two conditions of the values of ϖ ˘ 1 and ϖ ˘ 2 are discussed about the conditions in Theorems 1 and 2, respectively:
(1) Condition 1: ϖ ˘ 1 = ± 1 , ϖ ˘ 2 = ± 0.5 , ρ ˘ = 4 .
(2) Condition 2: ϖ ˘ 1 = ± 2 , ϖ ˘ 2 = ± 1 , ρ ˘ = 2 .
By simple calculation, we obtain the corresponding values under the above two cases in Table 4 and Table 5. It is easily seen that we acquire the corresponding criteria and compare the fixed time T ˘ τ with other ones from the above tables.
Figure 6. Instantaneous error states for the I part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for fixed-time synchronization.
Figure 6. Instantaneous error states for the I part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for fixed-time synchronization.
Mathematics 10 03031 g006
Table 2. The related values under two cases.
Table 2. The related values under two cases.
Condition σ ˘ T ˘ τ
1−6.5253.9142
2−4.78141.1808
Table 3. The comparison of the different fixed time T ˘ τ .
Table 3. The comparison of the different fixed time T ˘ τ .
Method T ˘ τ
[8]4.5
condition 13.9142
condition 21.1808
Figure 7. Instantaneous error states for the J part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for fixed-time synchronization.
Figure 7. Instantaneous error states for the J part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for fixed-time synchronization.
Mathematics 10 03031 g007
Table 4. The related values under two cases.
Table 4. The related values under two cases.
Condition σ ˘ T ˘ τ
1−0.6752.4142
2−1.6750.8321
Table 5. The comparison of the different fixed time T ˘ τ .
Table 5. The comparison of the different fixed time T ˘ τ .
Method T ˘ τ
[11]4.3784
[45]4.3620
[12]3.4259
[13]2.3897
condition 12.4142
condition 20.8321
Figure 8. Instantaneous error states for the K part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for fixed-time synchronization.
Figure 8. Instantaneous error states for the K part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for fixed-time synchronization.
Mathematics 10 03031 g008
Figure 9. Instantaneous error states for the R part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for two kinds of synchronization.
Figure 9. Instantaneous error states for the R part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for two kinds of synchronization.
Mathematics 10 03031 g009
Remark 9.
From the above three examples, our acquired results have made the following progress by the comparison with the ones in [11,12,13,45]: (1) The established model of USOMDVNN (1) can be reduced the special cases in [11,12,13,45]; (2) The solution to discuss the related dynamics of different multi-dimension neural networks can be unified in this paper; (3) The controllers are switching and can be various, owing to the participation of the parameters ϖ ˘ m ; (4) Whether the criteria for asymptotical synchronization or for a fixed-time one, the final judgements are newer; (5) The final values of the fixed time T ˘ τ are easy to be calculated; (6) The listed values of T ˘ τ in Table 5 are less than the ones in [11,12,13,45].
Figure 10. Instantaneous error states for the I part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for two kinds of synchronization.
Figure 10. Instantaneous error states for the I part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for two kinds of synchronization.
Mathematics 10 03031 g010
Figure 11. Instantaneous error states for the J part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for two kinds of synchronization.
Figure 11. Instantaneous error states for the J part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for two kinds of synchronization.
Mathematics 10 03031 g011
Figure 12. Instantaneous error states for the K part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for two kinds of synchronization.
Figure 12. Instantaneous error states for the K part between for the variable x ˘ of (18) and y ˘ of (19) under 30 random initial values for two kinds of synchronization.
Mathematics 10 03031 g012

5. Conclusions

In this paper, the problems of both the asymptotical synchronization and fixed-time one have been discussed for USOMDVNN in a unified form. Mainly by applying the Lyapunov method and multi-dimension algebra, we have established the unified model and concise criteria for the researched problem. In the process of establishing the criteria, we have derived two unified inequalities with useful parameters that have been sufficiently involved in the structure of the LKF, the construction of the switching controllers, and the final tighter fixed time. Finally, we have roundly simulated the obtained results by giving three numerical examples. We will learn more and extend the novel research approach to studying the corresponding dynamics, such as dissipativity or state estimation in [37,38,39,40,41,42,43], for delayed and uncertain USOMDVNN with memristors in the future.

Author Contributions

Conceptualization, J.X.; project management, Y.L.; preparation of the original draft, J.X. and Y.L. visualization, Y.L.; methodology, J.X.; investigation, J.X.; revision, J.X. and Y.L.; supervision, J.X. and Y.L.; funding acquisition, J.X. All authors have read and agreed to the published version of the manuscript.

Funding

This work was funded in part by the Program of Science and Technology of Sichuan Province of China under grant 2021ZYD0012, 2022NSFSC0532, and also in part by the Open Fund (PLN2022-20) of State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation of China (Southwest Petroleum University), and also in part by the Research Fund of Guangxi Key Lab of Multi-source Information Mining & Security of China (MIMS22-04).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare that they have no competing interests.

References

  1. Tyagi, S.; Martha, S.C. Finite-time stability for a class of fractional-order fuzzy neural networks with proportional delay. Fuzzy Sets Syst. 2020, 381, 68–77. [Google Scholar] [CrossRef]
  2. Xie, W.; Nguang, S.; Zhu, H.; Zhang, Y.; Shi, K. A novel event-triggered asynchronous H control for T-S fuzzy Markov jump systems under hidden Markov switching topologies. Fuzzy Sets Syst. 2022, 443, 258–282. [Google Scholar] [CrossRef]
  3. Zhang, W.; Li, C.; Huang, T.; Huang, J. Fixed-time synchronization of complex networks with nonidentical nodes and stochastic noise perturbations. Phys. A 2018, 492, 1531–1542. [Google Scholar] [CrossRef]
  4. Chen, X.; Song, Q.; Li, Z.; Liu, Y. Stability analysis of continuous-time and discrete-time quaternion-valued neural networks with linear threshold neurons. IEEE Trans. Neural Netw. Learn. Syst. 2017, 29, 2769–2781. [Google Scholar] [CrossRef]
  5. Wei, R.; Cao, J. Fixed-time synchronization of quaternion-valued memristive neural networks with time delays. Neural Netw. 2019, 113, 1–10. [Google Scholar] [CrossRef]
  6. Zhang, R.; Zeng, D.; Park, J.H.; Lam, H.K.; Zhong, S. Fuzzy adaptive event-triggered sampled-data control for stabilization of T-S fuzzy memristive neural networks with reaction-diffusion terms. IEEE Trans. Fuzzy Syst. 2021, 29, 1775–1785. [Google Scholar] [CrossRef]
  7. Xiao, J.Y.; Li, Y.T.; Wen, S.P. Mittag-Leffler synchronization and stability analysis for neural networks in the fractional-order multi-dimension field. Knowl.-Based Syst. 2021, 231, 107404. [Google Scholar] [CrossRef]
  8. Ding, X.; Cao, J.; Alsaedi, A.; Alsaadi, F.E.; Hayat, T. Robust fixed-time synchronization for uncertain complex-valued neural networks with discontinuous activation functions. Neural Netw. 2017, 90, 42–55. [Google Scholar] [CrossRef]
  9. Hu, J.; Zeng, C.; Tan, J. Boundedness and periodicity for linear threshold discrete-time quaternion-valued neural network with time-delays. Neurocomputing 2017, 267, 417–425. [Google Scholar] [CrossRef]
  10. Li, H.; Li, C.; Huang, T.; Zhang, W. Fixed-time stabilization of impulsive Cohen-Grossberg BAM neural networks. Neural Netw. 2018, 98, 203–211. [Google Scholar] [CrossRef]
  11. Polyakov, A. Nonlinear feedback design for fixed-time stabilization of linear control systems. IEEE Trans. Autom. Control 2011, 57, 2106–2110. [Google Scholar] [CrossRef]
  12. Hu, C.; Yu, J.; Chen, Z.; Jiang, H.; Huang, T. Fixed-time stability of dynamical systems and fixed-time synchronization of coupled discontinuous neural networks. Neural Netw. 2017, 89, 74–83. [Google Scholar] [CrossRef]
  13. Chen, C.; Li, L.; Peng, H.; Yang, Y.; Zhao, H. A new fixed-time stability theorem and its application to the fixed-time synchronization of neural networks. Neural Netw. 2020, 123, 412–419. [Google Scholar] [CrossRef]
  14. Liu, H.; Wang, Z.; Shen, B.; Dong, H. Delay-Distribution-Dependent H state estimation for discrete-time memristive neural networks with mixed time-delays and fading measurementss. IEEE Trans. Cybern. 2019, 50, 440–451. [Google Scholar] [CrossRef]
  15. Liu, H.; Wang, Z.; Shen, B.; Liu, X. Event-triggered H state estimation for delayed stochastic memristive neural networks with missing measurements: The discrete-time case. IEEE Trans. Neural Netw. Learn. Syst. 2017, 29, 3727–3737. [Google Scholar]
  16. Zhang, R.; Zeng, D.; Park, J.H.; Lam, H.K.; Xie, X. Fuzzy sampled-data control for synchronization of T-S fuzzy reaction-diffusion neural networks with additive time-varying delays. IEEE Trans. Cybern. 2021, 51, 2384–2397. [Google Scholar] [CrossRef]
  17. Liu, X.; Ho, D.W.C.; Song, Q.; Xu, W. Finite/fixed-time pinning synchronization of complex networks with stochastic disturbances. IEEE Trans. Cybern. 2019, 49, 2398–2403. [Google Scholar]
  18. Liu, X.; Ho, D.W.C.; Xie, C. Prespecified-time cluster synchronization of complex networks via a smooth control approach. IEEE Trans. Cybern. 2020, 50, 1771–1775. [Google Scholar] [CrossRef]
  19. Liu, Y.; Zhang, D.; Lu, J.; Cao, J. Global μ-stability criteria for quaternion-valued neural networks with unbounded time-varying delays. Inf. Sci. 2016, 360, 273–288. [Google Scholar] [CrossRef]
  20. Liu, Y.; Zhang, D.; Lu, J. Global exponential stability for quaternion-valued recurrent neural networks with time-varying delays. Nonlinear Dyn. 2017, 87, 553–565. [Google Scholar] [CrossRef]
  21. Yang, X.; Li, C.; Song, Q.; Li, H.; Huang, J. Effects of state-dependent impulses on robust exponential stability of quaternion-valued neural networks under parametric uncertainty. IEEE Trans. Neural Netw. Learn. Syst. 2018, 30, 2197–2211. [Google Scholar] [CrossRef] [PubMed]
  22. Yang, X.; Li, C.; Song, Q.; Chen, J.; Huang, J. Global Mittag-Leffler stability and synchronization analysis of fractional-order quaternion-valued neural networks with linear threshold neurons. Neural Netw. 2018, 105, 88–103. [Google Scholar] [CrossRef] [PubMed]
  23. Xiao, J.Y.; Cao, J.D.; Cheng, J.; Zhong, S.M.; Wen, S.P. Novel methods to finite-time Mittag-Leffler synchronization problem of fractional-order quaternion-valued neural networks. Inf. Sci. 2020, 122, 320–327. [Google Scholar] [CrossRef]
  24. Xiao, J.Y.; Cao, J.D.; Cheng, J.; Wen, S.P.; Zhang, R.M.; Zhong, S.M. Novel inequalities to global Mittag-Leffler synchronization and stability analysis of fractional-order quaternion-valued neural networks. IEEE Trans. Neural Netw. Learn. Syst. 2021, 32, 3700–3709. [Google Scholar] [CrossRef]
  25. Xiao, J.Y.; Cheng, J.; Shi, K.B.; Zhang, R.M. A general approach to fixed-time synchronization problem for fractional-order multi-dimension-valued fuzzy neural networks based on memristor. IEEE Trans. Fuzzy Syst. 2021, 30, 968–977. [Google Scholar] [CrossRef]
  26. Xiao, J.Y.; Zhong, S.M.; Wen, S.P. Unified analysis on the global dissipativity and stability of fractional-order multidimension-valued memristive neural networks with time delay. IEEE Trans. Neural Netw. Learn. Syst. 2021. Online ahead of print. [Google Scholar] [CrossRef]
  27. Xiao, J.Y.; Zhong, S.M.; Wen, S.P. Improved approach to the problem of the global Mittag-Leffler synchronization for fractional-order multidimension-valued BAM neural networks based on new inequalities. Neural Netw. 2021, 133, 87–100. [Google Scholar] [CrossRef]
  28. Hardy, G.; Littlewood, J.; Poly, G. Inequalities; Cambridge University Press: Cambridge, UK, 1952. [Google Scholar]
  29. 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]
  30. Rajchakit, G.; Sriraman, R. Robust passivity and stability analysis of uncertain complex-valued impulsive neural networks with time-varying delays. Neural Processing Lett. 2021, 53, 581–606. [Google Scholar] [CrossRef]
  31. Rajchakit, G.; Chanthorn, P.; Niezabitowski, M.; Raja, R.; Baleanu, D.; Pratap, A. Impulsive effects on stability and passivity analysis of memristor-based fractional-order competitive neural networks. Neurocomputing 2020, 417, 290–301. [Google Scholar] [CrossRef]
  32. Li, H.; Kao, Y.; Li, H.L. Globally beta-Mittag-Leffler stability and beta-Mittag-Leffler convergence in Lagrange sense for impulsive fractional-order complex-valued neural networks. Chaos Solitons Fractals 2021, 148, 111061. [Google Scholar] [CrossRef]
  33. Yang, X.J.; Li, C.D.; Huang, T.W.; Song, Q.K.; Huang, J.J. Synchronization of fractional-order memristor-based complex-valued neural networks with uncertain parameters and time delays. Chaos Solitons Fractals 2018, 110, 105–123. [Google Scholar] [CrossRef]
  34. Aadhithiyan, S.; Raja, R.; Zhu, Q.; Alzabut, J.; Niezabitowski, M.; Lim, C.P. Modified projective synchronization of distributive fractional order complex dynamic networks with model uncertainty via adaptive control. Chaos Solitons Fractals 2021, 147, 110853. [Google Scholar] [CrossRef]
  35. Chanthorn, P.; Rajchakit, G.; Thipcha, J.; Emharuethai, C.; Sriraman, R.; Lim, C.P.; Ramachandran, R. Robust stability of complex-valued stochastic neural networks with time-varying delays and parameter uncertainties. Mathematics 2020, 8, 742. [Google Scholar] [CrossRef]
  36. Xiao, J.Y.; Guo, X.; Li, Y.T.; Wen, S.P.; Shi, K.B.; Tang, Y.Q. Extended Analysis on the global Mittag-Leffler synchronization problem for fractional-order octonion-valued BAM neural networks. Neural Netw. 2022, 154, 491–507. [Google Scholar] [CrossRef]
  37. Vadivel, R.; Hammachukiattikul, P.; Gunasekaran, N.; Saravanakumar, R.; Dutta, H. Strict dissipativity synchronization for delayed static neural networks: An event-triggered scheme. Chaos Solitons Fractals 2021, 150, 111212. [Google Scholar] [CrossRef]
  38. Arbi, A.; Cao, J.D.; Alsaedi, A. Improved synchronization analysis of competitive neural networks with time-varying delays. Nonlinear Anal. Model. Control 2018, 23, 82–107. [Google Scholar] [CrossRef]
  39. Arbi, A. Novel traveling waves solutions for nonlinear delayed dynamical neural networks with leakage term. Chaos Solitons Fractals 2021, 152, 111436. [Google Scholar] [CrossRef]
  40. Arbi, A.; Tahri, N.; Jammazi, C.; Huang, C.X.; Cao, J.D. Almost anti-periodic solution of inertial neural networks with leakage and time-varying delays on timescales. Circuits Syst. Signal Processing 2022, 41, 1940–1956. [Google Scholar] [CrossRef]
  41. Ali, M.S.; Hymavathi, M.; Rajchakit, G.; Saroha, S.; Palanisamy, L.; Hammachukiattikul, P. Synchronization of fractional order fuzzy BAM neural networks with time varying delays and reaction diffusion terms. IEEE Access 2020, 8, 186551–186571. [Google Scholar] [CrossRef]
  42. Anbuvithya, R.; Sri, S.D.; Vadivel, R.; Gunasekaran, N.; Hammachukiattikul, P. Extended dissipativity and non-fragile synchronization for recurrent neural networks with multiple time-varying delays via sampled-data control. IEEE Access 2021, 9, 31454–31466. [Google Scholar] [CrossRef]
  43. Vadivel, R.; Hammachukiattikul, P.; Rajchakit, G.; Ali, M.S.; Unyong, B. Finite-time event-triggered approach for recurrent neural networks with leakage term and its application. Math. Comput. Simul. 2021, 182, 765–790. [Google Scholar] [CrossRef]
  44. Xiao, J.Y.; Zhong, S.M. Synchronization and stability of delayed fractional-order memristive quaternion-valued neural networks with parameter uncertainties. Neurocomputing 2019, 363, 321–338. [Google Scholar] [CrossRef]
  45. Parsegov, S.; Polyakov, A.; Shcherbakov, P. Nonlinear fixed-time control protocol for uniform allocation of agents on a segment. Decis. Control 2013, 363, 321–338. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Xiao, J.; Li, Y. Novel Synchronization Conditions for the Unified System of Multi-Dimension-Valued Neural Networks. Mathematics 2022, 10, 3031. https://doi.org/10.3390/math10173031

AMA Style

Xiao J, Li Y. Novel Synchronization Conditions for the Unified System of Multi-Dimension-Valued Neural Networks. Mathematics. 2022; 10(17):3031. https://doi.org/10.3390/math10173031

Chicago/Turabian Style

Xiao, Jianying, and Yongtao Li. 2022. "Novel Synchronization Conditions for the Unified System of Multi-Dimension-Valued Neural Networks" Mathematics 10, no. 17: 3031. https://doi.org/10.3390/math10173031

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