Processing math: 68%
Research article Special Issues

Enhancing skeleton-based human motion recognition with Lie algebra and memristor-augmented LSTM and CNN

  • Received: 13 December 2023 Revised: 24 March 2024 Accepted: 28 April 2024 Published: 24 May 2024
  • MSC : 68T07, 68T10

  • Lately, as a subset of human-centric studies, vision-oriented human action recognition has emerged as a pivotal research area, given its broad applicability in fields like healthcare, video surveillance, autonomous driving, sports, and education. This brief applies Lie algebra and standard bone length data to represent human skeleton data. A multi-layer long short-term memory (LSTM) recurrent neural network and convolutional neural network (CNN) are applied for human motion recognition. Finally, the trained network weights are converted into the crossbar-based memristor circuit, which can accelerate the network inference, reduce energy consumption, and obtain an excellent computing performance.

    Citation: Zhencheng Fan, Zheng Yan, Yuting Cao, Yin Yang, Shiping Wen. Enhancing skeleton-based human motion recognition with Lie algebra and memristor-augmented LSTM and CNN[J]. AIMS Mathematics, 2024, 9(7): 17901-17916. doi: 10.3934/math.2024871

    Related Papers:

    [1] Shuo Ma, Jiangman Li, Qiang Li, Ruonan Liu . Adaptive exponential synchronization of impulsive coupled neutral stochastic neural networks with Lévy noise and probabilistic delays under non-Lipschitz conditions. AIMS Mathematics, 2024, 9(9): 24912-24933. doi: 10.3934/math.20241214
    [2] Zhifeng Lu, Fei Wang, Yujuan Tian, Yaping Li . Lag synchronization of complex-valued interval neural networks via distributed delayed impulsive control. AIMS Mathematics, 2023, 8(3): 5502-5521. doi: 10.3934/math.2023277
    [3] Dong Pan, Huizhen Qu . Finite-time boundary synchronization of space-time discretized stochastic fuzzy genetic regulatory networks with time delays. AIMS Mathematics, 2025, 10(2): 2163-2190. doi: 10.3934/math.2025101
    [4] Hongguang Fan, Jihong Zhu, Hui Wen . Comparison principle and synchronization analysis of fractional-order complex networks with parameter uncertainties and multiple time delays. AIMS Mathematics, 2022, 7(7): 12981-12999. doi: 10.3934/math.2022719
    [5] Arthit Hongsri, Wajaree Weera, Thongchai Botmart, Prem Junsawang . Novel non-fragile extended dissipative synchronization of T-S fuzzy complex dynamical networks with interval hybrid coupling delays. AIMS Mathematics, 2023, 8(12): 28601-28627. doi: 10.3934/math.20231464
    [6] Chengbo Yi, Rui Guo, Jiayi Cai, Xiaohu Yan . Pinning synchronization of dynamical neural networks with hybrid delays via event-triggered impulsive control. AIMS Mathematics, 2023, 8(10): 25060-25078. doi: 10.3934/math.20231279
    [7] Shuang Li, Xiao-mei Wang, Hong-ying Qin, Shou-ming Zhong . Synchronization criteria for neutral-type quaternion-valued neural networks with mixed delays. AIMS Mathematics, 2021, 6(8): 8044-8063. doi: 10.3934/math.2021467
    [8] Xingxing Song, Pengfei Zhi, Wanlu Zhu, Hui Wang, Haiyang Qiu . Exponential synchronization control of delayed memristive neural network based on canonical Bessel-Legendre inequality. AIMS Mathematics, 2022, 7(3): 4711-4734. doi: 10.3934/math.2022262
    [9] Zhengqi Zhang, Huaiqin Wu . Cluster synchronization in finite/fixed time for semi-Markovian switching T-S fuzzy complex dynamical networks with discontinuous dynamic nodes. AIMS Mathematics, 2022, 7(7): 11942-11971. doi: 10.3934/math.2022666
    [10] Er-Yong Cong, Yantao Wang, Xian Zhang, Li Zhu . A new approach for accuracy-preassigned finite-time exponential synchronization of neutral-type Cohen–Grossberg memristive neural networks involving multiple time-varying leakage delays. AIMS Mathematics, 2025, 10(5): 10917-10942. doi: 10.3934/math.2025496
  • Lately, as a subset of human-centric studies, vision-oriented human action recognition has emerged as a pivotal research area, given its broad applicability in fields like healthcare, video surveillance, autonomous driving, sports, and education. This brief applies Lie algebra and standard bone length data to represent human skeleton data. A multi-layer long short-term memory (LSTM) recurrent neural network and convolutional neural network (CNN) are applied for human motion recognition. Finally, the trained network weights are converted into the crossbar-based memristor circuit, which can accelerate the network inference, reduce energy consumption, and obtain an excellent computing performance.



    Complex dynamical networks (CDNs) are large-scale networks comprising numerous nodes interconnected through specific topological links. CDNs with hybrid delays are crucial for modeling and optimizing real-world systems that exhibit both continuous and discrete delays. These networks find applications in various industries, including communication networks, control systems, biological systems, power systems, economics and finance, chemical engineering, transportation, environmental sciences, mechanical systems and healthcare, such as in [1,2,3,4,5,6,7,8,9]. Hybrid delay models provide a robust framework for analyzing and improving the behavior of complex systems in these domains by considering the interplay between continuous dynamics and discrete events, ultimately leading to enhanced performance and efficiency. The understanding and management of complex systems, whether observed in natural phenomena or constructed systems like biological neuron networks, power grids, social connections or the Internet, have seen significant advancements in recent research, as highlighted in [10,11,12,13,14,15]. To gain deeper insights into contemporary systems, it becomes imperative to examine both the network structure and dynamic properties of complex networks.

    Recent studies have extensively investigated the synchronization dynamics of CDNs composed of coupled oscillators, deriving synchronization criteria for networks with coupling delays, considering both delay-independent and delay-dependent stability of the synchronization manifold. Moreover, researchers have increasingly focused on synchronization phenomena within complex networks, serving as a framework for understanding various phenomena. Synchronization occurs when the discrepancy between driving and responding vectors approaches zero in norm. Furthermore, the concept of stability, as explored in works such as [16,17,18,19,20,21,22], also provides insights into the idea of synchronization.

    Achieving synchronization among CDN nodes is a complex challenge influenced by architectural intricacies, network topology, environmental factors, and connectivity efficiency. Control mechanisms play a pivotal role in enabling engineering system designers to achieve impressive performance by seamlessly adapting to varying environmental conditions. This adaptability is crucial for engineering systems to function effectively and reliably in diverse contexts. Consequently, a critical area of research revolves around addressing synchronization challenges in CDNs, particularly through the incorporation of feedback control strategies. Various control approaches have emerged in the literature, including model predictive control, state feedback control, stochastic control, adaptive control, non-fragile control, and pinning control, as documented in prior research [23,24,25,26,27].

    Real-world networks, such as mobile communication systems, citation networks, and cyber-physical setups, frequently depend on time-triggered schemes for data exchange among sensors, controllers, and actuators. However, there are disadvantages to using synchronization methods designed for complex networks with time-triggered schemes. Recent research has explored diverse aspects, including the synchronization of real-time tasks in time-triggered networks [28], adaptive pinning synchronization in networks with negative weights and its application in traffic road networks [29], enhancing security in time-triggered real-time systems through task replication [30], and achieving exponential synchronization of chaotic Lur'e systems with time-triggered intermittent control [31]. To effectively result of the burdens on communication networks, the adoption of event-triggered methodologies has emerged as a promising strategy. The fundamental premise underlying event-triggered control/communication schemes revolves around the concept that the execution of control inputs and system transmissions is dictated by the occurrence of predefined "events." This approach is engineered to uphold the intended control performance while simultaneously alleviating the strain on communication networks [32,33].

    In response to the challenges posed by communication networks, the adoption of event-triggered methodologies has emerged as a promising strategy. Event-triggered control/communication schemes stand in contrast to conventional time-triggered approaches, effectively alleviating the strain on both network communication and controller computational costs. Existing event-triggered control techniques can typically be classified into four main categories: dynamic event-triggered control, self-triggered control, periodic event-triggered control and continuous event-triggered control. Various event-triggered synchronization control strategies tailored for complex dynamical networks have been proposed in several sources, utilizing mathematical tools such as Lyapunov stability theory, linear matrix inequalities, Markov process theory, and impulsive control theory to formulate event-triggered controllers [34,35,36,37,38,39,40,41]. For instance, in [35], a robust H pinning synchronization method for complex networks with event-triggered communication is introduced, employing Lyapunov-Krasovskii functional (LKF) and matrix inequality techniques for controller design. Similarly, [36] explores an event-triggered pinning control approach for discrete-time stochastic complex dynamical network synchronization, utilizing Markov process theory and stochastic analysis for stability analysis. Another study focuses on coupled reaction-diffusion complex network systems, applying finite-time stability theory and LKF to design event-triggered controllers, which outperform traditional continuous-time control methods [37]. Moreover, [38] suggests an event-triggered delayed impulsive control approach for CDNs with coupling delay, utilizing LKF and impulsive control theory. In [42], a dynamic event-triggered control method is introduced as an alternative to static event-triggered control systems, aiming to further reduce information usage and energy consumption. However, dynamic approaches introduce complexities such as Zeno behavior, where an infinite number of triggers occur in a finite time span, posing challenges for event-triggered control systems. Consequently, it becomes crucial for event-triggering conditions to ensure a minimum constraint on time intervals between triggering moments to prevent Zeno behavior.

    Recent literature has explored the concept of dynamic event-triggered control in various contexts, as evident from works such as [43,44,45,46,47,48,49,50]. [43] likely contributes to the field by advancing dynamic event-triggered control methodologies and their applications. [45] may focus on dissipative systems, shedding light on energy-efficient control strategies. The authors in [46] explore novel triggering mechanisms and performance analyses in specific scenarios. [47] studied event-triggered control's utilization within cluster systems, optimizing resource allocation. The authors of [48] researched the balance between communication and control efficiency in event-triggered systems. The authors in [49] introduced a disturbance-based switching mechanism for robust synchronization, while [50] proposed a memory-based strategy for efficient global synchronization. These contributions expand the applicability of event-triggered control in chaotic Lurie systems, addressing challenges related to disturbances and global synchronization. It is well-known that proportional-integral-derivative (PID) controllers have been widely applied in industry for operation simplicity and good system performance. In [51], researchers utilized the linear matrix inequality technique to create an event-triggered fuzzy PID controller. This research effectively expanded the use of event-triggering mechanisms into PID control for linear time-invariant systems. However, only a few works have investigated the feasibility of PID control applied to complex networks. Motivated by the discussions above, this study aims to make significant contributions to PID control in CDNs with hybrid delays. The main contributions of this research are outlined below:

    ● In this paper, there is the first attempt to study a synchronization of PID control problem in CDNs by introducing a dynamic event-triggered mechanism. This novel combination aims to achieve exponential synchronization for CDNs. This contribution advances the understanding of synchronization techniques in complex systems.

    ● Different from others in [52,53], we have introduced a PID-based event-triggering mechanism inspired by the structure of the traditional PID control law. This novel mechanism takes into account the influence of the system's proportional, integral and derivative components, with parameters designed in harmony with those of the PID controller.

    ● To establish the theoretical support of our approach, we carefully construct a suitable LKF. We derive its properties employing linear matrix inequalities (LMI), which facilitates the analysis of the complex dynamical networks under consideration. This step is important in demonstrating the feasibility of achieving exponential synchronization within our proposed framework.

    ● Recognizing the significance of real-world uncertainties, we intensively look into the impact of parameter uncertainties on the considered system. Through rigorous analysis, we examine the system's exponential synchronization behavior using PID control parameters within the dynamic event-trigger mechanism. This exploration of parameter uncertainties adds a layer of practical relevance to the theoretical results.

    ● Finally, to show the effectiveness and validity of our theoretical contributions, we provide a comprehensive numerical simulation. This showcases practical scenarios and demonstrates the outcomes of our proposed approach.

    The subsequent sections of the paper are organized as follows: Section 2 introduces essential preliminaries and presents the problem formulation. Section 3 establishes the Exponential Synchronization Criteria for general complex dynamical networks, employing the PID controller within the dynamic event-trigger mechanism. Section 4 extends the analysis by incorporating parameter uncertainties into the complex dynamical networks. This section critically examines the resulting impact on exponential synchronization. The paper concludes with Section 5, where a summary and conclusive remarks wrap up the discussion.

    Notation: To be clear, the following symbols are first explained in a simple way

    T: The transpose of a matrix or a vector.

    Rn: The n-dimensional Euclidean space.

    Rn×m: The set of all n × m real matrices.

    W>0: The matrix W is symmetric and positive definite.

    : Symmetric terms in a symmetric matrix.

    In: Identity matrix.

    diag{}: A block-diagonal matrix.

    λmax(G) (λmin(G)): The largest (smallest) eigenvalue of G.

    : The Euclidean norm for given vector.

    Consider a controlled complex network consisting of N nodes with hybrid delays [5,16,54]. Each node of the dynamical network is a nonautonomous n-dimensional systems, which is given by

    ˙xi(t)=Axi(t)+f(xi(t))+Nj=1EijΘ1xj(t)+Nj=1HijΘ2xj(tα(t))+Nj=1JijΘ3ttδxj(s)ds+ui(t), (2.1)

    where i=1,2,,N is the number of nodes in the Network. xi(t)={xi1(t),xi2(t),,xin(t)} is the state variable of the ith node at time t. A is the known state matrix. f(.):RnRn is the nonlinear function which is continuous and differentiable that represents the dynamical behaviors of the system. The matrices Eij, Hij and Jij represent the outer coupling and network topology structure. When there is a direct connection from node i to node j, the values are Eij>0, Hij>0 and Jij>0; otherwise, they are 0. These matrices also satisfy the conditions Eii=Nj=1Eij, Hii=Nj=1Hij and Jii=Nj=1Jij to maintain internal consistency. Θ1, Θ2 and Θ3 represent the inner coupling matrices which interconnect the subsystems. α(t) is the time varying discrete delay, and δ is the distributed delay, satisfying the condition 0α(t)α and 0˙α(t)ς1. ui(t) is the control input to be designed.

    Now, consider the reference node S(t)Rn in the form which satisfies

    ˙S(t)=AS(t)+f(S(t)). (2.2)

    Define the synchronization error as ˙φi(t)=˙xi(t)˙S(t). Then, by subtracting (2.2) from (2.1), we have the dynamical error system as:

    ˙φi(t)=Aφi(t)+G(φi(t))+Nj=1EijΘ1φj(t)+Nj=1HijΘ2φj(tα(t))+Nj=1JijΘ3ttδφj(s)ds+ui(t), (2.3)

    where G(φi(t))=[f(xi(t))f(S(t))]. For general complex dynamical networks with network topologies, we propose PID control protocols, which are described by

    Ψi(t)=UiPφi(t)+UiIt0φi(s)ds+UiD˙φi(t), (2.4)

    where UP>0, UI>0 and UD>0 are the proportional, integral and derivative control gain values, respectively, which are to be designed for the ith node.

    Remark 2.1. PID control is a well known effective approach to various real-world control challenges. It is referred to as a universal controller because the proportional gain UP increases control effort when there is a significant control error-making its function quite clear. With the integral action (UI), the subsequent control uses previous control error values, and the derivative gain (UD) relies on expectations of future error values. In a dynamic event-triggered control system, the main goal is to minimize information and energy sources. The PID controller plays a crucial role by boosting control efforts when errors are significant, fitting well with the dynamic nature of the CDNs. Adding the integral action lets the control system learn from past data, and the derivative gain helps predict future errors—useful for navigating the changing dynamics of complex networks. In dynamic event-triggered control systems, PID works smoothly, making decisions that align with the goal of minimizing information use.

    In order to reduce the communication burden of the shared network in the control process, in this paper, a dynamic event-triggered mechanism is introduced to judge when the measured data should be transmitted to the observer. For clarity of the dynamic event-triggered mechanism, let us define the triggering time sequence for the ith node iteratively expressed as tik+1=inf{t>tik|Li(t)<0}, and the event generator function Li() can be taken from [55] and can be given by

    Li(t)=1υiDi(t)+μiΨTi(t)Ψi(t)ωTi(t)ωi(t), (2.5)

    where υi and μi are two given positive scalars. For t[tik,tik+1), ωi(t) is defined by,

    ωi(t)=Ψi(t)Ψi(tik), (2.6)

    where Ψi(tik) is the ith node of the control signal at the earliest triggering instant. The triggering instants are denoted by {tik}k=0 and ti0=0. Also, the internal dynamic variable Di(t) should satisfy

    ˙Di(t)=ρiDi(t)ωTi(t)ωi(t)+μiΨTi(t)Ψi(t). (2.7)

    Here, ρi is the scalar value. From the above equation, Di(0)>0 is the initial condition.

    Moreover, for all t0,

    ˙Di(t)ρiDi(t)1υiDi(t).

    By using this, we can easily obtain

    Di(t)Di(0)e(ρi+1υi)t>0.

    For the ith node, the actual input actuator can be chosen as

    ui(t)=ui(tik)=Ψi(tik),   t[tik,tik+1). (2.8)

    The following error dynamic system can be obtained by applying (2.6) and (2.8) to the error system (2.3):

    ˙φi(t)=Aφi(t)+G(φi(t))+Nj=1EijΘ1φj(t)+Nj=1HijΘ2φj(tα(t))+Nj=1JijΘ3ttδφj(s)dsΨi(t)+ωi(t). (2.9)

    By (2.4) and the system (2.9), we can obtain the following:

    ˙φi(t)=Aφi(t)+G(φi(t))+Nj=1EijΘ1φj(t)+Nj=1HijΘ2φj(tα(t))+Nj=1JijΘ3ttδφj(s)dsUiPφi(t)UiIt0φi(s)dsUiD˙φi(t)+ωi(t). (2.10)

    The error system can be written in compact form as

    ˙φ(t)=Aφ(t)+G(φ(t))+(EΘ1)φ(t)(HΘ2)φ(tα(t))+(JΘ3)ttδφ(s)dsUPφ(t)UIt0φ(s)dsUD˙φ(t)+ω(t). (2.11)

    The upcoming Assumptions, Lemmas and Definitions are very useful to prove our theoretical results.

    Assumption H1. [55] The nonlinear function f():RnRn satisfies the following the sector-bounded condition:

    [f(x)f(y)Υ1(xy)]T[f(x)f(y)Υ2(xy)]0,

    for any x,yRn, where Υ1 and Υ2 are known constant matrices.

    Lemma 2.2. [55] The following inequality holds for the H1, for the matrices Υ1 and Υ2 such that

    [φ(t)G(φ(t))]T[ˆΥ1ˆΥ2I][φ(t)G(φ(t))]0,

    where

    ˆΥ1=(INΥ1)T(INΥ2)+(INΥ2)(INΥ1)T2,ˆΥ2=(INΥ2)T+(INΥ1)T2.

    Lemma 2.3. (Schur Complement) [56] The LMI, U=[U11U12U21U22]<0, is equivalent to U22<0, U11U12U122UT12<0.

    Definition 2.4. [57] The complex dynamical network with hybrid delays (2.1) is said to be exponentially synchronized with target node (2.2) if there exists two constants ϵ>0 and M>0 such that

    xi(t)S(t)Meϵt,i=1,2,,N,

    for t0 and any initial conditions.

    The goal of this research is to develop a set of PID controllers (2.4) in order to guarantee the exponential synchronization of the CDNs (2.1) and response system (2.2). Specifically, we are interest in if the CDN with hybrid delay error system (2.11) is exponentially stable.

    The following theorems, when applied to a dynamic event-triggered PID control method with linear matrix inequalities, would enforce the appropriate exponential synchronization of CDNs with hybrid delays.

    Theorem 3.1. If given parameters α, ς1, ρ, μ, υ, β, UP, UI and UD and the Assumption H1 are true, then the CDN (2.1) is said to be exponentially synchronized with (2.2) if there exist positive definite matrices Cr (r=1,2,,5), B1, B2 and Wa=[W1W2W3]>0, Wb=[W4W5W6]>0 and appropriate dimension matrices Nr (r=1,2,,8) and positive scalars ε1 and ε2, such that the following LMIs hold:

    J=[J11×11]<0, (3.1)

    where matrix entries are provided as follows, with any missing entries assumed to be zero: J11=(B1+BT1)+C1+C2+B2+ςC5+2βB1+2βW1+2βW4+UTPΞ1UP+2[N1A+N1(EΘ1)N1UP]+ε1UTPΞ3UPε2ˆΥ1; J12=2βWT2+NT1(HΘ2)T+N2[A+(EΘ1)2UP]; J13=UTPΞ1UIN1UI+N3[A+(EΘ1)UP]+2ε1UTPΞ3UI; J14=B1+WT1+WT4+UTPΞ1UD[N1UD+N1]+N4[A+(EΘ1)UP]+2ε1UTPΞ3UD; J15=(1ς)W3+N5[A+(EΘ1)UP]; J16=N1(JΘ3)+N6[A+(EΘ1)UP]; J17=N7[A+(EΘ1)UP]+2βW5; J18=WT5+N8[A+(EΘ1)UP]; J19=NT1; Y110=NT1ε2ˆΥ2; J22=e2βς(1ς)C2+2βW3+N2(HΘ2); J23=N2UI+N3(HΘ2); J24=W2[N2+N2UD]+N4(HΘ2); J25=(1ς)W3+N5(HΘ2); J26=N2(JΘ3)+N6[HΘ2]; J27=N7(HΘ2); J28=N8(HΘ2); J29=NT2; J210=NT2; J33=UTIΞ1UI2N3UI+ε1UTIΞ3UI; J34=UTIΞ1UD[N3UD+N3]+ε1+UTIΞ3UDN4UI; J35=N5UI; J36=N3[JΘ3]N6UI; J37=N7UI; J38=N8UI; J39=NT3; J310=NT3; J44=UTDΞ1UD+C3+C42[N4UD+N4]+ε1UTDΞ2UD; J45=[N5UD+N5]; J46=N4(JΘ3)[N6UD+N6]; J47=WT5[N7UD+N7]; J48=[N8UD+N8]; J49=NT4; J410=NT4; J55=(1ς)e2βςC4; J56=N5(JΘ3); J59=NT5; J510=NT5; J66=e2βςδC5+N6(JΘ3); J67=N7(JΘ3); J68=N8(JΘ3); Y69=NT6; Y610=NT6; J77=e2βςC1+2βW6; J78=WT5; J79=NT7; J710=NT7; J88=e2βςC3; J89=NT8; J810=NT8; J99=Ξ1ε1I; J1010=ε2I; J1111=diag{ρ1+2β+μ1υ1,ρ2+2β+μ1υ2,ρN+2β+μ1υN}, Ξ1=diag{1υ1I,1υ2I,,1υNI}, Ξ2=diag{μ1υ1I,μ2υ2I,,μNυNI}, Ξ3=diag{μ1I,μ2I,,μNI}.

    Proof. Consider the Lyapunov function according to the error system (2.11) that can be given by

    V(t)=7i=1Vi(t), (3.2)

    where

    V1(t)=φT(t)B1φ(t),V2(t)=[φT(t)φT(tα(t))][W1W2W3][φ(t)φ(tα(t))],V3(t)=[φT(t)φT(tα)][W4W5W6][φ(t)φ(tα)],V4(t)=ttςe2β(st)φT(v)C1φ(v)dv+ttα(t)e2β(st)φT(v)C2φ(v)dv,V5(t)=ttςe2β(st)˙φT(v)C3˙φ(v)dv+ttα(t)e2β(st)˙φT(v)C4˙φ(v)dv,V6(t)=t0e2β(st)φT(v)B2φ(v)dv+0δtt+θe2β(st)φT(v)C5φ(v)dvdθ,V7(t)=Ni=11υiDi(t).

    Hereafter, let us consider the following notations:

    Y1(t)=φ(t); Y2(t)=φ(tα(t)); Y3(t)=t0φ(v)dv; Y4(t)=˙φ(t); Y5(t)=˙φ(tα(t)); Y6(t)=ttδφ(v)dv; Y7(t)=φ(tα); Y8(t)=˙φ(tα).

    Now, taking the derivative of the considered Lyapunov function can be given by

    ˙V1(t)+2βV1(t)=2YT1(t)B1Y4(t)+2βYT1(t)B1Y1(t), (3.3)
    ˙V2(t)+2βV2(t)=2YT1(t)W1Y4(t)+2YT2(t)WT2Y4(t)+2(1ς)YT1W2Y5(t)+2(1ς)YT2(t)W3Y5(t)+2βYT1(t)W1Y1(t)+4βYT1(t)W2Y2(t)+2βYT2(t)W3Y2(t), (3.4)
    ˙V3(t)+2βV3(t)=2YT1(t)W4Y4(t)+2YT7(t)WT5Y4(t)+2YT1W5Y8(t)+2YT7(t)W6Y8(t)+2βYT1(t)W4Y1(t)+4βYT1(t)W5Y7(t)+2βYT7(t)W6Y7(t), (3.5)
    ˙V4(t)+2βV4(t)=YT1(t)C1Y1(t)e2βςYT7(t)C1Y7(t)+YT1(t)C2Y1(t)e2βς(1ς)YT2C2Y2(t), (3.6)
    ˙V5(t)+2βV5(t)=YT4(t)C3Y4(t)e2βςYT8(t)C3Y8(t)+YT4(t)C4Y4(t)e2βς(1ς)YT5(t)C4Y5(t), (3.7)
    ˙V6(t)+2βV6(t)=YT1(t)B2Y1(t)+ςYT1(t)C5Y1(t)e2βςttδφT(v)C5φ(v)dv, (3.8)
    ˙V7(t)+2βV7(t)=Ni=11υi˙Di(t)+2βV7(t),=Ni=11υi[ρiDi(t)ωT(t)ω(t)+μiΨTi(t)Ψi(t)]+2βNi=11υiDi(t),=Ni=1ρiυiDi(t)ωT(t)i2ω(t)+φT(t)UTPΞ1UPφ(t)+t0φT(v)dvUTIΞ1UIt0φ(v)dv+˙φT(t)UTDΞ1UD˙φ(t)+2φT(t)UTPΞ1UIt0φ(v)dv+2φT(t)UTPΞ1UD˙φ(t)+2t0φT(v)dvUTIΞ1UD˙φ(t)+2βNi=11υiDi(t),=Ni=1ρiυiDi(t)ωT(t)Ξ2ω(t)+YT1(t)UTPΞ1UPY1(t)+YT3(t)UTIΞ1UIY3(t)+YT4(t)UTDΞ1UDY4(t)+2YT1(t)UTPΞ1UIY3(t)+2YT1(t)UTPΞ1UDY4(t)+2YT3(t)UTIΞ1UDY4(t)+2βNi=11υiDi(t), (3.9)

    where Ξ1=diag{μ1υ1,μ2υ2,...,μMυM} and Ξ2=diag{1υ1,1υ2,...,1υM}.

    From (3.8), using Jensen's inequality, we can get the following inequality:

    ttδφT(v)C5φ(v)dv1δ(ttδφ(v)dv)C5(ttδφ(v)dv). (3.10)

    From (2.5) and Li(t)<0, we can get

    Ni=11υiDi(t)+Ni=1μiΨTi(t)Ψi(t)Ni=1ωTi(t)ωi(t)0. (3.11)

    Any scalar ε1 that there exists can be obtained using the inequality above.

    0ε1Ni=11υiDi(t)ε1ωT(t)ω(t)+ε1YT1(t)UTPΞ3UPY1(t)+ε1YT3(t)UTIΞ3UIY3(t)+ε1YT4(t)UTDΞ3UDY4(t)+2ε1YT1(t)UTPΞ3UIY3(t)+2ε1YT1(t)UTPΞ3UDY4(t)+2ε1YT3(t)UTIΞ3UDY4(t), (3.12)

    where Ξ3=diag{μ1I,μ2I,...,μNI}.

    We can obtain the following from Lemma 2.2 and any scalar ε2:

    2ε2YT1(t)ˆΥ2(G(φ(t)))ε2YT1(t)ˆΥ1Y1(t)ε2(GT(φ(t)))(G(φ(t)))0. (3.13)

    It is evident that 0=˙φ(t)Y4(t), and the following equality exists for any free-weighting matrices Nr, (r=1,2,...,8):

    0=2[YT1(t)N1+YT2(t)N2+YT3(t)N3+YT4(t)N4+YT5(t)N5+YT6(t)N6+YT7(t)N7+YT8(t)N8]×[Aφ(t)+(G(φ(t)))+(EΘ1)φ(t)+(HΘ2)φ(tα(t))+(JΘ3)ttδφ(v)dvΨ(t)+ω(t)Y4(t)]. (3.14)

    Now, combining the equations from (3.2)–(3.14), we have the following inequality:

    ˙V(t)+2βV(t)ΣT(t)JΣ(t), (3.15)

    where Σ(t)=[YT1(t)YT2(t)YT3(t)YT4(t)YT5(t)YT6(t)YT7(t)YT8(t)ωT(t)(GT(φ(t)))ˉDT(t)] and ˉD(t)=[D121(t)D122(t)...D12N(t)]T.

    Now, we can easily obtain that

    ˙V(t)+2βV(t)0.

    Following a similar line as in [58], we have

    V(0)Λ||φ(0)||2, (3.16)

    where

    Λ=λmax(B1)+λmax(Wa)+λmax(Wb)+ςλmax(C1)+ςλmax(C2)+ςλmax(C3)+ςλmax(C4)+λmax(B2)+δ2λmax(C5).

    It becomes known that

    V(t)V(0)e2βt(Λ||φ(0)||2+Ni=11υiDi(0))e2βt. (3.17)

    On the other hand,

    V(t)e2βtφT(t)B1φ(t)e2βtλminB1||φ(t)||2. (3.18)

    Thus, one has

    ||φ(t)||Λ||φ(0)||2+Ni=11υiDi(0)λmin(B1)eβt. (3.19)

    As a result, it completes the proof of Theorem 3.1. Therefore, from Definition 2.4 we see that the CDNs (2.1) and (2.2) are exponentially synchronized and demonstrate that the CDN error (2.11) is exponentially stable.

    Remark 3.2. Excluding Zeno Behavior: We need to analyze whether the system has a minimum event-triggered time interval strictly greater than zero, which means that there is no Zeno behavior. Assume that there exists Zeno behavior for at the ith node, which implies that there exists 0<T< such that limktik=T, where T is a positive constant.

    From (3.17) we know that there exists a positive constant M0>0 such that |φi(t)|M0 for all t0 and i=1,2,...,n. Then, we have |ui(t)|2M0Ψi.

    Let ξ0=Di(0)4ΨiM0υie12(ρi+1υi)T>0. Then, from the property of limits, there exists a positive integer N(ξ0) such that tik[Tξ0,T], kN(ξ0).

    By the triggering instant tik and event-triggered condition with Li(t)>0, we can get the following: |φi(t)|Di(0)υiΨie12(ρi+1υi)t>0.

    Given |ui(t)|2M0Ψi and |φi(tik)|=0 for any triggering time tik, we conclude that the sufficient condition to the above inequality is

    (ttik)2M0ΨiDi(0)υiΨie12(ρi+1υi)t.

    This leads to

    tiN(ξ0)+1tiN(ξ0)Di(0)2ΨiM0υie12(ρi+1υi)tiN(ξ0)+1,Di(0)2ΨiM0υie12(ρi+1υi)T=2ξ0.

    This contradicts the condition tik[Tξ0,T], kN(ξ0). Therefore, Zero behavior is excluded.

    In the next subsection we will investigate the uncertain CDNs with hybrid delays, and finding the results of the CDNs with given PID control parameters leading to exponential synchronization. Linear matrix inequalities are employed to accommodate uncertainties.

    Consider the error CDNs (2.10) involving coupling uncertainties. In this context, replace the matrices A,Θ1,Θ2 and Θ3 with A+ΔA, ˆΘ1+ΔˆΘ1, ˆΘ2+ΔˆΘ2, ˆΘ3+ΔˆΘ3, respectively. These variables correspond to an N number of nodes and each node as an n-dimensional subsystem in the following form

    ˙xi(t)=(A+ΔA(t))xi(t)+G(φi(t))+Nj=1Eij(ˆΘ1+ΔˆΘ1(t))xj(t)+Nj=1Hij(ˆΘ2+ΔˆΘ2(t))xj(tα(t))+Nj=1Jij(ˆΘ3+ΔˆΘ3)ttδxj(s)dsUiPφi(t)UiIt0φi(s)dsUiD˙φi(t)+ωi(t), (3.20)

    where ΔA(t), ΔˆΘ1(t), ΔˆΘ2(t) and ΔˆΘ3(t) are the uncertain time varying matrices with norm bounded and satisfy the following:

    [ΔA(t) ΔˆΘ1(t)ΔˆΘ2(t)ΔˆΘ3(t)]=¯ΥM(t)[Π1Π2Π3Π4], (3.21)

    where, ¯Υ and Πa(a=1,2,3,4) are the known constant matrices, and M(t) is the unknown time-varying matrices with suitable dimension and satisfying the MT(t)M(t)I. Now, the compact form of error system can be given by

    ˙φ(t)=(A+ΔA(t))φ(t)+G(φi(t))+(E(ˆΘ1+ΔˆΘ1(t)))φ(t)(H(ˆΘ2+ΔˆΘ2(t)))φ(tα(t))+(J(ˆΘ3+ΔˆΘ3(t)))ttδφ(s)dsUPφ(t)UIt0φ(s)dsUD˙φ(t)+ω(t). (3.22)

    Theorem 3.3. For given parameters ς1, ρ, μ, υ and β with known control parameters UP, UI and UD and the Assumption H1 being true, the CDNs (3.20) are said to be exponentially stable if there exist positive definite matrices C1, C2, C3, C4, C5, B1, B2 and Wa=[W1W2W3]>0, Wb=[W4W5W6]>0 and appropriate dimension matrices Nr (r=1,2,...,8) and positive scalars λ1, λ2, ε1 and ε2, such that the following LMIs hold:

    ˆJ=[ˆJ]13×13<0, (3.23)

    where, ˆJ11=(B1+BT1)+C1+C2+B2+ςC5+2βB1+2βW1+2βW4+UTPΞ1UP+2[N1A+N1(EˆΘ1)N1UP]+ε1UTPΞ3UPε2ˆΥ1+λ1Π1ΠT1+λ2Π2ΠT2; ˆJ12=2βWT2+NT1(HˆΘ2)T+N2[A+(EˆΘ1)2UP]+λ1Π1ΠT3; ˆJ13=UTPUIΞ1N1UI+N3[A+(EˆΘ1)UP]+ε12UTPUIΞ3; ˆJ14=B1+WT1+WT4+UTPΞ1UD[N1UD+N1]+N4[A+(EˆΘ1)UP]+2ε1UTPΞ3UD; ˆJ15=(1ς)W3+N5[A+(EˆΘ1)UP]; ˆJ16=N1(JˆΘ3)+N6[A+(EˆΘ1)UP]+λ1Π1ΠT4; ˆJ17=N7[A+(EˆΘ1)UP]+2βW5; ˆJ18=WT5+N8[A+(EˆΘ1)UP]; ˆJ19=NT1; ˆJ110=NT1ε2ˆΥ2; ˆJ112=N1¯Υ; ˆJ113=N1¯Υ; ˆJ22=e2βς(1ς)C2+2βW3+N2(HˆΘ2)+λ1Π3ΠT3; ˆJ23=N2UI+N3(HˆΘ2); ˆJ24=W2[N2+N2UD]+N4(HˆΘ2); ˆJ25=(1ς)W3+N5(HˆΘ2); ˆJ26=N2(JˆΘ3)+N6[HˆΘ2]; ˆJ27=N7(HˆΘ2); ˆJ28=N8(HˆΘ2); ˆJ29=NT2; ˆJ210=NT2; ˆJ212=N2¯Υ; ˆJ213=N2¯Υ; ˆJ33=UTIΞ1UI2N3UI+ε1UTIΞ3UI; ˆJ34=UTIΞ1UD[N3UD+N3]+ε1+UTIΞ3UDN4UI; ˆJ35=N5UI; ˆJ36=N3[JˆΘ3]N6UI; ˆJ37=N7UI; ˆJ38=N8UI; ˆJ39=NT3; ˆJ310=NT3; ˆJ312=N3¯Υ; ˆJ313=N3¯Υ; ˆJ44=UTDΞ1UD+C3+C42[N4UD+N4]+ε1UTDΞ2UD; ˆJ45=[N5UD+N5]; ˆJ46=N4(JˆΘ3)[N6UD+N6]; ˆJ47=WT5[N7UD+N7]; ˆJ48=[N8UD+N8]; ˆJ49=NT4; ˆJ410=NT4; ˆJ412=N4¯Υ; ˆJ413=N4¯Υ; ˆJ55=(1ς)e2βςC4; ˆJ56=N5(JˆΘ3); ˆJ59=NT5; ˆJ510=NT5; ˆJ512=N5¯Υ; ˆJ513=N5¯Υ; ˆJ66=e2βςδC5+N6(JˆΘ3)+λ1Π4ΠT4; ˆJ67=N7(JˆΘ3); ˆJ68=N8(JˆΘ3); ˆJ69=NT6; ˆJ610=NT6; ˆJ612=N6¯Υ; ˆJ613=N6¯Υ; ˆJ77=e2βςC1+2βW6; ˆJ78=WT5; ˆJ79=NT7; ˆJ710=NT7; ˆJ712=N7¯Υ; ˆJ713=N7¯Υ; J88=e2βςC3; J89=NT8; ˆJ810=NT8; ˆJ812=N8¯Υ; ˆJ813=N8¯Υ; ˆJ99=Ξ1ε1I; ˆJ1010=ε2I, ˆJ1111=diag{ρ1+2β+μ1υ1,ρ2+2β+μ1υ2,ρN+2β+μ1υN}; ˆJ1212=λ1I; ˆJ1313=λ2I.

    Proof. Based on the condition in (3.21), we are able to express that the subsequent A+ΔA, ˆΘ1+ΔˆΘ1, ˆΘ2+ΔˆΘ2, and ˆΘ3+ΔˆΘ3 are replaced with A+¯ΥM(t)Π1, Θ1+¯ΥM(t)Π2, Θ2+¯ΥM(t)Π3, Θ3+¯ΥM(t)Π4, respectively. Then the LMI (3.1) for the uncertain condition is equivalent to the following condition:

    J+F1+F2, (3.24)
    F1=(Π1Π3000Π400000)M(t)(¯ΥNT7¯ΥNT2¯ΥNT3¯ΥNT4¯ΥNT5¯ΥNT6¯ΥNT7¯ΥNT8000)T+(¯ΥNT1¯ΥNT2¯ΥNT3¯ΥNT4¯ΥNT5¯ΥNT6¯ΥNT7¯ΥNT8000)MT(t)(Π1Π3000Π400000)T, (3.25)
    F2=(Π20000000000)M(t)(¯ΥNT1¯ΥNT2¯ΥNT3¯ΥNT4¯ΥNT5¯ΥNT6¯ΥNT7¯ΥNT8000)T+(¯ΥNT1¯ΥNT2¯ΥNT3¯ΥNT4¯ΥNT5¯ΥNT6¯ΥNT7¯ΥNT8000)MT(t)(Π20000000000)T. (3.26)

    By Lemma (2.3), necessary and sufficient conditions,

    F1λ1(Π1Π3000Π400000)(Π1Π3000Π400000)T+λ11(¯ΥNT7¯ΥNT2¯ΥNT3¯ΥNT4¯ΥNT5¯ΥNT6¯ΥNT7¯ΥNT8000)(¯ΥNT1¯ΥNT2¯ΥNT3¯ΥNT4¯ΥNT5¯ΥNT6¯ΥNT7¯ΥNT8000)T,
    F2λ2(Π20000000000)(Π20000000000)T+λ12(¯ΥNT1¯ΥNT2¯ΥNT3¯ΥNT4¯ΥNT5¯ΥNT6¯ΥNT7¯ΥNT8000)(¯ΥNT1¯ΥNT2¯ΥNT3¯ΥNT4¯ΥNT5¯ΥNT6¯ΥNT7¯ΥNT8000)T,

    Applying Schur complements, we can obtain from (3.16) that ˆJ1<0. This complete the proof.

    Remark 3.4. This work addresses the exponential synchronization of CDNs with hybrid delays using PID controller, in contrast to some research results on exponential synchronization of CDNs with time-varying delays [24,54,57]. In contrast to the approach used in [24,54,57], which investigated time scale, sample-data control, and impulsive effects, respectively, we studied PID controller with event-triggered mechanism using LMIs to directly incorporate the system's numerous coupling components in the hypothetical matrix in this paper. In addition, the method in [54] is distinct from applying appropriate Free-weight matrices to solve the problem with (3.1). As a result, the approach presented in this work is more effective while maintaining the system's complexity.

    Remark 3.5. Compared with [54], which did not take into account the influence of any controls while studying the synchronization of multi-weighted complex dynamical networks, our proposed results can guarantee exponential synchronization for CDNs with hybrid delays and event-triggered mechanisms. Particularly distinct from the standard results of PI/PD controllers in [52] and [53], in this research, we investigate PID controller as well as parameter uncertainties with PID controller, which is distinct from previous studies. In Table 1, a comparison table with previously published results is shown below.

    Table 1.  Comparison with other works.
    [10] [6,24,54] [52] [53] Our Paper
    CDNs
    Exponential Synchronization × × ×
    PI/PD Controller × ×
    PID Controller × × ×
    Uncertain terms × × × ×

     | Show Table
    DownLoad: CSV

    This section aims to illustrate the effectiveness of the main results developed in this paper using two numerical examples adopted from the literature.

    Example 4.1. Consider the general complex dynamical networks consisting of 5 nodes and each node as a 2-dimensional subsystem in the following form:

    ˙xi(t)=Axi(t)+G(φi(t))+5j=1EijΘ1xj(t)+5j=1HijΘ2xj(tα(t))+5j=1JijΘ3ttδxj(s)dsUiPφi(t)UiIt0φi(s)dsUiD˙φi(t)+ωi(t). (4.1)

    The state and inner-coupling matrices are constructed as follows:

    \begin{gather} \mathcal{A} = \left( \begin{array}{cc} 3.8 & 3.20 \\ 1.45 & 1.78 \\ \end{array} \right), \quad \mathcal{E} = \mathcal{H} = \mathcal{J} \left( \begin{array}{ccccc} -3 & 0.5 & -0.1 & 0 & 0\\ 0.5 & -0.4 & -1 & 0 & 0\\ 1 & 1.4 & -3 & 0 & 0.2\\ 0 & 0 & 0 & -1 & 0.6\\ 0 & 0 & 0 & 0.4 & -2\\ \end{array} \right),\quad\\ \Theta_{1} = \left( \begin{array}{cc} 0.25 & 0 \\ 0 & 0.25 \\ \end{array} \right),\quad \Theta_{2} = \left( \begin{array}{cc} 0.15 & 0 \\ 0 & 0.15 \\ \end{array} \right),\quad \Theta_{3} = \left( \begin{array}{cc} 0.35 & 0 \\ 0 & 0.35 \\ \end{array} \right).\quad \end{gather}

    Also, the nonlinear dynamical function can be chosen as

    \begin{gather*} \mathcal{G}(\varphi_i(t)) = \left[ \begin{array}{cc} tanh(0.3^{*}\varphi_{i1}(t)) \\ tanh(0.41^{*}\varphi_{i2}(t))\\ \end{array} \right], \end{gather*}

    which satisfies the condition that \Upsilon_{1} and \Upsilon_{2} can be given by

    \begin{gather*} \Upsilon_{1} = \left( \begin{array}{cc} -0.6 & -0.3 \\ 0.1 & 0.1 \\ \end{array} \right),\quad\nonumber \Upsilon_{2} = \left( \begin{array}{cc} -0.33 & -41 \\ 0.3 & 0.25 \\ \end{array} \right), \end{gather*}

    since parameter and threshold values can be chosen as \varsigma = 0.5 , \beta = 0.02 , \rho_{1} = \rho_{2} = \rho_{3} = \rho_{4} = \rho_{5} = 5 and \upsilon_{1} = \upsilon_{2} = \upsilon_{3} = \upsilon_{4} = \upsilon_{5} = 4 . Also, \mu_{1} = 0.15, \mu_{2} = 0.18, \mu_{3} = 0.16, \mu_{4} = 0.2, \mu_{5} = 0.12 and the upper bound \alpha = 2.5 . Due to the absence of control strategy in place, the state trajectories of the nodes in delayed CDNs cannot be synchronized with the trajectory of the isolated node. This is primarily because of the coupling effects and time-varying delays that are present. Therefore, we suggest using the PID controller in conjunction with the dynamic event-triggered strategy to synchronize all of the states to the target node. This will allow the complex network that is being considered to reach a state of synchronization. Eventually, to reach an exponential synchronization for delayed CDNs, our plan is to use a proportional control algorithm. According to the first theorem, if we assume that \mathcal{U}_{I} and \mathcal{U}_{D} will always remain equal to zero, the delayed complex dynamical network will be able to accomplish exponential synchronization when \mathcal{U}_{P} = 25 . The synchronization error trajectories \varphi_{j 1} and \varphi_{j 2} under the proportional controller are depicted in Figures 1 and 2. An illustration of the control input for the delayed CDN can be seen in Figure 3.

    Figure 1.  Evolution of synchronization error \varphi_{j1}(t) (Under Proportional controller), ( j = 1, 2, 3, 4, 5).
    Figure 2.  Evolution of synchronization error \varphi_{j2}(t) (Under Proportional controller), ( j = 1, 2, 3, 4, 5).
    Figure 3.  Control input.

    Next, if we assume that \mathcal{U}_{D} will always remain equal to zero, the delayed CDNs will be able to accomplish exponential synchronization when \mathcal{U}_{P} = 10 and \mathcal{U}_{I} = 55 . The synchronization error trajectories \varphi_{j 1} and \varphi_{j 2} under the proportional controller are depicted in Figures 4 and 5. An illustration of the control input for the delayed CDNs is shown in Figure 6.

    Figure 4.  Evolution of synchronization error \varphi_{j1}(t) (Under Proportional Integral controller), ( j = 1, 2, 3, 4, 5).
    Figure 5.  Evolution of synchronization error \varphi_{j2}(t) (Under Proportional Integral controller), j = 1, 2, 3, 4, 5.
    Figure 6.  Control input.

    Next, if we assume that \mathcal{U}_{I} will always remain equal to zero, the delayed complex dynamical network will be able to accomplish exponential synchronization when \mathcal{U}_{P} = 40 and \mathcal{U}_{D} = 0.55 . The synchronization error trajectories \varphi_{j 1} and \varphi_{j 2} under the proportional controller are depicted in Figures 7 and 8. An illustration of the control input for the delayed CDN can be seen in Figure 9.

    Figure 7.  Evolution of synchronization error \varphi_{j1}(t) (Under Proportional Derivative controller), ( j = 1, 2, 3, 4, 5).
    Figure 8.  Evolution of synchronization error \varphi_{j2}(t) (Under Proportional Derivative controller), ( j = 1, 2, 3, 4, 5).
    Figure 9.  Control input.

    Next, the delayed complex dynamical network will be able to accomplish exponential synchronization using PID controller when \mathcal{U}_{P} = 40 , \mathcal{U}_{I} = 55 and \mathcal{U}_{D} = 0.65 . The synchronization error trajectories \varphi_{j1} and \varphi_{j2} under the proportional controller are depicted in Figures 10 and 11. An illustration of the control input for the delayed CDNs can be seen in Figure 12.

    Figure 10.  Evolution of synchronization error \varphi_{j1}(t) (Under Proportional Integral Derivative controller), ( j = 1, 2, 3, 4, 5).
    Figure 11.  Evolution of synchronization error \varphi_{j2}(t) (Under Proportional Integral Derivative controller), ( j = 1, 2, 3, 4, 5).
    Figure 12.  Control input.

    By using the MATLAB LMI tool box, we have obtained the scalar values \varepsilon_{1} = 8.6389 , \varepsilon_{2} = 1.0853 , and positive definite matrices are given by

    \begin{gather*} \mathcal{W}_{1} = \left( \begin{array}{cc} 2.1399 & -0.2508\\ -0.2508 & 1.6640 \\ \end{array} \right),\quad \mathcal{W}_{2} = \left( \begin{array}{cc} 1.5791 & -0.3814\\ -0.3814 & 1.0592 \\ \end{array} \right),\quad \mathcal{W}_{3} = \left( \begin{array}{cc} 4.9061 & -1.4585\\ -1.4585 & 4.0388 \\ \end{array} \right), \end{gather*}
    \begin{gather*} \mathcal{W}_{4} = \left( \begin{array}{cc} 2.9941 & 0.2839\\ 0.2839 & 2.0446 \\ \end{array} \right),\quad \mathcal{W}_{5} = \left( \begin{array}{cc} 1.7289 & 0.1172\\ 0.1172 & 0.0866 \\ \end{array} \right),\quad \mathcal{W}_{6} = \left( \begin{array}{cc} 26.8389 & 0.0048\\ 0.0048 & -0.0128 \\ \end{array} \right), \end{gather*}
    \begin{gather*} \mathcal{N}_{1} = \left( \begin{array}{cc} 1.1918 & -0.0527\\ -0.0527 & 0.0065 \\ \end{array} \right),\quad \mathcal{N}_{2} = \left( \begin{array}{cc} 2.5062 & -0.1357\\ -0.1357 & 0.0490 \\ \end{array} \right),\quad \mathcal{N}_{3} = \left( \begin{array}{cc} 7.6356 & -0.2856\\ -0.2856 & 0.0350 \\ \end{array} \right), \end{gather*}
    \begin{gather*} \mathcal{N}_{4} = \left( \begin{array}{cc} 9.8037 & -0.3312\\ -0.3312 & 0.0490\\ \end{array} \right),\quad \mathcal{N}_{5} = \left( \begin{array}{cc} 4.4903 & 0.0339\\ 0.0339 & 0.0296 \\ \end{array} \right),\quad \mathcal{N}_{6} = \left( \begin{array}{cc} 1.2464 & 0.0088\\ 0.0088 & -0.0001 \\ \end{array} \right), \end{gather*}
    \begin{gather*} \mathcal{N}_{7} = \left( \begin{array}{cc} 3.6973 & 0.0116\\ 0.0116 & 0.0551 \\ \end{array} \right),\quad \mathcal{N}_{8} = \left( \begin{array}{cc} 4.5033 & 0.0128\\ 0.0128 & 0.0746 \\ \end{array} \right),\quad \mathcal{C}_{1} = \left( \begin{array}{cc} 2.1399 & -0.2508\\ -0.2508 & 1.6640\\ \end{array} \right), \end{gather*}
    \begin{gather*} \mathcal{C}_{2} = \left( \begin{array}{cc} 2.0314 -0.1100\\ -0.1100 & 1.4816 \\ \end{array} \right),\quad \mathcal{C}_{3} = \left( \begin{array}{cc} 2.9759 & 0.2172\\ 0.2172 & 3.2190 \\ \end{array} \right),\quad \mathcal{C}_{4} = \left( \begin{array}{cc} 1.0735 & 0.1313\\ 0.1313 & 1.2715 \\ \end{array} \right), \end{gather*}
    \begin{gather*} \mathcal{C}_{5} = \left( \begin{array}{cc} 1.0984 & 0.1347\\ 0.1347 & 1.3858 \\ \end{array} \right),\quad \mathcal{B}_{1} = \left( \begin{array}{cc} 0.7948 & 0.2775\\ 0.2775 & 1.1939 \\ \end{array} \right),\quad \mathcal{B}_{2} = \left( \begin{array}{cc} 1.7240 & 0.1790\\ 0.1790 & 1.9329\\ \end{array} \right). \end{gather*}

    Example 4.2. Consider the general uncertain CDNs consisting of 3 nodes and each node as a 2-dimensional subsystem in the following form:

    \begin{eqnarray} \dot{x}_{i}(t) & = & ({A}+\Delta {A}(t)) x_{i}(t)+ \mathcal{G}(\varphi_i(t))+ \sum\limits_{j = 1}^{3}\mathcal{E}_{i j}(\widehat{\Theta}_{1}+\Delta \widehat{\Theta}_{1}(t))x_{j}(t)+\sum\limits_{j = 1}^{3}\mathcal{H}_{i j}(\widehat{\Theta}_{2}+\Delta \widehat{\Theta}_{2}(t))x_{j}(t-\alpha(t))\\ \quad&&+\sum\limits_{j = 1}^{3}\mathcal{J}_{i j}(\widehat{\Theta}_{3}+\Delta \widehat{\Theta}_{3}) \int_{t-\delta}^{t}x_{j}(s)ds -\mathcal{U}_{i P}\varphi_{i}(t)-\mathcal{U}_{i I}\int_{0}^{t}\varphi_{i}(s)ds-\mathcal{U}_{i D}\dot{\varphi}_{i}(t)+\omega_{i}(t). \end{eqnarray} (4.2)

    The state and coupling uncertain matrices are constructed as follows:

    \begin{gather} {A} = \left( \begin{array}{cc} 3.8 & 3.20 \\ 1.45 & 1.78 \\ \end{array} \right), \quad \mathcal{E} = \left( \begin{array}{ccc} 3 & -1 & -2 \\ -1 & 2 & -1 \\ -2 & -1 & 3 \\ \end{array} \right),\quad \mathcal{H} = \left( \begin{array}{ccc} 4 & -2 & -2 \\ -2 & -1 & 3 \\ -2 & 3 & -1 \\ \end{array} \right),\quad\\ \mathcal{J} = \left( \begin{array}{ccc} -1 & 2 & 1 \\ 0 & -2 & 2 \\ 1 & 2 & -3 \\ \end{array} \right),\quad \widehat{\Theta}_{1} = \left( \begin{array}{cc} 0.25 & 0 \\ 0 & 0.25 \\ \end{array} \right),\quad \widehat{\Theta}_{2} = \left( \begin{array}{cc} 0.15 & 0 \\ 0 & 0.15 \\ \end{array} \right),\quad \widehat{\Theta}_{3} = \left( \begin{array}{cc} 0.35 & 0 \\ 0 & 0.35 \\ \end{array} \right),\quad\\ \Pi_{1} = \left( \begin{array}{cc} 2.54 & 3.52 \\ 5.15 & 0.61 \\ \end{array} \right),\quad \Pi_{2} = \left( \begin{array}{cc} 1.54 & 0.32 \\ 5.15 & 1.61 \\ \end{array} \right),\quad \Pi_{3} = \left( \begin{array}{cc} 1.54 & 0.32 \\ 0.15 & 0.13 \\ \end{array} \right),\quad \Pi_{4} = \left( \begin{array}{cc} 1.34 & 0.22 \\ 0.25 & 0.41 \\ \end{array} \right).\quad \end{gather}

    Also, the nonlinear dynamical function can be chosen as

    \begin{gather*} \mathcal{G}(\varphi_i(t)) = \left[ \begin{array}{cc} tanh(0.2^{*}\varphi_{i1}(t)) \\ tanh(0.34^{*}\varphi_{i2}(t))\\ \end{array} \right], \end{gather*}

    which satisfies the condition that \Upsilon_{1} and \Upsilon_{2} can be given by

    \begin{gather*} \Upsilon_{1} = \left( \begin{array}{cc} -0.54 & -0.74 \\ 0.12 & 0 \\ \end{array} \right),\quad\nonumber \Upsilon_{2} = \left( \begin{array}{cc} -0.43 & -45 \\ 0.32 & 0.2 \\ \end{array} \right). \end{gather*}

    The selected known parameters are \varsigma = 0.5 and \beta = 0.01 , with the maximum allowable upper bound set at \alpha = 2.2 . To achieve exponential synchronization for delayed complex dynamical networks under parameter uncertainties, our strategy involves employing a proportional control algorithm. According to the Theorem 3.3, assuming both \mathcal{U}_{I} and \mathcal{U}_{D} are consistently zero, the delayed complex dynamical network can achieve exponential synchronization with \mathcal{U}_{P} = 31 .

    The synchronization error trajectories, \varphi_{i 1} and \varphi_{j 2} , under the proportional controller are illustrated in Figures 13 and 14. An illustration of the control input for the delayed CDNs can be found in Figure 15.

    Figure 13.  Evolution of synchronization error \varphi_{j1}(t) (Under Proportional controller), j = 1, 2, 3.
    Figure 14.  Evolution of synchronization error \varphi_{j2}(t) (Under Proportional controller), j = 1, 2, 3.
    Figure 15.  Control input.

    Moving forward, applying Theorem 3.3, assuming \mathcal{U}_{D} remains constantly zero, the delayed CDNs can achieve exponential synchronization with \mathcal{U}_{P} = 20 and \mathcal{U}_{I} = 60 . The synchronization error trajectories, \varphi_{i 1} and \varphi_{j 2} , under the proportional controller are depicted in Figures 16 and 17. A visualization of the control input for the delayed CDNs is presented in Figure 18.

    Figure 16.  Evolution of synchronization error \varphi_{ji1}(t) (Under Proportional Integral controller), j = 1, 2, 3.
    Figure 17.  Evolution of synchronization error \varphi_{j2}(t) (Under Proportional Integral controller), j = 1, 2, 3.
    Figure 18.  Control input.

    Continuing, if we assume \mathcal{U}_{I} remains constantly zero, the delayed complex dynamical network can achieve exponential synchronization with \mathcal{U}_{P} = 50 and \mathcal{U}_{D} = 0.55 . The synchronization error trajectories, \varphi_{i 1} and \varphi_{j 2} , under the proportional controller are shown in Figures 19 and 20. An illustration of the control input for the delayed CDNs can be seen in Figure 21.

    Figure 19.  Evolution of synchronization error \varphi_{j1}(t) (Under Proportional Derivative controller), j = 1, 2, 3.
    Figure 20.  Evolution of synchronization error \varphi_{j2}(t) (Under Proportional Derivative controller), j = 1, 2, 3.
    Figure 21.  Control input.

    Further applying Theorem 3.3, the CDNs can achieve exponential synchronization using a PID controller with \mathcal{U}_{P} = 53 , \mathcal{U}_{I} = 75 , and \mathcal{U}_{D} = 0.65 . The synchronization error trajectories, \varphi_{j 1} and \varphi_{j 2} , under the proportional controller are visualized in Figures 22 and 23. An illustration of the control input for the delayed CDNs is available in Figure 24.

    Figure 22.  Evolution of synchronization error \varphi_{j1}(t) (Under PID controller), j = 1, 2, 3.
    Figure 23.  Evolution of synchronization error \varphi_{j2}(t) (Under PID controller), j = 1, 2, 3.
    Figure 24.  Control input.

    By utilizing the MATLAB LMI toolbox, we can get the following scalar values \varepsilon_{1} = 4.5477 , \varepsilon_{2} = 7.0519 and positive definite matrices:

    \begin{gather*} \mathcal{W}_{1} = \left( \begin{array}{cc} 2.5546& -0.0058 \\ -0.0058 & 2.5131 \\ \end{array} \right),\quad \mathcal{W}_{2} = \left( \begin{array}{cc} 838.5003 & 0.6866 \\ 0.9866 & 847.1332 \\ \end{array} \right),\quad \mathcal{W}_{3} = \left( \begin{array}{cc} 1.1224 & -0.0069 \\ -0.0069 & 1.0950 \\ \end{array} \right), \end{gather*}
    \begin{gather*} \mathcal{W}_{4} = \left( \begin{array}{cc} 2.9185 & 0.0074 \\ 0.0074 & 2.9413 \\ \end{array} \right),\quad \mathcal{W}_{5} = \left( \begin{array}{cc} 1.3328 & -0.0144 \\ -0.0144 & 1.3244 \\ \end{array} \right),\quad \mathcal{W}_{6} = \left( \begin{array}{cc} 362.7104 & 3.6002 \\ 3.6002 & 353.4019 \\ \end{array} \right), \end{gather*}
    \begin{gather*} \mathcal{N}_{1} = \left( \begin{array}{cc} 15.9662 & -0.3751 \\ -0.3751 & 15.5536 \\ \end{array} \right),\quad \mathcal{N}_{2} = \left( \begin{array}{cc} 17.8032 & -0.4754 \\ -0.4754 & 17.9828 \\ \end{array} \right),\quad \mathcal{N}_{3} = \left( \begin{array}{cc} 4.5940 & -0.1211 \\ -0.1211 & 4.3925 \\ \end{array} \right), \end{gather*}
    \begin{gather*} \mathcal{N}_{4} = \left( \begin{array}{cc} 10.5927 & -0.1858 \\ -0.1858 & 10.7247 \\ \end{array} \right),\quad \mathcal{N}_{5} = \left( \begin{array}{cc} 9.8368 & -0.2625 \\ -0.0625 & 9.6927 \\ \end{array} \right),\quad \mathcal{N}_{6} = \left( \begin{array}{cc} 1.6559 & -0.0148 \\ -0.0148 & 1.5761 \\ \end{array} \right), \end{gather*}
    \begin{gather*} \mathcal{N}_{7} = \left( \begin{array}{cc} 14.2600 & -0.3720 \\ -0.3720 & 14.2429 \\ \end{array} \right),\quad \mathcal{N}_{8} = \left( \begin{array}{cc} 18.5753 & -0.3917 \\ -0.3917 & 18.5580 \\ \end{array} \right),\quad \mathcal{C}_{1} = \left( \begin{array}{cc} 1.7252 & 0.1201 \\ 0.0120 & 2.1247 \\ \end{array} \right), \end{gather*}
    \begin{gather*} \mathcal{C}_{2} = \left( \begin{array}{cc} 1.1020 & -0.0023 \\ -0.0023 & 1.1232 \\ \end{array} \right),\quad \mathcal{C}_{3} = \left( \begin{array}{cc} 1.5381 & -0.0077 \\ -0.0077 & 1.5649 \\ \end{array} \right),\quad \mathcal{C}_{4} = \left( \begin{array}{cc} 2.1049 & -0.0206 \\ -0.0206 & 1.5649 \\ \end{array} \right), \end{gather*}
    \begin{gather*} \mathcal{C}_{5} = \left( \begin{array}{cc} 9.2451 & -0.0344 \\ -0.0344 & 9.2441 \\ \end{array} \right),\quad \mathcal{B}_{1} = \left( \begin{array}{cc} 2.4181 & 0.4222 \\ 0.4222 & 2.9580 \\ \end{array} \right), \mathcal{B}_{2} = \left( \begin{array}{cc} 1.3451 & 0.3942 \\ 0.3942 & 1.6548 \\ \end{array} \right). \end{gather*}

    Example 4.3. Consider the complex dynamical networks (4.1) consisting of 8 nodes and each node as a 3 -dimensional subsystem, and the known parameters are given as follows:

    \begin{gather} \mathcal{A} = \left( \begin{array}{ccc} -1 & 0 &0 \\ 0 & -1 &0 \\ 0 & 0 & -1\\ \end{array} \right), \quad \mathcal{E} = \mathcal{H} = \mathcal{J} \left( \begin{array}{cccccccc} -2 & 0 & 1 & 1 & 0 &0 & 0 & 0\\ 0 & -3 & 1 & 1 & 0 &1 & 0 & 0\\ 1 & 2 & -3 & 0 & 0 &0 & 0 & 1\\ 1 & 1 & 0 & -4 & 1 &0 & 0 & 1\\ 0 & 0 & 0 & 1 & -2 &0 & 1 & 0\\ 0 & 1 & 0 & 0 & 0 &-2 & 0 & 1\\ 0 & 0 & 0 & 0 & 1 &0 & -2 & 1\\ 0 & 0 & 1 & 1 & 0 &1 & 1 & -4\\ \end{array} \right),\quad\\ \Theta_{1} = \left( \begin{array}{ccc} 0.08 & 0 & 0\\ 0 & 0.08 & 0\\ 0 & 0& 0.08\\ \end{array} \right),\quad \Theta_{2} = \left( \begin{array}{ccc} 0.1 & 0 & 0\\ 0 & 0.1 & 0\\ 0 & 0& 0.1\\ \end{array} \right),\quad \Theta_{3} = \left( \begin{array}{ccc} 0.5 & 0 & 0\\ 0 & 0.5 & 0\\ 0 & 0& 0.5\\ \end{array} \right).\quad \end{gather}

    The nonlinear function is considered as follows:

    \begin{gather*} \mathcal{G}(\varphi_i(t)) = \left[ \begin{array}{cc} tanh(0.1^{*}\varphi_{i1}(t)) \\ tanh(0.15^{*}\varphi_{i2}(t))\\ tanh(0.2^{*}\varphi_{i2}(t))\\ \end{array} \right]. \end{gather*}

    The parameters and threshold values can be set as follows: \varsigma = 0.2 , \beta = 0.01 , \rho_{1} = \rho_{2} = \rho_{3} = \rho_{4} = \rho_{5} = \rho_{6} = \rho_{7} = \rho_{8} = 2 , and \upsilon_{1} = \upsilon_{2} = \upsilon_{3} = \upsilon_{4} = \upsilon_{5} = \upsilon_{6} = \upsilon_{7} = \upsilon_{8} = 2 . Additionally, \mu_{1} = 0.03 , \mu_{2} = 0.06 , \mu_{3} = 0.02 , \mu_{4} = 0.02 , \mu_{5} = 0.1 , and the upper bound \alpha = 1.5 . Using the same control parameters from Example 3.1, it can be verified through the Matlab toolbox that inequality (3.1) in Theorem 3.1 is satisfied. The results are shown in Figure 25.

    Figure 25.  Synchronization of \varphi_{j1}(t) , \varphi_{j2}(t) , \varphi_{j3}(t) (Under PID controller), ( 1\leq j\leq 8 ).

    In this manuscript, we have presented a novel approach to achieving exponential synchronization in CDNs with hybrid delays by combining PID control with a dynamic event-trigger mechanism. We formulate a comprehensive mathematical model for the network and establish synchronization criteria using LMI techniques. We have also demonstrated the stability of the system under the proposed control approach using Lyapunov stability theory techniques. Our numerical simulations have shown that the proposed approach is effective in achieving exponential synchronization in CDNs with hybrid delays and that the use of PID control parameter values and a dynamic event trigger mechanism can lead to significant improvements in the efficiency and robustness of the control strategy. Our results have important implications for the development of more advanced and effective control strategies for complex systems, particularly in the presence of delays and other sources of uncertainty. We hope that our research will inspire further investigations into the use of PID control and dynamic event trigger mechanisms in CDNs and contribute to the development of more efficient and robust control strategies for complex systems in the future.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    M. Rhaima was supported by Researchers Supporting Project number (RSPD2023R683), King Saud University, Riyadh, Saudi Arabia. The first author gratefully acknowledges that this work is funded by the Centre for Nonlinear Systems, Chennai Institute of Technology (CIT), India, funding number CIT/CNS/2023/RP-005.

    The author declares that there is no conflict of interest regarding the publication of this paper.



    [1] J. Rafferty, C. D. Nugent, J. Liu, L. Chen, From activity recognition to intention recognition for assisted living within smart homes, IEEE Trans. Human Machine Syst., 47 (2017), 368–379. https://doi.org/10.1109/THMS.2016.2641388 doi: 10.1109/THMS.2016.2641388
    [2] Y. Sun, Z. Zhang, I Kakkos, G. K. Matsopoulos, J. J. Yuan, J. Suckling, Inferring the individual psychopathologic deficits with structural connectivity in a longitudinal cohort of Schizophrenia, IEEE J. Biomed. Health Informa., 26 (2022), 2536–2546. https://doi.org/10.1109/JBHI.2021.3139701 doi: 10.1109/JBHI.2021.3139701
    [3] Z. Guo, L. Zhao, J. Yuan, H. Yu, MSANet: Multiscale aggregation network integrating spatial and channel information for Lung nodule detection, IEEE J. Biomed. Health Inform., 26 (2022), 2547–2558. https://doi.org/10.1109/JBHI.2021.3131671 doi: 10.1109/JBHI.2021.3131671
    [4] J. W. Li, S. Barma, P. Un Mak, F. Chen, C. Li, M. T. Li, et al., Single-channel selection for EEG-based emotion recognition using brain rhythm sequencing, IEEE J. Biomed. Health Inform., 26 (2022), 2493–2503. https://doi.org/10.1109/JBHI.2022.3148109 doi: 10.1109/JBHI.2022.3148109
    [5] C. Finn, I. Goodfellow, S. Levine, Unsupervised learning for physical interaction through video prediction, arXiv: 1605.07157, 2016. https://doi.org/10.48550/arXiv.1605.07157
    [6] L. Liu, L. Cheng, Y. Liu, Y. Jia, D. S. Rosenblum, Recognizing complex activities by a probabilistic interval-based model, In: Proceedings of the thirtieth AAAI conference on artificial intelligence (AAAI'16), AAAI Press, 2016, 1266–1272. https://doi.org/10.5555/3015812.3015999
    [7] Z. Cao, T. Simon, S. E. Wei, Y. Sheikh, Realtime multi-person 2D pose estimation using part affinity fields, arXiv: 1611.08050, 2016. https://doi.org/10.48550/arXiv.1611.08050
    [8] R. Vemulapalli, F. Arrate, R. Chellappa, Human action recognition by representing 3D skeletons as points in a Lie group, In: 2014 IEEE Conference on computer vision and pattern recognition, 2014,588–595. https://doi.org/10.1109/CVPR.2014.82
    [9] K. Fragkiadaki, S. Levine, P. Felsen, J. Malik, Recurrent network models for human dynamics, In: IEEE International conference on computer vision (ICCV), 2015, 4346–4354. https://doi.org/10.1109/ICCV.2015.494
    [10] A. Jain, A. R. Zamir, S. Savarese, A. Saxena, Structural-RNN: Deep learning on spatio-temporal graphs, In: 2016 IEEE Conference on computer vision and pattern recognition (CVPR), 2016, 5308–5317. https://doi.org/10.1109/CVPR.2016.573
    [11] J. Redmon, A. Farhadi, YOLOv3: An incremental improvement, arXiv: 1804.02767, 2018. https://doi.org/10.48550/arXiv.1804.02767
    [12] K. Smagulova, A. P. James, A survey on LSTM memristive neural network architectures and applications, Eur. Phys. J. Spec. Top., 228 (2019), 2313–2324. https://doi.org/10.1140/epjst/e2019-900046-x doi: 10.1140/epjst/e2019-900046-x
    [13] J. Hu, Z. Fan, J. Liao, L. Liu, Predicting long-term skeletal motions by a spatio-temporal hierarchical recurrent network, arXiv: 1911.02404, 2019. https://doi.org/10.48550/arXiv.1911.02404
    [14] C. Li, P. Wang, S. Wang, Y. Hou, W. Li, Skeleton-based action recognition using LSTM and CNN, In: 2017 IEEE International conference on multimedia & expo workshops (ICMEW), 2017,585–590. https://doi.org/10.1109/ICMEW.2017.8026287
    [15] Q. Huang, L. Jia, G. Ren, X. Wang, C. Liu, Extraction of vascular wall in carotid ultrasound via a novel boundary-delineation network, Eng. Appl. Artif. Intell., 121 (2023), 106069. https://doi.org/10.1016/j.engappai.2023.106069 doi: 10.1016/j.engappai.2023.106069
    [16] J. Liu, Y. Wang, Y. Liu, S. Xiang, C. Pan, 3D PostureNet: A unified framework for skeleton-based posture recognition, Pattern Recognition Lett., 140 (2020), 143–149. https://doi.org/10.1016/j.patrec.2020.09.029 doi: 10.1016/j.patrec.2020.09.029
    [17] P. Wang, J. Wen, C. Si, Y. Qian, L. Wang, Contrast-reconstruction representation learning for self-supervised skeleton-based action recognition, IEEE Trans. Image Process., 31 (2022), 6224–6238. https://doi.org/10.1109/TIP.2022.3207577 doi: 10.1109/TIP.2022.3207577
    [18] A. Krizhevsky, I. Sutskever, G. E. Hinton, ImageNet classification with deep convolutional neural networks, Commun. ACM, 60 (2017), 84–90. https://doi.org/10.1145/3065386 doi: 10.1145/3065386
    [19] T. M. Taha, R. Hasan, C. Yakopcic, M. R. McLean, Exploring the design space of specialized multicore neural processors, In: 2013 International joint conference on neural networks (IJCNN), 2013, 1–8. https://doi.org/10.1109/IJCNN.2013.6707074
    [20] L. Chua, Memristor-The missing circuit element, IEEE Trans. Circuit Theory, 18 (1971), 507–519. https://doi.org/10.1109/TCT.1971.1083337 doi: 10.1109/TCT.1971.1083337
    [21] S. Wen, R. Hu, Y. Yang, T. Huang, Z. Zeng, Y. D. Song, Memristor-based echo state network with online least mean square, IEEE Trans. Syst. Man Cybernet., 49 (2019), 1787–1796. https://doi.org/10.1109/TSMC.2018.2825021 doi: 10.1109/TSMC.2018.2825021
    [22] S. H. Jo, K. H. Kim, W. Lu, High-density crossbar arrays based on a Si memristive system, Nano Lett., 9 (2009), 870–874. https://doi.org/10.1021/nl8037689 doi: 10.1021/nl8037689
    [23] R. Hasan, T. M. Taha, C. Yakopcic, On-chip training of memristor crossbar based multi-layer neural networks, Microelectronics J., 66 (2017), 31–40. https://doi.org/10.1016/j.mejo.2017.05.005 doi: 10.1016/j.mejo.2017.05.005
    [24] S. Wen, H. Wei, Y. Yang, Z. Guo, Z. Zeng, T. Huang, et al., Memristive LSTM network for sentiment analysis, IEEE Trans. Syst. Man Cybernet., 51 (2019), 1794–1804. https://doi.org/10.1109/TSMC.2019.2906098 doi: 10.1109/TSMC.2019.2906098
    [25] X. Liu, Z. Zeng, D. C. Wunsch, Memristor-based LSTM network with in situ training and its applications, Neural Netw. 131 (2020), 300–311. https://doi.org/10.1016/j.neunet.2020.07.035
    [26] C. Yakopcic, M. Z. Alom, T. M. Taha, Memristor crossbar deep network implementation based on a convolutional neural network, In: 2016 International joint conferenceon neural networks (IJCNN), IEEE, 2016,963–970. https://doi.org/10.1109/IJCNN.2016.7727302
    [27] C. Yakopcic, M. Z. Alom, T. M. Taha, Extremely parallel memristor crossbar architecture for convolutional neural network implementation, In: 2017 International joint conference on neural networks (IJCNN), IEEE, 2017, 1696–1703. https://doi.org/10.1109/IJCNN.2017.7966055
    [28] S. Wen, J. Chen, Y. Wu, Z. Yan, Y. Cao, Y. Yang, CKFO: Convolution kemel first operated algorithm with applications in memristor-based convolutional neural network, IEEE Trans. Comput. Design Integr. Circuits Syst., 40 (2020), 1640–1647. https://doi.org/10.1109/TCAD.2020.3019993 doi: 10.1109/TCAD.2020.3019993
    [29] P. Yao, H. Wu, B. Gao, J. Tang, Q. Zhang, W. Zhang, et al., Fully hardware-implemented memristor convolutional neural network, Nature, 577 (2020), 641–646. https://doi.org/10.1038/s41586-020-1942-4 doi: 10.1038/s41586-020-1942-4
    [30] C. Ionescu, D. Papava, V. Olaru, C. Sminchisescu, Human3.6M: Large scale datasets and predictive methods for 3d human sensing in natural environments, IEEE Trans. Pattern Anal. Machine Intell., 36 (2013), 1325–1339. https://doi.org/10.1109/TPAMI.2013.248 doi: 10.1109/TPAMI.2013.248
    [31] A. Shahroudy, J. Liu, T. T. Ng, G. Wang, NTU RGB+D: A large scale dataset for 3D human activity analysis, In: 2016 IEEE Conference on computer vision and pattern recognition (CVPR), IEEE, 2016, 1010–1019. https://doi.org/10.1109/CVPR.2016.115
    [32] Y. Du, W. Wang, L. Wang, Hierarchical recurrent neural network for skeleton based action recognition, In: 2015 IEEE Conference on computer vision and pattern recognition (CVPR), IEEE, 2015, 1110–1118. https://doi.org/10.1109/CVPR.2015.7298714
    [33] C. Li, Y. Hou, P. Wang, W. Li, Joint distance maps based action recognition with convolutional neural networks, IEEE Signal Process. Lett., 24 (2017), 624–628. https://doi.org/10.1109/LSP.2017.2678539 doi: 10.1109/LSP.2017.2678539
    [34] P. Wang, W. Li, C. Li, Y. Hou, Action recognition based on joint trajectory maps with convolutional neurall networks, Knowledge Based Syst., 158 (2018), 43–53. https://doi.org/10.1016/j.knosys.2018.05.029 doi: 10.1016/j.knosys.2018.05.029
    [35] A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, et al., PyTorch: An imperative style, high-performance deep learning library, In: Proceedings of the 33rd international conference on neural information processing systems, 2019, 8026–8037.
    [36] C. Lammie, W. Xiang, B. Linares-Barranco, M. R. Azghadi, MemTorch: An open-source simulation framework for memristive deep learning systems, Neurocomputing, 485 (2022), 124–133. https://doi.org/10.1016/j.neucom.2022.02.043 doi: 10.1016/j.neucom.2022.02.043
    [37] Hadiyawarman, F. Budiman, D. G. O. Hernowo, R. R. Pandey, H. Tanaka, Recent progress on fabrication of memristor and transistor-based neuromorphic devices for high signal processing speed with low power consumption, Jpn. J. Appl. Phys., 57 (2018), 03EA06. https://doi.org/10.7567/JJAP.57.03EA06 doi: 10.7567/JJAP.57.03EA06
    [38] S. S. Sarwar, S. A. N. Saqueb, F. Quaiyum, A. B. M. H. U. Rashid, Memristor-based nonvolatile random access memory: Hybrid architecture for low power compact memory design, IEEE Access, 1 (2013), 29–34. https://doi.org/10.1109/ACCESS.2013.2259891 doi: 10.1109/ACCESS.2013.2259891
  • This article has been cited by:

    1. Donghui Wu, Ying Zhao, Hong Sang, Shuanghe Yu, Reachable set estimation for switched T-S fuzzy systems with a switching dynamic memory event-triggered mechanism, 2024, 490, 01650114, 109050, 10.1016/j.fss.2024.109050
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1402) PDF downloads(55) Cited by(1)

Figures and Tables

Figures(6)  /  Tables(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog