Next Article in Journal
Expectation-Maximization Algorithm for the Weibull Proportional Hazard Model under Current Status Data
Previous Article in Journal
Almost Automorphic Solutions to Nonlinear Difference Equations
Previous Article in Special Issue
Metaheuristic Procedures for the Determination of a Bank of Switching Observers toward Soft Sensor Design with Application to an Alcoholic Fermentation Process
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fixed/Preassigned-Time Synchronization of Fully Quaternion-Valued Cohen–Grossberg Neural Networks with Generalized Time Delay

1
College of Mathematics and System Science, Xinjiang University, Urumqi 830017, China
2
Xinjiang Key Laboratory of Applied Mathematics, Urumqi 830017, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(23), 4825; https://doi.org/10.3390/math11234825
Submission received: 15 October 2023 / Revised: 25 November 2023 / Accepted: 28 November 2023 / Published: 29 November 2023
(This article belongs to the Special Issue Artificial Neural Networks and Dynamic Control Systems)

Abstract

:
This article is concerned with fixed-time synchronization and preassigned-time synchronization of Cohen–Grossberg quaternion-valued neural networks with discontinuous activation functions and generalized time-varying delays. Firstly, a dynamic model of Cohen–Grossberg neural networks is introduced in the quaternion field, where the time delay successfully integrates discrete-time delay and proportional delay. Secondly, two types of discontinuous controllers employing the quaternion-valued signum function are designed. Without utilizing the conventional separation technique, by developing a direct analytical approach and using the theory of non-smooth analysis, several adequate criteria are derived to achieve fixed-time synchronization of Cohen–Grossberg neural networks and some more precise convergence times are estimated. To cater to practical requirements, preassigned-time synchronization is also addressed, which shows that the drive-slave networks reach synchronization within a specified time. Finally, two numerical simulations are presented to validate the effectiveness of the designed controllers and criteria.

1. Introduction

In the past few decades, quaternion-valued neural networks (QVNNs) have become increasingly prevalent and have been applied extensively to various fields, including image processing [1], speech recognition [2], robot control [3], and signal processing [4]. Owing to the multi-dimensional inherent properties of quaternions, quaternion neurons exhibit enhanced storage and computational capabilities compared to real-valued and complex-valued neurons. This inherent advantage equips QVNNs with formidable signal processing capabilities. For instance, quaternion neurons have the capability to process color information holistically, unlike real-valued and complex-valued neurons, which handle color space components separately. Consequently, QVNNs naturally handle internal dependencies between color channels [5]. Furthermore, because all parameters in QVNNs are quaternion-valued, they excel in managing rotations and scaling of 3-D vectors [6]. Considering the aforementioned advantages, QVNNs have garnered increasing attention in both practical applications and theoretical analysis, particularly in terms of their dynamic characteristics, such as dissipativity [7,8], stability [9,10,11,12], and synchronization [13,14,15,16].
The synchronization of QVNNs involves attaining consistent states among the quaternion neurons under external control. Nowadays, significant advancements have been achieved in the synchronization of QVNNs. For example, Singh et al. conducted research on the issue of anti-synchronization in quaternion-valued inertial neural networks with unbounded time delays [13]. Zhao et al. discussed the quasi-synchronization of discrete-time fractional-order quaternion-valued memristive neural networks with uncertain parameters and time delays [14]. In their works, synchronization is accomplished over an infinite time frame. However, in numerous practical scenarios, achieving synchronization within a finite time is crucial due to the limited lifespan of organisms or devices. In fact, compared to asymptotic synchronization, finite-time synchronization offers advantages such as accelerated convergence, strengthened robustness, and increased resistance to interference. Given this, Ping et al. [16] investigated finite-time synchronization of QVNNs by employing an improved one-norm and quaternion sign function, along with a well-designed event-triggered controller. It is important to emphasize that the settling time (ST) obtained within a finite-time framework is significantly influenced by the initial states and parameters of the systems.
In many practical scenarios, it is challenging and difficult to measure all initial states. Consequently, defining the ST for finite-time (FNT) synchronization becomes a formidable task. In order to address this challenge, the concept of fixed time (FIT) was introduced and the FIT stability theorem was first proposed in [17], in which the estimate of the ST is improved by eliminating its dependence on initial values. Since then, numerous remarkable research endeavors have emerged, encompassing FIT synchronization of recurrent neural networks [18,19,20], complex-valued neural networks (CVNNs) [21,22,23], and QVNNs [24,25,26,27,28]. In [24,25,26], the FIT synchronization of QVNNs was investigated by decomposing the QVNN model into four real valued neural networks, which resulted in four real-valued controllers being designed. While this method indirectly raises control gain and complicates the viability of control strategies, it underscores the urgency of developing a novel approach that can directly examine neural networks within the quaternion domain.
Except for FIT synchronization, preassigned-time (PET) synchronization is a novel direction achieved by utilizing the enhanced FIT stability outcomes. Unlike FNT and FIT synchronization, the synchronization time of PET synchronization is predetermined to meet practical requirements, making it independent of model parameters and initial conditions. The research on PET synchronization has garnered significant attention among scholars in recent years due to the aforementioned advantages and characteristics. Nevertheless, there remains a scarcity of related research results [29,30]. In [29], a feedback controller and a novel event-triggered controller are designed to discuss the PET synchronization in real-valued networks of piecewise smooth systems. Similarly, in [30], several smooth controllers were designed to facilitate the PET synchronization of real-valued complex networks. It is noteworthy that the majority of existing research results are primarily concentrated within the realm of real numbers, while the research in the quaternion field is in dire need of augmentation. Hence, the research on PET synchronization of QVNNs is of great significance and practical value. Furthermore, it is important to highlight that discontinuous situations are commonplace and unavoidable in real-world problems. However, the existing research outcomes pertaining to QVNNs seldom address these scenarios. Therefore, delving into the behavior of QVNNs with discontinuous activation functions carries substantial theoretical implications and practical relevance.
Drawing from recent research findings, scholars have explored a diverse array of network models. For instance, with the smooth control, the FIT/PAT synchronization was investigated for several types of neural networks, including switched coupled neural networks [31], BAM neural networks [32]. Owing to the strong robustness and generalization capabilities of Cohen–Grossberg neural networks (CGNNs) in data processing, allowing them to better handle the issue of noise interference and unknown data, it has attracted growing attention from scholars due to their significant practical application value. However, it is noteworthy that the research on Cohen–Grossberg quaternion-valued neural networks (CGQVNNs) remains conspicuously absent. Given the wide-ranging potential applications of CGNNs in areas such as pattern recognition, intelligent computing, and signal processing [32,33,34,35,36], a comprehensive examination of CGQVNNs is not only of great practical significance but also holds substantial research value. One of the primary challenges in addressing CGQVNNs lies in determining whether an outer amplification function exists within the quaternion field. If a real-valued amplification function is considered, CGQVNNs do not exhibit significant deviations from prior research outcomes. In addition, if QVNNs are divided into four real valued systems, they will be confronted with increased control costs and higher dimensions of computation. Therefore, how to develop a simpler and more efficient method to explore the FIT/PET synchronization of QVNNs in the quaternion field is an urgent problem to be overcome.
In consideration of the analysis outlined above, the FIT synchronization and PET synchronization of CGQVNNs with generalized time delay and discontinuous activation functions are investigated in this paper by using a measurable selection technique [37,38,39,40] and introducing a direct non-separation analysis framework. The key innovations and contributions of this paper can be succinctly summarized as follows:
(1)
A generalized time delay is introduced into the model of CGQVNNs, which successfully incorporates discrete constant delays [7], discrete time-varying delays [13] and proportional delays [9].
(2)
Compared with previous research on the synchronization issue of QVNNs [27,28], the synchronization problem of CGQVNNs with discontinuous activation functions is investigated for the first time. An effective analytical method is introduced to investigate the FIT synchronization and PET synchronization of CGQVNNs with quaternion-valued amplification function without separation, and high-precision ST is estimated.
(3)
Different from the methods used in [28], the FIT synchronization and PET synchronization of CGQVNNs are discussed through a direct analytical approach. Consequently, several effective quaternion-valued controllers are directly designed for the original CGQVNNs rather than for the four real-valued subsystems obtained by separation, so as to obtain more economical control gains and derive more concise synchronization conditions.
In Section 2, preliminaries are shown. The FIT synchronization and PET synchronization of CGQVNNs are investigated by quaternion-valued controllers in Section 3 and Section 4, respectively. Two numerical examples are provided to validate the theoretical findings presented in Section 5. Finally, Section 6 offers a concise summary of this paper.
Notation 1. 
In this article, R , Q , R n and Q n are the set denoting all real numbers, the set of all quaternion numbers, the set of all n-dimensional real column vectors and the set of all n-dimensional quaternion column vectors, respectively. Denote M = { 1 , 2 , n } , ϵ = { R , I , J , K } . For any z = z R + i z I + j z J + k z K Q , z ¯ = z R i z I j z J k z K , | z | 1 = | z R | + | z I | + | z J | + | z K | , | z | 2 = z z ¯ . For a discontinuous function m ( · ) = m R ( · ) + m I ( · ) i + m J ( · ) j + m K ( · ) k , m ϵ ( x ) and m ϵ + ( x ) are the left and right limits of m ( · ) at point x , respectively. m ` ϵ ( x ) and m ´ ϵ ( x ) denote as the minimum and the maximum of m ϵ ( x ) and m ϵ + ( x ) . The convex hull is defined as c o ¯ [ m ( x ) ] = c o ¯ [ m R ( x ) ] + c o ¯ [ m I ( x ) ] i + c o ¯ [ m J ( x ) ] j + c o ¯ [ m K ( x ) ] k = [ m ´ R ( x ) , m ` R ( x ) ] + [ m ´ I ( x ) , m ` I ( x ) ] i + [ m ´ J ( x ) , m ` J ( x ) ] j + [ m ´ K ( x ) , m ` K ( x ) ] k .

2. Model Description and Preliminaries

In this paper, the following CGQVNN is considered
ω ˙ p ( t ) = h p ( ω p ( t ) ) a p ω p ( t ) + q M b p q χ q ( ω q ( t ) ) + q M c p q ρ q ( ω q ( k p q ( t ) ) ) + ξ p , ω p ( s ) = ϑ p ( s ) , ς s 0 , p M ,
where ω p ( t ) Q is the state of the pth unit at time t, h p ( · ) Q is an amplification function, a p Q is the feedback self-connection weight, b p q , c p q Q are the connection weights from the q-th neuron to the p-th neuron, χ q ( · ) and ρ q ( · ) : Q Q are discontinuous quaternion activation functions without and with time delay, k p q ( t ) t is the generalized time delay, ξ p denotes the external input function, ϑ p ( s ) C ( [ ς , 0 ] ) is the initial state of the network (1), in which ς = max p , q M { | d p q ( 0 ) | } . Then, the response system of the system (1) is governed by
ζ ˙ p ( t ) = h p ( ζ p ( t ) ) a p ζ p ( t ) + q M b p q χ q ( ζ q ( t ) ) + q M c p q ρ q ( ζ q ( k p q ( t ) ) ) + ξ p + δ p ( t ) , ζ p ( s ) = υ p ( s ) , ς s 0 , p M ,
where the parameters in system (2) are the same as system (1), δ p ( t ) is the control input needed to be designed later.
Assumption 1. 
For p M , χ p and ρ p are continuous except on the sets of countable isolate points { u r p } and { v r p } , respectively, and χ p d ( u r p ) , χ p d + ( u r p ) and ρ p d ( v r p ) , ρ p d + ( v r p ) exist. Moreover, there are a finite number of jump points at most for χ p and ρ p in every bounded compact interval.
Assumption 2. 
For any p , q M , k p q ( 0 ) 0 and there exists a constant k ˜ p q > 0 such that
0 < k ˜ p q < k ˙ p q ( t ) < 1 .
Remark 1. 
Note, that the time delay in the system (1) is a general and unified delay type. Actually, if k p q ( t ) = t τ , the time delay in this article will degenerate into a discrete constant time delay [7]. If k p q ( t ) = t τ p q ( t ) with 0 τ p q ( t ) τ , the time delay in this article will degenerate into a discrete time-varying delay [14]. If k p q ( t ) = k q t with 0 < k q < 1 , the time delay in this article will reduce to the proportional delay [9]. In other words, the time delay proposed in this paper involves the traditional discrete-time delay and proportional delay.
Definition 1 
([41]). A continuous function vector ω ( t ) = ( ω 1 ( t ) , ω 2 ( t ) , , ω n ( t ) ) T : [ ς , T 0 ) Q n is called a solution of system (1) on [ ς , T 0 ) if
(1) ω ( t ) is absolutely continuous on [ 0 , T 0 ) .
(2) There exist measurable functions χ ˇ = ( χ ˇ 1 , , χ ˇ n ) T : [ 0 , T 0 ) Q n and ρ ˇ = ( ρ ˇ 1 , , ρ ˇ n ) T : [ 0 , T 0 ) Q n satisfying χ ˇ q c o ¯ [ χ q ( ω q ) ] , ρ ˇ q c o ¯ [ ρ q ( ω q ) ] , such that
ω ˙ p ( t ) = h p ( ω p ( t ) ) ( a p ω p ( t ) + q M b p q χ ˇ q ( t ) + q M c p q ρ ˇ q ( k p q ( t ) ) + ξ p ) , p M ,
for a.e. t [ 0 , T 0 ) .
Similarly, for the response system (2), there exist measurable functions χ ^ = ( χ ^ 1 , χ ^ 2 , , χ ^ n ) T : [ 0 , T 0 ) Q n and ρ ^ = ( ρ ^ 1 , ρ ^ 2 , , ρ ^ n ) T : [ 0 , T 0 ) Q n satisfying χ ^ q c o ¯ [ χ q ( ζ q ) ] , ρ ^ q c o ¯ [ ρ q ( ζ q ) ] , such that
ζ ˙ p ( t ) = h p ( ζ p ( t ) ) ( a p ζ p ( t ) + q M b p q χ ^ q ( t ) + q M c p q ρ ^ q ( k p q ( t ) ) + ξ p ) + δ p ( t ) , p M ,
for a.e. t [ 0 , T 0 ) .
Define η p ( t ) = ζ p ( t ) ω p ( t ) , η ( t ) = ( η 1 ( t ) , η 2 ( t ) , , η n ( t ) ) T , from systems (3) and (4), the error system can be derived
η ˙ p ( t ) = ( h p ( ζ p ( t ) ) a p ζ p ( t ) h p ( ω p ( t ) ) a p ω p ( t ) ) + q M ( h p ( ζ p ( t ) ) b p q χ ^ q ( t ) h p ( ω p ( t ) ) b p q χ ˇ q ( t ) ) + q M ( h p ( ζ p ( t ) ) c p q ρ ^ q ( k p q ( t ) ) h p ( ω p ( t ) ) c p q ρ ˇ q ( k p q ( t ) ) ) + ( h p ( ζ p ( t ) ) h p ( ω p ( t ) ) ) ξ p + δ p ( t ) , p M .
Assumption 3. 
For any p M , u , v Q , functions h p ( · ) , χ p ( · ) , ρ p ( · ) Q satisfy
| χ p ( u ) χ p ( v ) | μ l p μ | u v | μ + l ˜ p μ , | h p ( u ) h p ( v ) | μ h ˜ p μ | u v | μ ,
where l p μ , l ˜ p μ , h ˜ p μ > 0 , | χ p ( · ) | μ L p μ , | h p ( · ) | μ H p μ , | ρ p ( · ) | μ R p μ ( μ = 1 , 2 ) .
Remark 2. 
For several decades, many excellent results were concerned with the real-valued and complex-valued networks with h p ( · ) = 1 [41,42]. However, the theory and methods in these existing works cannot be directly used to investigate CGQVNNs. On the one hand, it is not easy to ensure the monotonicity of the inverse function of h p ( · ) if h p ( · ) Q . On the other hand, it is difficult to construct suitable Lyapunov functions to drive the FIT synchronization of CGQVNN due to the presence of special multiplications of quaternions with non-commutativity. Thus, a new and effective method will be proposed in this paper to deal with these problems.
Definition 2 
([43]). Drive-response CGQVNNs (1) and (2) are said to be FIT synchronized if there exists a number T ^ * ( η ( s ) ) 0 with s [ ς , 0 ] such that
lim t T ^ * ( η ( s ) ) | η ( t ) | μ = 0 ,
| η ( t ) | μ = 0 , t T ^ * ( η ( s ) ) ,
and there is a positive constant T max such that
T ^ * ( η ( s ) ) T max , η ( s ) Q ,
and
η p ( t ) = ζ p ( t ) ω p ( t ) = η p R ( t ) + i η p I ( t ) + j η p J ( t ) + k η p K ( t ) .
Definition 3. 
Drive-response CGQVNNs (1) and (2) are said to be PET synchronized within the preappointed time T p e t if
lim t T p e t | η ( t ) | μ = 0 ,
| η ( t ) | μ = 0 , t T p e t ,
where T p e t > 0 is completely independent of system parameters and initial values.
Definition 4 
([44]). For a quaternion variable y = y R + y I i + y J j + y K k Q , the signum function is defined as
[ y ] sign ( y R ) + sign ( y I ) i + sign ( y J ) j + sign ( y K ) k .
Based on Definition 1, y Q , the convex hull of [ y ] is defined by
c o ¯ ( [ y ] ) c o ¯ [ sign ( y R ) ] + c o ¯ [ sign ( y I ) ] i + c o ¯ [ sign ( y J ) ] j + c o ¯ [ sign ( y K ) ] k ,
where
c o ¯ [ sign ( y ϵ ) ] = { 1 } , y ϵ > 0 , [ 1 , 1 ] , y ϵ = 0 , { 1 } , y ϵ < 0 ,
and y ϵ R .
Lemma 1 
([43]). Assume that there exists a positive definite, regular and radially unbounded function V ( η ( t ) ) : R n R such that
d d t V ( η ( t ) ) υ V ( η ( t ) ) σ 1 V θ 1 ( η ( t ) ) σ 2 V θ 2 ( η ( t ) ) , η ( t ) R n { 0 } ,
where υ R , σ 1 > 0 , σ 2 > 0 , 0 θ 1 < 1 and θ 2 > 1 , then the following conclusions are true.
(i)
If 0 < υ < min { σ 1 , σ 2 } , then η ( t ) 0 for t T * , where
T * = π c s c ( π w ) σ 2 ( θ 2 θ 1 ) ( σ 2 σ 1 υ ) 1 w I ( σ 2 σ 1 + σ 2 υ , w , 1 w ) + π c s c ( π w ) σ 1 ( θ 2 θ 1 ) ( σ 1 σ 2 υ ) w I ( σ 1 σ 1 + σ 2 υ , 1 w , w ) .
(ii)
If 0 < υ < 2 σ 1 σ 2 and θ 1 + θ 2 = 2 , then η ( t ) 0 for t T ˜ , where
T ˜ = 2 ι ( θ 2 1 ) ( π 2 + arctan ( υ ι ) ) ,
where w = ( 1 θ 1 ) ( θ 2 θ 1 ) , ι = 4 σ 1 σ 2 υ 2 , the incomplete Beta function ratio I ( r , p , q ) was given in [43].
Lemma 2 
([43]). If there exist a positive, regular and radially unbounded function V ( η ( t ) ) : R n R and υ R , σ 1 > 0 , σ 2 > 0 , 0 θ 1 < 1 , θ 2 > 1 , T p e t > 0 such that
d d t V ( η ( t ) ) T ˇ T p e t ( υ V ( η ( t ) ) + σ 1 V θ 1 ( η ( t ) ) + σ 2 V θ 2 ( η ( t ) ) , η ( t ) R n { 0 } ) ,
then η ( t ) 0 for t T p e t , where
T ˇ = T * , 0 < υ < min { σ 1 , σ 2 } , T ˜ , 0 < υ < 2 σ 1 σ 2 , θ 1 + θ 2 = 2 .
Lemma 3 
([43]). Assume that b p 0 for p M , 0 θ 1 1 and θ 2 > 1 , then
p M b p θ 1 ( p M b p ) θ 1 , p M b p θ 2 n 1 θ 2 ( p M b p ) θ 2 .
Lemma 4 
([44]). For any b , u Q , x ( t ) : R Q , the following properties hold
(1) 
b ¯ ¯ = b .
(2) 
b + b ¯ = 2 b R 2 | b | 2 2 | b | 1 .
(3) 
b u ¯ = b ¯ u ¯ .
(4) 
d | x ( t ) | 1 d t = 1 2 ( [ x ( t ) ] ¯ d x ( t ) d t + d x ( t ) ¯ d t [ x ( t ) ] ) .
Lemma 5 
([41]). For any r , z , m Q , one has
(1) 
( r R | r I | | r J | | r K | ) | z | 1 ( [ z ] ¯ r z ) R ( r R + | r I | + | r J | + | r K | ) | z | 1 ,
(2) 
| z | 1 | m | 1 ( [ r ] ¯ z m ) R | z | 1 | m | 1 .

3. Fixed-Time Synchronization

In this section, two different controllers are designed to discuss the FIT synchronization of the CGQVNNs (1) and (2).
For convenience, denote
λ ¯ = max p M h ^ | a p | 1 + h ˜ p 1 | ξ | 1 + p M h ^ q l p 1 | b q p | 1 + L q 1 h ˜ p 1 | b p q | 1 + R q 1 h ˜ p 1 | c p q | 1 ,
λ ˜ = max p M q M 2 h ´ | a p | 2 + h ´ l p 2 | b q p | 2 + h ´ l q 2 | b p q | 2 + 2 L p 2 h ˜ p 2 | b p q | 2 + 2 R p 2 h ˜ p 2 | c p q | 2 ,
α ¯ = min p M { α p } , β ¯ = n 1 ε 2 min p M { β p } , ι 1 = 4 α ¯ β ¯ λ ¯ 2 ,
α ˜ = 2 ε 1 + 1 2 min p M { α p } , β ˜ = 2 ε 1 + 1 2 n 1 ε 2 2 min p M { β p } , ι 2 = 4 α ˜ β ˜ λ ˜ 2 ,
λ ¯ 1 = max p M | a p | 1 λ p + q M l p 1 | b q p | 1 , λ ˜ 1 = max p M q M ( | a p | 2 + l q 2 | b p q | 2 ) ,
ϖ 1 = ( 1 ε 1 ) ( ε 2 ε 1 ) .
Firstly, based on the 1-norm, the control scheme is designed by
δ p ( t ) = [ η p ( t ) ] γ p + λ p | ω p ( t ) | 1 + α p | η p ( t ) | 1 ε 1 + β p | η p ( t ) | 1 ε 2 ,
where α p , β p > 0 , 0 ε 1 < 1 , ε 2 > 1 .
Theorem 1. 
Based on Assumptions 1–3, and the controller (6), if
q M ( | b p q | 1 H p 1 l ˜ q 1 + 2 | c p q | 1 H p 1 R q 1 ) γ p < 0 ,
2 H p 1 λ p < 0 ,
then the following results hold.
(1)
If 0 < λ ¯ < min { α ¯ , β ¯ } , systems (1) and (2) realize FIT synchronization and the ST is estimated by
T ^ 1 = π c s c ( π ϖ 1 ) β ¯ ( ε 2 ε 1 ) ( β ¯ α ¯ λ ¯ ) 1 ϖ 1 I ( β ¯ α ¯ + β ¯ λ ¯ , ϖ 1 , 1 ϖ 1 ) + π c s c ( π ϖ 1 ) α ¯ ( ε 2 ε 1 ) ( α ¯ β ¯ λ ¯ ) ϖ 1 I ( α ¯ α ¯ + β ¯ λ ¯ , 1 ϖ 1 , ϖ 1 ) .
(2)
When ε 1 + ε 2 = 2 , 0 < λ ¯ < 2 α ¯ β ¯ , systems (1) and (2) are FIT synchronized and the ST is estimated by
T ^ 2 = 2 ι 1 ( ε 2 1 ) ( π 2 + arctan ( λ ¯ ι 1 ) ) .
Proof. 
Consider the Lyapunov function based on 1-norm as follows
V 1 ( η ^ ( t ) ) = p M | η p ( t ) | 1 ,
where η ^ ( t ) = ( | η 1 ( t ) | 1 , | η 2 ( t ) | 1 , , | η n ( t ) | 1 ) T R n .
According to the system (5), one obtains
D + V 1 ( η ^ ( t ) ) = 1 2 p M [ η p ( t ) ] ¯ D + η p ( t ) + D + η p ( t ) ¯ [ η p ( t ) ] = 1 2 p M ( [ η p ( t ) ] ¯ ( h p ( ω p ( t ) ) a p ω p ( t ) h p ( ζ p ( t ) ) a p ζ p ( t ) ) + h p ( ω p ( t ) ) a p ω p ( t ) h p ( ζ p ( t ) ) a p ζ p ( t ) ¯ [ η p ( t ) ] ) + 1 2 p M q M ( [ η p ( t ) ] ¯ h p ( ζ p ( t ) ) b p q ( χ ^ q ( t ) h p ( ω p ( t ) ) χ ˇ q ( t ) ) + h p ( ζ p ( t ) ) b p q χ ^ q ( t ) h p ( ω p ( t ) ) b p q χ ˇ q ( t ) ¯ [ η p ( t ) ] ) + 1 2 p M q M ( [ η p ( t ) ] ¯ c p q ( ( h p ( ζ p ( t ) ) ρ ^ q ( k p q ( t ) ) h p ( ω p ( t ) ) ρ ˇ q ( k p q ( t ) ) ) + h p ( ζ p ( t ) ) c p q ρ ^ q ( k p q ( t ) ) h p ( ω p ( t ) ) c p q ρ ˇ q ( k p q ( t ) ) ¯ [ η p ( t ) ] ) + 1 2 p M [ η p ( t ) ] ¯ ( h p ( ζ p ( t ) ) h p ( ω p ( t ) ) ) ξ p + ( h p ( ζ p ( t ) ) h p ( ω p ( t ) ) ) ξ p ¯ [ η p ( t ) ] p M γ p [ η p ( t ) ] [ η p ( t ) ] ¯ p M λ p [ η p ( t ) ] [ η p ( t ) ] ¯ | ω p ( t ) | 1 p M α p [ η p ( t ) ] [ η p ( t ) ] ¯ | η p ( t ) | 1 ε 1 p M β p [ η p ( t ) ] [ η p ( t ) ] ¯ | η p ( t ) | 1 ε 2 .
According to Assumptions 3 and 4 and Lemmas 4 and 5,
1 2 p M ( [ η p ( t ) ] ¯ ( h p ( ω p ( t ) ) a p ω p ( t ) h p ( ζ p ( t ) ) a p ζ p ( t ) ) + h p ( ω p ( t ) ) a p ω p ( t ) h p ( ζ p ( t ) ) a p ζ p ( t ) ¯ [ η p ( t ) ] ) p M | h p ( ζ p ( t ) ) a p ζ p ( t ) h p ( ω p ( t ) ) a p ω p ( t ) | 1 p M ( | h p ( ζ p ( t ) ) a p ζ p ( t ) h p ( ζ p ( t ) ) a p ω p ( t ) | 1 + | h p ( ζ p ( t ) ) a p ω p ( t ) h p ( ω p ( t ) ) a p ω p ( t ) | 1 ) p M | a p | 1 ( | h p ( ζ p ( t ) ) | 1 | η p ( t ) | 1 + | h p ( ζ p ( t ) ) h p ( ω p ( t ) ) | 1 | ω p ( t ) | 1 ) p M | a p | 1 ( H p 1 | η p ( t ) | 1 + 2 H p 1 | ω p ( t ) | 1 ) .
Similarly,
1 2 p M q M ( [ η p ( t ) ] ¯ ( h p ( ζ p ( t ) ) b p q χ ^ q ( t ) h p ( ω p ( t ) ) b p q χ ˇ q ( t ) ) + h p ( ζ p ( t ) ) b p q χ ^ q ( t ) h p ( ω p ( t ) ) b p q χ ˇ q ( t ) ¯ [ η p ( t ) ] ) p M q M ( | h p ( ζ p ( t ) ) b p q ( χ ^ q ( t ) χ ˇ q ( t ) ) | 1 + | χ ˇ q ( t ) b p q ( h p ( ζ p ( t ) ) h p ( ω p ( t ) ) ) | 1 ) = p M q M ( | b q p | 1 H q 1 l p 1 + | b p q | 1 L p 1 h ˜ p 1 ) | η p ( t ) | 1 + | b p q | 1 H p 1 l ˜ q 1 ,
and
1 2 p M q M ( [ η p ( t ) ] ¯ ( h p ( ζ p ( t ) ) c p q ρ ^ q ( k p q ( t ) ) h p ( ω p ( t ) ) c p q ρ ˇ q ( k p q ( t ) ) ) + h p ( ζ p ( t ) ) c p q ρ ^ q ( k p q ( t ) ) h p ( ω p ( t ) ) c p q ρ ˇ q ( k p q ( t ) ) ¯ [ η p ( t ) ] ) p M q M 2 | c p q | 1 H p 1 R q 1 + | c p q | 1 R q 1 h ˜ p 1 | η p ( t ) | 1 ,
further,
1 2 p M ( [ η p ( t ) ] ¯ ( h p ( ζ p ( t ) ) ξ p h p ( ω p ( t ) ) ξ p ) ( h p ( ζ p ( t ) ) ξ p h p ( ω p ( t ) ) ξ p ) ¯ [ η p ( t ) ] ) p M h ˜ p 1 | ξ p | 1 | η p ( t ) | 1 .
Submitting (10)–(13) into (9),
D + V 1 ( η ^ ( t ) ) p M H p 1 | a p | 1 + h ˜ p 1 | ξ | 1 + q M ( H p 1 l p 1 | b q p | 1 + L q 1 h ˜ p 1 | b p q | 1 + R q 1 h ˜ p 1 | c p q | 1 ) | η p ( t ) | 1 + p M ( 2 H p 1 λ p ) | ω p ( t ) | 1 + p M q M ( | b p q | 1 h ^ p l ˜ q 1 + 2 | c p q | 1 H p 1 R q 1 ) γ p p M α p | η p ( t ) | 1 ε 1 p M β p | η p ( t ) | 1 ε 2 λ ¯ p M | η p ( t ) | 1 α ¯ ( p M | η p ( t ) | 1 ) ε 1 β ¯ ( p M | η p ( t ) | 1 ) ε 2 = λ ¯ V 1 ( η ^ ( t ) ) α ¯ V 1 ε 1 ( η ^ ( t ) ) β ¯ V 1 ε 2 ( η ^ ( t ) ) ,
where the penultimate inequality is given by conditions (7) and (8).
If 0 < λ ¯ < min { α ¯ , β ¯ } , the networks (1) and (2) are FIT synchronized within the time T ^ 1 , which is obtained through Lemma 1. Similarly, the remaining results in Theorem 1 can be readily deduced from Lemma 1. □
Especially, if the amplification function h p ( · ) = 1 , system (1) is degenerated to QVNN as follows
ω ˙ p ( t ) = a p ω p ( t ) + q M b p q χ q ( t ) + q M c p q ρ q ( k p q ( t ) ) + ξ p , p M .
Correspondingly, the response system is degenerated to
ζ ˙ p ( t ) = a p ζ p ( t ) + q M b p q χ q ( t ) + q M c p q ρ q ( k p q ( t ) ) + δ p ( t ) + ξ p , p M .
To realize FIT synchronization, the controller is redesigned by
δ p ( t ) = [ η p ( t ) ] ( γ p + α p | η p ( t ) | 1 ε 1 + β p | η p ( t ) | 1 ε 2 ) ,
where α p , β p > 0 , 0 ε 1 < 1 , ε 2 > 1 .
Based on the analysis of Theorem 1, the following corollary can be readily derived.
Corollary 1. 
Based on Assumptions 3 and 4, with controller (16), if
q M ( | b p q | 1 l ˜ q 1 + 2 | c p q | 1 R q 1 ) γ p < 0 ,
then the following results are obtained.
(1)
If 0 < λ ¯ 1 < min { α ¯ , β ¯ } , systems (14) and (15) realize FIT synchronization and the ST is estimated by
T ^ 3 = π c s c ( π ϖ 1 ) β ¯ ( ε 2 ε 1 ) ( β ¯ α ¯ λ ¯ 1 ) 1 ϖ 1 I ( β ¯ β ¯ + α ¯ λ ¯ 1 , ϖ 1 , 1 ϖ 1 ) + π c s c ( π ϖ 1 ) α ¯ ( ε 2 ε 1 ) ( α ¯ β ¯ λ ¯ 1 ) ϖ 1 I ( α ¯ β ¯ + α ¯ λ ¯ 1 , 1 ϖ 1 , ϖ 1 ) .
(2)
When ε 1 + ε 2 = 2 , 0 < λ ¯ 1 < 2 α ¯ β ¯ , systems (14) and (15) are FIT synchronized and the ST is estimated by
T ^ 4 = 2 ι 1 ( ε 2 1 ) ( π 2 + arctan ( λ ¯ 1 ι 1 ) ) .
In the following, the FIT synchronization of systems (1) and (2) will be investigated based on 2-norm, the controller is designed as
δ p ( t ) = [ η p ( t ) ] ( γ p + λ p | ω p ( t ) | 2 + α p | η p ( t ) | 2 ε 1 + β p | η p ( t ) | 2 ε 2 ) ,
where λ p , α p , β p , γ p > 0 for any p N , and 0 ε 1 < 1 , ε 2 > 1 .
Theorem 2. 
Under Assumptions 1–4 and the controller (18), if
2 H p 2 | a p | 2 λ p < 0 ,
q M ( H p 2 l ˜ q 2 | b p q | 2 + 2 H p 2 R q 2 | c p q | 2 ) γ p < 0 ,
then the following results are obtained.
(1)
If 0 < λ ˜ < min { α ˜ , β ˜ } , systems (1) and (2) realize FIT synchronization and the ST is estimated by
T ^ 5 = π c s c ( π ϖ 1 ) β ¯ ( ε 2 ε 1 ) ( β ˜ α ˜ λ ˜ ) 1 ϖ 1 I ( β ˜ α ˜ + β ˜ λ ˜ , ϖ 1 , 1 ϖ 1 ) + π c s c ( π ϖ 1 ) α ˜ ( ε 2 ε 1 ) ( α ˜ β ˜ λ ˜ ) ϖ 1 I ( α ˜ α ˜ + β ˜ λ ˜ , 1 ϖ 1 , ϖ 1 ) .
(2)
When ε 1 + ε 2 = 2 , 0 < λ ˜ < 2 α ˜ β ˜ , systems (1) and (2) are FIT synchronized and the ST is estimated by
T ^ 6 = 2 ι 2 ( ε 2 1 ) ( π 2 + arctan ( λ ˜ ι 2 ) ) .
Proof. 
Consider the following 2-norm-based Lyapunov function
V 2 ( η ˜ ( t ) ) = 1 2 p M | η p ( t ) | 2 2 ,
where η ˜ ( t ) = ( | η 1 ( t ) | 2 , | η 2 ( t ) | 2 , , | η n ( t ) | 2 ) T R n .
Combining with the error system (5), one has
D + V 2 ( η ˜ ( t ) ) = 1 2 p M ( η p ( t ) ¯ D + η p ( t ) + D + η p ( t ) ¯ η p ( t ) ) = 1 2 p M ( η p ( t ) ¯ ( h p ( ω p ( t ) ) a p ω p ( t ) h p ( ζ p ( t ) ) a p ζ p ( t ) ) + ( h p ( ω p ( t ) ) a p ω p ( t ) h p ( ζ p ( t ) ) a p ζ p ( t ) ) ¯ ) η p ( t ) ) + 1 2 p M q M ( η p ( t ) ¯ ( h p ( ζ p ( t ) ) b p q χ ^ q ( t ) h p ( ω p ( t ) ) b p q χ ˇ q ( t ) ) + h p ( ζ p ( t ) ) b p q χ ^ q ( t ) h p ( ω p ( t ) ) b p q χ ˇ q ( t ) ¯ η p ( t ) ) + 1 2 p M q M ( η p ( t ) ¯ ( h p ( ζ p ( t ) ) c p q ρ ^ q ( k p q ( t ) ) h p ( ω p ( t ) ) c p q ρ ˇ q ( k p q ( t ) ) ) + h p ( ζ p ( t ) ) c p q ρ ^ q ( k p q ( t ) ) h p ( ω p ( t ) ) c p q ρ ˇ q ( k p q ( t ) ) ¯ η p ( t ) ) + 1 2 p M η p ( t ) ¯ ( h p ( ζ p ( t ) ) ξ h p ( ω p ( t ) ) ξ ) + ( h p ( ζ p ( t ) ) ξ h p ( ω p ( t ) ) ξ ) ¯ η p ( t ) 1 2 p M q M γ p ( η p ( t ) ¯ [ η p ( t ) ] + η p ( t ) [ η p ( t ) ] ¯ ) 1 2 p M λ p ( η p ( t ) ¯ [ η p ( t ) ] + η p ( t ) [ η p ( t ) ] ¯ ) | ω p ( t ) | 2 1 2 p M α p ( η p ( t ) ¯ [ η p ( t ) ] + η p ( t ) [ η p ( t ) ] ¯ ) | η p ( t ) | 2 ε 1 1 2 p M β p ( η p ( t ) ¯ [ η p ( t ) ] + η p ( t ) [ η p ( t ) ] ¯ ) | η p ( t ) | 2 ε 2 .
Based on Assumptions 3 and 4 and Lemmas 4 and 5, one obtains
1 2 p M ( η p ( t ) ¯ ( h p ( ω p ( t ) ) a p ω p ( t ) h p ( ζ p ( t ) ) a p ζ p ( t ) ) + ( h p ( ω p ( t ) ) a p ω p ( t ) h p ( ζ p ( t ) ) a p ζ p ( t ) ) ¯ ) η p ( t ) ) p M | η p ( t ) | 2 ( | h p ( ζ p ( t ) ) a p ( ζ p ( t ) ω p ( t ) ) | 2 + | a p ω p ( t ) ( h p ( ζ p ( t ) ) h p ( ω p ( t ) ) ) | 2 ) p M ( H p 2 | a p | 2 | η p ( t ) | 2 2 + 2 H p 2 | a p | 2 | ω p ( t ) | 2 | η p ( t ) | 2 ) .
Similarly,
1 2 p M q M ( η p ( t ) ¯ ( h p ( ζ p ( t ) ) b p q χ ^ q ( t ) h p ( ω p ( t ) ) b p q χ ˇ q ( t ) ) + h p ( ζ p ( t ) ) b p q χ ^ q ( t ) h p ( ω p ( t ) ) b p q χ ˇ q ( t ) ¯ η p ( t ) ) p M q M ( 1 2 h ´ l p 2 | b q p | 2 + 1 2 H p 2 l q 2 | b p q | 2 + L p 2 h ˜ 2 | b p q | 2 ) | η p ( t ) | 2 2 + | b p q | 2 H p 2 l ˜ q 2 | η p ( t ) | 2 ,
and
1 2 p M q M ( η p ( t ) ¯ c p q ( h p ( ζ p ( t ) ) ρ ^ q ( k p q ( t ) ) h p ( ω p ( t ) ) ρ ˇ q ( k p q ( t ) ) ) + h p ( ζ p ( t ) ) c p q ρ ^ q ( k p q ( t ) ) h p ( ω p ( t ) ) c p q ρ ˇ q ( k p q ( t ) ¯ η p ( t ) ) p M q M 2 H p 2 R q 2 | c p q | 2 | η p ( t ) | 2 + R p 2 h ˜ 2 | c p q | 2 | η p ( t ) | 2 2 .
Moreover,
1 2 p M λ p ( η p ( t ) ¯ [ η p ( t ) ] + η p ( t ) [ η p ( t ) ] ¯ ) | ω p ( t ) | 2 p M λ p | η p ( t ) | 2 | ω p ( t ) | 2 ,
1 2 p M γ p ( η p ( t ) ¯ [ η p ( t ) ] + η p ( t ) [ η p ( t ) ] ¯ ) p M γ p | η p ( t ) | 2 ,
1 2 p M α p ( η p ( t ) ¯ [ η p ( t ) ] + η p ( t ) [ η p ( t ) ] ¯ ) | η p ( t ) | 2 ε 1 α ˜ ( p M 1 2 | η p ( t ) | 2 2 ) 1 + ε 1 2 ,
1 2 p M β p ( η p ( t ) ¯ [ η p ( t ) ] + η p ( t ) [ η p ( t ) ] ¯ ) | η p ( t ) | 2 ε 2 β ˜ ( p M 1 2 | η p ( t ) | 2 2 ) 1 + ε 2 2 .
Substitute (22)–(28) into (21),
D + V 2 ( η ˜ ( t ) ) p M q M ( 2 H p 2 | a p | 2 λ p ) | ω p ( t ) | 2 | η p ( t ) | 2 + p M ( q M ( H p 2 l ˜ q 2 | b p q | 2 + 2 H p 2 R q 2 | c p q | 2 ) γ p ) | η p ( t ) | 2 + p M q M ( H p 2 | a p | 2 + 1 2 H p 2 l p 2 | b q p | 2 + 1 2 H p 2 l q 2 | b p q | 2 + L p 2 h ˜ 2 | b p q | 2 + R p 2 h ˜ p 2 | c p q | 2 ) | η p ( t ) | 2 2 p M α p | η p ( t ) | 2 ε 1 + 1 p M β p | η p ( t ) | 2 ε 2 + 1 λ ˜ V 2 ( η ˜ ( t ) ) α ˜ V 2 ε ˜ 1 ( η ˜ ( t ) ) β ˜ V 2 ε ˜ 2 ( η ˜ ( t ) ) .
If 0 < λ ˜ < min { α ˜ , β ˜ } , then the CGQVNNs (1) and (2) achieve FIT synchronization within the time T ^ 5 . Additionally, the other results presented in Theorem 1 can be straightforwardly derived from Lemma 1. □
To obtain the synchronization criteria of systems (14) and (15) based on 2-norm, the controller is designed as
δ p ( t ) = [ η p ( t ) ] ( γ p + α p | η p ( t ) | 2 ε 1 + β p | η p ( t ) | 2 ε 2 ) ,
where γ p , α p , β p > 0 , 0 ε 1 < 1 , ε 2 > 1 .
According to Theorem 2, the following corollary is easily obtained.
Corollary 2. 
Based on Assumptions 3 and 4, with controller (29), if
p M ( l ˜ q 2 | b p q | 2 + 2 R q 2 | b p q | 2 ) γ p < 0 ,
then the following results are derived.
(1)
If 0 < λ ˜ 1 < min { α ˜ , β ˜ } , systems (14) and (15) can realize FIT synchronization and the ST is estimated by
T ^ 7 = π c s c ( π ϖ 1 ) β ¯ ( ε 2 ε 1 ) ( β ˜ α ˜ λ ˜ 1 ) 1 ϖ 1 I ( β ˜ α ˜ + β ˜ λ ˜ 1 , ϖ 1 , 1 ϖ 1 ) + π c s c ( π ϖ 1 ) α ˜ ( ε 2 ε 1 ) ( α ˜ β ˜ λ ˜ 1 ) ϖ 1 I ( α ˜ α ˜ + β ˜ λ ˜ 1 , 1 ϖ 1 , ϖ 1 ) .
(2)
When ε 1 + ε 2 = 2 , 0 < λ ˜ < 2 α ˜ β ˜ , systems (14) and (15) are FIT synchronized and the ST is estimated by
T ^ 8 = 2 ι 2 ( ε 2 1 ) ( π 2 + arctan ( λ ˜ ι 2 ) ) .
Remark 3. 
The FIT synchronization of QVNNs with or without time delay was discussed in [24,25], in which the original QVNN was divided into four real-valued subnetworks. Different from the above theoretical analysis method, a non-separation method is proposed in this paper, which greatly reduces the complexity of the analysis. Besides, several control strategies are designed based on the quaternion-valued sign function to realize the FIT synchronization of CGQVNNs, which can extremely reduce control costs and obtain higher accuracy estimation of ST. Furthermore, the time delay considered in this paper integrates discrete constant delay, discrete time-varying delay and proportional delay, which is more general and widely applicable.

4. Preassigned-Time Synchronization

To achieve the PET synchronization of CGQVNNs (1) and (2), the controller is proposed by
δ p ( t ) = T ˇ T p e t [ η p ( t ) ] ( γ p + λ p | ω p ( t ) | 1 + α p | η p ( t ) | 1 ε 1 + β p | η p ( t ) | 1 ε 2 ) ,
where γ p , λ p , α p , β p > 0 for any p N , 0 ε 1 < 1 , ε 2 > 1 , and
T ˇ = T ^ 1 , 0 < λ ¯ < min { α ¯ , β ¯ } , T ^ 2 , ε 1 + ε 2 = 2 , 0 < λ ¯ < 2 α ¯ β ¯ .
Theorem 3. 
Based on Assumptions 1–3 and the controller (30), if conditions (7) and (8) hold, then the networks (1) and (2) realize PET synchronization within 0 < T p e t T ˇ .
Proof. 
Similar to the analysis of Theorem 1, one can obtain
D + V 1 ( η ^ ( t ) ) p M ( H p 1 | a p | 1 + h ˜ p 1 | ξ | 1 + q M ( H q 1 l p 1 | b q p | 1 + L q 1 h ˜ p 1 | b p q | 1 + R q 1 h ˜ p 1 | c p q | 1 ) ) | η p ( t ) | 1 + p M ( 2 H p 1 T ˇ T p e t λ p ) | ω p ( t ) | 1 + p M ( q M ( | b p q | 1 H p 1 l ˜ q 1 + 2 | c p q | 1 H p 1 R q 1 ) T ˇ T p e t γ p ) p M T ˇ T p e t α p | η p ( t ) | 1 ε 1 p M T ˇ T p e t β p | η p ( t ) | 1 ε 2 T ˇ T p e t λ ¯ p M | η p ( t ) | 1 T ˇ T p e t α ¯ ( p M | η p ( t ) | 1 ) ε 1 T ˇ T p e t β ¯ ( p M | η p ( t ) | 1 ) ε 2 = T ˇ T p e t ( λ ¯ V 1 ( η ^ ( t ) ) α ¯ V 1 ε 1 ( η ^ ( t ) ) β ¯ V 1 ε 2 ( η ^ ( t ) ) ) .
In light of Lemma 2, CGQVNNs (1) and (2) are PET synchronized within T p e t . □
Corollary 3. 
Based on Assumptions 3 and 4 and the following controller
δ p ( t ) = T ˘ T p e t [ η p ( t ) ] ( γ p + α p | η p ( t ) | 1 ε 1 + β p | η p ( t ) | 1 ε 2 ) ,
if condition (17) holds, then the networks (14) and (15) achieve PET synchronization within 0 < T p e t T ˘ , where γ p , α p , β p > 0 for any p N , 0 ε 1 < 1 , ε 2 > 1 and
T ˘ = T ^ 3 , 0 < λ ¯ 1 < min { α ¯ , β ¯ } , T ^ 4 , 0 < λ ¯ 1 < 2 α ¯ β ¯ , ε 1 + ε 2 = 2 .
Based on 2-norm, the control scheme is designed by
δ p ( t ) = T ´ T p e t [ η p ( t ) ] ( γ p + λ p | ω p ( t ) | 2 + α p | η p ( t ) | 2 ε 1 + β p | η p ( t ) | 2 ε 2 ) ,
where γ p , λ p , α p , β p > 0 for any p N , 0 ε 1 < 1 , ε 2 > 1 , and
T ´ = T ^ 5 , 0 < λ ˜ < min { α ˜ , β ˜ } , T ^ 6 , 0 < λ ˜ < 2 α ˜ β ˜ , ε 1 + ε 2 = 2 .
Theorem 4. 
Based on Assumptions 1–3 and the controller (31), if conditions (19) and (20) hold, then the networks (1) and (2) achieve PET synchronization within 0 < T p e t T ´ .
Similarly, the following corollary can be drawn.
Corollary 4. 
Based on Assumptions 3 and 4 and the following controller
δ p ( t ) = T ` T p e t [ η p ( t ) ] ( γ p + α p | η p ( t ) | 1 ε 1 + β p | η p ( t ) | 1 ε 2 ) ,
if condition (17) holds, then the networks (14) and (15) achieve PET synchronization within 0 < T p e t T ` , where γ p , α p , β p > 0 for any p N , 0 ε 1 < 1 , ε 2 > 1 and
T ` = T ^ 7 , 0 < λ ˜ 1 < min { α ˜ , β ˜ } , T ^ 8 , 0 < λ ˜ 1 < 2 α ˜ β ˜ , ε 1 + ε 2 = 2 .
Remark 4. 
Compared with the results presented in [16,44], the FNT synchronization of CGQVNNs is readily available when β p = 0 in this paper. In [25], the FIT and PET synchronization of QVNNs has been discussed, in which the original QVNNs was decomposed into four real-valued systems and four corresponding controllers were designed. Obviously, this separation method leads to complex and redundant analysis and calculations. Nevertheless, there are limited relevant results available for discussing the FIT and PET synchronization of CGQVNNs using a non-separation method. In Theorems 1–3, three quaternion-valued controllers (18), (6) and (30) are designed, and the FIT and PET synchronization of CGQVNNs under non-separation are completely solved under the non-separation method. In theoretical analysis, only a few common inequalities and real number operations are utilized, which simplifies the analytical process to some extent.
Remark 5. 
In [16], the authors designed an event-triggered controller to realize the FNT synchronization of QVNNs through a non-decomposition method. Inspired by this issue, it is also a challenge to construct event-triggered controllers for the FIT and PET synchronization of CGQVNNs, which will be investigated in the future.

5. Numerical Simulations

In this section, two numerical examples are presented to verify the above theoretical results.
Consider the following CGQVNN with two neurons
ω ˙ p ( t ) = h p ( ω p ( t ) ) ( a p ω p ( t ) + q = 1 , 2 b p q χ q ( ω q ( t ) ) + q = 1 , 2 c p q ρ q ( ω q ( k p q ( t ) ) ) + ξ p ) , p = 1 , 2 ,
in which a 1 = 0.4 + 0.2 i 0.5 j 1.3 k , a 2 = 0.3 2.2 i + 1.1 j 0.2 k , χ 1 ( κ ) = χ 2 ( κ ) = 0.1 tanh ( κ R ) + 0.01 sign ( κ R ) + i ( 0.1 tanh ( κ I ) + 0.01 sign ( κ I ) ) + j ( 0.1 tanh ( κ J ) + 0.01 sign ( κ J ) )   +   k ( 0.1 tanh ( κ K ) + 0.01 sign ( κ K ) ) , ρ 1 ( κ ) = ρ 2 ( κ ) = 0.1 cos ( κ R ) + 0.1 sign ( κ R ) + i ( 0.1 cos ( κ I )   +   0.1 sign ( κ I ) ) +   j ( 0.1 cos ( κ J ) + 0.1 sign ( κ J ) ) + k ( 0.1 cos ( κ K ) + 0.1 sign ( κ K ) ) , h ( κ ) = sin ( κ R )   +   2 where κ Q , k p q ( t ) = t e t 1 + e t , p , q = 1 , 2 , and
( b p q ) 2 × 2 = 1.6 + 1.4 i + 1.2 j 2.4 k 0.4 + 0.6 i 0.3 j 1.6 k 2.5 + 0.3 i 0.2 j + 0.6 k 2.1 + 0.4 i 0.6 j 0.2 k ,
( c p q ) 2 × 2 = 0.1 + 0.2 i 0.3 j + 0.6 k 0.8 + 0.3 i 0.5 j 0.5 k 0.2 + 0.4 i + 0.6 j 0.2 k 0.6 + 0.2 i 0.3 j + 0.6 k ,
( ξ p ) 2 × 2 = 2.0 + 1.5 i 1.3 j 2.0 k 0 0 1.2 + 0.6 i 1.6 j 0.8 k .
The corresponding CGQVNN is given as follows
ζ ˙ p ( t ) = h p ( ζ p ( t ) ) ( a p ζ p ( t ) + q = 1 , 2 b p q χ q ( ζ q ( t ) ) + q = 1 , 2 c p q ρ q ( ζ q ( k p q ( t ) ) ) + ξ p ) + δ p ( t ) , p = 1 , 2 .
By randomly selecting the initial values, the synchronization error of CGQVNNs (32) and (33) is shown in Figure 1 without control.
First of all, consider the synchronization of driven-response CGQVNNs (32) and (33) with the controller (8). According to calculation, l q 1 = 1 , l ˜ q 1 = 0.08 , L q 1 = 0.44 , R q 1 = 0.8 , h ˜ q 1 = 1 , H q 1 = 3 , for any q = 1 , 2 and λ ¯ = 22.124 . In (8), select γ 1 = 18.0 , γ 2 = 14.4 , λ 1 = λ 2 = 6.5 , α = 23.0 , β = 24.0 , ε 1 = 0.7 , ε 2 = 1.1 . It is not difficult to verify that
17.5 = q = 1 2 ( | b 1 q | 1 H 1 1 l ˜ q 1 + 2 | c 1 q | 1 H 1 1 R q 1 ) < γ 1 = 18.0 ,
13.9 = q = 1 2 ( | b 2 q | 1 H 2 1 l ˜ q 1 + 2 | c 2 q | 1 H 2 1 R q 1 ) < γ 1 = 14.4 ,
6 = 2 H p 1 < λ p = 6.5 , p = 1 , 2 ,
22.124 = λ ¯ < min { α ¯ , β ¯ } = 22.39 .
By means of Theorem 1, the driven-response CGQVNNs (32) and (33) achieve FXT synchronization, here the settling time is estimated by T ^ 1 = 2.1253 . The synchronization result is simulated in Figure 2.
Furthermore, choose T p e t = 0.8 in (38). Under the above-selected parameters, CGQVNNs (32) and (33) reach PET synchronization with T p e t = 0.8 according to Theorem 3, which is demonstrated in Figure 3.
Next, let us verify the FIX synchronization of driven-response CGQVNNs (32) and (33) under a 2-norm-based controller (24). By simple calculation, l q 2 = 0.02 , l ˜ q 2 = 0.090 , L q 2 = 0.6957 , R q 2 = 0.4 , h ˜ q 2 = 1 , H p 2 = 3 for any q = 1 , 2 and λ ¯ = 29.02 . In (8), select γ 1 = 11.0 , γ 2 = 6.0 , λ 1 = 8.40 , λ 2 = 15.19 , α = 15.0 , β = 15.5 , ε 1 = 0.7 , ε 2 = 1.1 . Thus,
8.34 = 2 H 1 2 | a 1 | 2 < λ p = 8.40 ,
15.18 = 2 H 2 2 | a 2 | 2 < λ p = 15.19 ,
10.28 = q = 1 2 ( H p 2 l ˜ q 2 | b 1 q | 2 + 2 H p 2 R q 2 | c 1 q | 2 ) < γ p = 11.0 ,
5.80 = q = 1 2 ( H p 2 l ˜ q 2 | b 2 q | 2 + 2 H p 2 R q 2 | c 2 q | 2 ) < γ p = 6.0 ,
29.02 = λ ˜ < min { α ˜ , β ˜ } = 31 .
Therefore, CGQVNNs (32) and (33) achieve FIX synchronization based on the controller (24) by using Theorem 2, and the settling time is estimated by T ^ 2 = 1.2318 . The synchronization result is given in Figure 4.
On the other hand, choose T p e t = 0.8 in (39). Under the above selected parameters, CGQVNNs (32) and (33) reach PET synchronization with T p e t = 0.8 according to Theorem 4, which is shown in Figure 5.

6. Conclusions

In this article, the FIT and PET synchronization of CGQVNNs with discontinuous activation functions and generalized time delays have been investigated. In contrast to the previous CGNN models defined in the real-valued or complex-valued domain [34,35,36], the proposed quaternion-valued neural network has stronger storage capacity and is suitable for NNs with discontinuous activation functions. Based on the introduced quaternion-valued symbolic function, two direct control schemes were proposed. At the same time, the criteria of the FIT and the PET synchronization of the CGQVNNs were derived without dividing the quaternion-valued system into real-valued or complex-valued systems. Compared with [24,25], the non-separation method proposed in this paper greatly reduces the computational complexity, and the direct control scheme saves control costs. Finally, two numerical examples were provided to validate the theoretical results.
Considering the control cost, future work will focus on the discussion of FIT or PET synchronization of quaternion-valued NNs by developing a reasonable event-triggered controller, intermittent controller or impulsive controller to reduce the control cost.

Author Contributions

Conceptualization, H.J.; Methodology, C.H.; Validation, H.J.; Formal analysis, S.J.; Writing—original draft, S.J.; Writing—review & editing, C.H.; Supervision, C.H. and H.J.; Funding acquisition, H.J. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported jointly by National Natural Science Foundation of China (62163035), by the Key Project of Natural Science Foundation of Xinjiang (2021D01D10), by the Special Project for Local Science and Technology Development Guided by the Central Government (ZYYD2022A05), by Tianshan Talent Program (2022TSYCLJ0004), by Excellent Doctor Innovation program of Xinjiang University (XJUBSCX-201929).

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Miron, S.; Flamant, J.; Bihan, N.L.; Chainais, P.; Brie, D. Quaternions in Signal and Image Processing: A comprehensive and objective overview. IEEE Signal Process. Mag. 2023, 40, 26–40. [Google Scholar] [CrossRef]
  2. Guizzo, E.; Weyde, T.; Comminiello, D. Learning speech emotion representations in the quaternion domain. IEEE/Acm Trans. Audio Speech Lang. Process. 2023, 31, 1200–1212. [Google Scholar] [CrossRef]
  3. Bayro-Corrochano, E.; Lechuga-Gutierrez, L.; Garza-Burgos, M. Geometric techniques for robotics and HMI: Interpolation and haptics in conformal geometric algebra and control using quaternion spike neural networks. Robot. Auton. Syst. 2018, 104, 72–84. [Google Scholar] [CrossRef]
  4. Zhang, H.; Wang, Z.; Chen, D.; Zhu, S.; Xu, D. Quaternion Extreme Learning Machine Based on Real Augmented Representation. IEEE Signal Process. Lett. 2023, 30, 175–179. [Google Scholar] [CrossRef]
  5. Zhou, Y.; Jin, L.; Ma, G.; Xu, X. Quaternion capsule neural network with region attention for facial expression recognition in color images. IEEE Trans. Emerg. Top. Comput. Intell. 2022, 6, 893–911. [Google Scholar] [CrossRef]
  6. Liu, J.; Liao, X.; Dong, J. A quaternion-valued neural network approach to nonsmooth nonconvex nonstrained optimization in quaternion domain. IEEE Trans. Emerg. Top. Comput. Intell. 2023, 1–16. [Google Scholar] [CrossRef]
  7. Aouiti, C.; Touati, F. Global dissipativity of quaternion-valued fuzzy cellular fractional-order neural networks with time delays. Neural Process. Lett. 2023, 55, 481–503. [Google Scholar] [CrossRef]
  8. Li, R.; Cao, J. Dissipativity and synchronization control of quaternion-valued fuzzy memristive neural networks: Lexicographical order method. Fuzzy Sets Syst. 2021, 443, 70–89. [Google Scholar] [CrossRef]
  9. Song, Q.; Yang, L.; Liu, Y.; Alsaadi, F. Stability of quaternion-valued neutral-type neural networks with leakage delay and proportional delays. Neurocomputing 2022, 521, 191–198. [Google Scholar] [CrossRef]
  10. Rezaie, A.; Mobayen, S.; Ghaemi, M.; Fekih, A.; Zhilenkov, A. Design of a Fixed-Time Stabilizer for Uncertain Chaotic Systems Subject to External Disturbances. Mathematics 2023, 15, 3273. [Google Scholar] [CrossRef]
  11. Zhang, Z.; Yang, Z. Asymptotic stability for quaternion-valued fuzzy BAM neural networks via integral inequality approach. Chaos Solitons Fractals 2023, 169, 113227. [Google Scholar] [CrossRef]
  12. Wang, J.; Zhu, S.; Liu, X.; Wen, S. Mittag-Leffler stability of fractional-order quaternion-valued memristive neural networks with generalized piecewise constant argument. Neural Net. 2023, 162, 175–185. [Google Scholar] [CrossRef] [PubMed]
  13. Singh, S.; Das, S.; Chouhan, S.; Cao, J. Anti-synchronization of inertial neural networks with quaternion-valued and unbounded delays: Non-reduction and non-separation approach. Knowl.-Based Syst. 2023, 278, 110903. [Google Scholar] [CrossRef]
  14. Zhao, M.; Li, H.; Zhang, L.; Hu, C.; Jiang, H. Quasi-synchronization of discrete-time fractional-order quaternion-valued memristive neural networks with time delays and uncertain parameters. Appl. Math. Comput. 2023, 453, 128095. [Google Scholar] [CrossRef]
  15. Xiao, J.; Cao, J.; Cheng, J.; Zhong, S.; Wen, S. Novel methods to finite-time Mittag-Leffler synchronization problem of fractional-order quaternion-valued neural networks. Inf. Sci. 2020, 526, 221–244. [Google Scholar] [CrossRef]
  16. Ping, J.; Zhu, S.; Shi, M.; Wu, S.; Shen, M.; Liu, X.; Wen, S. Event-triggered finite-time synchronization control for quaternion-valued memristive neural networks by an non-decomposition method. IEEE Trans. Netw. Sci. Eng. 2023, 10, 3609–3619. [Google Scholar] [CrossRef]
  17. Polyakov, A. Nonlinear feedback design for fixed-time stabilization of linear control systems. IEEE Trans. Autom. Control. 2012, 57, 2106–2110. [Google Scholar] [CrossRef]
  18. Sadik, H.; Abdurahman, A.; Tohti, R. Fixed-time synchronization of reaction-diffusion fuzzy neural networks with stochastic perturbations. Mathematics 2023, 6, 1493. [Google Scholar] [CrossRef]
  19. Yang, W.; Xiao, L.; Huang, J.; Yang, J. Fixed-time synchronization of neural networks based on quantized intermittent control for image protection. Mathematics 2021, 23, 3086. [Google Scholar] [CrossRef]
  20. Pang, L.; Hu, C.; Yu, J.; Jiang, H. Fixed-time synchronization for fuzzy-based impulsive complex networks. Mathematics 2022, 9, 1533. [Google Scholar] [CrossRef]
  21. Pu, H.; Li, F. Fixed/predefined-time synchronization of complex-valued discontinuous delayed neural networks via non-chattering and saturation control. Physical A 2022, 610, 128425. [Google Scholar] [CrossRef]
  22. Wu, E.; Wang, Y.; Li, Y.; Li, K.; Luo, F. Fixed-Time Synchronization of Complex-Valued Coupled Networks with Hybrid Perturbations via Quantized Control. Mathematics 2023, 18, 3845. [Google Scholar] [CrossRef]
  23. Cheng, Y.; Hu, T.; Xu, W.; Zhang, X.; Zhong, S. Fixed-time synchronization of fractional-order complex-valued neural networks with time-varying delay via sliding mode control. Neurocomputing 2022, 505, 339–352. [Google Scholar] [CrossRef]
  24. Deng, H.; Bao, H. Fixed-time synchronization of quaternion-valued neural networks. Physical A 2019, 527, 121351. [Google Scholar] [CrossRef]
  25. Wei, R.; Cao, J. Fixed-time synchronization of quaternion-valued memristive neural networks with time delays. Neural Net. 2019, 113, 1–10. [Google Scholar] [CrossRef] [PubMed]
  26. Wei, W.; Yu, J.; Wang, L.; Hu, C.; Jiang, H. Fixed/Preassigned-time synchronization of quaternion-valued neural networks via pure power-law control. Neural Net. 2021, 146, 341–349. [Google Scholar] [CrossRef] [PubMed]
  27. Zhang, Y.; Yang, L.; Kou, K.; Liu, Y. Fixed-time synchronization for quaternion-valued memristor-based neural networks with mixed delays. Neural Net. 2023, 165, 274–289. [Google Scholar] [CrossRef]
  28. Peng, T.; Wu, Y.; Tu, Z.; Alofi, A.; Lu, J. Fixed-time and prescribed-time synchronization of quaternion-valued neural networks: A control strategy involving Lyapunov functions. Neural Net. 2023, 160, 108–121. [Google Scholar] [CrossRef]
  29. Li, X.; Wu, H.; Cao, J. Prescribed-time synchronization in networks of piecewise smooth systems via a nonlinear dynamic event-triggered control strategy. Math. Comput. Simul. 2022, 203, 647–668. [Google Scholar] [CrossRef]
  30. Liu, X.; Ho, D.; Xie, C. Prespecified-time cluster synchronization of complex networks via a smooth control approach. IEEE Trans. Cybern. 2020, 50, 1771–1775. [Google Scholar] [CrossRef]
  31. Shao, S.; Liu, X.; Cao, J. Prespecified-time synchronization of switched coupled neural networks via smooth controllers. Neural Net. 2020, 133, 32–39. [Google Scholar] [CrossRef]
  32. Yang, J.; Chen, G.; Zhu, S.; Wen, S.; Hu, J. Fixed/prescribed-time synchronization of BAM memristive neural networks with time-varying delays via convex analysis. Neural Net. 2023, 163, 53–63. [Google Scholar] [CrossRef] [PubMed]
  33. Tan, F.; Zhou, L.; Xia, J. Adaptive quantitative exponential synchronization in multiplex Cohen–Grossberg neural networks under deception attacks. J. Frankl. Inst. 2022, 359, 10558–10577. [Google Scholar] [CrossRef]
  34. Jamal, M.; Kumar, R.; Mukhopadhyay, S.; Kwon, O. Fixed-time stability of Cohen–Grossberg BAM neural networks with impulsive perturbations. Neurocomputing 2023, 550, 126501. [Google Scholar] [CrossRef]
  35. Kong, F.; Zhu, Q.; Karimi, H. Fixed-time periodic stabilization of discontinuous reaction-diffusion Cohen–Grossberg neural networks. Neural Net 2023, 166, 354–365. [Google Scholar] [CrossRef] [PubMed]
  36. Zhang, H.; Chen, X.; Ye, R.; Stamova, I.; Cao, J. Adaptive quasi-synchronization analysis for Caputo delayed Cohen–Grossberg neural networks. Math. Comput. Simul. 2023, 212, 49–65. [Google Scholar] [CrossRef]
  37. Clarke, F. Optimization and Nonsmooth Analysis; Wiley: New York, NY, USA, 1983. [Google Scholar]
  38. Filippov, A. Differential Equations with Discontinuous Right-Hand Sides; Kluwer: Dordrecht, The Netherlands, 1988. [Google Scholar]
  39. Huang, L.; Guo, Z.; Wang, J. Theory and Applications of Differential Equations with Discontinuous Right-Hand Sides; Science Press: Beijing, China, 2011. [Google Scholar]
  40. Aubin, J.; Frankowska, H. Set-Valued Analysis; Birkhäuser: Boston, MA, USA, 1990. [Google Scholar]
  41. Wei, W.; Hu, C.; Yu, J.; Jiang, H. Fixed/preassigned-time synchronization of quaternion-valued neural networks involving delays and discontinuous activations: A direct approach. Acta Math. Sci. 2022, 43, 1439–1461. [Google Scholar] [CrossRef]
  42. Liu, H.; Cheng, J.; Cao, J.; Katib, I. Preassigned-time synchronization for complex-valued memristive neural networks with reaction-diffusion terms and Markov parameters. Neural Net. 2023, 169, 520–531. [Google Scholar] [CrossRef]
  43. Hu, C.; He, H.; Jiang, H. Fixed/Preassigned-time synchronization of complex networks via improving fixed-time stability. IEEE Trans. Cybern. 2021, 51, 2882–2892. [Google Scholar] [CrossRef]
  44. Li, Z.; Liu, X. Finite time anti-synchronization of quaternion-valued neural networks with asynchronous time-varying delays. Neural Process. Lett. 2020, 52, 2253–2274. [Google Scholar] [CrossRef]
Figure 1. Synchronization error of CGQVNNs (32) and (33) without control.
Figure 1. Synchronization error of CGQVNNs (32) and (33) without control.
Mathematics 11 04825 g001
Figure 2. FIT synchronization error of CGQVNNs (32) and (33) under controller (8).
Figure 2. FIT synchronization error of CGQVNNs (32) and (33) under controller (8).
Mathematics 11 04825 g002
Figure 3. PET synchronization error of CGQVNNs (32) and (33) under controller (8).
Figure 3. PET synchronization error of CGQVNNs (32) and (33) under controller (8).
Mathematics 11 04825 g003
Figure 4. FIT synchronization error of CGQVNNs (32) and (33) under controller (24).
Figure 4. FIT synchronization error of CGQVNNs (32) and (33) under controller (24).
Mathematics 11 04825 g004
Figure 5. PET synchronization error of CGQVNNs (32) and (33) under controller (39).
Figure 5. PET synchronization error of CGQVNNs (32) and (33) under controller (39).
Mathematics 11 04825 g005
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

Jia, S.; Hu, C.; Jiang, H. Fixed/Preassigned-Time Synchronization of Fully Quaternion-Valued Cohen–Grossberg Neural Networks with Generalized Time Delay. Mathematics 2023, 11, 4825. https://doi.org/10.3390/math11234825

AMA Style

Jia S, Hu C, Jiang H. Fixed/Preassigned-Time Synchronization of Fully Quaternion-Valued Cohen–Grossberg Neural Networks with Generalized Time Delay. Mathematics. 2023; 11(23):4825. https://doi.org/10.3390/math11234825

Chicago/Turabian Style

Jia, Shichao, Cheng Hu, and Haijun Jiang. 2023. "Fixed/Preassigned-Time Synchronization of Fully Quaternion-Valued Cohen–Grossberg Neural Networks with Generalized Time Delay" Mathematics 11, no. 23: 4825. https://doi.org/10.3390/math11234825

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