Next Article in Journal
Design, Control, and Testing of a Multifunctional Soft Robotic Gripper
Next Article in Special Issue
Fault Diagnosis of Rolling Element Bearing Based on BiTCN-Attention and OCSSA Mechanism
Previous Article in Journal
Dynamic Analysis and Equivalent Modeling for a Four-Axle Vehicle
Previous Article in Special Issue
Fixed-Time Congestion Control for a Class of Uncertain Multi-Bottleneck TCP/AWM Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Stability of Stochastic Coupled Networks with Time-Varying Coupling Under Intermittent Event-Triggered Control

1
School of Automation, Southeast University, Nanjing 210096, China
2
Polytechnic Institute, Zhejiang University, Hangzhou 310015, China
*
Author to whom correspondence should be addressed.
Actuators 2024, 13(12), 475; https://doi.org/10.3390/act13120475
Submission received: 20 September 2024 / Revised: 15 November 2024 / Accepted: 21 November 2024 / Published: 24 November 2024
(This article belongs to the Special Issue Intelligent Sensing, Control and Actuation in Networked Systems)

Abstract

:
This paper studies the exponential stability in the mean square of the stochastic complex networks with time-varying coupling under an intermittent dynamic event-triggered control. A dynamic term and an exponential function are introduced into the event-triggered mechanism to reduce the number of control updates. Simultaneously, the minimum inter-execution time for every sample path solution of the stochastic complex networks, independent mathematical expectation, is obtained. Unlike previous research, the event-triggered mechanism under the stochastic version is more reasonable due to the absence of mathematical expectations in the event-triggered function. Furthermore, using the average control rate for intermittent strategy and the Lyapunov method, sufficient conditions for exponential stability in the mean square under intermittent dynamic event-triggered control are derived. Finally, an example with numerical simulations is provided to validate the feasibility of the theoretical results.

1. Introduction

Complex networks have attracted a tremendous amount of attention due to their diverse applications in a variety of fields such as brain science, engineering, sociology and linguistics [1,2,3,4]. In practical systems, the connections between nodes in complex networks are more likely to exhibit time-varying characteristics instead of remaining static over time. For instance, in the field of brain science, brain networks can be described as complex networks with time-varying coupling, as the nodal activity and connectivity patterns of brain nodes change over time [5,6]. Similarly, in a power grid, when a local power system experiences severe faults, it is disconnected from the network, leading to time-varying links [7]. Hence, time-varying coupling should be considered when simulating practical systems. In fact, several scholars have contributed to the investigations of the dynamical behaviors of complex networks with time-varying coupling [8,9].
In conjunction with the advancement of network control, many scholars used different controls to investigate the dynamical behaviors of complex networks [10,11,12,13]. Control cost is an important factor to consider when designing a control strategy due to the limited communication and computational resources as well as energy. Compared with the continuous control strategies, intermittent control is more efficient and economical since it has control subintervals (work time) and rest subintervals (rest time). Apart from that, intermittent control can choose the control width. Therefore, it has good flexibility. Hence, rapidly growing research results about intermittent control have been reported in [14,15,16,17]. The above-mentioned papers considered the intermittent control based on continuous-time states during work time. When considering cost and efficiency, discrete-time states (time-triggered) are more practical and economical than continuous-time states. In view of this, intermittent control based on time-triggered control during the work time was proposed in [9] to discuss the synchronization of the stochastic complex networks. However, time-triggered control may result in redundant transmission. In addition, the current results mainly consider intermittent strategies based on the minimum time activation rate of intermittent control [18]. Therefore, further improvement of intermittent control is needed. To avoid redundant transmission caused by time-triggered control, event-triggered control has become interesting, and some relevant results have been published in [19,20,21,22,23,24,25,26,27,28].
However, most of the references above mainly considered event-triggered control for deterministic systems. In actuality, the stochastic interference factor is unavoidable. For example, signals transmitted through communication networks are inevitably subject to stochastic interference from the external environment, which may cause the loss of information contained in these signals [29]. Meanwhile, stochastic interference may result in the poor performance and instability of the complex networks with time-varying coupling. Therefore, it is necessary to consider stochastic interference factors when studying the stabilization of complex networks by event-triggered control. The existing results related to the stabilization problem for the stochastic systems can be seen in [30,31,32,33]. For example, in [30], event-triggered control was investigated for uncertain stochastic systems. In [31], Ma et al. investigated event-triggered control for Markovian jump systems. However, the proposed event-triggered controls were based on mathematical expectation in [30] and [31]. In [32,33], Gao et al. and Wang et al. obtained the minimum inter-execution time by taking the mathematical expectations of the state. From a practical standpoint, this approach may not be implemented because the state measured by the controller is a sample path rather than statistics. Moreover, the minimum inter-execution time of every sample path solution of stochastic systems is required for the event-triggered control. To avoid the aforementioned two limitations, in [34], Luo and Deng designed event-triggered control based on dynamic event-generator control for nonlinear stochastic systems. The obtained results can ensure the existence of the minimum inter-execution time in a more reasonable way by utilizing a time-regularization design framework.
Most existing work considers either intermittent control or event-triggered control in the stochastic case. Considering the advantages of both event-triggered control and intermittent control, it is necessary to introduce the event-triggered control mechanism into intermittent control. As a matter of fact, in [35], Hu et al. considered the consensus of multi-agent systems under deterministic case by designing intermittent event-triggered control. However, the method of obtaining the minimum inter-execution time proposed in [35] might not be utilized for stochastic complex networks since the solution to stochastic complex networks is a stochastic process. Compared with the static event-triggered control considered in [35], the dynamic term should be added to the event-triggered mechanism to reduce the number of control updates, thereby making further efforts to improve energy utilization efficiency.
Motivated by the aforementioned discussions, we extend intermittent static event-triggered control into intermittent dynamic event-triggered control for complex networks with time-varying coupling under stochastic cases and investigate the exponential stability in the mean square of the stochastic complex networks with time-varying coupling under this novel control in this paper. Furthermore, the event-triggered control in the paper actually requires that every sample path solution of the system has a minimum inter-execution time. Meanwhile, the event-triggered condition designed in this paper is dependent on the topology structure of the stochastic complex networks. In addition, this article adopts the average control rate of intermittent strategy instead of the minimum time activation rate. What is more, based on the Lyapunov method and graph theory, some sufficient conditions with regard to the exponential stability in the mean square of the stochastic complex networks with time-varying coupling are established. Compared with relevant papers, the main contributions are as follows: (1) Unlike [17], an intermittent dynamic event-triggered control is developed where a dynamic term is added to the event-triggered condition to reduce the number of control updates. Moreover, an exponential function is added to the controller to better approximate the state of the stochastic complex networks with time-varying coupling, which can lower the error part and therefore reduce the number of control updates. Moreover, the average control rate of the intermittent strategy is proposed, which weakens the limitations of the intermittent strategy. (2) Compared with [19,22,23,25,26,28,30,31], the minimum inter-execution time of intermittent dynamic event-triggered control independent of mathematical expectation is guaranteed under the stochastic case, which is more reasonable. Meanwhile, the minimum inter-execution time has close relationship with the parameters of the stochastic complex networks with time-varying coupling. Moreover, the minimum inter-execution time can be estimated by the unique solution to Equation (3)). Unlike the results of existing intermittent strategies [15,17,18], this paper adopts the average control rate of intermittent strategies. We found that the larger the control rate of the intermittent strategy, the easier it is to satisfy the conditions of the theorem. Therefore, the results obtained in this article have less conservatism because the average control rate is greater than the minimum activation time rate.
The rest of this paper will be arranged as follows: We will begin with some notations and model formulation in Section 2. Then, the  exponential stability analysis for stochastic complex networks will be shown in Section 3. Next, in Section 4, we give an application and numerical simulations. Finally, the conclusions are given in Section 5.

2. Notations and Model Formulation

2.1. Notations

Let Z = { 0 , 1 , 2 , } , R + = [ 0 , + ) , and  N = { 1 , 2 , , n } . For  x R , | | x | | denotes the Euclidean norm of x. Moreover, let ( Ω , F , { F t } t 0 , P ) be a complete probability space with the filtration { F t } t 0 satisfying the usual conditions if it is right continuous and F 0 contains all P -null sets, and  E ( · ) is the mathematical expectation with regard to the given probability measure P . In addition, B ( t ) represents one-dimensional normal Brownian motion defined on the above probability space.
A digraph G = ( N , E ( t ) ) is made up of a set N of nodes and a set E ( t ) of edges ( i , j ) . For a weighed digraph G , each edge ( j , i ) is assigned a nonzero weight r i j ( t ) . And we define the weight matrix as r ( t ) = ( r i j ( t ) ) n × n . Meanwhile, the connecting edge ( j , i ) exists in G if and only if r i j ( t ) > 0 . If for any pair of distinct nodes of digraph G , there is a directed path from one to the other, then the digraph is strongly connected. Furthermore, the Laplacian matrix of digraph ( G , r ( t ) ) is defined as L ( t ) = ( p i j ( t ) ) n × n , where p i j ( t ) = r i j ( t ) for i j , and  p i i ( t ) = j i r i j ( t ) .

2.2. Model Formulation

In this paper, we focus on a stochastic complex networks with time-varying coupling as follows:
d y i ( t ) = f i ( y i ( t ) , t ) + j = 1 n d i j ( t ) h i j ( y i ( t ) , y j ( t ) ) d t + k i ( y i ( t ) , t ) d B ( t ) , i N ,
where y i ( t ) = ( y i 1 ( t ) , y i 2 ( t ) , , y i m ( t ) ) T R m , h i j : R m × R m R m is a coupling function, f i : R m × R + R m represents the internal dynamic behaviors of the ith node, and k i : R m × R + R m denotes the stochastic interference intensity. Suppose that d i j ( t ) is bounded, that is, d i j ( t ) d i j , where d i j > 0 .
To make system (1) stable, the following intermittent dynamic event-triggered control strategy is proposed:
u i ( t ) = b i y i ( t l , k ) exp { a i ( t t l , k ) } , t I l , k I l , 0 , t S l ,
where I l , k = [ t l , k , t l , k + 1 ) , I l = [ t l , s l ) , S l = [ s l , t l + 1 ) , a i , b i are positive constants, l , k Z , [ t l , s l ) denotes the work time, and [ s l , t l + 1 ) represents the rest time. The event-triggered time sequences { t l , k } are determined by the following equation:
t l , k + 1 = inf t > t l , k + τ | η i = 1 n c i ( t ) | | e i ( t ) | | 2 δ i = 1 n c i ( t ) | | y i ( t ) | | 2 > θ ( t ) ,
where parameters η > 0 , δ > 0 , τ > 0 , e i ( t ) = exp { a i ( t t l , k ) } y i ( t l , k ) y i ( t ) , and c i ( t ) is a cofactor of the ith diagonal element of the Laplacian matrix of the strongly connected digraph ( G , r ( t ) ) , where r ( t ) = ( r i j ( t ) ) n × n , r i j ( t ) = max { d i j ( t ) b i j , d i j 2 ( t ) b i j 2 } . Suppose t l , 0 = t l and the dynamic term θ ( t ) is given as follows:
θ ˙ ( t ) = ξ 1 θ ( t ) , t I l , k , τ I l , ξ 1 θ ( t ) i = 1 n c i ( t ) | | e i ( t ) | | 2 + δ i = 1 n c i ( t ) | | y i ( t ) | | 2 , t I l , k , τ c I l , 0 , t S l ,
where I l , k , τ = [ t l , k , t l , k + τ ) , I l , k , τ c = [ t l , k + τ , t l , k + 1 ) , parameter ξ 1 > 0 , and  θ ( 0 ) > 0 .
Now, system (1) with intermittent dynamic event-triggered control (2) is rewritten by
d y i ( t ) = f i ( y i ( t ) , t ) + j = 1 n d i j ( t ) h i j ( y i ( t ) , y j ( t ) ) b i y i ( t l , k ) exp { a i ( t t l , k ) } d t + k i ( y i ( t ) , t ) d B ( t ) , t I l , k I l , d y i ( t ) = f i ( y i ( t ) , t ) + j = 1 n d i j ( t ) h i j ( y i ( t ) , y j ( t ) ) d t + k i ( y i ( t ) , t ) d B ( t ) , t S l .
Next, we present three assumptions and a definition.
Assumption 1. 
There exist α i 1 > 0 , α i 2 > 0 , and  b i j > 0 such that
| | f i ( y i , t ) | | α i 1 | | y i | | , | | k i ( y i , t ) | | α i 2 | | y i | | ,
and
| | h i j ( y i , y j ) | | b i j ( | | y i | | + | | y j | | ) ,
for any y i , y j R m .
In this article, the functions f i , k i , and h i j in the system (1) satisfy the inequalities in Assumption 1. In fact, Assumption 1 and the local Lipschitz condition are important for ensuring a unique solution to system (1) based on [36].
Assumption 2. 
Assuming a digraph ( G , r ( t ) ) is strongly connected, the cofactor c i ( t ) of the ith diagonal element of the Laplacian matrix of the strongly connected digraph ( G , r ( t ) ) satisfies
c ̲ i c i ( t ) c ¯ i , c i ( t ) c i ,
where c ¯ i , c ̲ i , c i are positive constants and  c i ( t ) represents the derivative of cofactor c i ( t ) .
For the intermittent strategy, we make the following assumption:
Assumption 3 
(see [37]). For the intermittent strategy, there are ϑ ( 0 , 1 ) and T 0 0 such that
T c o n ( t 1 , t 2 ) ϑ ( t 1 t 2 ) T 0 , t 1 > t 2 0 ,
in which T c o n ( t 1 , t 2 ) stands for the total control interval length on [ t 2 , t 1 ) , ϑ represents the average control rate, and  T 0 is called the elasticity number.
In Assumption 3, ϑ is an average control rate, which can be calculated by ϑ = l = 0 s l t l / l = 0 t l + 1 t l .
Definition 1. 
System (1) reaches the exponential stability in the mean square under intermittent dynamic event-triggered control (2) if there are constants M 0 > 0 and γ > 0 such that
E | | y ( t ) | | 2 M 0 exp { γ t } , t 0 ,
where y ( t ) = ( y 1 T ( t ) , y 2 T ( t ) , , y n T ( t ) ) T R n m is the state solution of system (5).
We can see from Definition 1 that the system (5) can achieve not only exponential convergence but also asymptotic convergence. If system (5) is exponentially convergent, it can achieve asymptotic convergence. But, if the system is asymptotically convergent, it is difficult to achieve exponential convergence.

3. Exponential Stability Analysis for Stochastic Complex Networks

This section gives the exponential stability in the mean square of the stochastic complex networks with time-varying coupling. Before proposing the exponential stability result, an important lemma is presented.
For the convenience of the following lemma description, we make the following notations. Let c 1 ˜ = c ¯ c ̲ and c 2 ˜ = c ̲ c ¯ with c ¯ = max i N { c i ¯ } , c ̲ = min i N { c i ̲ } . In addition, set Z 1 ( τ ) = c 1 ˜ β 1 exp { c 1 ˜ β 2 τ } , where β 1 = max i N { β i 1 } with β i 1 = τ 6 τ ( b i a i ) 2 + 2 ( 6 τ α i 1 2 + 2 α i 2 2 ) + 48 τ M c ¯ c ̲ j = 1 n r i j , and β 2 = max i N { β i 2 } with β i 2 = 2 ( 6 τ α i 1 2 + 2 α i 2 2 ) + 48 τ 2 M c ¯ c ̲ j = 1 n r i j . And let Z 2 ( τ ) = b κ ( exp { κ τ } 1 ) c 2 ˜ + c 2 ˜ exp { κ τ } with κ = max i M 2 α i 1 + α i 2 2 + b i + 4 j = 1 n r i j + c i c i ̲ and b = min i N { b i } .
Lemma 1. 
Let Assumptions 1 and 2 hold. For each t [ t l , k , t l , k + τ ) , the following estimations are obtained:
E i = 1 n c i ( t ) | | x i ( t ) | | 2 Z 2 ( τ ) E i = 1 n c i ( t ) | | y i ( t l , k ) | | 2 , E i = 1 n c i ( t ) | | e i ( t ) | | 2 Z 1 ( τ ) E i = 1 n c i ( t ) | | y i ( t l , k ) | | 2 ,
where c i ( t ) is cofactor of the ith diagonal element of the Laplacian matrix of the strongly connected digraph ( G , r ( t ) ) , and  the event-triggered time sequences { t l , k } are given in (3).
Proof. 
According to system (5), when t I l , k , τ , we can find
d e i ( t ) = ( f i ( y i ( t ) , t ) j = 1 n d i j ( t ) h i j ( y i ( t ) , y j ( t ) ) a i exp { a i ( t t l , k ) } y i ( t l , k ) + b i exp { a i ( t t l , k ) } y i ( t l , k ) ) d t k i ( y i ( t ) , t ) d B ( t ) .
Therefore, based on Assumption 2, we can prove that  
E ( | | e i ( t ) | | 2 | F t l , k ) E ( 2 τ t l , k t ( 3 ( b i a i ) 2 exp { 2 a i ( s t l , k ) } | | y i ( t l , k ) | | 2 + 3 | | f i ( y i ( s ) , s ) | | 2 + 3 M j = 1 n d i j 2 ( s ) | | h i j ( y i ( s ) , y j ( s ) ) | | 2 ) d s + 2 t l , k t | | k i ( y i ( s ) , s ) | | 2 d s | F t l , k ) E ( t l , k t ( 6 τ ( b i a i ) 2 | | y i ( t l , k ) | | 2 + 6 τ α i 1 2 | | y i ( s ) | | 2 + 6 τ M j = 1 n d i j 2 ( s ) b i j 2 ( | | y i ( s ) | | + | | y j ( s ) | | ) 2 + 2 α i 2 2 | | y i ( s ) | | 2 ) d s | F t l , k ) t l , k t ( ( 6 τ ( b i a i ) 2 | | y i ( t l , k ) | | 2 + ( 6 τ α i 1 2 + 2 α i 2 2 ) E | | y i ( s ) | | 2 + 12 τ M j = 1 n d i j 2 ( s ) b i j 2 ( E | | y i ( s ) | | 2 + E | | y j ( s ) | | 2 ) ) | F t l , k ) d s .
Making use of the elementary inequality, we can easily find that | | y i ( s ) | | 2 2 | | e i ( s ) | | 2 + 2 | | y i ( t l , k ) | | 2 , which further implies that
E ( | | e i ( t ) | | 2 | F t l , k ) t l , k t ( 6 τ ( b i a i ) 2 + 2 ( 6 τ α i 1 2 + 2 α i 2 2 ) | | y i ( t l , k ) | | 2 + 2 ( 6 τ α i 1 2 + 2 α i 2 2 ) E | | e i ( s ) | | 2 + 12 τ M j = 1 n d i j 2 ( s ) b i j 2 ( E | | y i ( s ) | | 2 + E | | y j ( s ) | | 2 ) | F t l , k ) d s τ 6 τ ( b i a i ) 2 + 2 ( 6 τ α i 1 2 + 2 α i 2 2 ) | | y i ( t l , k ) | | 2 + t l , k t 2 ( 6 τ α i 1 2 + 2 α i 2 2 ) E ( | | e i ( s ) | | 2 | F t l , k ) d s + t l , k t 12 τ M E j = 1 n d i j 2 ( s ) b i j 2 ( | | y i ( s ) | | 2 + | | y j ( s ) | | 2 ) | F t l , k d s .
Based on (7), we can find that
i = 1 n c i ( t ) E ( | | e i ( t ) | | 2 | F t l , k ) i = 1 n c i ( t ) τ ( 6 τ ( b i a i ) 2 + 2 ( 6 τ α i 1 2 + 2 α i 2 2 ) ) | | y i ( t l , k ) | | 2 + t l , k t 2 i = 1 n c i ( 6 τ α i 1 2 + 2 α i 2 2 ) E ( | | e i ( s ) | | 2 | F t l , k ) d s + t l , k t 12 τ M c ¯ c ̲ E i = 1 n j = 1 n c i ( s ) r i j ( s ) ( | | y j ( s ) | | 2 | | y i ( s ) | | 2 ) | F t l , k d s + t l , k t 24 τ M c ¯ c ̲ E i = 1 n j = 1 n c i ( s ) r i j ( s ) | | y i ( s ) | | 2 | F t l , k d s i = 1 n c i τ 6 τ ( b i a i ) 2 + 2 ( 6 τ α i 1 2 + 2 α i 2 2 ) + 48 τ M c ¯ c ̲ j = 1 n r i j | | y i ( t l , k ) | | 2 + t l , k t i = 1 n c i [ 2 ( 6 τ α i 1 2 + 2 α i 2 2 ) + 48 τ 2 M c ¯ c ̲ j = 1 n r i j ] E ( | | e i ( s ) | | 2 | F t l , k ) d s + t l , k t 12 τ M c ¯ c ̲ E i = 1 n j = 1 n c i ( s ) r i j ( s ) ( | | y j ( s ) | | 2 | | y i ( s ) | | 2 ) | F t l , k d s .
According to Proposition 2.2 in [38], it is not difficult to find that
i = 1 n j = 1 n c i ( t ) r i j ( t ) ( | | y j ( t ) | | 2 | | y i ( t ) | | 2 ) = 0 .
Based on (9), we can find that
i = 1 n c i ( t ) E ( | | e i ( t ) | | 2 | F t l , k ) i = 1 n c i τ 6 τ ( b i a i ) 2 + 2 ( 6 τ α i 1 2 + 2 α i 2 2 ) + 48 τ M c ¯ c ̲ j = 1 n r i j | | y i ( t l , k ) | | 2 + t l , k t i = 1 n c i β i 2 E ( | | e i ( t ) | | 2 | F t l , k ) d s i = 1 n c i β i 1 | | y i ( t l , k ) | | 2 + t l , k t β 2 c ¯ c ̲ E i = 1 n c i ( s ) | | e i ( t ) | | 2 | F t l , k d s .
According to the Gronwall’s inequality, we have
E i = 1 n c i ( t ) | | e i ( t ) | | 2 | F t l , k c ˜ 1 β 1 i = 1 n c i ( t ) | | y i ( t l , k ) | | 2 exp { c ˜ 1 β 2 τ } = Z 1 ( τ ) i = 1 n c i ( t ) | | y i ( t l , k ) | | 2 .
Taking the mathematical expectation of both sides of inequality (11), we have
E i = 1 n c i | | e i ( t ) | | 2 Z 1 ( τ ) E i = 1 n c i ( t ) | | y i ( t l , k ) | | 2 .
On the other hand, if V i ( t ) = | | y i ( t ) | | 2 , we have
E ( V i ( t ) | F t l , k ) = V i ( t l , k ) + t l , k t E ( L V i ( s ) | F t l , k ) d s ,
where
L V i ( t ) = 2 y i T ( t ) ( f i ( y i ( t ) , t ) + j = 1 n d i j ( t ) h i j ( y i ( t ) , y j ( t ) ) b i y i ( t l , k ) exp { a i ( t t l , k ) } ) + | | k i ( y i ( t ) , t ) | | 2 2 α i 1 | | y i ( t ) | | 2 + b i | | y i ( t ) | | 2 + b i | | y i ( t l , k ) | | 2 + 3 j = 1 n d i j ( t ) b i j | | y i ( t ) | | 2 + j = 1 n d i j ( t ) b i j | | y j ( t ) | | 2 .
Therefore, we find that
d ( E V i ( t ) | F t l , k ) d t E ( ( ( 2 α i 1 + α i 2 2 + b i ) | | y i ( t ) | | 2 + b i | | y i ( t l , k ) | | 2 + 3 j = 1 n d i j ( t ) b i j | | y i ( t ) | | 2 + j = 1 n d i j ( t ) b i j | | y j ( t ) | | 2 ) | F t l , k ) .
Thus, we can derive that
d E i = 1 n c i ( t ) V i ( t ) | F t l , k d t E i = 1 n c i V i ( t ) | F t l , k + E ( i = 1 n c i ( t ) ( 2 α i 1 + α i 2 2 + b i + 4 j = 1 n r i j ) | | y i ( t ) | | 2 | F t l , k ) + i = 1 n c i ( t ) b i | | y i ( t l , k ) | | 2 + E i = 1 n j = 1 n c i ( t ) r i j ( t ) ( | | y j ( t ) | | 2 | | y i ( t ) | | 2 ) | F t l , k .
Based on (9), inequality (12) can be rewritten as
d E i = 1 n c i ( t ) V i ( t ) | F t l , k d t i = 1 n c i ( t ) b i | | y i ( t l , k ) | | 2 + E ( i = 1 n c i ( t ) ( 2 α i 1 + α i 2 2 + b i + 4 j = 1 n r i j + c i c i ̲ ) | | y i ( t ) | | 2 | F t l , k ) i = 1 n c i b i | | y i ( t l , k ) | | 2 E κ i = 1 n c i ( t ) V i ( t ) | F t l , k .
According to the comparison principle, we can find that
E i = 1 n c i ( t ) V i ( t ) | F t l , k 1 κ i = 1 n c i b i | | y i ( t l , k ) | | 2 ( exp { κ ( t t l , k ) } 1 ) i = 1 n c i ( t l , k ) | | y i ( t l , k ) | | 2 exp { κ ( t t l , k ) } .
Therefore, we can find that
E i = 1 n c i ( t ) | | y i ( t ) | | 2 | F t l , k 1 κ b ( exp { κ τ } 1 ) c 2 + c 2 exp { κ τ } i = 1 n c i ( t ) | | y i ( t l , k ) | | 2 .
Taking the mathematical expectation of both sides of (13), we obtain the estimates of two inequalities. The proof is completed.    □
Based on Lemma 1, the exponential stability in the mean square of system (1) with the intermittent dynamic event-triggered control strategy (2) is shown.
Let Λ 2 = min { ε 1 , Λ 1 } , where Λ 1 = min { γ , ξ 1 } and ε 1 = min ε ¯ 1 , ξ 1 b ˘ η with ε ¯ 1 = min i N b i δ b ˘ δ c i c i ̲ 2 α i 1 4 j = 1 n r i j α i 2 2 and b ˘ = max i N { b i } . And let Λ 3 = max i N { Λ 3 i } , where Λ 3 i = c i c ̲ i + 2 α i 1 + α i 2 2 + 4 j = 1 n r i j with r i j = max { d i j b i j , d i j 2 b i j 2 } .   ε 2 = min i N b i c i c ̲ i + 2 α i 1 + α i 2 2 + 4 j = 1 n r i j .
Theorem 1. 
Let Assumptions 1–3 hold. System (1) reaches exponential stability in the mean square under the intermittent dynamic event-triggered control strategy (2) if the following conditions are satisfied:
Λ 2 ϑ + Λ 3 ( 1 ϑ ) < 0 , 0 < τ < τ * ,
where τ * is the unique solution to the following equation:
( ε 2 γ ) Z 1 ( τ ) + b ˘ Z 2 ( τ ) = 0 ,
where γ > 0 , Z 1 ( τ ) and Z 2 ( τ ) are given in Lemma 1.
Proof. 
When t I l , k , τ , we can find that θ ˙ ( t ) = ξ 1 θ ( t ) , which yields
θ ( t ) = θ ( t l , k ) exp { ξ 1 ( t t l , k ) } .
On the one hand, when t I l , k , τ c , we have
θ ˙ ( t ) = ξ 1 θ ( t ) i = 1 n c i ( t ) | | e i ( t ) | | 2 + δ i = 1 n c i ( t ) | | y i ( t ) | | 2 .
Combined with (3), we can find that
θ ˙ ( t ) ξ 1 θ ( t ) 1 η θ ( t ) = ξ 1 + 1 η θ ( t ) .
Therefore, we have
θ ( t ) θ ( t l , k ) exp { ξ 1 τ } exp ξ 1 + 1 η ( t ( t l , k + τ ) ) θ ( t l , k ) exp { ξ 1 + 1 η ( t t l , k ) } .
Moreover, when t S l , we have θ ˙ ( t ) = 0 , which implies that
θ ( t ) = θ ( s l ) .
By combining (14) with (15), we can find that θ ( t ) > 0 .
Now, a Lyapunov function is constructed as V ( t ) = i = 1 n c i ( t ) | | y i ( t ) | | 2 + θ ( t ) . Hence, we can find
L V ( t ) = i = 1 n c i ( t ) | | y i ( t ) | | 2 + i = 1 n c i ( t ) [ 2 y i T ( t ) ( f i ( y i ( t ) , t ) + j = 1 n d i j ( t ) h i j ( y i ( t ) , y j ( t ) ) + u i ( t ) + | | k i ( y i ( t ) , t ) | | 2 ) ] + θ ˙ ( t ) i = 1 n c i ( t ) | | y i ( t ) | | 2 + i = 1 n c i ( t ) 2 α i 1 + α i 2 2 + 4 j = 1 n r i j ( t ) | | y i ( t ) | | 2 + i = 1 n j = 1 n c i ( t ) r i j ( t ) ( | | y j ( t ) | | 2 | | y i ( t ) | | 2 ) + 2 i = 1 n c i ( t ) y i T ( t ) u i ( t ) + θ ˙ ( t ) .
According to (9), inequality (16) is rewritten by
L V ( t ) i = 1 n c i | | y i ( t ) | | 2 + i = 1 n c i ( t ) 2 α i 1 + α i 2 2 + 4 j = 1 n r i j ( t ) | | y i ( t ) | | 2 + 2 i = 1 n c i ( t ) y i T ( t ) u i ( t ) + θ ˙ ( t ) .
When t I l , k I l , we have  
2 i = 1 n c i ( t ) y i T ( t ) u i ( t ) = 2 i = 1 n b i c i ( t ) y i T ( t ) y i ( t ) + 2 i = 1 n b i c i ( t ) y i T ( t ) y i ( t ) y i ( t l , k ) exp { a i ( t t l , k ) } i = 1 n b i c i ( t ) | | y i ( t ) | | 2 + i = 1 n b i c i ( t ) | | e i ( t ) | | 2 .
According to (3), for  t I l , k , τ c I k , it can be proven that
i = 1 n c i ( t ) | | e i ( t ) | | 2 δ i = 1 n c i ( t ) | | y i ( t ) | | 2 + 1 η θ ( t ) .
By substituting (19) into (18), it yields
2 i = 1 n c i ( t ) y i T ( t ) u i ( t ) i = 1 n c i ( t ) ( b i + δ b ˘ ) | | y i ( t ) | | 2 + b ˘ η θ ( t ) .
By inserting (20) into (17), we have
L V ( t ) i = 1 n c i ( t ) c i c i ̲ + 2 α i 1 + α i 2 2 + 4 j = 1 n r i j ( t ) b i + δ b ˘ | | y i ( t ) | | 2 + b ˘ η θ ( t ) + θ ˙ ( t ) .
When t [ t l , k + τ , t l , k + 1 ) , we can prove that
L V ( t ) i = 1 n c i ( t ) c i c i ̲ + 2 α i 1 + α i 2 2 + 4 j = 1 n r i j b i + δ b ˘ + δ | | y i ( t ) | | 2 ξ 1 b ˘ η θ ( t ) ε 1 V ( t ) .
For t I l , k , τ , by combining (16) with (18), it shows
L V ( t ) i = 1 n c i ( t ) c i c i ̲ + 2 α i 1 + α i 2 2 + 4 i = 1 n r i j b i | | y i ( t ) | | 2 + i = 1 n c i ( t ) b i | | e i ( t ) | | 2 ξ 1 θ ( t ) .
Based on Lemma 1 and taking the mathematical expectation of both sides of (23), we have
E L V ( t ) γ E i = 1 n c i ( t ) | | y i ( t ) | | 2 ( ε 2 γ ) Z 2 ( τ ) E i = 1 n c i ( t ) | | y i ( t l , k ) | | 2 + b ˘ Z 1 ( τ ) E i = 1 n c i ( t ) | | y i ( t l , k ) | | 2 ξ 1 E θ ( t ) γ E i = 1 n c i ( t ) | | y i ( t ) | | 2 ξ 1 E θ ( t ) Λ 1 E V ( t ) .
By combining (22) with (24), we can find that when t I l , k ,
E L V ( t ) min { ε 1 , Λ 1 } E V ( t ) = Λ 2 E V ( t ) .
When t S l , we have
L V ( t ) = i = 1 n c i ( t ) | | y i ( t ) | | 2 + i = 1 n c i ( t ) [ 2 y i T ( t ) ( f i ( y i ( t ) , t ) ) + j = 1 n d i j ( t ) h i j ( y i ( t ) , y j ( t ) ) + | | k i ( y i ( t ) , t ) | | 2 ] i = 1 n c i ( t ) | | y i ( t ) | | 2 + i = 1 n c i ( t ) 2 α i 1 + α i 2 2 + 4 j = 1 n r i j | | y i ( t ) | | 2 + i = 1 n j = 1 n c i ( t ) r i j ( t ) ( | | y j ( t ) | | 2 | | y i ( t ) | | 2 ) .
Based on (9), we have
L V ( t ) i = 1 n c i ( t ) c i c i ̲ + 2 α i 1 + α i 2 2 + 4 j = 1 n r i j | | y i ( t ) | | 2 Λ 3 i = 1 n c i ( t ) | | y i ( t ) | | 2 = Λ 3 V ( t ) .
Therefore, by combining (24) with (25), it yields
E L V ( t ) Λ 2 E V ( t ) , t I l , Λ 3 E V ( t ) , t S l .
In fact, we can find E L V ( t ) Λ ( t ) E V ( t ) with Λ ( t ) = Λ 2 for t I l and Λ ( t ) = Λ 3 for t S l . Thus, based on Assumption 3, we have
E V ( t ) E V ( 0 ) exp 0 t Λ ( s ) d s = E V ( 0 ) exp Λ 2 T c o n ( t , 0 ) + Λ 3 T c o n c ( t , 0 ) E V ( 0 ) exp ( Λ 2 ϑ + Λ 3 ( 1 ϑ ) ) t + ( Λ 2 + Λ 3 ) T 0 .
Therefore, according to V ( t ) min i N { c ̲ i } | | x ( t ) | | 2 , we have
E | | x ( t ) | | 2 E V ( 0 ) min i N { c ̲ i } exp ( Λ 2 + Λ 3 ) T 0 exp ( Λ 2 ϑ + Λ 3 ( 1 ϑ ) ) t .
Hence, according to Definition 1, we find that system (1) achieves exponential stability in the mean square. We complete the proof.    □
Remark 1. 
Theorem 1 discusses the exponential stability in the mean square of stochastic complex networks with time-varying coupling. In fact, our results still hold when time-varying coupling d i j ( t ) degrades into constant coupling l i j . Therefore, the results obtained in this paper are an extension of the existing literature.
Remark 2. 
Recently, we proposed intermittent control based on time-triggered control to investigate the synchronization of the stochastic complex networks and stochastic neural networks, as shown in [9,39]. References [9,39] presented the intermittent control based on the time-triggered control in work time (sampled every regular time interval τ). Compared with the intermittent control based on the time-triggered control, the unnecessary number of control updates and the waste of network resources can be reduced by applying intermittent dynamic event-triggered control. Therefore, we improve the control strategy in [9,39].
For the design of intermittent dynamic event-triggered control (2), an algorithm is presented in Algorithm  1.
Algorithm 1 Design of intermittent dynamic event-triggered control strategy.
1: Initialize the parameters f i , k i , h i j , d i j ( t ) in system (1). Based on Assumptions 1 and 2, we can obtain α i 1 , α i 2 , b i j , c ¯ i , c ̲ i , c i .
2: Choose a i , b i , η , δ , ξ 1 in intermittent dynamic event-triggered control strategy (2) with (3) and (4).
3: Choose t l and s l . Calculate ϑ by Assumption 3.
4: Solve Equation ( ε 2 γ ) Z 1 ( τ ) + b ˘ Z 2 ( τ ) = 0 in Theorem 1 to acquire τ * . Choose τ such that 0 < τ < τ * .
5: Check whether condition Λ 2 ϑ + Λ 3 ( 1 ϑ ) < 0 in Theorem 1 holds. If it does, output the values of a i , b i , η , δ , ξ 1 . Otherwise, return to Step 2.
Remark 3. 
In this paper, we present intermittent dynamic event-triggered control to study the exponential stability in the mean square of the stochastic complex networks with time-varying coupling. In [40,41], Ding and Zhu et al. investigated the dynamical behaviors of deterministic systems by designing event-triggered control. They excluded Zeno phenomena by ensuring the minimum lower bound for two triggered times based on the boundedness of e i ( t ) / x i ( t ) . But, for stochastic systems, e i ( t ) and x i ( t ) are stochastic processes. Therefore, this approach may not be applied to stochastic systems. In this paper, by utilizing a time-regularization design framework, the minimum inter-execution time can be obtained, that is, t l , k + 1 t l , k > τ . This overcomes the difficulty of excluding the Zeno phenomenon caused by stochastic interference.
Remark 4. 
We mainly propose intermittent dynamic event-triggered control (2) in this paper. In (3), when θ ( t ) = 0 , the intermittent dynamic event-triggered control (2) strategy turns into the intermittent static event-triggered control strategy, that is, the dynamic event-triggered mechanism (3) degenerates into the static one as follows:
t l , k + 1 = inf t > t l , k + τ | i = 1 n c i ( t ) | | e i ( t ) | | 2 δ i = 1 n c i ( t ) | | y i ( t ) | | 2 > 0 .
Moreover, it is not difficult to know that the number of control updates of intermittent dynamic event-triggered control is less than that of intermittent static event-triggered control strategy. This fact is mainly analyzed as follows: Let t l , k + 1 d and t l , k + 1 s be the triggering moments of the dynamic and static event-triggered mechanism (3) and (26), respectively. If t l , k + 1 s > t l , k + 1 d , when t [ t l , k + 1 d , t l , k + 1 s ) , based on static event-triggered mechanism (26), we can find i = 1 n c i ( t ) e i ( t ) 2 i = 1 n δ c i ( t ) y i ( t ) 2 0 . Based on dynamic event-triggered mechanism (3), we can find that
0 θ ( t l , k + 1 d ) η i = 1 n c i ( t ) e i ( t l , k + 1 d ) 2 i = 1 n δ c i ( t ) y i ( t l , k + 1 d ) 2 θ ( t l , k + 1 d ) ,
which is in contradiction to θ ( t ) > 0 . Therefore, t l , k + 1 s t l , k + 1 d .
Remark 5. 
In Theorem 1, τ * is the unique solution to Equation ( ε 2 γ ) Z 1 ( τ ) + b Z 2 ( τ ) = 0 . For the uniqueness of solution, we can simply analyze as follows: Set function g ( τ ) = ( ε 2 γ ) Z 1 ( τ ) + b Z 2 ( τ ) . We can find that g ( 0 ) = ( ε 2 γ ) < 0 and g ( + ) = + . Therefore, based on the continuity and monotonicity of function g, there is a unique solution τ * > 0 , such that g ( τ * ) = 0 .
Remark 6. 
In Assumption 3, the average control rate for intermittent strategy is shown. In the existing literature, most scholars use the lower bound of the control rate (the minimum activation time rate) for intermittent strategies. The average control rate is not less than the lower bound of the control rate. From the condition Λ 2 ϑ + Λ 3 ( 1 ϑ ) < 0 in Theorem 1, we can see that the larger ϑ is, the easier it is to satisfy the condition of Theorem 1 when other parameters remain unchanged.

4. Applications and Numerical Simulations

Oscillator systems have been studied by many scholars [42,43]. Now, we consider the following oscillator system:
x ¨ ( t ) + α x ˙ ( t ) + g ( x ( t ) ) = 0 ,
in which g is the nonlinear restoring force, and α 0 represents damping coefficient.
Considering stochastic interference, we assume that the damping coefficient α is disturbed and can be expressed as α + γ B ˙ ( t ) , in which γ is interference intensity. Therefore, system (27) can be rewritten as
x ¨ ( t ) + α x ˙ ( t ) + g ( x ( t ) ) = γ x ˙ ( t ) B ˙ ( t ) .
Now, considering coupling factor into system (28), we can find an oscillator network with time-varying coupling as follows:
x ¨ i ( t ) + α i x ˙ i ( t ) + g i ( x i ( t ) ) + j = 1 n d i j ( t ) ( x ˙ i ( t ) x ˙ j ( t ) ) = γ i x ˙ i ( t ) B ˙ ( t ) , i N ,
where a connecting edge from node j to node i exists at time t, then d i j ( t ) > 0 ; otherwise, d i j ( t ) = 0 .
Now, system (29) can be transformed into
d x i ( t ) = y i ( t ) d t , d y i ( t ) = ( α i y i ( t ) + g i ( x i ( t ) ) + j = 1 n d i j ( t ) ( y i ( t ) y j ( t ) ) ) d t γ i y i ( t ) d B ( t ) , i N .
Set Y i ( t ) = ( x i ( t ) , y i ( t ) ) T and then system (30) can be expressed in the following compact form:
d Y i ( t ) = ( f i ( Y i ( t ) , t ) ) + j = 1 n d i j ( t ) h i j ( Y i ( t ) , Y j ( t ) ) d t + k i ( Y i ( t ) , t ) d B ( t ) , i N ,
where f i ( Y i ( t ) , t ) = ( y i ( t ) , α i y i ( t ) g i ( x i ( t ) ) ) T , h i j ( Y i ( t ) , Y j ( t ) ) = ( 0 , y j ( t ) y i ( t ) ) T , k i ( Y i ( t ) , t ) = ( 0 , γ i y i ( t ) ) T .
To make system (31) stable, we design an intermittent dynamic event-triggered control strategy as follows:
u i ( t ) = b i Y i ( t l , k ) exp { a i ( t t l , k ) } , t I l , k I l , 0 , t S l ,
where the relevant parameters are similarly defined in Section 2.2. Now, we can obtain an oscillator network with time-varying coupling and control (32) below:
d Y i ( t ) = f i ( Y i ( t ) , t ) + j = 1 n d i j ( t ) h i j ( Y i ( t ) , Y j ( t ) ) + u i ( t ) d t + k i ( Y i ( t ) , t ) d B ( t ) , i N .
Next, we state a result with regard to the exponential stability in the mean square of system (33) as follows.:
Theorem 2. 
System (33) reaches the exponential stability in the mean square if Assumptions 2 and 3 and the following conditions are satisfied:
| | g i ( x i ) g i ( y i ) | | λ i | | x i y i | | , Λ 2 ϑ + Λ 3 ( 1 ϑ ) < 0 ,
where λ i is a positive constant, γ is an existing positive constant, Λ 2 = min { ε 1 , Λ 1 } , Λ 3 = max i N { Λ 3 i } , Λ 1 = min { γ , ξ 1 } , ε 1 = min ε ¯ 1 , ξ 1 b η , ε ¯ 1 = min i N b i δ b δ c i c i ̲ 2 α i 1 4 j = 1 n r i j γ i 2 , Λ 3 i = c i c ̲ i + 2 α i 1 + γ i 2 + 4 j = 1 n r i j , θ 1 = inf k { t k s k } , θ 2 = sup k { t k + 1 t k } , ε 2 = min i N b i c i c ̲ i + 2 α i 1 + γ i 2 + 4 j = 1 n r i j , α i 1 2 = max i N { 1 + 2 α i 2 2 , 2 λ i 2 } ,   r i j = max { d i j b i j , d i j 2 b i j 2 } , and 0 < τ < τ * , in which τ * is the unique solution to Equation ( ε 2 γ ) Z 1 ( τ ) + b Z 2 ( τ ) = 0 , where Z 1 ( τ ) and Z 2 ( τ ) are defined in Lemma 1.
Proof. 
According to function f i , we can find
| | f i ( X i , t ) f i ( Y i , t ) | | 2 | | y i y ˜ i | | 2 + | | α i ( y i y ˜ i ) g i ( x i ) + g i ( x i ˜ ) | | 2 ( 1 + 2 α i 2 ) | | y i y ˜ i | | 2 + 2 λ i 2 | | x i x i ˜ | | 2 α i 1 2 | | X i Y i | | 2 ,
which implies
| | f i ( X i , t ) f i ( Y i , t ) | | α i 1 | | X i Y i | | .
Thus, Assumption 1 and all conditions in Theorem 1 are satisfied. According to Theorem 1, it yields a system (33) that achieves the exponential stability in the mean square. The proof is completed. □
Now, set n = 26 . We consider an oscillator network with 26 nodes, and the network topology is given in Figure 1.
Obviously, we can see from Figure 1 that digraph ( G , ( d i j ( t ) ) n × n ) is strongly connected, and the nonzero components of weight matrix ( d i j ( t ) ) n × n are shown in Table 1.
Set α i = 0.005 , g i ( x i ) = x i , and γ i = 0.01 .  Figure 2 shows the state trajectories of the system (31) without a control strategy. From Figure 2, we can see that the state trajectories of system (31) are fluctuating. To make system (31) stable, we select parameters as follows: Letting b i = 18 , a i = 2 , and δ = 0.01 , we can find that ε ¯ 1 = 10.7175 . Then, choosing ξ 1 = 15 , γ = 3 , and η = 2 , we can find that Λ 1 = 3 , ε 1 = 6 . By calculating, we find that λ i = 0.01 , Λ 2 = 3 , Λ 3 = 7.0925 , and ε 2 = 10.9075 . Setting θ 1 = 2.9 , θ 2 = 4 , it yields that Λ 2 θ 1 + Λ 3 ( θ 2 θ 1 ) = 0.8983 and the unique solution τ * = 0.0014 of Equation ( ε 2 γ ) Z 1 ( τ ) + b Z 2 ( τ ) = 0 . Hence, all the conditions in Theorem 2 are satisfied.
Now, the trajectories of system (31) under control (32) are given in Figure 3. From Figure 3, we can see that system (33) is stable, which verifies the effectiveness of our theoretical results.
Comparison 1. To compare intermittent dynamic event-triggered control with and without an exponential function, Figure 4 gives out the number of control updates under intermittent dynamic event-triggered control with an exponential function, and Figure 5 shows the number of control updates under intermittent dynamic event-triggered control without an exponential function. From Figure 4 and Figure 5, it can be found that the number of control updates is much smaller than the number of sampled signals shown in Figure 5. Consequently, by adding an exponential function into the intermittent dynamic event-triggered control, the number of control updates can be significantly reduced.
Comparison 2. In order to compare intermittent static event-triggered control strategy and intermittent dynamic event-triggered control, Figure 4 and Figure 6 are given. Figure 4 and Figure 6 denote simulations with η = 2 in intermittent dynamic event-triggered control and intermittent static event-triggered control strategies, respectively. We can find that the number of control updates under an intermittent dynamic event-triggered control strategy is significantly reduced compared to the number of control updates under an intermittent static event-triggered control strategy. Therefore, the number of control updates for intermittent dynamic event-triggered control can be reduced.

5. Conclusions

This paper proposed an intermittent dynamic event-triggered control to discuss the exponential stability in the mean square of stochastic complex networks with time-varying coupling. For the intermittent dynamic event-triggered control, a dynamic term and an exponential function were introduced into the event-triggered mechanism to reduce the number of control updates. Furthermore, the minimum inter-execution time of intermittent dynamic event-triggered control, independent mathematical expectation, was guaranteed. Moreover, the event-triggered condition designed in this paper was dependent on the topology structure of the stochastic complex networks. In addition, the intermittent strategy considered in this article was based on the average control rate rather than the lower bound of the control rate. We found that this restriction had less conservatism. Based on the Lyapunov method and stochastic technique, some stability criteria were derived. Finally, an oscillator system was used, and some numerical simulations were given. In future work, considering the importance of delay factors, we will study delayed stochastic complex networks with time-varying coupling based on novel intermittent dynamic event-triggered control.

Author Contributions

J.B.: Writing—original draft, Methodology; Y.W.: Writing—review and editing; Supervision. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by the National Natural Science Foundation of China under grant 62203114; in part by the Natural Science Foundation of Jiangsu Province of China under grants BK20220811; in part by Jiangsu Funding Program for Excellent Postdoctoral Talent under grant 2022ZB116.

Data Availability Statement

No data were used for the research described in this article.

Conflicts of Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

  1. Aldana, M. Boolean dynamics of networks with scale-free topology. Phys. D Nonlinear Phenom. 2003, 185, 45–66. [Google Scholar] [CrossRef]
  2. Wang, J.L.; Wu, H.N.; Huang, T.; Ren, S.Y.; Wu, J.; Zhang, X.X. Analysis and control of output synchronization in directed and undirected complex dynamical networks. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 3326–3338. [Google Scholar] [CrossRef]
  3. Tang, Q.; Qu, S.; Zhang, C.; Tu, Z.; Cao, Y. Effects of impulse on prescribed-time synchronization of switching complex networks. Neural Netw. 2024, 174, 106248. [Google Scholar] [CrossRef] [PubMed]
  4. 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]
  5. Stankovski, T. Time-varying coupling functions: Dynamical inference and cause of synchronization transitions. Phys. Rev. E 2017, 95, 022206. [Google Scholar] [CrossRef]
  6. Tang, J.; Scellato, S.; Musolesi, M.; Mascolo, C.; Latora, V. Small-world behavior in time-varying graphs. Phys. Rev. E-Stat. Nonlinear Soft Matter Phys. 2010, 81, 055101. [Google Scholar] [CrossRef]
  7. Liu, Y.; Wang, Z.; Zhou, D. Scalable distributed filtering for a class of discrete-time complex networks over time-varying topology. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 2930–2941. [Google Scholar] [CrossRef]
  8. Liu, Y.; Li, W.; Feng, J. The stability of stochastic coupled systems with time-varying coupling and general topology structure. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 4189–4200. [Google Scholar] [CrossRef]
  9. Wu, Y.; Zhuang, S.; Li, W. Periodically intermittent discrete observation control for synchronization of the general stochastic complex network. Automatica 2019, 110, 108591. [Google Scholar] [CrossRef]
  10. Duan, Z.; Wang, J.; Chen, G.; Huang, L. Stability analysis and decentralized control of a class of complex dynamical networks. Automatica 2008, 44, 1028–1035. [Google Scholar] [CrossRef]
  11. D’Souza, R.M.; di Bernardo, M.; Liu, Y.Y. Controlling complex networks with complex nodes. Nat. Rev. Phys. 2023, 5, 250–262. [Google Scholar] [CrossRef]
  12. Xiong, W.; Yu, X.; Liu, C.; Wen, G.; Wen, S. Simplifying complex network stability analysis via hierarchical node aggregation and optimal periodic control. IEEE Trans. Neural Netw. Learn. Syst. 2020, 32, 3098–3107. [Google Scholar] [CrossRef]
  13. Su, H.; Rong, Z.; Chen, M.Z.; Wang, X.; Chen, G.; Wang, H. Decentralized adaptive pinning control for cluster synchronization of complex dynamical networks. IEEE Trans. Cybern. 2013, 43, 394–399. [Google Scholar]
  14. Zhou, H.; Liu, Z.; Chu, D.; Li, W. Sampled-data synchronization of complex network based on periodic self-triggered intermittent control and its application to image encryption. Neural Netw. 2022, 152, 419–433. [Google Scholar] [CrossRef]
  15. Zhang, G.; Shen, Y. Exponential stabilization of memristor-based chaotic neural networks with time-varying delays via intermittent control. IEEE Trans. Neural Netw. Learn. Syst. 2015, 26, 1431–1441. [Google Scholar] [CrossRef]
  16. Li, C.; Feng, G.; Liao, X. Stabilization of nonlinear systems via periodically intermittent control. IEEE Trans. Circuits Syst. II Express Briefs 2007, 54, 1019–1023. [Google Scholar]
  17. Liu, X.; Chen, T. Synchronization of complex networks via aperiodically intermittent pinning control. IEEE Trans. Autom. Control 2015, 60, 3316–3321. [Google Scholar] [CrossRef]
  18. Liu, B.; Yang, M.; Liu, T.; Hill, D.J. Stabilization to exponential input-to-state stability via aperiodic intermittent control. IEEE Trans. Autom. Control 2020, 66, 2913–2919. [Google Scholar] [CrossRef]
  19. Dimarogonas, D.V.; Frazzoli, E.; Johansson, K.H. Distributed event-triggered control for multi-agent systems. IEEE Trans. Autom. Control 2012, 57, 1291–1297. [Google Scholar] [CrossRef]
  20. Zhang, L.; Zhao, Z.; Ma, Z.; Zhao, N. Prescribed performance adaptive neural event-triggered control for switched nonlinear cyber–physical systems under deception attacks. Neural Netw. 2024, 179, 106586. [Google Scholar] [CrossRef]
  21. Liu, X.; Chen, L.; Zhao, Y.; Li, H. Adaptive event-triggered control for stability of fractional-order TS fuzzy multi-links complex networks with random coupling delay. Chaos Solitons Fractals 2023, 176, 114074. [Google Scholar] [CrossRef]
  22. Garcia, E.; Antsaklis, P.J. Model-based event-triggered control for systems with quantization and time-varying network delays. IEEE Trans. Autom. Control 2013, 58, 422–434. [Google Scholar] [CrossRef]
  23. Wu, Z.; Xu, Y.; Pan, Y.; Su, H.; Tang, Y. Event-triggered control for consensus problem in multi-agent systems with quantized relative state measurements and external disturbance. IEEE Trans. Circuits Syst. I Regul. Pap. 2018, 65, 2232–2242. [Google Scholar] [CrossRef]
  24. Liu, Y.; Wang, J. Synchronization of coupled systems via intermittent event-triggered control: Quaternion case. Chaos, Solitons Fractals 2021, 151, 111242. [Google Scholar] [CrossRef]
  25. Li, H.; Chen, Z.; Wu, L.; Lam, H.K. Event-triggered control for nonlinear systems under unreliable communication links. IEEE Trans. Fuzzy Syst. 2017, 25, 813–824. [Google Scholar] [CrossRef]
  26. Hu, W.; Liu, L. Cooperative output regulation of heterogeneous linear multi-agent systems by event-triggered control. IEEE Trans. Cybern. 2017, 47, 105–116. [Google Scholar] [CrossRef]
  27. Ran, G.; Shu, Z.; Lam, H.K.; Liu, J.; Li, C. Dissipative tracking control of nonlinear Markov jump systems with incomplete transition probabilities: A multiple-event-triggered approach. IEEE Trans. Fuzzy Syst. 2023, 31, 2389–2400. [Google Scholar] [CrossRef]
  28. Cheng, T.; Kan, Z.; Klotz, J.R.; Shea, J.M.; Dixon, W.E. Event-triggered control of multiagent systems for fixed and time-varying network topologies. IEEE Trans. Autom. Control 2017, 62, 5365–5371. [Google Scholar] [CrossRef]
  29. Wang, J.; Feng, J.; Zhao, Y. Exponentially synchronization of stochastic complex networks with time-varying delays and switching topology via pinning control. In Proceedings of the 2011 Seventh International Conference on Computational Intelligence and Security, Sanya, China, 3–4 December 2011; IEEE: New York, NY, USA, 2011; pp. 263–267. [Google Scholar] [CrossRef]
  30. Wu, L.; Gao, Y.; Liu, J.; Li, H. Event-triggered sliding mode control of stochastic systems via output feedback. Automatica 2017, 82, 79–92. [Google Scholar] [CrossRef]
  31. Ma, R.; Shao, X.; Liu, J.; Wu, L. Event-triggered sliding mode control of Markovian jump systems against input saturation. Syst. Control Lett. 2019, 134, 104525. [Google Scholar] [CrossRef]
  32. Gao, Y.; Sun, X.; Wen, C.; Wang, W. Event-triggered control for stochastic nonlinear systems. Automatica 2018, 95, 534–538. [Google Scholar] [CrossRef]
  33. Wang, Y.; Zheng, W.X.; Zhang, H. Dynamic event-based control of nonlinear stochastic systems. IEEE Trans. Autom. Control 2017, 62, 6544–6551. [Google Scholar] [CrossRef]
  34. Luo, S.; Deng, F. On event-triggered control of nonlinear stochastic systems. IEEE Trans. Autom. Control 2020, 65, 369–375. [Google Scholar] [CrossRef]
  35. Hu, A.; Cao, J. Consensus of multi-agent systems via intermittent event-triggered control. Int. J. Syst. Sci. 2017, 48, 280–287. [Google Scholar] [CrossRef]
  36. Mao, X. Stochastic Differential Equations and Applications; Woodhead Publishing: Cambridge, UK, 2007. [Google Scholar]
  37. Wu, Y.; Sun, Z.; Ran, G.; Xue, L. Intermittent control for fixed-time synchronization of coupled networks. IEEE/CAA J. Autom. Sin. 2023, 10, 1488–1490. [Google Scholar] [CrossRef]
  38. Li, M.Y.; Shuai, Z. Global-stability problem for coupled systems of differential equations on networks. J. Differ. Equ. 2010, 248, 1–20. [Google Scholar] [CrossRef]
  39. Wu, Y.; Zhu, J.; Li, W. Intermittent discrete observation control for synchronization of stochastic neural networks. IEEE Trans. Cybern. 2020, 50, 2414–2424. [Google Scholar] [CrossRef]
  40. Ding, D.; Wang, Z.; Shen, B.; Wei, G. Event-triggered consensus control for discrete-time stochastic multi-agent systems: The input-to-state stability in probability. Automatica 2015, 62, 284–291. [Google Scholar] [CrossRef]
  41. Zhu, Q. Stabilization of stochastic nonlinear delay systems with exogenous disturbances and the event-triggered feedback control. IEEE Trans. Autom. Control 2019, 64, 3764–3771. [Google Scholar] [CrossRef]
  42. Wang, P.; Zhang, B.; Su, H. Stabilization of stochastic uncertain complex-valued delayed networks via aperiodically intermittent nonlinear control. IEEE Trans. Syst. Man Cybern. Syst. 2019, 49, 649–662. [Google Scholar] [CrossRef]
  43. Umpierrez, P.; Araña, V.; Sancho, S. Piecewise semi-analytical formulation for the analysis of coupled-oscillator systems. IEEE Trans. Microw. Theory Tech. 2019, 67, 2259–2269. [Google Scholar] [CrossRef]
Figure 1. A digraph ( G , ( d i j ( t ) ) 26 × 26 ) with 26 nodes. Here, the red circles represent network nodes, and the arrows indicate the connection between the edges of the digraph.
Figure 1. A digraph ( G , ( d i j ( t ) ) 26 × 26 ) with 26 nodes. Here, the red circles represent network nodes, and the arrows indicate the connection between the edges of the digraph.
Actuators 13 00475 g001
Figure 2. The state trajectories of system (31) without an intermittent dynamic event−triggered control strategy (32).
Figure 2. The state trajectories of system (31) without an intermittent dynamic event−triggered control strategy (32).
Actuators 13 00475 g002
Figure 3. The state trajectories of system (33) with an intermittent dynamic event−triggered control strategy (32).
Figure 3. The state trajectories of system (33) with an intermittent dynamic event−triggered control strategy (32).
Actuators 13 00475 g003
Figure 4. The triggering times under an intermittent dynamic event-triggered control strategy (32) with η = 2 and a i = 2 . The blue line with a red circle represents the time interval between adjacent triggering moments.
Figure 4. The triggering times under an intermittent dynamic event-triggered control strategy (32) with η = 2 and a i = 2 . The blue line with a red circle represents the time interval between adjacent triggering moments.
Actuators 13 00475 g004
Figure 5. The triggering times under an intermittent dynamic event-triggered control strategy (32) with η = 2 and a i = 0 . The blue line with a red circle represents the time interval between adjacent triggering moments.
Figure 5. The triggering times under an intermittent dynamic event-triggered control strategy (32) with η = 2 and a i = 0 . The blue line with a red circle represents the time interval between adjacent triggering moments.
Actuators 13 00475 g005
Figure 6. The triggering times under an intermittent static event-triggered control strategy with η = 2 . The blue line with a red circle represents the time interval between adjacent triggering moments.
Figure 6. The triggering times under an intermittent static event-triggered control strategy with η = 2 . The blue line with a red circle represents the time interval between adjacent triggering moments.
Actuators 13 00475 g006
Table 1. Nonzero components of weight matrix ( d i j ( t ) ) 26 × 26 .
Table 1. Nonzero components of weight matrix ( d i j ( t ) ) 26 × 26 .
Matrix ElementsValue
d 18 , 17 ( t ) , d 17 , 26 ( t ) , d 26 , 25 ( t ) , d 25 , 24 ( t ) , d 24 , 23 ( t ) 0.095 + 0.0095 exp { 2 t }
d 23 , 22 ( t ) , d 22 , 21 ( t ) , d 21 , 20 ( t ) , d 20 , 19 ( t ) , d 19 , 18 ( t ) 0.025 + 0.0085 exp { 2 t }
d 18 , 5 ( t ) , d 5 , 19 ( t ) , d 19 , 6 ( t ) , d 6 , 20 ( t ) , d 8 , 21 ( t ) 0.015 + 0.0015 exp { 3 t }
d 20 , 8 ( t ) , d 9 , 22 ( t ) , d 9 , 21 ( t ) , d 11 , 23 ( t ) , d 22 , 11 ( t ) 0.015 + 0.0025 exp { 3 t }
d 12 , 24 ( t ) , d 23 , 12 ( t ) , d 14 , 25 ( t ) , d 24 , 14 ( t ) , d 15 , 26 ( t ) 0.014 + 0.0015 exp { 3 t }
d 25 , 15 ( t ) , d 17 , 16 ( t ) , d 26 , 16 ( t ) , d 4 , 17 ( t ) , d 4 , 18 ( t ) 0.013 + 0.0025 exp { 3 t }
d 5 , 4 ( t ) , d 6 , 5 ( t ) , d 6 , 8 ( t ) , d 9 , 8 ( t ) , d 9 , 11 ( t ) 0.085 + 0.0075 exp { 2 t }
d 12 , 11 ( t ) , d 12 , 14 ( t ) , d 15 , 14 ( t ) , d 16 , 15 ( t ) , d 16 , 4 ( t ) 0.085 + 0.0085 exp { 2 t }
d 3 , 16 ( t ) , d 2 , 5 ( t ) , d 8 , 7 ( t ) , d 11 , 10 ( t ) , d 14 , 13 ( t ) 0.013 + 0.0035 exp { 3 t }
d 2 , 4 ( t ) , d 2 , 6 ( t ) , d 7 , 6 ( t ) , d 7 , 9 ( t ) , d 10 , 9 ( t ) 0.085 + 0.0075 exp { 2 t }
d 10 , 12 ( t ) , d 13 , 12 ( t ) , d 13 , 15 ( t ) , d 15 , 3 ( t ) , d 4 , 3 ( t ) 0.092 + 0.0065 exp { 2 t }
d 7 , 2 ( t ) , d 7 , 10 ( t ) , d 10 , 13 ( t ) , d 3 , 13 ( t ) , d 3 , 2 ( t ) 0.092 + 0.0075 exp { 2 t }
d 2 , 1 ( t ) , d 1 , 7 ( t ) , d 10 , 1 ( t ) , d 1 , 13 ( t ) , d 1 , 3 ( t ) 0.094 + 0.0085 exp { 2 t }
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

Wu, Y.; Bing, J. Stability of Stochastic Coupled Networks with Time-Varying Coupling Under Intermittent Event-Triggered Control. Actuators 2024, 13, 475. https://doi.org/10.3390/act13120475

AMA Style

Wu Y, Bing J. Stability of Stochastic Coupled Networks with Time-Varying Coupling Under Intermittent Event-Triggered Control. Actuators. 2024; 13(12):475. https://doi.org/10.3390/act13120475

Chicago/Turabian Style

Wu, Yongbao, and Jiayi Bing. 2024. "Stability of Stochastic Coupled Networks with Time-Varying Coupling Under Intermittent Event-Triggered Control" Actuators 13, no. 12: 475. https://doi.org/10.3390/act13120475

APA Style

Wu, Y., & Bing, J. (2024). Stability of Stochastic Coupled Networks with Time-Varying Coupling Under Intermittent Event-Triggered Control. Actuators, 13(12), 475. https://doi.org/10.3390/act13120475

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