Next Article in Journal
Geometric Control and Structure-at-Infinity Control for Disturbance Rejection and Fault Compensation Regarding Buck Converter-Based LED Driver
Previous Article in Journal
Relation-Theoretic Nonlinear Almost Contractions with an Application to Boundary Value Problems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fixed/Preassigned-Time Synchronization of Fuzzy Memristive Fully Quaternion-Valued Neural Networks Based on Event-Triggered Control

1
College of Mathematics and System Sciences, Xinjiang University, Urumqi 830017, China
2
Xinjiang Key Laboratory of Applied Mathematics, Urumqi 830017, China
3
College of Mathematics and Statistics, Yili Normal University, Yining 835000, China
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(9), 1276; https://doi.org/10.3390/math12091276
Submission received: 30 March 2024 / Revised: 12 April 2024 / Accepted: 22 April 2024 / Published: 23 April 2024
(This article belongs to the Section Dynamical Systems)

Abstract

:
In this paper, the fixed-time and preassigned-time synchronization issues of fully quaternion-valued fuzzy memristive neural networks are studied based on the dynamic event-triggered control mechanism. Initially, the fuzzy rules are defined within the quaternion domain and the relevant properties are established through rigorous analysis. Subsequently, to conserve resources and enhance the efficiency of the controller, a kind of dynamic event-triggered control mechanism is introduced for the fuzzy memristive neural networks. Based on the non-separation analysis, fixed-time and preassigned-time synchronization criteria are presented and the Zeno phenomenon under the event-triggered mechanism is excluded successfully. Finally, the effectiveness of the theoretical results is verified through numerical simulations.

1. Introduction

Over the past several decades, artificial neural networks have taken center stage in technology research. At present, in an attempt to mimic the complex operations of the human brain, researchers have embarked on the exploration of a novel form of artificial neural network known as the fuzzy memristive neural network (FMNN). This groundbreaking neural network blends fuzzy logic and memristor technology, boosting the deep learning prowess of neural networks by imitating the synaptic behavior inherent in the human brain. The fuzzy memristive neural network not only facilitates the storage and processing of substantial volumes of data but also enhances adaptability and efficiency in the machine learning process. This form of neural network holds immense potential for propelling the evolution of artificial intelligence and heralding a novel technological revolution. Currently, researchers in the field of FMNN have produced several excellent results [1,2,3,4]. For instance, in [1], an impulsive sampled data communication mechanism is proposed to investigate the anti-synchronization of FMNNs. Gong et al. presented the T-S FMNN synchronization criterion in [3]. Additionally, Wang et al. investigated the fixed-time and preassigned-time synchronization of FMNNs [4].
It is important to note that the aforementioned studies on FMNN have been conducted in the real number domain. As a generalization of real-valued numbers and complex-valued numbers, the algebraic structure of quaternions is well-recognized for its ability to empower networks with increased representational capacity and a reduced count of parameters when addressing complex interrelationships and patterns. By integrating quaternion-based weights and activation functions, the quaternion-valued neural network (QVNN) improves the traditional mathematical representation of neurons and makes it possible to process multi-channel data, including color imagery [5], video content [6], and 3D spatial information [7]. Currently, the dynamic properties of QVNN have been widely concerned, such as dissipativity [8,9], stability [10,11], optimization [12], and synchronization [13,14]. The fusion of QVNN, known for its efficient data representation, with the high fault tolerance characteristic of FMNN, has given rise to the innovative quaternion-valued fuzzy neural network model. This synergetic model amplifies the network’s resilience to noise and data incompleteness while preserving the inherent multi-dimensional correlations present within the data.
Synchronization pertains to the coordinated process where neurons or neuron clusters within a neural network achieve a uniform or coherent state of activity via mutual influence. This phenomenon has become a significant topic in the field of QVNNs. Zhang et al. provided several criteria for synchronization of quaternion-valued memristive neural networks (QVMNNs) by designing adaptive control strategies [15]. The exponential synchronization for QVMNNs with time-varying delayed were addressed in [16,17]. Moreover, the issues of synchronization associated with quaternion-valued fuzzy neural networks have been reported in [18,19,20]. Nevertheless, due to the complexity of quaternion-valued and memristor-based neurons, there are fewer related references on quaternion-valued fuzzy memristive neural networks (QVFMNNs). Furthermore, the fuzzy operations introduced into the model of QVMNN, the design of controller, and the theoretical proof are not a trivial generalization. We need to design new control algorithms, use special techniques to deal with the fuzzy term, and study the synchronization of QVFMNN.
Traditional research on synchronous systems typically emphasizes exponential and asymptotic synchronization. However, these techniques frequently fail to achieve synchronization within a limited time. Consequently, there has been an increasing interest in research on fixed-time synchronization (FITS) to meet practical application requirements. FITS aims to attain consistency of states among all neurons in a network within a finite time, regardless of initial conditions. There are several outstanding results about FITS [21,22,23,24]. Tang et al. designed a continuous sampling and non-chattering controller to achieve the FITS of neural networks [21]. The FITS of memristor-based neural networks was investigated by a continuous sampling feedback control in [24]. With the development of time, more investigation in the engineering field is needed to achieve synchronization in an ideal predetermined time, in which the convergence time is independent of the system and controller parameters. Hu et al. have proposed a mature theory of prescribed-time stability [25], which successfully extended the fixed-time stability theory. Subsequently, numerous noteworthy achievements have been made [26,27,28,29,30]. The preassigned-time synchronization (PETS) of complex-valued memristive neural networks was studied in [29]. It is important to note that most of the aforementioned research is based on continuous time-triggered control. When it comes to resource utilization, this control wastes computing and energy resources by performing control tasks periodically. In addition, if the sampling period is relatively small, a large number of redundant sampling signals will be released into the communication network with limited bandwidth, which will inevitably cause network congestion.
Event-triggered control is an important method in the design of modern control systems, with the core concept of reducing redundant data transmission and improving computation efficiency by designing event-triggered mechanisms. In an event-triggered control framework, the update of control inputs is not performed at fixed time points, but rather depends on specific changes in the system state or the occurrence of certain events. This approach is in stark contrast to traditional periodic sampling control, which continuously checks and updates the system state at fixed time intervals, regardless of whether there is a significant change in the system state. Static event-triggered control is one of the more traditional event-triggering methods. In a static event-triggering mechanism, the triggering condition typically relies on a determined relationship between the current system state and the sampling error. When the system error exceeds a preset threshold, a control action is triggered. The design goal of this mechanism is to ensure that the system state can gradually converge to the desired target or origin [31,32,33,34,35]. Dynamic event-triggered control introduces internal dynamic variables to improve upon the static method. The dynamic event-triggering mechanism allows the triggering conditions to adjust dynamically with time and changes in system state, which can further save resources while maintaining or enhancing system performance. By introducing dynamic variables, the control system can adjust the event-triggering rules based on real-time system performance and predetermined stability requirements, thus increasing the interval between executions and reducing unnecessary control updates while ensuring stability and performance metrics [36,37,38,39].
Based on the preceding analysis, this study aims to address the synchronization of QVFMNNs by a kind of dynamic event-triggered control mechanism in both fixed-time and prescribed-time scenarios. The main contributions and innovations of this article can be highlighted as follows.
(1)
Building on the foundational insights of established methods like the lexicographic order method and the metric function method [40,41,42], this paper embarks on a novel journey within the realm of quaternion analysis by redefining fuzzy rules. It further fortifies this innovation by rigorously analyzing and validating the accuracy and efficacy of the lemmas tied to the fuzzy rules, thereby setting a new benchmark in theoretical exploration.
(2)
Moving beyond traditional static event-triggering control mechanisms [43,44] with an eye towards enhancing communication efficiency, this paper introduces an innovative approach through the formulation of quaternion-valued dynamic event-triggering control strategies devoid of linear components. This strategic framework is designed to guarantee both FITS and PETS within the context of QVFMNNs. Additionally, the paper adeptly eliminates the potential for Zeno phenomena within the system by employing a methodical application of the proof by contradiction.
(3)
Different from the conventional separation technique, the FITS and PETS of QVFMNN are discussed through a direct analytical approach. Consequently, several flexible criteria are established for achieving FITS and PETS of QVFMNN and the upper bound of the setting time is provided explicitly.
In Section 2, the necessary preliminaries are introduced. Section 3 are dedicated to exploring the FITS and PETS of QVFMNNs through the lens of event-triggered control mechanisms, respectively. In Section 4, two numerical examples are present to substantiate the theoretical results. The paper is summarized in Section 5.

2. Model Description and Preliminaries

A quaternion-valued fuzzy memristive neural network is given by
w ˙ p ( t ) = d p ( w p ( t ) ) w p ( t ) + q N a p q ( w p ( t ) ) f q ( w q ( t ) ) + q N b p q ( w p ( t ) ) g q ( w q ( m p q ( t ) ) ) + q N θ p q g q ( x q ( m p q ( t ) ) ) + q N σ p q g q ( w q ( m p q ( t ) ) ) + q N c p q η q + q N ϕ p q η q + q N ψ p q η q + ξ p , p N ,
where w p ( t ) Q is the state of the pth unit, d p ( w p ( t ) ) Q is the feedback self-connection weight, a p q ( w p ( t ) ) , b p q ( w p ( t ) ) Q are the connection weights, f q ( · ) and g q ( · ) : Q Q are quaternion-valued activation functions, m p q ( t ) t is the generalized time delay, c p q , ϕ p q , ψ p q Q mean the connection weights of fuzzy feed-forward template, η p and ξ p denote the bias and the external input of the pth neuron, respectively. ⋁ and ⋀ denote the fuzzy operations of OR and AND, and θ p q and σ p q Q purport the connection weights of the fuzzy feedback MIN template and feed forward MAX template. In addition, w p ( s ) = ϱ p ( s ) C ( [ Ϝ , 0 ] ) is the initial state of the network (1), in which Ϝ = max p , q N { | m p q ( 0 ) | } . Moreover, the connection weights d p ( w p ( t ) ) , a p q ( w p ( t ) ) , b p q ( w p ( t ) ) satisfy
d p ( w p ( t ) ) = d ˇ p = d ˇ p R + d ˇ p I i + d ˇ p J j + d ˇ p K k , | w p ( t ) | 1 h p , d ^ p = d ^ p R + d ^ p I i + d ^ p J j + d ^ p K k , | w p ( t ) | 1 > h p ,
a p q ( w p ( t ) ) = a ˇ p q = a ˇ p q R + a ˇ p q I i + a ˇ p q J j + a ˇ p q K k , | x p ( t ) | 1 h p , a ^ p q = a ^ p q R + a ^ p q I i + a ^ p q J j + a ^ p q K k , | x p ( t ) | 1 > h p ,
b p q ( w p ( t ) ) = b ˇ p q = b ˇ p q R + b ˇ p q I i + b ˇ p q J j + b ˇ p q K k , | w p ( t ) | 1 h p , b ^ p q = b ^ p q R + b ^ p q I i + b ^ p q J j + b ^ p q K k , | w p ( t ) | 1 > h p ,
where d ˇ p d ^ p , a ˇ p q a ^ p q , b ˇ p q b ^ p q , h p μ > 0 are the switching jump.
Definition 1.
For any a p Q , p N , the fuzzy rules p N a p and p N a p are defined as
p N a p = min p N { a p R } + min p N { a p I } i + min p N { a p J } j + min p N { a p K } k , p N a p = max p N { a p R } + max p N { a p I } i + max p N { a p J } j + max p N { a p K } k .
Remark 1.
In model (1), the fuzzy rule is introduced into QVMNN to describe the fuzzy logic in the feed-forward MAX template and feedback MIN template. Previous researchers have made efforts to compare the ‘magnitude’ of quaternions. For instance, Li et al. proposed a lexicographical order method [40]. In [41], the quaternion vector was decomposed into two complex-value vectors, which naturally solved the aforementioned problem using a generalized inequality technique. Additionally, the ‘magnitude’ of different quaternions was determined based on a defined linear distance function in [42]. In contrast to these approaches, a quaternion-valued fuzzy rule is introduced in Definition 1 in this article. Notably, Definition 1 degenerates to a real-valued fuzzy rule when i = j = k = 0 , and to a complex-valued fuzzy rule when j = k = 0 . This implies that the developed quaternion-valued fuzzy rule is an important generalization of its real-valued and complex-valued counterpart.
It is worth noting that the right-hand side of system (1) is essentially discontinuous due to the presence of the switching jump points. According to the theory of non-smooth analysis in [45,46,47,48], the Filippov solution of system (1) satisfies
w ˙ p ( t ) c o ¯ [ d p ( w p ( t ) ) ] w p ( t ) + q N c o ¯ [ a p q ( w p ( t ) ) ] f q ( w q ( t ) ) + q N c o ¯ [ b p q ( w p ( t ) ) ] g q ( w q ( m p q ( t ) ) ) + q N θ p q g q ( w q ( m p q ( t ) ) ) + q N σ p q g q ( w q ( m p q ( t ) ) ) + q N c p q η q + q N ϕ p q η q + q N ψ p q η q + ξ p , p N ,
where the convex hull of d p ( w p ( t ) ) , a p q ( w p ( t ) ) , and b p q ( w p ( t ) ) are defined as
c o ¯ [ d p ( w p ( t ) ) ] = c o ¯ [ d ˇ p R , d ^ p R ] + c o ¯ [ d ˇ p I , d ^ p I ] i + c o ¯ [ d ˇ p J , d ^ p J ] j + c o ¯ [ d ˇ p K , d ^ p K ] k ,
c o ¯ [ a p q ( w p ( t ) ) ] = c o ¯ [ a ˇ p q R , a ^ p q R ] + c o ¯ [ a ˇ p q I , a ^ p q I ] i + c o ¯ [ a ˇ p q J , a ^ p q J ] j + c o ¯ [ a ˇ p q K , a ^ p q K ] k ,
c o ¯ [ b p q ( w p ( t ) ) ] = c o ¯ [ b ˇ p q R , b ^ p q R ] + c o ¯ [ b ˇ p q I , b ^ p q I ] i + c o ¯ [ b ˇ p q J , b ^ p q J ] j + c o ¯ [ b ˇ p q K , b ^ p q K ] k .
By the theory of measurable selections [48], there exist d ´ p ( t ) c o ¯ [ d p ( w p ( t ) ) ] , a ´ p q ( t ) c o ¯ [ a p q ( w p ( t ) ) ] , and b ´ p q ( t ) c o ¯ [ b p q ( w p ( t ) ) ] such that
w ˙ p ( t ) = d ´ p ( t ) w p ( t ) + q N a ´ p q ( t ) f q ( w q ( t ) ) + q N b ´ p q ( t ) g q ( w q ( m p q ( t ) ) ) + q N θ p q g q ( w q ( m p q ( t ) ) ) + q N σ p q g q ( w q ( m p q ( t ) ) ) + q N c p q η q + q N ϕ p q η q + q N ψ p q η q + ξ p , p N .
Thus, the response system of system (1) is described by
δ ˙ p ( t ) = d p ( δ p ( t ) ) δ p ( t ) + q N a p q ( δ p ( t ) ) f q ( δ q ( t ) ) + q N b p q ( δ p ( t ) ) g q ( δ q ( m p q ( t ) ) ) + q N θ p q g q ( δ q ( m p q ( t ) ) ) + q N σ p q g q ( δ q ( m p q ( t ) ) ) + q N c p q η q + q N ϕ p q η q + q N ψ p q η q + ξ p + u p ( t ) , p N ,
where u p ( t ) is the control input and δ p ( s ) = p ( s ) C ( [ Ϝ , 0 ] ) is the initial state of the response system (3).
Similarly, there exist d p ( t ) c o ¯ [ d p ( δ p ( t ) ) ] , a p q ( t ) c o ¯ [ a p q ( δ p ( t ) ) ] and b p q ( t ) c o ¯ [ b p q ( δ p ( t ) ) ] such that
δ ˙ p ( t ) = d p ( t ) δ p ( t ) + q N a p q ( t ) f q ( δ q ( t ) ) + q N b p q ( t ) g q ( δ q ( m p q ( t ) ) ) + q N θ p q g q ( δ q ( m p q ( t ) ) ) + q N σ p q g q ( δ q ( m p q ( t ) ) ) + q N c p q η q + q N ϕ p q η q + q N ψ p q η q + ξ p + u p ( t ) , p N .
Assumption 1.
For any p N ,   u , v Q , there exist positive constants l p 1 , l ˜ p 1 , L p 1 , L ˜ p 1 such that
| f p ( u ) f p ( v ) | 1 l p 1 | u v | 1 , | g p ( u ) g p ( v ) | 1 l ˜ p 1 | u v | 1 , | f p ( u ) | 1 L p 1 , | g p ( u ) | 1 L ˜ p 1 .
Remark 2.
Activation functions are intrinsically critical elements that affect the dynamic characteristics of the designed neural networks. According to Assumption 1, the existence and uniqueness of solutions for system (1) can be guaranteed due to the continuity of activation functions [16,17]. The assumption of Lipschitz conditions is quite common because activation functions such as the Logistic sigmoid function, piecewise linear functions, and hyperbolic tangent functions satisfy these conditions.
Definition 2.
Drive-response QVFMNNs (1) and (3) are said to be FITS if there exist two number T max and T ( α ( Θ ) ) satisfying T max T ( α ( Θ ) ) > 0 such that
lim t T ( α ( Θ ) ) | α ( t ) | 1 = 0 , | α ( t ) | 1 = 0 , for all t T ( α ( Θ ) ) ,
where α ( t ) = ( α 1 ( t ) , , α p ( t ) ) T Q n , α p ( t ) = δ p ( t ) w p ( t ) , χ p ( s ) = ϱ p ( s ) p ( s ) C ( [ Ϝ , 0 ] ) , Θ = ( δ 1 ( s ) , , δ p ( s ) ) T Q n , p N . Moreover, drive-response QVFMNNs (1) and (3) are said to be PETS for a preassigned time T pat if
lim t T pat | α ( t ) | 1 = 0 , | α ( t ) | 1 = 0 , for all t T pat ,
in which T pat > 0 is completely independent of initial values and system parameters.
Definition 3.
For o Q , the signum function of o is defined as
[ o ] sign ( o R ) + i sign ( o I ) + j sign ( o J ) + k sign ( o K ) .
For a regular, positive, and radially unbounded function V ( x ) : Q n R , x ( t ) : R Q n , the following results should be introduced.
Lemma 1
([25]). If there exist constants z 1 0 , z 2 > 0 , z 3 > 0 , 0 b 1 < 1 , and b 2 > 1 such that for any x ( t ) Q n { 0 n } ,
d d t V ( x ( t ) ) z 1 V ( x ( t ) ) z 2 V b 1 ( x ( t ) ) z 3 V b 2 ( x ( t ) ) ,
then the following results are true.
(i) If z 1 < 0 , x ( t ) 0 n for t T ¯ 1 , where
T ¯ 1 = π z 2 ( b 2 b 1 ) z 2 z 3 ϖ c s c ( z 3 π ) .
(ii) If 0 < z 1 < min { z 2 , z 3 } , x ( t ) 0 n for t T ¯ 2 , where
T ¯ 2 = π c s c ( π z 3 ) z 3 ( b 2 b 1 ) z 3 z 2 z 1 1 ϖ I ( z 3 z 2 + z 3 z 1 , z 3 , 1 z 3 ) + π c s c ( π z 3 ) z 2 ( b 2 b 1 ) z 2 z 3 z 1 ϖ I ( z 2 z 2 + z 3 z 1 , 1 z 3 , z 3 ) ,
in which ϖ = ( 1 b 1 ) / ( b 2 b 1 ) and the incomplete Beta function ratio I ( r , p , q ) is given in [25].
(iii) If 0 < z 1 < 2 z 2 z 3 and b 1 + b 2 = 2 ,   x ( t ) 0 n for t T ¯ 3 , where
T ¯ 3 = 2 ( b 2 1 ) ι π 2 + arctan ( z 1 ι ) ,
in which ι = 4 z 2 z 3 z 1 2 .
Lemma 2
([25]). If there exist constants T pat > 0 , z 1 R ,   z 2 , z 3 > 0 ,   0 b 1 < 1 ,   b 2 > 1 such that for any x ( t ) Q n { 0 n } ,
d d t V ( x ( t ) ) T ˜ T pat z 1 V ( x ( t ) ) + z 2 V b 1 ( x ( t ) ) + z 3 V b 2 ( x ( t ) ,
then x ( t ) 0 n for t T pat , where
T ˜ = T ¯ 1 , z 1 0 , T ¯ 2 , 0 < z 1 < min { z 2 , z 3 } , T ¯ 3 , 0 < z 1 < 2 z 2 z 3 , b 1 + b 2 = 2 .
Lemma 3
([25]). Assume that c i 0 for 1 i N , 0 b 1 1 and b 2 > 1 , then
i N c i b 1 ( i N c i ) b 1 , i N c i b 2 n 1 b 2 ( i N c i ) b 2 .
Lemma 4
([49]). For any ρ 1 , ρ 2 Q , ρ ( t ) : R Q , the following properties hold
( 1 ) ρ ¯ ¯ 1 = ρ 1 , ( 2 ) ρ 1 + ρ ¯ 1 = 2 ρ 1 R 2 | ρ 1 | 1 , ( 3 ) ρ 1 ρ 2 ¯ = ρ ¯ 2 ρ ¯ 1 , ( 4 ) d | ρ ( t ) | 1 d t = 1 2 ( [ ρ ( t ) ] ¯ d ρ ( t ) d t + d ρ ( t ) ¯ d t [ ρ ( t ) ] ) .
Lemma 5
([49]). For any r 1 , r 2 , r 3 Q ,
( 1 ) ( r 1 R | r 1 I | | r 1 J | | r 1 K | ) | r 2 | 1 ( [ r 2 ] ¯ r 1 r 2 ) R ( r 1 R + | r 1 I | + | r 1 J | + | r 1 K | ) | r 2 | 1 , ( 2 ) | z | 1 | r 3 | 1 ( [ r 1 ] ¯ r 2 r 3 ) R | r 2 | 1 | r 3 | 1 .
Lemma 6.
For any ϑ ( t ) Q , D + | ϑ ( t ) | 1 | ϑ ˙ ( t ) | 1 .
Proof. 
By Lemma 4, it can be concluded that
D + | ϑ ( t ) | 1 = 1 2 ( [ ϑ ( t ) ] ¯ D + ϑ ( t ) + D + ϑ ( t ) ¯ [ ϑ ( t ) ] ) = ( sign ( ϑ R ( t ) ) ϑ ˙ R ( t ) + sign ( ϑ I ( t ) ) ϑ ˙ I ( t ) + sign ( ϑ J ( t ) ) ϑ ˙ J ( t ) + sign ( ϑ K ( t ) ) ϑ ˙ K ( t ) ) | ϑ ˙ R ( t ) | + | ϑ ˙ I ( t ) | + | ϑ ˙ J ( t ) | + | ϑ ˙ K ( t ) | .
Further, according to the definition of the absolute-based norm,
| ϑ ˙ ( t ) | 1 = | ϑ ˙ R ( t ) + i ϑ ˙ I ( t ) + j ϑ ˙ J ( t ) + k ϑ ˙ K ( t ) | 1 = | ϑ ˙ R ( t ) | + | ϑ ˙ I ( t ) | + | ϑ ˙ J ( t ) | + | ϑ ˙ K ( t ) | .
Thus, D + | ϑ ( t ) | 1 | ϑ ˙ ( t ) | 1 .
Lemma 7.
For any ϵ p , ϵ ˜ p Q , p N ,
| p N ϵ p p N ϵ ˜ p | 1 p N | ϵ p ϵ ˜ p | 1 , | p N ϵ p p N ϵ ˜ p | 1 p N | ϵ p ϵ ˜ p | 1 .
Proof. 
Based on Definition 1, there exist τ 1 , τ 2 , τ 3 , τ 4 , ϖ 1 , ϖ 2 , ϖ 3 , ϖ 4 N such that
p N ϵ p = ϵ τ 1 R + ϵ τ 2 I i + ϵ τ 3 J j + ϵ τ 4 K k , p N ϵ ˜ p = ϵ ˜ ϖ 1 R + ϵ ˜ ϖ 2 I i + ϵ ˜ ϖ 3 J j + ϵ ˜ ϖ 4 K k .
Hence,
| p N ϵ p p N ϵ ˜ p | 1 = | ϵ τ 1 R ϵ ˜ ϖ 1 R | + | ϵ τ 2 I ϵ ˜ ϖ 2 I | + | ϵ τ 3 J ϵ ˜ ϖ 3 J | + | ϵ τ 4 K ϵ ˜ ϖ 4 K | , max { | ϵ τ 1 R ϵ ˜ τ 1 R | , | ϵ ϖ 1 R ϵ ˜ ϖ 1 R | } + max { | ϵ τ 2 I ϵ ˜ τ 2 I | , | ϵ ϖ 2 I ϵ ˜ ϖ 2 I | } + max { | ϵ τ 3 J ϵ ˜ τ 3 J | , | ϵ ϖ 3 J ϵ ˜ ϖ 3 J | } + max { | ϵ τ 4 K ϵ ˜ τ 4 K | , | ϵ ϖ 4 K ϵ ˜ ϖ 4 K | } p N | ϵ p R ϵ ˜ p R | + p N | ϵ p I ϵ ˜ p I | + p N | ϵ p J ϵ ˜ p J | + p N | ϵ p K ϵ ˜ p K | p N | ϵ p ϵ ˜ p | 1 .
Similar to the above analysis, it can be obtained
| p N ϵ p p N ϵ ˜ p | 1 p N | ϵ p ϵ ˜ p | 1 ,
The proof is completed. □
Remark 3.
In recent research on QVFNN [18,19,40,41,42], without the rigorous theoretical proof, the above two inequalities are directly used to investigate the synchronization of QVFNN. To address this gap, based on the revised fuzzy rule definition, Lemma 7 in this paper is offered.

3. Main Results

This section presents several main theorems with an absolute-based norm and 2-norm that give the FITS and PETS of the QVFMNNs (1) and (3) by the designed event-triggered control.

3.1. FITS

Before giving the main results, several notations are provided.
a ˜ p q = max { | a ^ p q | 1 , | a ˇ p q | 1 } , b ˜ p q = max { | b ^ p q | 1 , | b ˇ p q | 1 } ,
d ˜ p = max { d ^ p R + | d ^ p I | + | d ^ p J | + | d ^ p K | , d ˇ p R + | d ˇ p I | + | d ˇ p J | + | d ˇ p K | } ,
β ˜ 1 = ( 2 n ) 1 ε min p N { β p } , β ˜ 2 = ( 2 n ) 1 ε min p N { β ^ p } , β ˜ 3 = ( 2 n ) 1 ε min p N { β ˇ p } ,
κ ˜ 1 = max p N { d ˜ p + q N   a ˜ q p l p 1 } , ι 1 = 4 n M 1 β ˜ 1 κ ˜ 1 2 , ι 2 = 4 n M ^ 1 β ˜ 2 κ ˜ 1 2 , ι 3 = 4 n M ˇ 1 β ˜ 3 κ ˜ 1 2 .
A 1 p = h p 1 | [ α p ( t ) ] | 1 | d ^ p d ˇ p | 1 + q N h p 1 | [ e p ( t ) ] | 1 | a ^ p q a ˇ p q | 1 l q 1 + 2 L ˜ q ( b ˜ p q | [ α p ( t ) ] | 1 + | θ p q | 1 + | σ p q | 1 ) ,
A 2 p = h p 1 | [ α p ( t ) ] | 1 | d ^ p d ˇ p | 1 + q N l q 1 h p 1 | [ α p ( t ) ] | 1 | a ^ p q a ˇ p q | 1 + 2 L ˜ q b ˜ p q | [ α p ( t ) ] | 1 ,
A 3 p = d ˜ p h p 1 + q N a ˜ p q l q 1 h q 1 + 2 L ˜ q ( b ˜ p q | [ α p ( t ) ] | 1 + | θ p q | 1 + | σ p q | 1 ) .
To achieve FITS, the event-triggered controller based on the absolute-based norm is designed by
u p ( t ) = [ α p ( t s ) ] ( γ p + β p | α p ( t s ) | 1 ε ) , t [ t s , t s + 1 ) ,
where t s , s Z is the latest triggering instant with t 0 = 0 , ε > 1 , and γ p , β p are positive constants, p N .
The dynamic triggering law are developed as follows
t s + 1 = inf { t : t t s , F p ( t ) 0 } , F p ( t ) = A 1 p + | E p ( t ) | 1 γ p + M 1 p λ p ( t ) , λ ˙ p ( t ) = p λ p ( t ) β p λ p ε ( t ) ,
where M 1 , p > 0 and λ p ( t ) with λ p ( 0 ) > 0 is the internal dynamic variable and E p ( t ) is the measure errors and described by
  E p ( t ) = [ α p ( t s ) ] ( γ p + β p | α p ( t s ) | 1 ε ) [ α p ( t ) ] ( γ p + β p | α p ( t ) | 1 ε ) .
The above event-triggered synchronization mechanism is shown in Figure 1.
Lemma 8.
For any t 0 , p N , λ p ( t ) 0 .
Proof. 
To begin with, confirm that λ p ( t ) 0 is valid for any t 0 . If it is not valid, there exists a t ˜ such that λ p ( t ˜ ) < 0 . Since λ p ( t ) with λ p ( 0 ) > 0 is continuous, there exist some t ^ in the interval ( 0 , t ˜ ) such that λ p ( t ^ ) = 0 . Let t * = inf { t ^ | λ p ( t ^ ) = 0 , t ^ ( 0 , t ˜ ) } . Obviously, λ p ( t * ) = 0 and λ p ( t ) > 0 for t [ 0 , t * ) .
Integrate both sides of the third term in (6) to obtain
0 = λ p ( t * ) = e 0 t * ( p β p λ p ε 1 ( t ) ) d s λ p ( 0 ) > 0 ,
this is contradictory to the above conditions. Therefore, for any t 0 , λ p ( t ) 0 . □
Remark 4.
In comparison to traditional static event-triggering mechanisms [43,44], the key advantage of dynamic event-triggering mechanisms is that they can adjust the triggering conditions based on the current state and performance requirements of the system, thereby adapting to the constantly changing system environment and demands. This paper introduces a dynamic variable function λ p ( t ) into the event-triggering conditions, which can converge from λ p ( 0 ) to 0 over time. Such a design allows for dynamic adjustment of the triggering threshold according to changes in the system state. As a result, it can help to reduce the number of data packet transmissions and thus lower the likelihood of network congestion. Furthermore, the dynamic event-triggering mechanism can also reduce unnecessary task execution, save computational resources, and decrease energy consumption.
Theorem 1.
Based on Assumption 1 the event-triggered control mechanism (5) and (6), then the following results are true.
(1) 
If k ˜ 1 0 , the FITS of QVFMNNs (1) and (3) can be realized and the ST is estimated by
T 1 = π ε n M 1 ( n M 1 β ˜ 1 ) 1 ε csc ( π ε ) .
(2) 
If 0 < k ˜ 1 < min { n M 1 , β ˜ 1 } , then α ( t ) 0 n for t T 2 , in which
T 2 = π c s c ( π ε ) β ˜ 1 ε ^ ( β ˜ 1 n M 1 k ˜ 1 ) 1 ε ^ I ( β ˜ 1 n M 1 + β ˜ 1 k ˜ 1 , ε , 1 ε ^ ) + π c s c ( π ε ) n M 1 ε ^ ( n M 1 β ˜ 2 k ˜ 1 ) ε ^ I ( n M 1 n M 1 + β ˜ 2 k ˜ 1 , 1 ε ^ , ε ^ ) .
(3) 
If 0 < k ˜ 1 < 2 n M 1 β ˜ 1 and ε = 2 , then α ( t ) 0 n for t T 3 , in which
T 3 = 2 ι 1 ( π 2 + arctan ( k ˜ 1 ι 1 ) ) .
Proof. 
Consider the following absolute-based norm Lyapunov function
V ( t ) = V 1 ( t ) + V 2 ( t ) = p N | α p ( t ) | 1 + p N λ p ( t ) .
According to the systems (1) and (3), for any α ( t ) R n { 0 n } ,
D + V 1 ( t ) = 1 2 p N ( [ α p ( t ) ] ¯ D + α p ( t ) + D + α p ( t ) ¯ [ α p ( t ) ] ) = 1 2 p N ( [ α p ( t ) ] ¯ ( d p ( t ) δ p ( t ) d ´ p ( t ) w p ( t ) ) ( d p ( t ) δ p ( t ) d ´ p ( t ) w p ( t ) ) ¯ [ α p ( t ) ] ) + 1 2 p N q N ( [ α p ( t ) ] ¯ ( a p q ( t ) f q ( δ q ( t ) ) a ´ p q ( t ) f q ( w q ( t ) ) ) + ( a p q ( t ) f q ( δ q ( t ) ) a ´ p q ( t ) f q ( w q ( t ) ) ) ¯ [ α p ( t ) ] ) + 1 2 p N q N ( [ α p ( t ) ] ¯ ( b p q ( t ) g q ( δ q ( m p q ( t ) ) ) b ´ p q ( t ) g q ( w q ( m p q ( t ) ) ) ) + ( b p q ( t ) g q ( δ q ( m p q ( t ) ) ) b ´ p q ( t ) g q ( w q ( m p q ( t ) ) ) ) ¯ [ α p ( t ) ] ) + 1 2 p N ( [ α p ( t ) ] ¯ ( q N θ p q g q ( δ q ( m p q ( t ) ) ) ) q N θ p q g q ( w q ( m p q ( t ) ) ) ) + q N θ p q g q ( δ q ( m p q ( t ) ) ) ) q N θ p q g q ( w q ( m p q ( t ) ) ) ¯ [ α p ( t ) ] ) + 1 2 p N ( [ α p ( t ) ] ¯ ( q N σ p q g q ( δ q ( m p q ( t ) ) ) ) q N σ p q g q ( w q ( m p q ( t ) ) ) ) + q N σ p q g q ( δ q ( m p q ( t ) ) ) ) q N σ p q g q ( w q ( m p q ( t ) ) ) ¯ [ α p ( t ) ] ) + 1 2 p N [ α p ( t ) ] ¯ u p ( t ) + u p ( t ) ¯ [ α p ( t ) ] .
when α ( t ) { 0 n } , based on Lemma 4,
1 2 p N α p ( t ) ¯ ( d p ( t ) δ p ( t ) d ´ p ( t ) w p ( t ) ) ( d p ( t ) δ p ( t ) d ´ p ( t ) w p ( t ) ) ¯ α p ( t ) = p N α p ( t ) ( d p ( t ) δ p ( t ) d ´ p ( t ) w p ( t ) ) R .
In view of Lemma 5, the following cases are discussed.
(1)
When | w p ( t ) | 1 , | δ p ( t ) | 1 h p 1 ,
p N [ α p ( t ) ] ( d p ( t ) δ p ( t ) d ´ p ( t ) w p ( t ) ) R = p N [ α p ( t ) ] d ˇ p α p ( t ) R p N ( d ˇ p R + | d ˇ p I | + | d ˇ p J | + | d ˇ p K | ) | α p ( t ) | 1 .
(2)
When | w p ( t ) | 1 , | δ p ( t ) | 1 > h p 1 ,
p N [ α p ( t ) ] ( d p ( t ) δ p ( t ) d ´ p ( t ) w p ( t ) ) R = p N [ α p ( t ) ] d ^ p α p ( t ) R p N ( d ^ p R + | d ^ p I | + | d ^ p J | + | d ^ p K | ) | α p ( t ) | 1 .
(3)
When | w p ( t ) | 1 > h p 1 , | δ p ( t ) | 1 h p 1 ,
p N [ α p ( t ) ] ( d p ( t ) δ p ( t ) d ´ p ( t ) w p ( t ) ) R = p N [ e p ( t ) ] ( d ˇ p δ p ( t ) d ^ p w p ( t ) ) R = p N [ e p ( t ) ] ( d ˇ p δ p ( t ) d ^ p δ p ( t ) + d ^ p δ p ( t ) d ^ p w p ( t ) ) R p N ( d ^ p R + | d ^ p I | + | d ^ p J | + | d ^ p K | ) | α p ( t ) | 1 + h p 1 | [ α p ( t ) ] | 1 | d ^ p d ˇ p | 1 .
(4)
When | w p ( t ) | 1 h p 1 , | δ p ( t ) | 1 > h p 1 ,
p N [ α p ( t ) ] ( d p ( t ) δ p ( t ) d ´ p ( t ) w p ( t ) ) R = p N [ α p ( t ) ] ( d ^ p δ p ( t ) d ˇ p w p ( t ) ) R = p N [ α p ( t ) ] ( d ^ p δ p ( t ) d ^ p w p ( t ) + d ^ p w p ( t ) d ˇ p w p ( t ) ) R p N ( d ^ p R + | d ^ p I | + | d ^ p J | + | d ^ p K | ) | α p ( t ) | 1 + h p 1 | [ α p ( t ) ] | 1 | d ^ p d ˇ p | 1 .
As mentioned above,
1 2 p N [ α p ( t ) ] ¯ ( d p ( t ) δ p ( t ) d ´ p ( t ) w p ( t ) ) ( d p ( t ) δ p ( t ) d ´ p ( t ) w p ( t ) ) ¯ [ α p ( t ) ] p N d ˜ p | α p ( t ) | 1 + h p 1 | [ α p ( t ) ] | 1 | d ^ p d ˇ p | 1 .
From Assumption 1,
1 2 p N q N ( [ α p ( t ) ] ¯ ( a p q ( t ) f q ( δ q ( t ) ) a ´ p q ( t ) f q ( w q ( t ) ) ) + ( a p q ( t ) f q ( δ q ( t ) ) a p q ( w p ( t ) ) f q ( w q ( t ) ) ) ¯ [ α p ( t ) ] ) p N q N ( l p a ˜ q p | α p ( t ) | 1 + l q h p 1 | [ α p ( t ) ] | 1 | a ^ p q a ˇ p q | 1 ) ,
and
1 2 p N q N ( [ α p ( t ) ] ¯ ( b p q ( t ) g q ( δ q ( m p q ( t ) ) ) b ´ p q ( t ) g q ( w q ( m p q ( t ) ) ) ) + ( b p q ( t ) g q ( δ q ( m p q ( t ) ) ) b ´ p q ( t ) g q ( w q ( m p q ( t ) ) ) ) ¯ [ α p ( t ) ] ) p N q N 2 b ˜ p q L ˜ q | [ α p ( t ) ] | 1 .
In addition, in light of Lemma 7,
1 2 p N ( [ α p ( t ) ] ¯ ( q N θ p q g q ( δ q ( m p q ( t ) ) ) ) q N θ p q g q ( w q ( m p q ( t ) ) ) ) + q N θ p q g q ( δ q ( m p q ( t ) ) ) ) q N θ p q g q ( w q ( m p q ( t ) ) ) ¯ [ α p ( t ) ] ) p N q N 2 | θ p q | 1 L ˜ q ,
and
1 2 p N ( [ α p ( t ) ] ¯ ( q N σ p q g q ( δ q ( m p q ( t ) ) ) ) q N σ p q g q ( w q ( m p q ( t ) ) ) ) + q N σ p q g q ( δ q ( m p q ( t ) ) ) ) q N σ p q g q ( w q ( m p q ( t ) ) ) ¯ [ α p ( t ) ] ) p N q N 2 | σ p q | 1 L ˜ q .
From event-triggered mechanism (5) and (6), for any α ( t ) Q n { 0 n } ,
1 2 p N [ α p ( t ) ] ¯ u p ( t ) + u p ( t ) ¯ [ α p ( t ) ] = 1 2 p N ( [ α p ( t ) ¯ ] E p ( t ) + E p ( t ) ¯ [ α p ( t ) ] ) p N [ α p ( t ) ¯ ] [ α p ( t ) ] γ p p N [ α p ( t ) ¯ ] [ α p ( t ) ] β p | α p ( t ) | 1 ε p N ( | E p ( t ) | 1 γ p β p | α p ( t ) | 1 ε ) .
Submitting the (8)–(13) into (7) and using the event-triggered condition (6),
D + V 1 ( t ) p N ( d ˜ p + q N l p a ˜ q p ) | α p ( t ) | 1 p N β p | α p ( t ) | 1 ε + p N ( A 1 p + | E p ( t ) | 1 γ p ) p N ( d ˜ p + q N l p a ˜ q p ) | α p ( t ) | 1 p N β p | α p ( t ) | 1 ε n M 1 = κ ˜ 1 p N | α p ( t ) | 1 p N β p | α p ( t ) | 1 ε + p N β p λ p ( t ) ε n M 1 .
If k ˜ 1 0 ,
D + V ( t ) β ˜ 1 V ε ( t ) n M 1 ,
according to Lemma 1, the QVFMNNs (1) and (3) are fixed-time synchronized within the time T 1 .
When 0 < k ˜ 1 < min { n M 1 , β ˜ 1 } ,
D + V ( t ) κ ˜ 1 V ( t ) β ˜ 1 V ε ( t ) n M 1 ,
the QVFMNNs (1) and (3) can realize FXT synchronization within the time T 2 . In particular, when 0 < k ˜ 1 < 2 n M 1 β ˜ 1 , the FITS of QVFMNNs (1) and (3) will be achieved within the time T 3 . The proof is complied. □
Remark 5.
In [40,41], researchers explored the dissipativity and synchronicity of QVFMNNs employing the quadratic norm methodology. Contrarily, our investigation diverges from these prior studies by concentrating on the fixed-time synchronization of QVFMNNs via the 1-norm perspective. This method not only provides more accurate estimations of system settling times but also broadens the scope of our conclusions. As a result, our study gains applicability across a wider array of systems.
It is worth noting that if the fuzzy terms are removed, system (1) will degenerate into the following QVMNN,
w ˙ p ( t ) = d p ( w p ( t ) ) w p ( t ) + q N a p q ( w p ( t ) ) f q ( w q ( t ) ) + q N b p q ( w p ( t ) ) g q ( w q ( m p q ( t ) ) ) + ξ p , q N ,
Correspondingly, the response system is degenerated to
δ ˙ p ( t ) = d p ( δ p ( t ) ) δ p ( t ) + q N a p q ( δ p ( t ) ) f q ( δ q ( t ) ) + q N b p q ( δ p ( t ) ) g q ( δ q ( m p q ( t ) ) ) + ξ p + u ^ p ( t ) , q N .
In order to realize the FITS of QVMNNs (14) and (15), the following event-triggered controller is designed for all t [ t s ^ , t s ^ + 1 ) ,
u ^ p ( t ) = [ α p ( t s ^ ) ] ( γ ^ p + β ^ p | α p ( t s ^ ) | 1 ε ^ ) ,
where t s ^ , s ^ Z is the latest triggering instant with t 0 = 0 and ε ^ > 1 and γ ^ p , β ^ p are positive constants, p N .
The triggering condition is developed by
t s ^ + 1 = inf { t : t t s ^ , F ^ p ( t ) 0 } , F ^ p ( t ) = A 2 p + | E ^ p ( t ) | 1 γ ^ p + M ^ 1 ^ p λ ^ p ( t ) , λ ^ ˙ p ( t ) = ^ p λ ^ p ( t ) β ^ p λ ^ p ε ^ ( t ) ,
where M ^ 1 , ^ p > 0 , λ ^ ( t ) with λ ^ p ( 0 ) > 0 is the internal dynamic variable and E ^ p ( t ) is the measure errors and described by
  E ^ p ( t ) = [ α p ( t s ^ ) ] ( γ ^ p + β ^ p | α p ( t s ^ ) | 1 ε ^ ) [ α p ( t ) ] ( γ ^ p + β ^ p | α p ( t ) | 1 ε ^ ) .
Corollary 1.
According to Assumption 1, the event-triggered control mechanism (16) and (17), then the following results are true.
(1) 
If k ˜ 1 0 , the FITS of systems (14) and (15) can be realized and the ST is estimated by
T ^ 1 = π ε ^ n M ^ ( n M ^ 1 β ˜ 2 ) 1 ε ^ csc ( π ε ^ ) .
(2) 
If 0 < k ˜ 1 < min { n M ^ 1 , β ˜ 2 } , then α ( t ) 0 n for t T ^ 2 , where
T ^ 2 = π c s c ( π ε ^ ) β ˜ 2 ε ^ ( β ˜ 2 n M ^ 1 k ˜ 1 ) 1 ε ^ I ( β ˜ 2 n M ^ 1 + β ˜ 2 k ˜ 1 , ε ^ , 1 ε ^ ) + π c s c ( π ε ^ ) n M ^ 1 ε ^ ( n M ^ 1 β ˜ 2 k ˜ 1 ) ε ^ I ( ε ε ^ + β ˜ 2 k ˜ 1 , 1 ε ^ , ε ^ ) .
(3) 
If 0 < k ˜ 1 < 2 ε ^ β ˜ 2 and ε ^ = 2 , then α ( t ) 0 n for t T ^ 3 , where
T ^ 3 = 2 ι 2 ( π 2 + arctan ( k ˜ 1 ι 2 ) ) .
On the other hand, if the memristive mechanisms are removed, system (1) will degenerate into QVMNN,
w ˙ p ( t ) = d p w p ( t ) + q N a p q f q ( w q ( t ) ) + q N b p q g q ( w q ( m p q ( t ) ) ) + q N c p q λ q + q N θ p q g q ( w q ( m p q ( t ) ) ) + q N σ p q g q ( w q ( m p q ( t ) ) ) + q N ϕ p q λ q + q N ψ p q λ q + ξ p , q N ,
Similarly, the response system is given by
δ ˙ p ( t ) = d p δ p ( t ) + q N a p q f q ( δ q ( t ) ) + q N b p q g q ( δ q ( m p q ( t ) ) ) + q N c p q λ q + q N θ p q g q ( δ q ( m p q ( t ) ) ) + q N σ p q g q ( δ q ( m p q ( t ) ) ) + q N ϕ p q λ q + q N ψ p q λ q + ξ p + u ˇ p ( t ) , q N ,
In order to realize the FITS of QVMNNs (18) and (19), the following event-triggered controller is designed for all t [ t s ˇ , t s ˇ + 1 ) ,
u ˇ p ( t ) = [ α p ( t s ˇ ) ] ( γ ˇ p + β ˇ p | α p ( t s ˇ ) | 1 ε ˇ ) ,
where t s ˇ , s ˇ Z is the latest triggering instant with t 0 = 0 , ε ˇ > 1 and γ ˇ p , β ˇ p are positive constants, p N .
The triggering condition is developed as follows
t s ^ + 1 = inf { t : t t s ˇ , F ˇ p ( t ) 0 } , F ˇ p ( t ) = A 2 p + | E ˇ p ( t ) | 1 γ ˇ p + M ˇ 1 ˇ p λ ˇ p ( t ) , λ ˇ ˙ p ( t ) = ˇ p λ ˇ p ( t ) β ˇ p λ ˇ p ε ˇ ( t ) ,
where M ˇ 1 , ˇ p > 0 , λ ˇ ( t ) with λ ˇ p ( 0 ) > 0 is the internal dynamic variable and E ˇ p ( t ) is the measure errors and described by
  E ˇ p ( t ) = [ α p ( t s ˇ ) ] ( γ ˇ p + β ˇ p | α p ( t s ˇ ) | 1 ε ˇ ) [ α p ( t ) ] ( γ ˇ p + β ˇ p | α p ( t ) | 1 ε ˇ ) .
Corollary 2.
Based on Assumption 1, the event-triggered control mechanism (20) and (21), then the following results are true.
(1) 
If k ˜ 1 0 , the FITS of systems (18) and (19) can be realized and the ST is estimated by
T ˇ 1 = π ε ˇ n M ˇ 1 ( n M ˇ 1 β ˜ 3 ) 1 ε ˇ csc ( π ε ˇ ) .
(2) 
If 0 < k ˜ 1 < min { n M ˇ 1 , β ˜ 3 } , then α ( t ) 0 n for t T ˇ 2 , where
T ˇ 2 = π c s c ( π ε ˇ ) β ˜ 3 ε ˇ ( β ˜ 3 n M ˇ 1 k ˜ 1 ) 1 ε ˇ I ( β ˜ 3 n M ˇ 1 + β ˜ 3 k ˜ 1 , ε ˇ , 1 ε ˇ ) + π c s c ( π ε ˇ ) n M ˇ 1 ε ˇ ( n M ˇ 1 β ˜ 3 k ˜ 1 ) ε ˇ I ( ε ˇ ε ˇ + β ˜ 3 k ˜ 1 , 1 ε ˇ , ε ˇ ) .
(3) 
If 0 < k ˜ 1 < 2 ε ˇ β ˜ 3 and ε ˇ = 2 , then α ( t ) 0 n for t T ˇ 3 , where
T ˇ 3 = 2 ι 3 ( π 2 + arctan ( k ˜ 1 ι 3 ) ) .
Remark 6.
Based on Corollaries 1 and 2, the following results can be obtained. Firstly, the authors investigated the issues of FITS and PETS for QVNNs [13]. If the system in this paper is degenerated, the FITS and PETS of QVNNs based on event-triggered control can be achieved. Secondly, compared to the asymptotic synchronization results of the QVMNNs in [15,16,17], if the fuzzy mechanism in the system of this paper is removed, the FITS and PETS of the systems can be obtained. Lastly, if the system in this paper is reduced to a QVFNN, better synchronization results can be obtained as compared to [19].
Next, we will prove that Zeno behavior does not occur under the designed event-triggering mechanism. For convenience, let
B 1 = | d ^ p d ˇ p | 1 h p 1 | α p ( t ) | 1 + 2 q N | a ˜ p q | 1 L q 1 | α p ( t ) | 1 + 2 q N | b ˜ p q | 1 L ˜ q 1 | α p ( t ) | 1 + 2 q N | θ p q | 1 L ˜ q 1 + 2 q N | σ p q | 1 L ˜ q 1 + 4 γ p .
Theorem 2.
Based on the event-triggered controller mechanism (5) and (6), there is no Zeno behavior in systems (1) and (3).
Proof. 
From Theorem 1, V ˙ 1 ( t ) 0 , which leads to
| α p ( t ) | 1 p N | α p ( t ) | 1 = V 1 ( t ) V 1 ( 0 ) = G 1 .
Consider the Dini derivative of | E p ( t ) | 1 ,
D + | E p ( t ) | 1 = 1 2 ( [ E p ( t ) ¯ ] D + E p ( t ) + D + E p ( t ) ¯ [ E p ( t ) ] ) = 1 2 { [ E p ( t ) ¯ ] [ α p ( t ) ] ( β p ε | α p ( t ) | 1 ε 1 D + | α p ( t ) | 1 ) + [ α p ( t ) ¯ ] ( β p ε | α p ( t ) | 1 ε 1 D + | α p ( t ) | 1 ) [ E p ( t ) ] } 4 β p ε | α p ( t ) | 1 ε 1 | D + | α p ( t ) | 1 | ,
By Lemma 6, for any t [ t s , t s + 1 ) ,
D + | α p ( t ) | 1 | α ˙ p ( t ) | 1 | d ˜ p | 1 | α p ( t ) | 1 + | d ^ p d ˇ p | 1 h p 1 | α p ( t ) | 1 + 2 q N | a ˜ p q | 1 L q 1 | α p ( t ) | 1 + 2 q N | b ˜ p q | 1 L ˜ q 1 | α p ( t ) | 1 + 2 q N | θ p q | 1 L ˜ q 1 + 2 q N | σ p q | 1 L ˜ q 1 + 4 ( γ p + β p | α p ( t s ) | 1 ε ) | d ˜ p | 1 G 1 + B 1 + 4 β 1 p ( G 1 ) ε ,
Hence,
D + | E p ( t ) | 1 4 β p ε ( G 1 ) ε 1 | d ˜ p | 1 G 1 + B 1 + 4 β p ( G 1 ) ε = 4 β p | d ˜ p | 1 ε ( G 1 ) ε + 4 B 1 β p ε ( G 1 ) ε 1 + 16 β p 2 ε ( G 1 ) 2 ε 1 H 1 .
For t [ t s , t s + 1 ) , | E p ( t ) | 1 H 1 ( t t s ) . When t = t s + 1 ,
| E p ( t s + 1 ) | 1 H 1 ( t s + 1 t s ) .
On the other hand, based on triggering condition (6),
| E p ( t s + 1 ) | 1 > λ p ( t ) , t [ t s , t s + 1 ) .
In light of Lemma 7, for any t [ t s , t s + 1 ) ,
λ p ( t ) = e t s t ( p β p λ p ε 1 ( r ) ) d r λ p ( t s ) = e t s 1 t ( p β p λ p ε 1 ( r ) ) d r λ p ( t s 1 ) = = e 0 t ( p β p λ p ε 1 ( r ) ) d r λ p ( 0 ) ,
thus,
| E p ( t s + 1 ) | 1 > e 0 t ( p β p λ p ε 1 ( r ) ) d r λ p ( 0 ) ,
which combines (22),
s = t s + 1 t s e 0 t ( p β p λ p ε 1 ( r ) ) d r λ p ( 0 ) H 1 .
Note that the event-triggering condition (6) is not satisfied after T st , where T st is the ST of QVFMNNs. In other words, we only need to verify that Zeno behavior does not occur for any t ( 0 , T st ) .
Firstly, when κ ˜ 1 0 ,
s > e 0 T 1 ( p β p λ p ε 1 ( r ) ) d r λ p ( 0 ) H 1 > 0 .
Secondly, when 0 < κ ˜ 1 < min { n M 1 , β ˜ 1 } ,
s > e 0 T 2 ( p β p λ p ε 1 ( r ) ) d r λ p ( 0 ) H 1 > 0 .
Finally, when 0 < κ ˜ 1 < 2 n M 1 β ˜ 1 ,
s > e 0 T 3 ( p β p λ p ε 1 ( r ) ) d r λ p ( 0 ) H 1 > 0 .
Therefore, under the event-triggered controller mechanism (5) and (6), systems (1) and (3) will not demonstrate the Zeno behavior. The proof is completed. □

3.2. PETS

The PETS of QVFMNNs (1) and (3) will be analyzed below. The controller based on the absolute value-like norm is characterized by
u p ( t ) = T ^ T 1 p [ α p ( t s ¯ ) ] ( γ p + β p | α p ( t s ¯ ) | 1 ε ) ,
where T 1 p is a positive preassigned time,
T ^ = T 1 , κ ˜ 1 0 , T 2 , 0 < κ ˜ 1 < min { n M 1 , β ˜ 1 } , T 3 , 0 < κ ˜ 1 < 2 n M 1 β ˜ 1 , ε = 2 .
The triggering condition is developed by
t s ¯ + 1 = inf { t : t t s ¯ , F p ( t ) > 0 } , F p ( t ) = A 1 p + | E p ( t ) | 1 T ^ T 1 p γ p + T ^ T 1 p M 1 p λ p ( t ) , λ ˙ p ( t ) = p λ p ( t ) T ^ T 1 p β p λ p ε ( t ) ,
where λ p ( t ) > 0 ,
E p ( t ) = T ^ T 1 p [ e p ( t s ¯ ) ] ( γ p + β p | e p ( t s ¯ ) | 1 ε ) T ^ T 1 p [ e p ( t ) ] ( γ p + β p | e p ( t ) | 1 ε ) .
Theorem 3.
Based on Assumption 1, the PETS of systems (1) and (3) is realized within the preassigned time T 1 p satisfying 0 < T 1 p T ^ under the control laws (23) and (24).
Proof. 
Construct the following Lyapunov function
V ^ ( t ) = V 1 ( t ) + V 3 ( t ) = p N | α p ( t ) | 1 + p N λ p ( t ) .
Similar to the proof of Theorem 1,
D + V 1 ( t ) p N ( d ˜ p + q N l p a ˜ q p ) | α p ( t ) | 1 T ^ T 1 p p N β p | α p ( t ) | 1 ε + p N ( A 1 p + | E p ( t ) | 1 T ^ T 1 p γ p ) p N ( d ˜ p + q N l p a ˜ q p ) | α p ( t ) | 1 T ^ T 1 p p N β p | α p ( t ) | 1 ε T ^ T 1 p n M 1 κ ˜ 1 p N | α p ( t ) | 1 T ^ T 1 p p N β p | α p ( t ) | 1 ε T ^ T 1 p n M 1 .
when κ ˜ 1 0 ,
D + V ^ ( t ) T ^ T 1 p β ˜ 1 ( V ( t ) ) ε n M 1 .
In view of Lemma 2, the QVFMNNs (1) and (3) are preassigned-time synchronized within the time T 1 p .
When 0 < κ ˜ 1 < min { n M 1 , β ˜ 1 } ,
D + V ^ ( t ) T ^ T 1 p κ ˜ 1 V ( t ) β ˜ 1 ( V ( t ) ) ε n M 1 .
The QVFMNNs (1) and (3) can realize PETS within the time T 1 p . In particular, when 0 < κ ˜ 1 < 2 n M 1 β ˜ 1 , the PETS of QVFMNNs (1) and (3) is achieved within the time T 1 p . □
The PETS of QVMNNs (14) and (15) will be analyzed below. To achieve this aim, the controller is proposed by
u ^ p ( t ) = T ¯ ^ T ^ 1 p [ α p ( t s ¯ ^ ) ] ( γ ^ p + β ^ p | α p ( t s ¯ ^ ) | 1 ε ^ ) , t [ t s ¯ ^ , t s ¯ ^ + 1 ) ,
where T ^ 1 p is a positive preassigned time,
T ¯ ^ = T ^ 1 , κ ˜ 1 0 , T ^ 2 , 0 < κ ˜ 1 < min { n M ^ 1 , β ˜ 2 } , T ^ 3 , 0 < κ ˜ 1 < 2 n M ^ 1 β ˜ 2 , ε ^ = 2 .
The triggering condition is developed by
t s ¯ ^ + 1 = inf { t : t t s ¯ ^ , F ^ p ( t ) > 0 } , F ^ p ( t ) = A 2 p + | E ^ p ( t ) | 1 T ¯ ^ T ^ 1 p γ ^ p + M ^ 1 ^ p λ ^ p ( t ) , λ ^ ˙ p ( t ) = ^ p λ ^ p ( t ) T ¯ ^ T ^ 1 p β ^ p λ ^ p ε ^ ( t ) ,
where λ ^ p ( t ) > 0 ,
E ^ p ( t ) = T ¯ ^ T ^ 1 p [ α p ( t s ¯ ^ ) ] ( γ ^ p + β ^ p | α p ( t s ¯ ^ ) | 1 ε ^ ) T ¯ ^ T ^ 1 p [ α p ( t ) ] ( γ ^ p + β ^ p | α p ( t ) | 1 ε ^ ) .
Corollary 3.
Based on Assumption 1, the PETS of networks (14) and (15) is realized within the preassigned time T ^ 1 p satisfying 0 < T ^ 1 p T ¯ ^ under the control laws (25) and (26).
In order to achieve the PETS of QVFNNs (18) and (19), the controller is designed by
u ˇ p ( t ) = T ¯ ˇ T ˇ 1 p [ α p ( t s ¯ ˇ ) ] ( γ ˇ p + β ˇ p | α p ( t s ¯ ˇ ) | 1 ε ˇ ) , t [ t s ¯ ˇ , t s ¯ ˇ + 1 ) ,
where T ˇ 1 p is a positive preassigned time,
T ¯ ˇ = T ˇ 1 , κ ˜ 1 0 , T ˇ 2 , 0 < κ ˜ 1 < min { n M ˇ 1 , β ˜ 3 } , T ˇ 3 , 0 < κ ˜ 1 < 2 n M ˇ 1 β ˜ 3 , ε ˇ = 2 .
The triggering condition is developed by
t s ¯ ˇ + 1 = inf { t : t t s ¯ ˇ , F ˇ p ( t ) > 0 } , F ˇ p ( t ) = A 3 p + | E ˇ p ( t ) | 1 T ¯ ˇ T ˇ 1 p γ ˇ p + M ˇ 1 ˇ p λ ˇ p ( t ) , λ ˇ ˙ p ( t ) = ˇ p λ ˇ p ( t ) T ˇ T ˇ 1 p β ˇ p λ ˇ p ε ˇ ( t ) ,
where λ ˇ p ( t ) > 0 , and the measure error E ˇ p ( t ) is defined by
E ˇ p ( t ) = T ˇ T ˇ 1 p [ α p ( t s ¯ ˇ ) ] ( γ ˇ p + β ˇ p | α p ( t s ¯ ˇ ) | 1 ε ˇ ) T ˇ T ˇ 1 p [ α p ( t ) ] ( γ ˇ p + β ˇ p | α p ( t ) | 1 ε ˇ ) .
Corollary 4.
Based on Assumption 1, the networks (18) and (19) are PETS within the preassigned time T ˇ 1 p satisfying 0 < T ˇ 1 p T ¯ ˇ under the control laws (27) and (28).
Remark 7.
Specifically, when the QVFMNNs (1) and (3) are simplified into real-valued [4] or complex-valued [29] NN models, the control strategies outlined in this paper can also be adapted for use with real or complex-variable control laws. Additionally, the synchronization conditions established herein are applicable to systems with either real or complex variables.
Remark 8.
In [22], the authors addressed the challenges of higher-dimensional data by proposing a criterion for achieving FITS in octonion-valued neural networks. Building upon the insight gained from these studies, our forthcoming research aims to explore the FITS and PETS of octonion-valued neural networks by adaptive event-triggered control.
Remark 9.
Take Theorem 1 as an example, the following steps (Table 1) can be used to achieve FITS of (1) and (3).

4. Numerical Simulations

In this section, three numerical examples are presented to verify the above theoretical results.
Example 1.
Consider the following QVFMNN with two neurons
w ˙ p ( t ) = d p ( w p ( t ) ) w p ( t ) + q = 1 , 2 a p q ( w p ( t ) ) f q ( w q ( t ) ) + q = 1 , 2 b p q ( w p ( t ) ) g q ( w q ( m p q ( t ) ) ) + q = 1 , 2 θ p q g q ( w q ( m p q ( t ) ) ) + q = 1 , 2 c p q η q + q = 1 , 2 σ p q g q ( w q ( m p q ( t ) ) ) + q = 1 , 2 ϕ p q η q + q = 1 , 2 ψ p q η q + ξ p , p = 1 , 2 ,
where w p ( t ) Q , f q ( x ) = 0.82 tanh ( x R ) + i 0.82 sin ( x I ) + j 0.82 tanh ( x J ) + k 0.82 sin ( x K ) , g q ( x ) = 0.88 sin ( x R ) + i 0.88 sin ( x I ) + j 0.88 sin ( x J ) + k 0.88 sin ( x K ) , m p q ( t ) = t e t 1 + e t , θ 11 = 0.5 , θ 12 = 0.4 , θ 21 = 0.2 , θ 22 = 0.6 , σ 11 = 0.2 , σ 12 = 0.3 , σ 21 = 0.7 , σ 22 = 0.5 , η 1 = 1 , η 2 = 0.8 , ξ 1 = ξ 2 = 0 , and
( ϕ p q ) 2 × 2 = 0.8 2.0 i + 0.8 j 1.4 k 0.6 + 0.8 i + 0.6 j + 0.4 k 1.4 + 0.6 i + 1.6 j 1.8 k 1.3 1.5 i + 0.9 j 0.5 k ,
( ψ p q ) 2 × 2 = 0.6 1.0 i + 1.0 j 2.4 k 1.3 1.6 i + 1.3 j 1.8 k 0.8 1.2 i + 1.2 j 1.3 k 1.1 0.6 i + 1.4 j 0.6 k ,
and memristive weights are given as
d 1 x 1 ( t ) = 2.10 2.20 2.50 j 2.20 k , x 1 ( t ) 1 0.90 , 1.16 2.20 i 1.56 j 1.61 k , x 1 ( t ) 1 > 0.90 ,
d 2 x 2 ( t ) = 1.40 1.50 i 1.80 j 2.20 k , x 2 ( t ) 1 0.90 , 1.56 4.00 i 1.70 j 2.20 k , x 2 ( t ) 1 > 0.90 ,
a 11 x 1 ( t ) = 1.80 1.50 i 0.80 j 1.80 k , x 1 ( t ) 1 0.90 , 2.00 0.80 i + 0.40 j 0.70 k , x 1 ( t ) 1 > 0.90 ,
a 12 x 1 ( t ) = 0.60 + 0.90 i + 1.30 j 1.30 k , x 1 ( t ) 1 0.90 , 0.80 + 3.50 i 0.50 j 0.90 k , x 1 ( t ) 1 > 0.90 ,
a 21 x 2 ( t ) = 1.50 1.66 i 1.50 j 1.36 k , x 2 ( t ) 1 0.90 , 0.60 + 0.56 i 0.80 j 0.60 k , x 2 ( t ) 1 > 0.90 ,
a 22 x 2 ( t ) = 1.00 0.40 i 1.40 j + 0.50 k , x 2 ( t ) 1 0.90 , 1.50 2.00 i 0.35 j + 0.65 k , x 2 ( t ) 1 > 0.90 ,
b 11 x 1 ( t ) = 1.20 + 1.20 i 1.60 j 0.50 k , x 1 ( t ) 1 0.90 , 1.85 + 0.50 i 1.40 j + 0.50 k , x 1 ( t ) 1 > 0.90 ,
b 12 x 1 ( t ) = 1.30 0.50 i 1.50 j + 0.25 k , x 1 ( t ) 1 0.90 , 0.20 + 2.80 i 1.00 j + 0.69 k , x 1 ( t ) 1 > 0.90 ,
b 21 x 2 ( t ) = 1.90 2.30 i 1.60 j 1.45 k , x 2 ( t ) 1 0.90 , 1.20 0.80 i 1.80 j + 0.80 k , x 2 ( t ) 1 > 0.90 ,
b 22 x 2 ( t ) = 0.10 0.90 i + 1.20 j 0.50 k , x 2 ( t ) 1 0.90 , 0.20 1.00 i 0.80 j 0.55 k , x 2 ( t ) 1 > 0.90 .
Set x 1 ( s ) = 1.50 1.00 i 1.50 j 1.60 k and x 2 ( s ) = 1.80 + 1.50 i 2.00 j + 1.50 k as the initial conditions of (29), in which s [ 0.5 , 0 ) . Then, the chaotic behaviors of system (29) is shown in Figure 2, Figure 3, Figure 4 and Figure 5.
The response system of system (31) is described by
δ ˙ p ( t ) = d p ( δ p ( t ) ) δ p ( t ) + q = 1 , 2 a p q ( δ p ( t ) ) f q ( δ q ( t ) ) + q = 1 , 2 b p q ( δ p ( t ) ) g q ( δ q ( m p q ( t ) ) ) + q = 1 , 2 θ p q g q ( δ q ( m p q ( t ) ) ) + q = 1 , 2 c p q η q + q = 1 , 2 σ p q g q ( δ q ( m p q ( t ) ) ) + q = 1 , 2 ϕ p q η q + q = 1 , 2 ψ p q η q + ξ p + u p ( t ) , p = 1 , 2 .
Set δ 1 ( s ) = 1.90 1.80 i 1.30 j + 1.60 k and δ 2 ( s ) = 1.10 1.50 i 2.00 j 1.60 k as the initial conditions of (32), in which s [ 0.5 , 0 ) .
Firstly, to verify the FITS results of (29) and (30) based on event-triggered control mechanism (5) and (6), select γ 1 = 18 , γ 2 = 14 , β 1 = 5 , β 2 = 6 , ε = 1.2 , M 1 = 0.5 , 1 = 2 , 2 = 1.2 , λ 1 ( 0 ) = 20 , and λ 2 ( 0 ) = 15 . By means of Theorems 1 and 2, the QVFMNNs (29) and (30) can achieve FITS, and the settling time is estimated by T 1 = 1.7250 . The synchronization results are shown in Figure 6, Figure 7 and Figure 8.
In addition, choose T 1 p = 1.0 in (23). The PETS of QVFMNNs (31) and (32) can be realized within the preassigned time T 1 p according to Theorem 3, which is demonstrated in Figure 9 and Figure 10.
Remark 10.
In Figure 6, the trajectories of the FITS errors are shown, which are convergent within T 1 = 1.7250 in Theorem 1. The exclusion of Zeno behavior is demonstrated as shown in Figure 7. Similarly, Figure 8 and Figure 9 validate the prescribed-time synchronization results mentioned in Theorem 3. In addition, with identical parameter settings, the estimated ST is 2.3513. Clearly, the settling time estimation presented in this study is more precise. The relevant result is displayed in Table 2.
Example 2.
Consider the following QVMNN with two neurons
w ˙ p ( t ) = d p ( w p ( t ) ) w p ( t ) + q = 1 , 2 a p q ( w p ( t ) ) f q ( w q ( t ) ) + q = 1 , 2 b p q ( w p ( t ) ) g q ( w q ( m p q ( t ) ) ) + ξ p , p = 1 , 2 ,
where w p ( t ) Q , f q ( x ) = 0.82 tanh ( x R ) + i 0.82 sin ( x I ) + j 0.82 tanh ( x J ) + k 0.82 sin ( x K ) , g q ( x ) = 0.88 sin ( x R ) + i 0.88 sin ( x I ) + j 0.88 sin ( x J ) + k 0.88 sin ( x K ) , m p q ( t ) = t e t 1 + e t , ξ 1 = ξ 2 = 0 , and memristive weights are given as
d 1 x 1 ( t ) = 2.10 2.20 2.50 j 2.20 k , x 1 ( t ) 1 0.90 , 1.10 2.20 i 1.50 j 1.61 k , x 1 ( t ) 1 > 0.90 ,
d 2 x 2 ( t ) = 1.30 1.50 i 1.80 j 2.20 k , x 2 ( t ) 1 0.90 , 1.50 4.00 i 1.50 j 2.20 k , x 2 ( t ) 1 > 0.90 ,
a 11 x 1 ( t ) = 1.80 1.50 i 0.80 j 1.80 k , x 1 ( t ) 1 0.90 , 2.00 0.80 i + 1.40 j 0.70 k , x 1 ( t ) 1 > 0.90 ,
a 12 x 1 ( t ) = 0.50 + 0.90 i + 1.50 j 1.30 k , x 1 ( t ) 1 0.90 , 0.70 + 3.50 i 0.80 j 0.90 k , x 1 ( t ) 1 > 0.90 ,
a 21 x 2 ( t ) = 1.50 1.66 i 1.50 j 2.30 k , x 2 ( t ) 1 0.90 , 0.60 + 0.50 i 1.80 j 0.60 k , x 2 ( t ) 1 > 0.90 ,
a 22 x 2 ( t ) = 2.00 1.40 i 1.40 j + 0.50 k , x 2 ( t ) 1 0.90 , 1.50 2.00 i 1.30 j + 0.60 k , x 2 ( t ) 1 > 0.90 ,
b 11 x 1 ( t ) = 1.20 + 1.20 i 1.60 j 0.50 k , x 1 ( t ) 1 0.90 , 1.80 + 0.50 i 1.40 j + 0.50 k , x 1 ( t ) 1 > 0.90 ,
b 12 x 1 ( t ) = 1.30 1.50 i 1.50 j + 0.25 k , x 1 ( t ) 1 0.90 , 0.20 + 2.80 i 1.20 j + 0.40 k , x 1 ( t ) 1 > 0.90 ,
b 21 x 2 ( t ) = 1.90 2.30 i 1.60 j 1.45 k , x 2 ( t ) 1 0.90 , 1.20 0.80 i 1.80 j + 0.80 k , x 2 ( t ) 1 > 0.90 ,
b 22 x 2 ( t ) = 0.15 0.90 i + 1.20 j 0.50 k , x 2 ( t ) 1 0.90 , 1.20 1.00 i 1.80 j 0.50 k , x 2 ( t ) 1 > 0.90 .
Set x 1 ( s ) = 1.80 1.20 i 0.50 j 1.60 k and x 2 ( s ) = 0.80 + 1.20 i 2.00 j + 1.50 k as the initial conditions of (31), in which s [ 0.5 , 0 ) . Then, the chaotic behaviors of system (31) is shown in Figure 11, Figure 12, Figure 13 and Figure 14.
The response system of system (31) is described by
δ ˙ p ( t ) = d p ( δ p ( t ) ) δ p ( t ) + q = 1 , 2 a p q ( δ p ( t ) ) f q ( δ q ( t ) ) + q = 1 , 2 b p q ( δ p ( t ) ) g q ( δ q ( m p q ( t ) ) ) + ξ p + u p ( t ) , p = 1 , 2 .
Set δ 1 ( s ) = 1.90 2.80 i 2.30 j + 1.60 k and δ 2 ( s ) = 1.00 2.50 i 2.00 j 2.60 k as the initial conditions of (32), in which s [ 0.5 , 0 ) .
Firstly, the FITS results of (31) and (32) based on event-triggered control mechanism (16) and (17) are verified, select γ ^ 1 = 10 , γ ^ 2 = 12 , β ^ 1 = 4 , β ^ 2 = 5 , ε ^ = 1.3 , M ^ 1 = 0.6 , ^ 1 = 3 , ^ 2 = 2 , λ ^ 1 ( 0 ) = 12 , and λ ^ 2 ( 0 ) = 14 . Based on Corollary 1, the QVMNNs (31) and (32) can achieve FITS, and the settling time is estimated by T ^ 1 = 1.4634 . The synchronization results are shown in Figure 15, Figure 16 and Figure 17.
Furthermore, choose T ^ 1 p = 1.2 in (25). The PETS of QVMNNs (31) and (32) can be realized within the preassigned time T ^ 1 p = 1.2 according to Corollary 3, which are demonstrated in Figure 18 and Figure 19.

5. Conclusions

In this paper, under the framework of a direct analysis approach, the synchronization of delayed QVNNs including fuzzy term and memristive were investigated in a fixed time and preassigned time, respectively. Firstly, unlike the existing quaternion-valued fuzzy rules [28,40,41,42], a new fuzzy rule was proposed in the quaternion field, and the some important properties were established. Furthermore, several dynamic event-triggering protocols were designed to ensure FITS and PETS, and the established synchronization criteria were more concise than the existing separation results. Lastly, the effectiveness and applicability of the main results of this paper were verified by two numerical examples.
Note that the finite-time and FITS of the second-order NNs have been explored by means of reduced-order variable substitution techniques. Nevertheless, there seems to be few related works to discussed the FITS and PETS of QVMNNs with delay by using direct analytical method and a dynamic event-triggering approach. The challenging problem will be addressed in our future work.

Author Contributions

Methodology, S.J.; Software, H.J.; Investigation, C.H.; Writing—original draft, S.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

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

R R = ( , + )
Q The quaternion set
R n The n-dimensional real number vector set
Q n The n-dimensional quaternion number vector set
N N = { 1 , 2 , n }
ϰ ϰ = { R , I , J , K }
| w | 1 | w | 1 = | w R | + | w I | + | w J | + | w K | ,
for any w = w R + i w I + j w J + k w K Q
a ϰ ( w ) The left limit of discontinuous function a ( · ) : Q Q
at point w Q
a ϰ + ( w ) The right limit of discontinuous function a ( · ) : Q Q
at point w Q
a ϰ ( w ) The minimum of a ϰ ( w )
a ´ ϰ ( w ) The maximum of a ϰ + ( w )
c o ¯ [ a ( w ) ] c o ¯ [ a ( w ) ] = c o ¯ [ a R ( w ) ] + c o ¯ [ a I ( w ) ] i + c o ¯ [ a J ( w ) ] j
+ c o ¯ [ a K ( w ) ] k , in which c o ¯ [ a R ( w ) ] = [ a ´ R ( w ) , a R ( w ) ]
c o ¯ [ a I ( w ) ] = [ a ´ I ( w ) , a I ( w ) ] , c o ¯ [ a J ( w ) ] = [ a ´ J ( w ) , a J ( w ) ] ,
c o ¯ [ a K ( w ) ] = [ a ´ K ( w ) , a K ( w ) ]

References

  1. Liu, F.; Meng, W.; Lu, R. Anti-synchronization of discrete-time fuzzy memristive neural networks via impulse sampled-data communication. IEEE Trans. Cybern. 2023, 53, 4122–4133. [Google Scholar] [CrossRef] [PubMed]
  2. Wei, H.; Li, R. Exponential synchronization control of reaction-diffusion fuzzy memristive neural networks: Hardy-Poincare inequality. IEEE Trans. Neural Netw. Learn. Syst. 2023; online ahead of print. [Google Scholar] [CrossRef]
  3. Gong, S.; Guo, Z.; Wen, S. Finite-time synchronization of T-S fuzzy memristive neural networks with time delay. Fuzzy Sets Syst. 2022, 459, 67–81. [Google Scholar] [CrossRef]
  4. Wang, L.; Li, H.; Hu, C.; Hu, J.; Wang, Q. Synchronization and settling-time estimation of fuzzy memristive neural networks with time-varying delays: Fixed-time and preassigned-time control. Fuzzy Sets Syst. 2023, 470, 108654. [Google Scholar] [CrossRef]
  5. Davila-Meza, E.; Bayro-Corrochano, E. Quaternion and split quaternion neural networks for low-light color image enhancement. IEEE Access 2023, 11, 108257–108280. [Google Scholar] [CrossRef]
  6. Frants, V.; Agaian, S.; Panetta, K. QSAM-Net: Rain streak removal by quaternion neural network with self-attention module. IEEE Trans. Multimed. 2023, 26, 789–798. [Google Scholar] [CrossRef]
  7. Ni, H.; Xie, S.; Xu, P.; Fang, X.; Sun, W.; Fang, R. QMGR-Net: Quaternion multi-graph reasoning network for 3D hand pose estimation. Int. J. Mach. Learn. Cybern. 2023, 14, 4029–4045. [Google Scholar] [CrossRef]
  8. Shi, Y.; Chen, X.; Zhu, P. Dissipativity for a class of quaternion-valued memristor-based neutral-type neural networks with time-varying delays. Math. Methods Appl. Sci. 2023, 46, 18166–18194. [Google Scholar] [CrossRef]
  9. Aouiti, C.; Touati, F. Global dissipativity of quaternion-valued fuzzy cellular fractional-order neural networks with time delays. Neural Process. Lett. 2022, 55, 481–503. [Google Scholar] [CrossRef]
  10. Chen, Y.; Xue, Y.; Yang, X.; Zhang, X. A direct analysis method to Lagrangian global exponential stability for quaternion memristive neural networks with mixed delays. Appl. Math. Comput. 2022, 439, 127633. [Google Scholar] [CrossRef]
  11. Liu, Y.; Zhang, D.; Lou, J.; Lu, J.; Cao, J. Stability analysis of quaternion-valued neural networks: Decomposition and direct approaches. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 4201–4211. [Google Scholar] [CrossRef]
  12. Liu, Y.; Zheng, Y.; Lu, J.; Cao, J.; Rutkowski, L. Constrained quaternion-variable convex optimization: A quaternion-valued recurrent neural network approach. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 1022–1035. [Google Scholar] [CrossRef]
  13. 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 Netw. 2023, 160, 108–121. [Google Scholar] [CrossRef] [PubMed]
  14. Shang, W.; Zhang, W.; Chen, D.; Cao, J. New criteria of finite time synchronization of fractional-order quaternion-valued neural networks with time delay. Appl. Math. Comput. 2022, 436, 127484. [Google Scholar] [CrossRef]
  15. Zhang, L.; Wei, R.; Cao, J.; Ding, X. Synchronization control of quaternion-valued inertial memristor-based neural networks via adaptive method. Math. Methods Appl. Sci. 2024, 47, 581–599. [Google Scholar] [CrossRef]
  16. Zhang, T.; Jian, J. Quantized intermittent control tactics for exponential synchronization of quaternion-valued memristive delayed neural networks. ISA Trans. 2021, 126, 288–299. [Google Scholar] [CrossRef] [PubMed]
  17. Lin, D.; Chen, X.; Yu, G.; Li, Z.; Xia, Y. Global exponential synchronization via nonlinear feedback control for delayed inertial memristor-based quaternion-valued neural networks with impulses. Appl. Math. Comput. 2021, 401, 126093. [Google Scholar] [CrossRef]
  18. Aouiti, C.; Jallouli, H. New feedback control techniques of quaternion fuzzy neuralnetworks with time-varying delay. Int. J. Robust Nonlinear Control 2021, 31, 2783–2809. [Google Scholar] [CrossRef]
  19. Wang, P.; Li, X.; Wang, N.; Li, Y.; Shi, K.; Lu, J. Almost periodic synchronization of quaternion-valued fuzzy cellular neural networks with leakage delays. Fuzzy Sets Syst. 2021, 426, 46–65. [Google Scholar] [CrossRef]
  20. Narayanan, G.; Ali, M.; Alam, M.; Rajchakit, G.; Boonsatit, N.; Kumar, P.; Hammachukiattikul, P. Adaptive fuzzy feedback controller design for finite-time mittag-leffler synchronization of fractional-order quaternion-valued reaction-diffusion fuzzy molecular modeling of delayed neural networks. IEEE Access 2021, 9, 130862–130883. [Google Scholar] [CrossRef]
  21. Tang, Q.; Qu, S.; Zheng, W.; Du, X.; Tu, Z. New fixed-time stability criterion and fixed-time synchronization of neural networks via non-chattering control. Neural Comput. Appl. 2022, 35, 6029–6041. [Google Scholar] [CrossRef]
  22. Chouhan, S.; Kumar, U.; Das, S.; Cao, J. Fixed time synchronization of octonion valued neural networks with time varying delays. Eng. Appl. Artif. Intell. 2022, 118, 105684. [Google Scholar] [CrossRef]
  23. Wang, D.; Li, L. Fixed-time synchronization of delayed memristive neural networks with impulsive effects via novel fixed-time stability theorem. Neural Netw. 2023, 163, 75–85. [Google Scholar] [CrossRef] [PubMed]
  24. Jia, T.; Chen, X.; Zhao, F.; Cao, J.; Qiu, J. Adaptive fixed-time synchronization of stochastic memristor-based neural networks with discontinuous activations and mixed delays. J. Frankl. Inst. 2022, 360, 3364–3388. [Google Scholar] [CrossRef]
  25. Hu, C.; He, H.; Jiang, H. Fixed/Preassigned-time synchronization of complex networks via improving fixed-yime stability. IEEE Trans. Cybern. 2021, 51, 2882–2892. [Google Scholar] [CrossRef]
  26. 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]
  27. 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]
  28. Pang, L.; Hu, C.; Yu, J.; Jiang, H. Fixed-time synchronization for fuzzy-based impulsive complex networks. Mathematics 2022, 9, 1533. [Google Scholar] [CrossRef]
  29. 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 Netw. 2023, 169, 520–531. [Google Scholar] [CrossRef] [PubMed]
  30. Zhou, X.; Cao, J.; Wang, X. Predefined-time synchronization of coupled neural networks with switching parameters and disturbed by Brownian motion. Neural Netw. 2023, 160, 97–107. [Google Scholar] [CrossRef]
  31. Yuan, J.; Zhang, C.; Chen, T. Command filtered adaptive neural network synchronization control of nonlinear stochastic systems with Lévy noise via event-triggered mechanism. IEEE Access 2021, 9, 146195–146202. [Google Scholar] [CrossRef]
  32. Yao, W.; Wang, C.; Sun, Y.; Gong, S.; Lin, H. Event-triggered control for robust exponential synchronization of inertial memristive neural networks under parameter disturbance. Neural Netw. 2023, 164, 67–80. [Google Scholar] [CrossRef] [PubMed]
  33. Bao, Y.; Zhang, Y.; Zhang, B. Fixed-time synchronization of coupled memristive neural networks via event-triggered control. Appl. Math. Comput. 2021, 411, 126542. [Google Scholar] [CrossRef]
  34. Zhu, S.; Bao, H. Event-triggered synchronization of coupled memristive neural networks. Appl. Math. Comput. 2022, 415, 126715. [Google Scholar] [CrossRef]
  35. Ge, C.; Liu, X.; Liu, Y.; Hua, C. Event-triggered exponential synchronization of the switched neural networks with frequent asynchronism. IEEE Trans. Neural Netw. Learn. Syst. 2024, 35, 1750–1760. [Google Scholar] [CrossRef] [PubMed]
  36. Guo, H.; Liu, J.; Ahn, C.; Wu, Y.; Li, W. Dynamic event-triggered impulsive control for stochastic nonlinear systems with extension in complex networks. IEEE Trans. Circuits Syst. I Regul. Pap. 2022, 69, 2167–2178. [Google Scholar] [CrossRef]
  37. Sun, J.; Wang, Y.; Wu, Y.; Zhou, Y.; Liu, J. Dynamic event-triggered control for fixed-time synchronization of Kuramoto-Oscillator networks with and without a pacemaker. Intell. Control Appl. 2023, 111, 10147–10162. [Google Scholar] [CrossRef]
  38. Ge, C.; Chang, C.; Liu, Y.; Hua, C. Dynamic event-triggered exponential synchronization for neural networks with random controller gain perturbations. Int. J. Control Autom. Syst. 2023, 21, 2927–2937. [Google Scholar] [CrossRef]
  39. 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. [Google Scholar] [CrossRef]
  40. 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]
  41. Li, R.; Gao, X.; Cao, J. Quasi-state estimation and quasi-synchronization control of quaternion-valued fractional-order fuzzy memristive neural networks: Vector ordering approach. Appl. Math. Comput. 2019, 362, 124572. [Google Scholar] [CrossRef]
  42. Li, R.; Cao, J.; Li, N. Quasi-synchronization control of quaternion-valued fuzzy memristive neural networks. Fuzzy Sets Syst. 2023, 472, 108701. [Google Scholar] [CrossRef]
  43. Zhang, Z.; Wang, S.; Wang, X.; Wang, Z.; Lin, C. Event-triggered synchronization for delayed quaternion-valued inertial fuzzy neural networks via nonreduced order approach. IEEE Trans. Fuzzy Syst. 2023, 31, 3000–3014. [Google Scholar] [CrossRef]
  44. Wei, R.; Cao, J. Synchronization control of quaternion-valued memristive neural networks with and without event-triggered scheme. Cogn. Neurodyn. 2019, 13, 489–502. [Google Scholar] [CrossRef] [PubMed]
  45. Clarke, F. Optimization and Nonsmooth Analysis; Wiley: New York, NY, USA, 1983. [Google Scholar]
  46. Filippov, A. Differential Equations with Discontinuous Right-Hand Sides; Kluwer: Boston, MA, USA, 1988. [Google Scholar]
  47. Huang, L.; Guo, Z.; Wang, J. Theory and Applications of Differential Equations with Discontinuous Right-Hand Sides; Science Press: Beijing, China, 2011. [Google Scholar]
  48. Aubin, J.; Frankowska, H. Set-Valued Analysis; Birkhäuser: Boston, MA, USA, 1990. [Google Scholar]
  49. 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]
Figure 1. Structure of FMQVNNs with event-triggered control mechanism.
Figure 1. Structure of FMQVNNs with event-triggered control mechanism.
Mathematics 12 01276 g001
Figure 2. Chaotic behaviors of x 1 R ( t ) and x 2 R ( t ) .
Figure 2. Chaotic behaviors of x 1 R ( t ) and x 2 R ( t ) .
Mathematics 12 01276 g002
Figure 3. Chaotic behaviors of x 1 I ( t ) and x 2 I ( t ) .
Figure 3. Chaotic behaviors of x 1 I ( t ) and x 2 I ( t ) .
Mathematics 12 01276 g003
Figure 4. Chaotic behaviors of x 1 J ( t ) and x 2 J ( t ) .
Figure 4. Chaotic behaviors of x 1 J ( t ) and x 2 J ( t ) .
Mathematics 12 01276 g004
Figure 5. Chaotic behaviors of x 1 K ( t ) and x 2 K ( t ) .
Figure 5. Chaotic behaviors of x 1 K ( t ) and x 2 K ( t ) .
Mathematics 12 01276 g005
Figure 6. Synchronization errors of QVFMNNs (31) and (32) under controller (5).
Figure 6. Synchronization errors of QVFMNNs (31) and (32) under controller (5).
Mathematics 12 01276 g006
Figure 7. Triggering instants of each neuron.
Figure 7. Triggering instants of each neuron.
Mathematics 12 01276 g007
Figure 8. The dynamic evolution of λ r ( t ) .
Figure 8. The dynamic evolution of λ r ( t ) .
Mathematics 12 01276 g008
Figure 9. Synchronization errors of QVFMNNs (31) and (32) under controller (23).
Figure 9. Synchronization errors of QVFMNNs (31) and (32) under controller (23).
Mathematics 12 01276 g009
Figure 10. Triggering instants of each neuron.
Figure 10. Triggering instants of each neuron.
Mathematics 12 01276 g010
Figure 11. Chaotic behaviors of x 1 R ( t ) and x 2 R ( t ) .
Figure 11. Chaotic behaviors of x 1 R ( t ) and x 2 R ( t ) .
Mathematics 12 01276 g011
Figure 12. Chaotic behaviors of x 1 I ( t ) and x 2 I ( t ) .
Figure 12. Chaotic behaviors of x 1 I ( t ) and x 2 I ( t ) .
Mathematics 12 01276 g012
Figure 13. Chaotic behaviors of x 1 J ( t ) and x 2 J ( t ) .
Figure 13. Chaotic behaviors of x 1 J ( t ) and x 2 J ( t ) .
Mathematics 12 01276 g013
Figure 14. Chaotic behaviors of x 1 K ( t ) and x 2 K ( t ) .
Figure 14. Chaotic behaviors of x 1 K ( t ) and x 2 K ( t ) .
Mathematics 12 01276 g014
Figure 15. Synchronization errors of QVFMNNs (31) and (32) under controller (16).
Figure 15. Synchronization errors of QVFMNNs (31) and (32) under controller (16).
Mathematics 12 01276 g015
Figure 16. Triggering instants of each neuron.
Figure 16. Triggering instants of each neuron.
Mathematics 12 01276 g016
Figure 17. The dynamic evolution of λ r ( t ) .
Figure 17. The dynamic evolution of λ r ( t ) .
Mathematics 12 01276 g017
Figure 18. Synchronization errors of QVFMNNs (31) and (32) under controller (25).
Figure 18. Synchronization errors of QVFMNNs (31) and (32) under controller (25).
Mathematics 12 01276 g018
Figure 19. Triggering instants of each neuron.
Figure 19. Triggering instants of each neuron.
Mathematics 12 01276 g019
Table 1. FITS control algorithm.
Table 1. FITS control algorithm.
Parameter Selection Steps in Theorem 1.
Step 1: the value of k ˜ 1 is calculated by using the parameters A 1 p , A 2 p , A 3 p , l p 1 and l ˜ p 1 .
Step 2: choose control parameters γ p , β p , p , M 1 and ε in the controller (5) and (6).
Step 3: estimate the setting time T 1 ( T 2 , T 3 ) .
Step 4: draw the simulation result of FITS.
Table 2. Comparison of settling-time estimation.
Table 2. Comparison of settling-time estimation.
( γ 1 , γ 2 , β 1 , β 2 , ϵ ) = (18, 14, 5, 6, 1.2)
 Refs. [22,24,33] Example 1
estimation of settling time 2.35131.7250
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 Fuzzy Memristive Fully Quaternion-Valued Neural Networks Based on Event-Triggered Control. Mathematics 2024, 12, 1276. https://doi.org/10.3390/math12091276

AMA Style

Jia S, Hu C, Jiang H. Fixed/Preassigned-Time Synchronization of Fuzzy Memristive Fully Quaternion-Valued Neural Networks Based on Event-Triggered Control. Mathematics. 2024; 12(9):1276. https://doi.org/10.3390/math12091276

Chicago/Turabian Style

Jia, Shichao, Cheng Hu, and Haijun Jiang. 2024. "Fixed/Preassigned-Time Synchronization of Fuzzy Memristive Fully Quaternion-Valued Neural Networks Based on Event-Triggered Control" Mathematics 12, no. 9: 1276. https://doi.org/10.3390/math12091276

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