Co-Design of Periodic Event-Triggered Quantization Control for Linear Systems with Packet Losses

Abstract

This paper investigates the co-design problem of an event-triggered communication mechanism and a dynamic output feedback controller for networked control systems (NCSs) subject to packet losses and quantization errors under a no-ACK transmission mechanism. For the baseline scenario with packet losses only, an augmented closed-loop system model incorporating registers and auxiliary variables is constructed to characterize the effects of consecutive packet losses. A Lyapunov-based approach is then employed to derive sufficient linear matrix inequality (LMI) conditions for ℒ 2 -stability, based on which the dynamic periodic event-triggered mechanism (PETM) and the dynamic output feedback controller are co-designed. To further account for quantized signal transmission, a dynamic quantization scheme is introduced to prevent quantizer saturation caused by external disturbances through adaptive adjustment of the quantization scaling parameter. The dynamic PETM and dynamic quantizer are jointly designed as a unified dynamic periodic event-triggered quantization mechanism (PETQM), based on which an augmented closed-loop system model is established. The LMI conditions derived for the baseline scenario are then employed to facilitate the joint design of the dynamic PETQM and the dynamic output feedback controller, while accounting for the coupled effects of packet losses and quantization errors. Numerical examples demonstrate that the proposed method reduces network transmissions while maintaining the stability and control performance of the closed-loop system.

Share and Cite:

Hou, M. (2026) Co-Design of Periodic Event-Triggered Quantization Control for Linear Systems with Packet Losses. Open Journal of Applied Sciences, 16, 4093-4122. doi: 10.4236/ojapps.2026.1610225.

1. Introduction

Networked control systems (NCSs) are feedback control systems in which sensors, controllers, actuators, and plants communicate with each other through digital communication networks [1] [2]. Benefiting from their inherent advantages of flexible deployment, reduced wiring, and convenient maintenance, NCSs are widely used in industrial automation [3], intelligent transportation systems [4], and smart grids [5]. However, communication in NCSs relies on open digital networks and is inevitably subject to imperfections such as packet losses and bandwidth limitations. These phenomena often interact, significantly degrading system performance and potentially destabilizing the closed-loop system if not properly handled. Consequently, developing strategies that can simultaneously guarantee satisfactory control performance and efficient communication resource utilization has become a critical research challenge.

To reduce unnecessary communication, event-triggered control (ETC) was proposed to transmit data only when necessary in [6] [7]. Most existing studies consider continuous ETC (CETC), where the triggering condition is continuously evaluated [5] [8]-[10]. However, continuous evaluation makes it difficult to guarantee a positive minimum inter-event time (MIET), which may lead to the Zeno phenomenon. In contrast, periodic ETC (PETC) evaluates the triggering condition only at discrete sampling instants [11]. The sampling period thus provides a positive MIET and naturally excludes Zeno behavior. Moreover, [12] showed that dynamic ETC can reduce the number of communication events. By introducing additional dynamic variables, dynamic periodic event-triggered mechanism (PETM) provides greater flexibility in designing the triggering conditions [13]-[16]. These advantages motivate the study of dynamic PETMs in this paper.

Due to the unreliability of network transmission, packet loss is an unavoidable phenomenon in NCSs, which may degrade system performance or even destabilize the closed-loop system [9]. To address the effects of packet losses, various packet loss models have been considered in the literature. For example, random packet losses have been investigated in [17] [18], while consecutive packet losses have been considered in [10] [15] [19]. It should be noted that the studies in [10] [15] [19] rely on acknowledgment mechanisms or assume that acknowledgment signals are transmitted without delay. However, in practical NCSs, acknowledgment signals may also experience packet losses or transmission delays during network transmission. Therefore, some recent studies, such as [9] [16], have investigated NCSs subject to packet losses without acknowledgment (no-ACK) mechanisms. In this paper, the baseline NCS considers consecutive packet losses under the no-ACK mechanisms.

In addition to packet loss, the inherent bandwidth limitations of communication networks necessitate the quantization of signals prior to transmission. A quantizer is a mapping that maps a signal from a continuous-valued domain to a finite set of discrete values. Existing quantization strategies are generally divided into static quantization [20] [21] and dynamic quantization [22]-[25]. Since the error bound of a static quantizer (SQ) is fixed, an infinite quantization range is often assumed to avoid saturation when the signal exceeds the quantization range. However, an infinite quantization range is difficult to realize in practice [21]. To overcome this limitation, [22] proposed a scaling-factor-based approach that dynamically adjusts the quantizer range and the quantizer error bound. However, most existing studies have not simultaneously considered consecutive packet losses and dynamic quantization in the absence of an acknowledgment mechanism. Motivated by these developments, this paper further investigates the effects of consecutive packet losses and quantization errors on closed-loop systems without an acknowledgment mechanism.

Most existing studies adopt a simulation-based design approach, where the controller is first designed without considering the network, followed by the design of an event triggering strategy for the resulting closed-loop system [10] [23] [24]. However, such a design procedure does not adequately capture the coupling between network constraints and controller synthesis. Consequently, the controller and event triggering mechanism may not be well coordinated, making it difficult to guarantee the stability of the resulting NCS. To address this issue, the co-design of event-triggering strategies and controllers has attracted increasing attention, as demonstrated in [26]-[29].

This paper considers two related co-design problems for NCSs under packet losses in the no-ACK network environment. First, dynamic PETMs for the sensor-to-controller and controller-to-actuator channels are co-designed with a dynamic output feedback controller for the baseline NCS with packet losses. An augmented closed-loop system model is constructed by introducing registers and auxiliary variables, based on which sufficient conditions for ℒ 2 stability are derived in the form of LMIs. Second, the framework is extended to NCSs subject to both packet losses and quantization errors by introducing dynamic quantizers. The scaling variables of the dynamic quantizers are adjusted dynamically to avoid saturation caused by external disturbances, while the dynamic quantizers enable finite-bit transmission at each transmission instant. The quantization errors are further incorporated into the event triggering conditions, leading to a co-design method for the dynamic PETQMs and controller that guarantees ℒ 2 stability of the resulting closed-loop system. The designed PETMs and PETQMs can be implemented using only locally available information at the triggering mechanisms, without relying on acknowledgment signals.

The remainder of this paper is organized as follows. Section 2 presents the problem formulation and introduces the two network environments considered in this paper. Section 3 addresses the co-design of dynamic PETMs and a dynamic output feedback controller for the baseline NCS under no-ACK packet losses. The closed-loop system model is first established, followed by the derivation of sufficient conditions for ℒ 2 stability. Section 4 extends the framework by incorporating dynamic quantization. The parameters of the dynamic quantizers are first designed, after which the closed-loop system model under the dynamic PETQM is established and its ℒ 2 stability is analyzed. Section 5 verifies the effectiveness of the proposed approaches via a numerical example. Finally, Section 6 concludes the paper.

Notations: ℝ n denotes the n -dimensional Euclidean space and ℕ denotes the set of nonnegative integers. Denote ℕ >0 =ℕ\{ 0 } , ℝ ≥0 =[ 0,∞ ) and ℝ >0 =( 0,∞ ) . 0 and I n stand for the zero matrix of appropriate dimensions and the n -dimensional identity matrix, respectively. For vectors x i ∈ ℝ n x i , i∈{ 1,2,⋯,M } , ( x 1 , x 2 ,⋯, x M ) stands for [ x 1 T , x 2 T ,⋯, x M T ] T . The maximum and minimum eigenvalues of a symmetric matrix A are denoted by λ min ( A ) and λ max ( A ) , respectively. A continuous function α: ℝ ≥0 → ℝ ≥0 is referred to as the class- K function if it is strictly increasing and satisfies α( 0 )=0 . Furthermore, if the function is of class K and unbounded, it is said to be the class- K ∞ function. A function g:D⊂ ℝ n → ℝ n is said to be locally Lipschitz function if there exists a positive constant K∈ ℝ >0 satisfying | g( a )−g( b ) |≤K| a−b | , for ∀a,b∈D , where K is said to be the Lipschitz constant. For a real number a , we denote ⌊ a ⌋ as the nearest integer to a , i.e., ⌊ a ⌋:=min{ n∈ℕ|a≤n } . For x∈ ℝ n and a locally Lipschitz function U: ℝ n →ℝ , U ∘ ( x;v ) is the Clarke derivative of the function U at x in the direction v , i.e., U ∘ ( x;v )=lim sup y→x,λ↓0 U( y+λv )−U( y ) λ .

2. Problem Formulation

Consider the following linear time-invariant plant:

{ x ˙ p ( t )= A p x p ( t )+ B p u ^ ( t )+ E p ω( t ), y( t )= C p x p ( t ), (1)

where x p ( t )∈ ℝ n x p is the state of plant, u ^ ( t )∈ ℝ n u is the most recent control input available at the actuator, ω( t )∈ ℝ n ω is an exogenous disturbance, y( t )∈ ℝ n y is the measurement output, A p , B p , E p and C p are known matrices with appropriate dimensions. The dynamic output feedback controller is given in the following form

{ x ˙ c ( t )= A c x c ( t )+ B c y ^ ( t ), u( t )= C c x c ( t ), (2)

where x c ( t )∈ ℝ n x c is the controller state, y ^ ( t )∈ ℝ n y is the most recently received measured output by the controller, and A c ∈ ℝ n x c × n x c , B c ∈ ℝ n x c × n y and C c ∈ ℝ n u × n x c are matrices to be designed. The performance output is given by

z( t )= C z x( t ), (3)

where z( t )∈ ℝ n z ,x=( x p , x c ) with n x := n x p + n x c , and C z =[ C zp 0 ]∈ ℝ n z × n x . Note that y ^ and u ^ denote the networked versions of y and u , respectively. Define the augmented vector v=( y,u )∈ ℝ n v , where v 1 =y∈ ℝ n y , v 2 =u∈ ℝ n u , and n v = n y + n u . The network-induced error is then defined as e:= v ^ −v , where e=( e 1 , e 2 ) , e 1 =: y ^ −y and e 2 =: u ^ −u .

2.1. Network Environment

This section describes the communication environment and signal transmission mechanism considered in this paper. To investigate the impact of packet losses on the stability of NCSs, we consider two scenarios. The first is an architecture employing PETMs in the presence of packet losses, whereas the second jointly designs the PETMs and dynamic quantizers for both the sensor-to-controller and controller-to-actuator channels under packet losses, thereby characterizing the effects of quantized signal transmission.

2.1.1. Dynamic PETMs under Packet Losses

As depicted in Figure 1(a), the plant and controller communicate with each other through two decoupled networks, which are denoted as N 1 and N 2 . Each of these networks is equipped with an independent dynamic PETM.

For each network N i with i∈{ 1,2 } , the signal v i ∈ ℝ n v i is sampled only at a sequence of discrete sampling instants defined by t j i =j h i . Here, j∈ℕ denotes an arbitrary positive integer, and h i >0 is a positive scalar that represents the sampling period of network N i . The trigger PETMi in network N i checks the event-triggering condition at these sampling instants. Once the event-triggering condition is satisfied, the trigger PETMi is activated, and the data packet containing the latest sampled data is transmitted to the recipient. Let s k i  ( k∈ T i ) represent the kth triggered instant of the trigger PETMi, where T i ={ 0,1,2,⋯ }⊆ℕ denotes the index set of all triggered instants. However, due to the inherent unreliability of communication networks, data packet dropouts may occur during transmission. The triggered instant corresponding to the data packet received and adopted by the recipient is called successful, and the r th successful triggered instant is denoted as z r i , r∈ S i :={ 0,1,2,⋯ } . Obviously, the set { z r i |r∈ S i }⊂{ s k i |k∈ T i }⊂{ t j i |j∈ℕ } . In PETC, the sampling period h i >0 is provided to avoid Zeno behaviors. Consequently, both the set { t j i |j∈ℕ } and { s k i |k∈ T i } are at most countable and have no finite accumulation point. For convenience, if the set S i is finite, i.e., S i ={ 0,1,⋯, r i * } for r i * ∈ ℕ >0 , we define z r i * +1 i =∞ .

If the packet at s k i is lost, the signal v ^ i available at the receiver is not updated. Between two consecutive successful triggered instants, v ^ i is kept constant with a zero-order-hold (ZOH) device, i.e.,

v ^ i ( t )= v i ( z r i ),∀t∈( z r i , z r+1 i ],r∈ S i ,i∈{ 1,2 }.

Denote δ r i ∈ Δ i :={ 0,1,⋯, δ max i } as the number of successive packet losses in the corresponding network within the time interval ( z r i , z r+1 i ) , for i∈{ 1,2 } . In other words, there are δ r i triggered instants in network N i within the time interval ( z r i , z r+1 i ) at which the transmitted data packets are lost. More precisely, we make the following standard assumption, as commonly adopted in the literature [9].

Figure 1. Network architectures considered in this paper. (a) Baseline NCS architecture with dynamic PETMs. (b) Proposed NCS architecture with dynamic PETMs and dynamic quantizers.

Assumption 1. [9] There exist nonnegative integers δ max i  ( i∈{ 1,2 } ) satisfying 0≤ δ r i ≤ δ max i ( r∈ S i ,i∈{ 1,2 } ) . Here, δ max i represents the maximally allowable numbers of consecutive packet losses in network N i .

2.1.2. Dynamic PETMs and Dynamic Quantizers under Packet Losses

As shown in Figure 1(b), the plant and the controller still communicate through two decoupled networks N 1 and N 2 . Each network is equipped with an independent dynamic PETM, and a dynamic quantizer is additionally introduced in each communication channel to quantize signals prior to transmission.

For i∈{ 1,2 } , let v q,i denote the quantized value of v i and v ^ q,i denote the networked version of v q,i . For notational simplicity, we further define v q =( v q,1 , v q,2 ) and v ^ q =( v ^ q,1 , v ^ q,2 ) , where v q,1 = y q , v q,2 = u q , v ^ q,1 = y ^ q and v ^ q,2 = u ^ q . For network N i , the signal v i is sampled only at the sampling instants t j i . At each sampling instant, the trigger PETMi checks the corresponding triggering condition. When the triggering condition is satisfied at a triggered instant s k i  ( k∈ T i ) , the sampled signal is immediately quantized by the dynamic quantizer. The zoom variable of the dynamic quantizer is encoded and transmitted to the recipient together with the quantized data. The recipient then decodes the received data packet and processes the decoded data. In this scenario, packet dropouts are also considered, with the maximum allowable number of packet dropouts specified in Assumption 1. Between two consecutive successful triggered instants, v ^ q,i is also held constant by a ZOH device, i.e.,

v ^ q,i ( t )= v q,i ( z r i ),∀t∈( z r i , z r+1 i ],r∈ S i ,i∈{ 1,2 }.

A quantizer in network N i is essentially a piecewise constant function q i : ℝ n v i ↦ ℚ i ⊂ ℝ n v i , where ℚ i is a finite subset of ℝ n v i with finite cardinality card( ℚ i ) . The quantizer q i generates a partition of card( ℚ i ) quantization regions in ℝ n v i , which is described by { o∈ ℝ n v i | q i ( o )=w,w∈ ℚ i } . Without loss of generality, we assume that ℚ i is ordered increasingly as a finite list. We adopt the standard quantizer assumption proposed in [22].

Assumption 2. [22] There exist positive constants M i and ℵ i such that

| v i |≤ M i ⇒| q i ( v i )− v i |≤ ℵ i , (4)

where M i and ℵ i are referred to as the initial quantization range and initial quantization error bound, respectively.

The inequality (4) shows that if the quantizer does not saturate, then the quantization error always has an upper bound. Accordingly, we employ the following dynamic quantizer to avoid quantizer saturation.

q i, μ i ( v i ):= μ i q i ( v i μ i ), (5)

where μ i ∈ ℝ ≥ μ i _ is the zoom variable associated with the dynamic quantizer q i, μ i , and μ i _ is a lower bound for μ i (see Section 4.1 for details). The function q i ( ⋅ ) satisfies Assumption 2 for some scalars M i >0 and ℵ i >0 . At each triggered instant, zoom variable μ i is updated dynamically based on the magnitude of v i , thereby scaling the quantization range to M i μ i and the corresponding error bound to ℵ i μ i . As a result, inequality (4) becomes

| v i |≤ M i μ i ⇒| q i, μ i ( v i )− v i |≤ ℵ i μ i . (6)

Note that the total number of quantization regions remains unchanged under this dynamic scaling. The zoom variable μ i is updated at each triggered instant according to the following rule:

μ i + = Ω i,out z i,out Ω i,in z i,in μ i , (7)

where Ω i,out >1 and Ω i,in ∈( 0,1 ) are the zoom-out and zoom-in scaling factors, z i,in ∈ℤ and z i,out ∈ℤ denote the number of zoom-in and zoom-out operations performed at the transmission instant. To ensure synchronous operation, the encoder and decoder are initialized with the same μ i , and share the common parameters Ω i,in , Ω i,out and the quantization set ℚ i [23]. Since the decoder cannot directly obtain the current value of μ i , the integer indices z i,in and z i,out are transmitted over the network to update the decoder-side μ i .

Having described the architectures of both the baseline and the proposed NCSs, we now detail the dynamic PETM adopted in both cases, which is developed under a unified design framework. In our system configuration, two triggers operate asynchronously and independently in two distinct networks, but all these triggering conditions are designed to take the following form

s k+1 i =inf{ t> s k i |t∈{ t j i |j∈ℕ }∧ min ι i ∈ Δ i ξ i, ι i +1 ≤0 }, for i∈{ 1,2 }, (8)

where k∈ℕ , the triggering functions ξ i, ι i +1 ∈ℝ are to be defined (refer to (24) or (41)).

Remark 1. From (8), one can easily find that the trigger PETMi here periodically detects the values of the triggering functions ξ i, ι i +1 instead of continuously detecting the values of the dynamic variables η i, ι i +1 , which is quite different from the triggers in [9] in CETC. PETM1 and PETM2 are deployed in the sensor-to-controller (S-C) channel and the controller-to-actuator (C-A) channel, respectively. Under this setup, the scheduled transmission signal vector can be uniformly expressed as v=( y,u ) . It is worth noting that the triggering framework developed in this paper is also applicable to general NCSs with an arbitrary finite number of nodes. For the multi-node case, the scheduled signal vector can be extended to the general form v=( v 1 , v 2 ,⋯, v n ) , where v i ( i=1,2,⋯,n ) denotes the signal to be transmitted at the i-th network node.

2.2. Problem Statement

Building on the two network architectures described above, we formulate the control problems considered in this paper. For both scenarios, the objective is to design the communication mechanisms and dynamic output feedback controller such that the resulting closed-loop system is ℒ 2 -stable under no-ACK packet losses.

For the baseline NCS equipped solely with dynamic PETMs, the control problem is to co-design the dynamic PETMs in (8) and the dynamic output feedback controller (2) such that the resulting closed-loop system is ℒ 2 -stable under no-ACK packet losses. For the proposed NCS with limited communication bandwidth, the dynamic PETMs in (8) and dynamic quantizers in (5) are jointly designed as a unified dynamic periodic event-triggered quantization mechanism (PETQM), together with the dynamic output feedback controller in (2), such that the resulting closed-loop system is ℒ 2 -stable in the presence of both quantization errors and packet dropouts.

To rigorously characterize the stability criterion adopted throughout this work, we recall the definition of ℒ 2 -stability as follows:

Definition 1. [30] ( ℒ 2 -stable) For a system ℋ with initial state x( t 0 ) and external disturbance ω∈ ℒ 2 , suppose that there exists a K ∞ -class function α such that solutions ϕ ℋ ( t ) of the system satisfy

‖ z ‖ ℒ 2 ≤α( | ϕ ℋ ( t 0 ) | )+θ ‖ ω ‖ ℒ 2 ,

where ‖ z ‖ ℒ 2 := ( ∑ j=0 J−1 ∫ t j t j+1 | z( t ) | 2 dt ) 1 2 denotes the ℒ 2 -norm of z . Then the system ℋ is ℒ 2 -stable from ω to the performance output z with an ℒ 2 -gain less than or equal to θ∈ ℝ ≥0 .

3. Co-Design of Dynamic PETM and Output Feedback Controller under No-ACK Packet Losses

This section investigates the co-design of the dynamic PETM and the dynamic output feedback controller for the baseline NCS subject to no-ACK packet losses. First, a closed-loop system model under the dynamic PETM is established by characterizing the effects of event-triggered transmission and packet losses. Then, sufficient conditions for ℒ 2 -stability are derived in terms of LMIs, and the stability of the resulting closed-loop system is analyzed accordingly. The obtained conditions are further used to determine the parameters of the triggering functions ξ i, ι i +1 and the dynamic output feedback controller in (2).

3.1. Closed-Loop System Modeling under the Dynamic PETM

In this section, we establish the closed-loop system for the plant (1) and controller (2) under the dynamic PETM and no-ACK packet losses. The coupled system dynamics are then reorganized into an augmented state-space form for subsequent stability analysis.

For t∈( t j i , t j+1 i ) , i∈{ 1,2 } , the closed-loop dynamics are given by

x ˙ =Ax+Be+Eω, (9)

where A=[ A p B p C c B c C p A c ],B=[ 0 B p B c 0 ],E=[ E p 0 ] . By the definition of v , we have v= C v x and v i = C v,i x , with C v =[ C p 0 0 C c ] , C v,1 =[ C p 0 ] and C v,2 =[ 0 C c ] . Consequently,

v ˙ i = A v,i x+ B v,i e+ E v,i ω, (10)

where A v,i = C v,i A , B v,i = C v,i B , E v,i = C v,i E . Accordingly, for t∈ ℝ >0 and t∉{ t j i |j∈ℕ,i∈{ 1,2 } } , the dynamics of e i are given by

e ˙ i = A e,i x+ B e,i e+ E e,i ω. (11)

Here, A e,i =− C v,i A , B e,i =− C v,i B , E e,i =− C v,i E .

Inspired by [9], we introduce auxiliary variables δ i ∈ Δ i , τ i ∈ ℝ ≥0 and two registers Θ i for i∈{ 1,2 } . The auxiliary variable δ i is used to record the number of successive packet losses of network N i since its last successful triggered instant. This means that for t∈( z r i , z r+1 i ] , ( r∈ S i ) , the trigger PETMi is triggered δ i ( t ) times within the time interval [ z r i ,t ) . The internal clock variables τ i ∈ ℝ ≥0 measure the elapsed time of network N i since its last triggered instant, i.e., τ i ( t ):=t− s k i for t∈[ s k i , s k+1 i ) . Each network is equipped with a register Θ i :=( Θ i,1 , Θ i,2 ,⋯, Θ i, δ max i +1 ) , which stores the sampled signals corresponding to the most recent δ max i +1 triggered instants. For simplicity, the time argument t is omitted from all variables where appropriate, including δ i ( t ) and τ i ( t ) , which are abbreviated to δ i and τ i . To design the dynamic PETM to compensate for the effects of consecutive packet losses in no-ACK networks, we introduce a set of dynamic variables η i =( η i,1 , η i,2 ,⋯, η i, δ max i +1 )∈ ℝ ≥0 δ max i +1 , where η i, δ i +1 ∈ ℝ ≥0 denotes the dynamic variable associated with the current number of consecutive packet losses δ i , for i∈{ 1,2 } . These dynamic variables serve as the basis for constructing the triggering functions.

Denote the augmented state by q:=( x, e i , δ i , τ i , η i , Θ i )∈ ℝ n x × ℝ n v i × Δ i × ℝ ≥0 × ℝ ≥0 δ max i +1 × ℝ ( δ max i +1 ) n v i , for i∈{ 1,2 } . Then, the closed-loop system resulting from (1) - (2) is given by

d dt [ x( t ) e i ( t ) δ i ( t ) τ i ( t ) η i ( t ) Θ i ]=[ Ax+Be+Eω A e,i x+ B e,i e+ E e,i ω 0 1 ( ϒ i,1 ,⋯, ϒ i, δ max i +1 ) 0 ],  t∈ ℝ ≥0 , t∉{ t j i |j∈ℕ,i∈{ 1,2 } } (12)

[ x( t + ) e i ( t + ) δ i ( t + ) τ i ( t + ) η i ( t + ) Θ i ( t + ) ]=[ x e i δ i 0 ( ξ i,1 , ξ i,2 ,⋯, ξ i, δ max i +1 ) Θ i ],   t∈{ t j i |j∈ℕ,i∈{ 1,2 } }\ { s k i |k∈ T i ,i∈{ 1,2 } }, (13)

[ x( t + ) e i ( t + ) δ i ( t + ) τ i ( t + ) η i ( t + ) Θ i ( t + ) ]=[ x e i δ i +1 0 ( η i,0 , η i,1 ,⋯, η i, δ max i ) ( v i , Θ i,1 ⋯, Θ i, δ max i ) ],   t∈{ s k i |k∈ T i ,i∈{ 1,2 } }\ { z r i |r∈ S i ,i∈{ 1,2 } }, (14)

[ x( t + ) e i ( t + ) δ i ( t + ) τ i ( t + ) η i ( t + ) Θ i ( t + ) ]=[ x 0 0 0 ( η i,0 , η i,1 ,⋯, η i, δ max i ) ( v i , Θ i,1 ,⋯, Θ i, δ max i ) ],  { z r i |r∈ S i ,i∈{ 1,2 } } (15)

where the functions ϒ i, δ i +1 , η i,0 and ξ i, δ i +1 are to be designed, with ξ i, δ i +1 defining the triggering functions in (8) for δ i ∈ Δ i .

3.2. ℒ 2 -Stability Analysis

Based on the augmented state model established in the previous section, the ℒ 2 -stability of the closed-loop system is analyzed, and sufficient conditions are derived in terms of feasible linear matrix inequalities (LMIs). Based on these conditions, the parameters of the dynamic PETM and the dynamic output feedback controller (2) are co-designed.

Lemma 1. Given scalars α b ∈ ℝ >0 , if there exist β i ∈ ℝ >0 , γ i ∈ ℝ >0 , α m ≥0 for all m∈{ 1,2,3 } , symmetric positive definite matrices H b , X , Y , and matrices A ^ c , B ^ c , C ^ c satisfying (16) and (17), then the closed-loop system (1) - (2) is ℒ 2 -stable and has an ℒ 2 -gain from ω to z less than or equal to θ= α 1 α 2 .

Ω=[ I ∗ Ω 1 2 α b Ω 2 − H b ]≥0, (16)

Ξ=[ Ξ 1 T + Ξ 1 ∗ ∗ ∗ ∗ ∗ ∗ Ξ 2 −Γ ∗ ∗ ∗ ∗ ∗ Ξ 3 0 − α 1 I n ω ∗ ∗ ∗ ∗ Ξ 1 Ξ 2 T Ξ 3 T − 1 α b 2 H b ∗ ∗ ∗ Ξ 4 0 0 0 − α 2 I n z ∗ ∗ Ξ 5 0 0 0 0 −Φ( β ) ∗ Ξ 6 0 0 0 0 0 − α 3 I n x ]≤0, (17)

where

Ω 1 =[ − C p T 0 − X T C p T − C ^ c T ],

Ω 2 =[ Y ∗ I X T ],

Ξ 1 =[ Y A p + B ^ c C p A ^ c A p A p X+ B p C ^ c ],

Ξ 2 =[ B ^ c T 0 B p T Y B p T ],

Ξ 3 =[ E p T Y E p T ],

Ξ 4 =[ C zp C zp X ],

Ξ 5 =[ C p C p X 0 C ^ c ],

Ξ 6 =[ I X 0 M T ],

Γ=[ γ 1 2 I n v 1 0 0 γ 2 2 I n v 2 ]

A ^ c =Y A p X+ B ^ c C p X+Y B p C ^ c +N A c M T ,

B ^ c =N B c ,  C ^ c = C c M T

Φ( β )=[ β 1 I n v 1 0 0 β 2 I n v 2 ].

Proof. Define

Z 1 =[ Y I N T 0 ],   Z 2 =[ I X 0 M T ],

and let P= Z 1 Z 2 −1 = Z 2 −T Z 1 T . Since P= P T >0 , it follows that XY+M N T =I . Consequently,

Ω 1 =− Z 2 T C v T ,   Ω 2 = Z 2 T Z 1 ,   Ξ 1 = Z 1 T A Z 2 ,

Ξ 2 = B T Z 1 ,   Ξ 3 = E T Z 1 ,   Ξ 4 = C z Z 2 ,

Ξ 5 = C v Z 2 ,   Ξ 6 = Z 2 .

Pre-multiplying and post-multiplying (17) by diag{ Z 2 −T ,I,I, Z 2 −T ,I,II } and its transpose, respectively, yields

[ PA+ A T P ∗ ∗ ∗ ∗ ∗ ∗ B T P −Γ ∗ ∗ ∗ ∗ ∗ E T P 0 − α 1 I n ω ∗ ∗ ∗ ∗ PA PB PE − 1 α b 2 H ^ b ∗ ∗ ∗ C z 0 0 0 − α 2 I n x ∗ ∗ C v 0 0 0 0 −Φ( β ) ∗ I 0 0 0 0 0 − α 3 I n x ]≤0,

where H ^ b = Z 2 −T H b Z 2 −1 . Applying the Schur complement to the above inequality yields that

[ PA+ A T P+ 1 α 2 C z T C z + C v T Φ ( β ) −1 C v + 1 α 3 I n x ∗ ∗ B T P −Γ ∗ E T P 0 − α 1 I n ω ] +[ A T P B T P E T P ] α b 2 H ^ b −1 [ PA PB PE ]≤0. (18)

It follows from (16) that 2 α b Z 2 T Z 1 − H b ≥ Z 2 T C v T C v Z 2 . Moreover, by Young’s inequality, C v T C v ≤2 α b P− H ^ b ≤ α b 2 P H ^ b −1 P , and hence

[ PA+ A T P+ 1 α 2 C z T C z + C v T Φ ( β ) −1 C v + 1 α 3 I n x ∗ ∗ B T P −Γ ∗ E T P 0 − α 1 I n ω ] +[ A T B T E T ] C v T C v [ A B E ]≤0,

from which it follows that

[ Σ 1 ∗ ∗ B T P+ B e T A e B e T B e −Γ ∗ E T P+ E e T A e E e T B e E e T E e − α 1 I n ω ]≤0, (19)

where Σ 1 :=PA+ A T P+ 1 α 2 C z T C z + C v T Φ ( β ) −1 C v + 1 α 3 I n x + A e T A e , A e = C v A=[ − A e,1 − A e,2 ] , B e = C v B=[ − B e,1 − B e,2 ] , and E e = C v E=[ − E e,1 − E e,2 ] .

Consider the quadratic function V( x )= x T Px . Its derivative along the trajectories of (1) - (2) is given by V ˙ ( x )= x T ( A T P+PA )x+2 e T B T Px+2 ω T E T Px . From (19), the derivative of V( x ) satisfies

〈 ∇V( x ),Ax+Be+Eω 〉 ≤−σ | x | 2 + ∑ i=1 2 ( − ϱ i | v i | 2 + γ i 2 | e i | 2 − ( A e,i x+ B e,i e+ E e,i ω ) T ( A e,i x+ B e,i e+ E e,i ω ) )     +μ( θ 2 | ω | 2 − | z | 2 ), (20)

where σ= 1 α 3 , ϱ i = 1 β i , and μ= 1 α 2 , for all x∈ ℝ n x , e∈ ℝ n v and ω∈ ℝ n ω . In the absence of network-induced errors, i.e., e=0 , the above dissipation inequality establishes the ℒ 2 -stability of the nominal closed-loop system with an ℒ 2 -gain no greater than θ .

□

The above dissipation inequality provides a basis for constructing the Lyapunov function of the overall networked closed-loop system. We next present the co-design of the dynamic PETMs and the dynamic output feedback controller (2), followed by the stability analysis of the closed-loop system (12) - (15).

Theorem 1. Suppose that the conditions in (16) - (17) of Lemma 1 hold. If there exist positive constants T MATI i satisfying

( δ max i +1 ) h i < T MATI i , (21)

then, under the following choices of the dynamic PETMS and the dynamic output feedback controller, the closed-loop system (12) - (15) is ℒ 2 -stable with an ℒ 2 -gain less than or equal to θ . Choose

ϒ i, δ i +1 = ϱ i | v i | 2 ,   δ i ∈ Δ i . (22)

At each triggering instant s k i ,k∈ T i , the dynamic variables η i, δ i +1 are updated according to (14) or (15), together with

η i,1 + = η i,0 := min k∈ Δ i { γ i ϕ i ( ( k+1 ) h i ) | Θ i,k+1 − v i | 2 + η i,k+1 }. (23)

The triggering functions ξ i, δ i +1 are given at the sampling instants { t j i |j∈ℕ,i∈{ 1,2 } } by

ξ i, δ i +1 = γ i ( ϕ i ( ( δ i +1 ) h i )− ϕ i ( δ i h i ) ) | Θ i, δ i +1 − v i | 2 + η i, δ i +1 . (24)

The matrices A c , B c and C c of the dynamic output feedback controller are then obtained from

[ A c B c C c 0 ]= [ N Y B p 0 I ] −1 [ A ^ c −Y A p X B ^ c C ^ c 0 ] [ M T 0 C p X I ] −1 . (25)

Proof. For t≥0 , consider the following piecewise continuous Lyapunov function:

U( t )=V( x )+ ∑ i=1 2 ( γ i ϕ i ( δ i h i + τ i ) | e i | 2 + η i, δ i +1 ), (26)

where V( x )= x T Px with P>0 , γ i >0 are given in Lemma 1 and the functions ϕ i : ℝ ≥0 → ℝ ≥0 satisfy

ϕ ˙ i ( s )=− γ i ( ϕ i 2 ( s )+1 ). (27)

For each i∈{ 1,2 } , choose λ i ∈( 0,1 ) and ϕ i ( 0 )= λ i −1 . Solving (27) gives ϕ i ( s )=tan( arctan( λ i −1 )− γ i s ) . Define T MATI i = [ arctan( λ i −1 )−arctan( λ i ) ]/ γ i . Then, ϕ i ( T MATI i )= λ i , and ϕ i ( s )∈[ λ i , λ i −1 ] for 0≤s≤ T MATI i . Hence, a sampling period is any h i satisfying 0< h i < T MATI i / ( δ max i +1 ) .

The stability analysis follows the general Lyapunov-based methodology developed in [9] [16] [30] for dynamic ETC. Specifically, to establish the ℒ 2 -stability of the closed-loop system (12) - (15) with the proposed dynamic PETM and dynamic output feedback controller (2), it is sufficient to show that the constructed Lyapunov function U satisfies the following properties:

a) For all t∈ ℝ ≥0 , there exist class- K ∞ functions a _ U and a ¯ U such that

a _ U ( | q | )≤U( t )≤ a ¯ U ( | q | ); (28)

b) For all t∈{ t j i |j∈ℕ,i∈{ 1,2 } } , it holds that

U( t + )−U( t )≤0; (29)

c) For all t≥0 within inter-sampling intervals, i.e., t∉{ t j i |j∈ℕ,i∈{ 1,2 } } , it holds that

U ˙ ( t )≤−σ | x | 2 +μ( θ 2 | ω | 2 − | z | 2 ). (30)

We first verify property a). By construction of the dynamic variables η i, δ i +1 ≥0 for all i∈{ 1,2 } . Thus, U( t ) satisfies λ min ( P ) | x | 2 + ∑ i=1 2 ( γ i λ i | e i | 2 + η i, δ i +1 ) ≤U( t )≤ λ max ( P ) | x | 2 + ∑ i=1 2 ( γ i λ i −1 | e i | 2 + η i, δ i +1 ) . Since the lower and upper bounds are positive definite and radially unbounded functions of the augmented state q , they can be bounded by suitable class- K ∞ functions. Hence, there exist class- K ∞ functions a _ U and a ¯ U such that (28) holds. This verifies statement a).

Now, we proceed to verify statement b), which states that the Lyapunov function U is non-increasing at jump points. To facilitate the subsequent analysis, define U i ( t )= γ i ϕ i ( δ i h i + τ i ) | e i | 2 + η i, δ i +1 .

Consider the sampling instants at which no triggering occurs, i.e., { t j i |j∈ℕ }\{ s k i |k∈ T i } . At these instants, the post-jump variables satisfy δ i + = δ i , τ i + =0 (with τ i = h i ), e i + = e i = Θ i, δ i +1 − v i , and η i, δ i +1 + = ξ i, δ i +1 . Consequently,

U i ( t + )− U i ( t )= γ i ϕ i ( δ i h i ) | e i | 2 + ξ i, δ i +1 −( γ i ϕ i ( δ i h i + h i ) | e i | 2 + η i, δ i +1 ).

By the triggering function (24), it follows that U( t + )−U( t )≤0 . Moreover, the triggering condition (8) ensures that the updated value of η i, δ i +1 satisfies η i, δ i +1 + = ξ i, δ i +1 >0 .

For the triggered instants at which the transmitted packet is lost, i.e., t∈{ s k i |k∈ T i }\{ z r i |r∈ S i } , we have δ i + = δ i +1 , τ i + =0 (with τ i = h i ) and e i + = e i . Substituting these relations into U i ( t ) gives

U i ( t + )= γ i ϕ i ( ( δ i +1 ) h i ) | e i | 2 + η i, δ i +2 + ,

U i ( t )= γ i ϕ i ( δ i h i + h i ) | e i | 2 + η i, δ i +1 .

By (14), η i, δ i +2 + = η i, δ i +1 , and hence U( t + )−U( t )≤0 still holds.

For the successful triggered instants t∈{ z r i |r∈ S i ,i∈{ 1,2 } } , we have δ i + =0 , τ i + =0 (with τ i = h i ), and e i + =0 . Then,

U i ( t + )− U i ( t )= γ i ϕ i ( 0 ) | 0 | 2 + η i,1 + −( γ i ϕ i ( δ i h i + h i ) | e i | 2 + η i, δ i +1 ).

By the definition of η i,1 + in (23) and its upper bound

η i,0 ≤ η ¯ i ≜ γ i ϕ i ( ( δ i +1 ) h i ) | e i | 2 + η i, δ i +1 , (31)

we have 0≤ η i,1 + ≤ η ¯ i . This follows from the fact that, for any t with δ i ∈ Δ i , the network-induced error satisfies e i = Θ i, δ i +1 − v i . Accordingly, U( t + )−U( t )≤0 .

Thus, statement b) is verified.

It remains to verify statement c). Consider the flow dynamics for t∈ ℝ ≥0 \{ t j i |j∈ℕ,i∈{ 1,2 } } . Taking the time derivative of U( t ) along the system trajectories yields

U ˙ ( t )=〈 ∇V( x ),Ax+Be+Eω 〉  + ∑ i=1 2 ( γ i ϕ ˙ i ( δ i h i + τ i ) | e i | 2 +2 γ i ϕ i ( δ i h i + τ i )| e i | d dt | e i |+ ϒ i, δ i +1 ).

By Lemma 1, we have

U ˙ ( t )≤−σ | x | 2 + ∑ i=1 2 ( − ϱ i | v i | 2 + γ i 2 | e i | 2 − ( A e,i x+ B e,i e+ E e,i ω ) T ( A e,i x  + B e,i e+ E e,i ω )+ γ i ( − γ i ( ϕ i 2 ( δ i h i + τ i )+1 ) ) | e i | 2  + 2 γ i ϕ i ( δ i h i + τ i )| e i || A e,i x+ B e,i e+ E e,i ω |+ ϒ i, δ i +1 )  +μ( θ 2 | ω | 2 − | z | 2 ).

Applying Young’s inequality to the cross term and substituting the resulting bound into the above inequality, we obtain

2 γ i ϕ i ( δ i h i + τ i )| e i |×| A e,i x+ B e,i e+ E e,i ω | ≤ γ i 2 ϕ i 2 ( δ i h i + τ i ) | e i | 2 + ( A e,i x+ B e,i e+ E e,i ω ) T ( A e,i x+ B e,i e+ E e,i ω ) .

U ˙ ( t )≤−σ | x | 2 + ∑ i=1 2 ( − ϱ i | v i | 2 + ϒ i, δ i +1 )+μ( θ 2 | ω | 2 − | z | 2 ).

By the definition of ϒ i, δ i +1 , we have U ˙ ( t )≤−σ | x | 2 +μ( θ 2 | ω | 2 − | z | 2 ) . This establishes statement c).

□

Remark 2. In the above stability analysis, we employ the fundamental norm-derivative inequality d dt | e i |≤| e ˙ i |=| A e,i x+ B e,i e+ E e,i ω | . It is worth noting that this treatment of the error derivative bound differs from Condition 1 in [19] and Assumption 1 in [31]. For the linear closed-loop system (1) - (2) considered in this paper, one can verify that B e,1 e=− C p B p e 2 and B e,2 e=− C c B p e 1 . This implies that, under the frameworks of [19] and [31], the Lipschitz constants L i associated with e i can be taken to be zero. Consequently, the differential equation for ϕ i preserves the form given in (27), without the additional term −2 L i ϕ i . This simplification yields a relatively slower decay rate of ϕ i , which may allow for a larger sampling interval h i under the event-triggered scheme and thus potentially improve communication efficiency.

Remark 3. For numerical implementation, α b >0 is fixed beforehand. By introducing g i = γ i 2 , the decision variables are X,Y, H b , A ^ c , B ^ c , C ^ c and the scalars α 1 , α 2 , α 3 , β i , g i , subject to the required positivity conditions. The hatted controller matrices are treated as independent variables, and their defining relations are used only for controller reconstruction after solving. For each fixed α b , conditions (16) - (17) are affine in the decision variables and can be solved as a single SDP feasibility problem. A feasible solution gives γ i = g i and ϱ i =1/ β i , and the controller is recovered using (25). The gain bound θ= α 1 α 2 is calculated afterwards and is not minimized in this feasibility problem. If different values of α b are considered, an outer search over a prescribed finite set of positive values is performed, with one SDP solved for each value.

4. Dynamic Periodic Event-Triggered Quantization and Dynamic Output Feedback Control: Co-Design under No-ACK Packet Losses

In this section, we investigate the co-design of the dynamic PETQM and the dynamic output feedback controller for NCSs subject to no-ACK packet losses, as illustrated in Figure 2. First, the parameters of the dynamic quantizers are designed to ensure proper quantization. Then, the closed-loop system model under the dynamic PETQM is established by characterizing the effects of event-triggered quantization and packet losses. Finally, sufficient conditions for ℒ 2 -stability are derived in terms of LMIs, based on which the parameters of the dynamic PETQM and the parameters of the dynamic output feedback controller are determined.

4.1. Parameter Design for Dynamic Quantizers

The i -th dynamic quantizer depicted in Figure 2 incorporates a zoom variable μ i , whose evolution is governed by the update law in (7). The zoom variable is adjusted according to the normalized magnitude of the transmitted signal relative to the current zoom level. Specifically, its update law is given by

μ i + ={ Ω i,in z i,in μ i , | v i |≤ ℓ i,in μ i μ i , ℓ i,in μ i <| v i |< ℓ i,out μ i Ω i,out z i,out μ i , | v i |≥ ℓ i,out μ i (32)

where constants ℓ i,in , ℓ i , ℓ i,out satisfy

0< ℓ i,in ≤ 1 Ω i,out ℓ i ≤ ℓ i ≤ 1 Ω i,in ℓ i ≤ ℓ i,out ≤ M i − ℵ i , (33)

the integer codes z i,in and z i,out are defined as

z i,in =⌈ max{ −ν, log( max{ | v i | ℓ i μ i , φ i μ i } ) log( Ω i,in ) } ⌉, (34)

z i,out =⌈ max{ −ν, log( | v i | ℓ i μ i ) log( Ω i,out ) } ⌉, (35)

where ν∈( 0,1 ) . The auxiliary function φ i : ℝ ≥0 → ℝ ≥0 is introduced to limit the amount of zoom-in at each triggered instant. Specifically, φ i provides a time-varying reference level for the zoom variable, preventing μ i from shrinking excessively fast under consecutive zoom-in operations. By choosing φ ˙ i ( t )=− c i φ i ( t ) with c i >0 and φ i ( 0 )>0 , we have φ i ( t )= φ i ( 0 ) e − c i t , so that the reference level remains positive while converging to zero, thereby avoiding a nonzero lower bound on the quantization scale.

Since −1<−ν<0 , we have ⌈ −ν ⌉=0 , which guarantees z i,in , z i,out ∈ℕ . It follows from (34) and (35) that

z i,in >0⇒max{ | v i | ℓ i μ i , φ i μ i }<1⇒ | v i | ℓ i μ i <1⇒ z i,out =0,

z i,out >0⇒ | v i | ℓ i μ i >1⇒max{ | v i | ℓ i μ i , φ i μ i }>1⇒ z i,in =0. (36)

This confirms that zoom-in and zoom-out actions are mutually exclusive at each triggered instant and never occur simultaneously. At a triggered instant s k i ( k∈T ) , the zoom variable μ i is updated according to (7). If a zoom-in event occurs, then

Ω i,in max{ | v i | ℓ i μ i , φ i μ i } μ i < μ i + = Ω i,in z i,in μ i ≤max{ | v i | ℓ i μ i , φ i μ i } μ i .

If a zoom-out event occurs, then

| v i | ℓ i ≤ μ i + = Ω i,out z i,out μ i < Ω i,out | v i | ℓ i .

If neither zoom-in nor zoom-out occurs, then

| v i | ℓ i,out < μ i + < | v i | ℓ i,in .

Combining these three cases with (33) yields the following bound on the update value μ i +

| v i | ℓ i,out < μ i + ≤max{ | v i | ℓ i,in , φ i }. (37)

The term | v i | ℓ i,out in the lower bound ensures that the quantization interval covers the current signal amplitude. This dynamic quantization scheme adaptively adjusts the quantization range through discrete zooming steps to accommodate signal variations and avoid quantizer saturation.

Since the decoder has no direct access to the zoom variable μ i , only the corresponding update codes z i,in and z i,out are transmitted over the communication network. Given that Ω i,in and Ω i,out are known a priori at the decoder, the zoom variable μ i can be reconstructed according to the update law in (7) upon successful packet reception. To maintain encoder-decoder synchronization in no-ACK networks with bounded consecutive packet losses, we adopt the encoder-decoder framework developed in [16]. Each transmitted packet contains the zoom updates associated with the δ max i +1 most recent triggering events. As long as the number of consecutive packet losses does not exceed δ max i , each successfully received packet contains all zoom updates missed since the last successful reception. The decoder can therefore recover the zoom updates missed during consecutive packet losses and resynchronize its zoom variable with that of the encoder upon each successful packet reception, without requiring a reverse acknowledgment channel.

Remark 4. The dynamic zooming mechanism in this work is rooted in the dynamic quantization framework of [22], which employs online adjustments of the quantization scale. The use of the time-varying variable φ i in the dynamic quantizer is inspired by the dynamic quantization idea in [10]. However, unlike the approach in [10], which relies on ACK signals to implement the proposed CETC, the proposed dynamic PETQM is developed under a no-ACK communication mechanism. In contrast to these existing approaches, the proposed mechanism embeds this dynamic quantization idea into a discrete multi-step zooming scheme and further integrates it with a no-ACK packet loss framework, with the zooming information designed to enable resynchronization after consecutive packet losses.

4.2. Closed-Loop System Modeling under the Dynamic PETQM

Unlike the baseline NCS in Section 3, the introduction of dynamic quantizers changes the content stored in the register Θ i . Specifically, Θ i stores the quantized values v q,i generated at the most recent δ max i +1 triggered instants, rather than the corresponding raw signal values. Accordingly, the update rule of the register at triggered instants is given by

Θ i =( v q,i , Θ i,2 ,⋯, Θ i, δ max i +1 ),

which differs from the register update rule in (14) - (15). Furthermore, the quantization error and the sampling error are defined as e q,i := v q,i − v i , e s,i := v ^ q,i − v q,i , respectively. Accordingly, the network-induced error can be decomposed as e i := e s,i + e q,i = v ^ q,i − v i . At successful triggered instants, e i no longer follows the jump rule in (15); instead, its jump rule is revised to e i + = e q,i .

For t∈ ℝ ≥0 \{ t j i |j∈ℕ,i∈1,2 } , the augmented state q evolves according to (12). For t∈{ t j i |j∈ℕ,i∈1,2 }\{ s k i |k∈ T i ,i∈1,2 } , it evolves according to (13). To save space, only the jump rule of the augmented state q at triggered instants is detailed herein.

[ x( t + ) e i ( t + ) δ i ( t + ) τ i ( t + ) η i ( t + ) Θ i ( t + ) ]=[ x e i δ i +1 0 ( ζ i,0 , η i,1 ,⋯, η i, δ max i ) ( v q,i , Θ i,1 ,⋯, Θ i, δ max i ) ],   t∈{ s k i |k∈ T i ,i∈{ 1,2 } }\ { z r i |r∈ S i ,i∈{ 1,2 } }, (38)

[ x( t + ) e i ( t + ) δ i ( t + ) τ i ( t + ) η i ( t + ) Θ i ( t + ) ]=[ x e q,i 0 0 ( ζ i,0 , η i,1 ,⋯, η i, δ max i ) ( v q,i , Θ i,1 ,⋯, Θ i, δ max i ) ],  { z r i |r∈ S i ,i∈{ 1,2 } } (39)

where ζ i,0 in (38) - (39), ϒ i, δ i +1 in (12), and the triggering functions are designed to guarantee the desired well-posed behavior of the closed-loop system composed of the plant (1) and the controller (2) under the proposed dynamic PETQM. For all δ i ∈ Δ i , the triggering functions ξ i, δ i +1 in (13) are constructed based on the dynamic functions η i, δ i +1 .

4.3. Stability Analysis for the Dynamic PETQM

The following theorem provides sufficient conditions for the ℒ 2 -stability of the closed-loop system under the dynamic PETQM.

Theorem 2. Suppose that the conditions in (16) - (17) of Lemma 1 hold and that there exist positive constants T MATI i satisfying (21). Let the functions ϒ i, δ i +1 satisfy ϒ i, δ i +1 =( ϱ i − ϵ i ) | v i | 2 with 0< ϵ i < ϱ i for all δ i ∈ Δ i . At each triggering instant { s k i |k∈ T i ,i∈{ 1,2 } } , the dynamic variables η i, δ i +1 are updated according to (38) or (39), and

η i,1 + = ζ i,0 := min k∈ Δ i { η i,k+1 +max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( ( k+1 ) h i ) | Θ i,k+1 − v i | 2 } }                  −max{ θ i,1 | v i | 2 , φ i 2 }. (40)

The triggering functions ξ i, δ i +1 are defined at the sampling instants { t j i |j∈ℕ,i∈{ 1,2 } } as

ξ i, δ i +1 =max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( ( δ i +1 ) h i ) | Θ i, δ i +1 − v i | 2 }  + η i, δ i +1 −max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( δ i h i ) | Θ i, δ i +1 − v i | 2 }. (41)

The resulting coupling constraint between the parameters of dynamic PETQM is given by

( γ i ϕ i ( T MATI i ) + θ i,1 ) θ i,1 ≤ ϵ i ,   γ i 2 ϕ i ( T MATI i ) ≤ c i ,   ℵ i ≤ λ i γ i min{ ℓ i,in 2 θ i,1 ,1 } . (42)

Furthermore, let the controller matrices A c , B c and C c be given by (25). Then, the closed-loop system described by (12) - (13) and (38) - (39) is ℒ 2 -stable with an ℒ 2 -gain less than or equal to θ .

Proof. The proof follows a similar approach to that of Theorem 1, in which the Lyapunov function is shown to satisfy properties a), b) and c). To characterize the effect of dynamic quantization on the stability of the closed-loop system, we augment the Lyapunov function with quantization-related terms and define the resulting Lyapunov function candidate as

U ˜ ( t )=V( x )+ ∑ i=1 2 ( max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( δ i h i + τ i ) | e i | 2 }+ η i, δ i +1 ), (43)

where V( x )= x T Px with P>0 , max{ θ i,1 | v i | 2 , φ i 2 } represents the quantization-related term, θ i,1 >0 , and γ i satisfy (16) - (17). For ease of subsequent analysis, we define U ˜ i ( t )=max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( δ i h i + τ i ) | e i | 2 }+ η i, δ i +1 .

Property a) is trivially satisfied; hence, only properties b) and c) need to be verified.

Proof of b): For all t∈{ t j i |j∈ℕ,i∈{ 1,2 } } , we distinguish the following cases according to the transmission status.

If the triggering condition is not satisfied at a sampling instant, i.e., t∈{ t j i |j∈ℕ }\{ s k i |k∈ T i } , then ξ i, δ i +1 >0 for all δ i ∈ Δ i . It then follows from (13) that

U ˜ i ( t + )− U ˜ i ( t )=max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( δ i h i ) | e i | 2 }+ η i, δ i +1 +  −( max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( δ i h i + h i ) | e i | 2 }+ η i, δ i +1 ).

By the definition of the triggering function in (41) and e i = Θ i, δ i +1 − v i , we obtain U ˜ i ( t + )− U ˜ i ( t )≤0 . Since the remaining terms in U ˜ ( t ) do not change at this sampling instant, we consequently obtain U ˜ ( t + )− U ˜ ( t )≤0 .

If the triggering condition is satisfied at a sampling instant but packet is lost, i.e., t∈{ s k i |k∈ T i }\{ z r i |r∈ S i } , it follows from (38) that η i, δ i +2 + = η i, δ i +1 , with the jump updates given by e i ( t + )= e i ( t ) , δ i + = δ i +1 and τ i + =0 (with τ i = h i ). Consequently,

U ˜ i ( t + )− U ˜ i ( t )=max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( ( δ i +1 ) h i ) | e i | 2 }+ η i, δ i +2 +   −( max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( δ i h i + h i ) | e i | 2 }+ η i, δ i +1 ) =0.

Since V( x ) and U ˜ j ( t ) , j≠i , remain unchanged at this jump instant, we consequently have U ˜ ( t + )− U ˜ ( t )=0

For the successful triggered instants, i.e., t∈{ z r i |r∈ S i } , it follows from (39) that e i ( t + )= e q,i ( t ) , δ i + =0 and τ i + =0 (with τ i = h i ). Accordingly,

U ˜ i ( t + )=max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( 0 ) | e q,i | 2 }+ η i,1 + .

From (40) and the definition of register Θ i , we have

η i,1 + ≤ ζ ¯ i =max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( ( δ i +1 ) h i ) | e i | 2 }+ η i, δ i +1 −max{ θ i,1 | v i | 2 , φ i 2 }. (44)

Next, we consider four cases to verify property b) at successful triggered instants.

1) If θ i,1 | v i | 2 ≥max{ φ i 2 , γ i ϕ i ( 0 ) | e q,i | 2 } , it follows that

U ˜ i ( t + )− U ˜ i ( t )= θ i,1 | v i | 2 + η i,1 + −max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( ( δ i +1 ) h i ) | e i | 2 }− η i, δ i +1 ≤0

where the last inequality follows from θ i,1 | v i | 2 ≤max{ θ i,1 | v i | 2 , φ i 2 } .

2) If φ i 2 ≥max{ θ i,1 | v i | 2 , γ i ϕ i ( 0 ) | e q,i | 2 } , then U ˜ i ( t + )− U ˜ i ( t )≤0 .

3) If γ i ϕ i ( 0 ) | e q,i | 2 ≥max{ θ i,1 | v i | 2 , φ i 2 } , it follows that

U ˜ i ( t + )− U ˜ i ( t )= γ i ϕ i ( 0 ) | e q,i | 2 + η i,1 + −max{ θ i,1 | v i | 2 , φ i 2 , γ i ϕ i ( ( δ i +1 ) h i ) | e i | 2 }− η i, δ i +1 ≤ γ i ϕ i ( 0 ) | e q,i | 2 −max{ θ i,1 | v i | 2 , φ i 2 }.

By (6) and (37), we have | e q,i | 2 ≤ ℵ i 2 μ i 2 ≤ ℵ i 2 max{ | v i | 2 ℓ i,in 2 , φ i 2 } . Since ϕ i ( 0 )= λ i −1 and ℵ i 2 ≤ λ i γ i min{ ℓ i,in 2 θ i,1 ,1 } , it follows that U ˜ i ( t + )− U ˜ i ( t )≤0 .

4) If φ i 2 = θ i,1 | v i | 2 = γ i ϕ i ( 0 ) | e q,i | 2 , then U ˜ i ( t + )− U ˜ i ( t )≤0 follows from Lemma II.1 of [32].

Consequently, at successful triggered instant, we have U ˜ ( t + )− U ˜ ( t )≤0 .

Hence, property b) holds at all jump instants.

Proof of c): We now verify that property c) holds for U ˜ ( t ) during t∈ ℝ ≥0 \{ t j i |j∈ℕ,i∈{ 1,2 } } . Due to the maximum term in the Lyapunov function, we consider the following four cases.

i) If θ i,1 | v i | 2 >max{ φ i 2 , γ i ϕ i ( δ i h i + τ i ) | e i | 2 } , combining (42) with ϕ i ( T MATI i )≤ ϕ i ( δ i h i + τ i ) , yields γ i 2 | e i | 2 ≤ γ i θ i,1 ϕ i ( δ i h i + τ i ) | v i | 2 ≤( ϵ i − θ i,1 2 ) | v i | 2 . From (11), it gets

d dt ( θ i,1 | v i | 2 )≤2 θ i,1 | v i || e ˙ i | ≤ θ i,1 2 | v i | 2 + ( A e,i x+ B e,i e+ E e,i ω ) T ( A e,i x+ B e,i e+ E e,i ω ).

Thus, we can obtain that

U ˜ i ∘ ( q; d dt q )+ γ i 2 | e i | 2 − ϱ i | v i | 2 − ( A e,i x+ B e,i e+ E e,i ω ) T ( A e,i x+ B e,i e+ E e,i ω ) ≤( ϵ i − ϱ i ) | v i | 2 + ϒ i, δ i +1 .

ii) If φ i 2 >max{ θ i,1 | v i | 2 , γ i ϕ i ( δ i h i + τ i ) | e i | 2 } , it follows that φ i 2 ≥ γ i ϕ i ( T MATI i ) | e i | 2 . From γ i 2 ϕ i ( T MATI i ) ≤ c i in (42), we can obtain that

U ˜ i ∘ ( q; d dt q )+ γ i 2 | e i | 2 − ϱ i | v i | 2 − ( A e,i x+ B e,i e+ E e,i ω ) T ( A e,i x+ B e,i e+ E e,i ω ) ≤−2 c i φ i 2 + γ i φ i 2 ϕ i ( T MATI i ) + ϒ i, δ i +1 − ϱ i | v i | 2

≤− ϱ i | v i | 2 + ϒ i, δ i +1 .

iii) If γ i ϕ i ( δ i h i + τ i ) | e i | 2 >max{ θ i,1 | v i | 2 , φ i 2 } ,

U ˜ i ∘ ( q; d dt q )+ γ i 2 | e i | 2 − ϱ i | v i | 2 − ( A e,i x+ B e,i e+ E e,i ω ) T ( A e,i x+ B e,i e+ E e,i ω ) ≤− γ i ( γ i ( ϕ i 2 ( δ i h i + τ i )+1 ) ) | e i | 2 +2 γ i ϕ i ( δ i h i + τ i )| e i || A e,i x+ B e,i e+ E e,i ω |     + ϒ i, δ i +1 + γ i 2 | e i | 2 − ϱ i | v i | 2 − ( A e,i x+ B e,i e+ E e,i ω ) T ( A e,i x+ B e,i e+ E e,i ω ) ≤− ϱ i | v i | 2 + ϒ i, δ i +1 .

iv) If γ i ϕ i ( δ i h i + τ i ) | e i | 2 = θ i,1 | v i | 2 = φ i 2 , then, by Lemma II.1 of [32], it is known that

U ˜ i ∘ ( q; d dt q )+ γ i 2 | e i | 2 − ϱ i | v i | 2 − ( A e,i x+ B e,i e+ E e,i ω ) T ( A e,i x+ B e,i e+ E e,i ω ) ≤( ϵ i − ϱ i ) | v i | 2 + ϒ i, δ i +1 .

Therefore, from ϒ i, δ i +1 =( ϱ i − ϵ i ) | v i | 2 and Lemma 1, it follows that property c) holds for U ˜ ( t ) during t∈ ℝ ≥0 \{ t j i |j∈ℕ,i∈{ 1,2 } } .

□

To demonstrate how a dynamic PETQM updates operate without knowing the packet reception results, we provide a compact no-ACK implementation algorithm (Algorithm 1). In this framework, it is crucial to distinguish between physically implemented variables and analysis-only states.

Remark 5. From the above stability analysis, y and u remain bounded for bounded x( 0 ) , e( 0 ) , η( 0 ) and ω∈ ℒ 2 . So there exist positive constants v ¯ i such that | v i |≤ v ¯ i . By (32) and (33), the zoom variable satisfies μ i ≤ μ ¯ i =max{ | v ¯ i | ℓ i,in , φ i ( 0 ), μ i ( 0 ) } . Further, (34) and (35) yield 0≤ z i,in ≤ log( φ i / μ ¯ i ) log Ω i,in <∞ and 0≤ z i,out ≤ log( v ¯ i / ℓ i μ _ i ) log Ω i,out .

5. Simulation

To demonstrate the effectiveness of the proposed approach, we consider a benchmark example of a linearized batch reactor, which is adapted from the examples reported in [10]. The plant matrices are given by

A p =[ 1.3800 −0.2077 6.7150 −5.6760 −0.5814 −4.2900 0 0.6750 1.0670 4.2730 −6.6540 5.8930 0.0480 4.2730 1.3430 −2.1040 ],   B p =[ 0 0 5.6790 0 1.1360 −3.1460 1.1360 0 ],

C p =[ 1 0 1 −1 0 1 0 0 ],   E p = [ 1 0 1 0 ] T ,   C zp =[ 0.1 0 0 0 ].

Solving (16) and (17), we obtain

A c =[ −11.8993 −8.7701 36.6199 40.8943 −1.6714 −5.0641 3.8434 4.0695 −6.1476 −10.7971 29.6418 40.2751 3.4521 8.2373 −21.6322 −31.0181 ],

B c =[ 55.5522 24.9476 9.9006 5.1211 51.1121 33.4232 −36.5069 −25.0197 ],   C c =[ 0.1100 0.0719 −0.5799 −0.6038 0.2690 −0.0225 −0.0027 0.1812 ],

β 1 = β 2 =0.2,   γ 1 = γ 2 =20.292.

Algorithm 1. Compact no-ACK implementation of dynamic PETQM (node i).

For the baseline NCS, we set λ i =0.6 , δ max i =2 for all i∈{ 1,2 } . By substituting these parameters into (21), we get T i =0.0241 s , T i =0.008 s and ϱ i =5 ( i∈{ 1,2 } ). Then, we run simulation for 14 s with x p ( 0 )= [ 0.8,−1,0,0.5 ] T , e( 0 )=0 , and the external disturbance ω( t )= e −t sin( 2t ) . The state curves are depicted in Figure 2, the triggered instants are described in Figure 3. The numbers of triggered times in the two different networks are 333 and 353, and the numbers of packet losses in these networks are 130 and 125, respectively.

Figure 2. State trajectories of the closed-loop system under the PETM.

Figure 3. The triggered times in N 1 and N 2 under the PETM with packet losses.

Figure 4. State trajectories of the closed-loop system under the PETQM.

Figure 5. The triggered times in N 1 and N 2 under the PETQM with packet losses.

Based on the theoretical construction in (21), the maximum possible elapsed time without a successful control update under the worst-case packet loss scenario is ( δ max i +1 ) h i =3×0.008=0.024 s . Since this calculated worst-case interval strictly satisfies 0.024 s < 0.0241 s = T i , the chosen sampling periods and the packet loss bounds jointly satisfy the analytical constraints required for dynamic triggering. This guarantees that the closed-loop system maintains ℒ 2 -stability despite the simultaneous presence of discrete event-triggering and bounded network losses.

For the proposed NCS, we set λ i =0.6 , θ i,1 =0.01 and ℓ i,in =20 for all i∈{ 1,2 } . Substituting these parameters into (42) yields c i =20 , ℵ i =0.1 and ϵ i =0.5 . We then choose M i =100 , ℓ i =40 , ℓ i,out =90 to satisfy (33). The state curves are depicted in Figure 4, the triggered instants are described in Figure 5. The numbers of triggered times in the two different networks are 366 and 370, and the numbers of packet losses in these networks are 142 and 130, respectively. The average inter-event times in the two networks are 0.0383 s and 0.0378 s, respectively, representing increases of approximately 45.6% and 43.7% over the 0.0263 s value reported in the example of [10].

6. Conclusion

For the baseline NCS with packet losses only, the dynamic PETM accommodates consecutive packet losses by using the information maintained in the network registers and auxiliary dynamic variables. The Lyapunov-based analysis provides sufficient conditions for ℒ 2 -stability, based on which the dynamic PETM and dynamic output feedback controller are co-designed. The resulting design compensates for the effects of consecutive packet losses while ensuring ℒ 2 -stability and excluding Zeno behavior during signal transmission. The framework was further extended to the case where quantized signals are transmitted over the communication channels. The proposed dynamic quantization scheme adaptively adjusts the quantization scaling parameter according to the transmitted signal and the available quantization range, thereby avoiding quantizer saturation under external disturbances. By integrating the dynamic PETM with the dynamic quantizer, the dynamic PETQM provides a unified treatment of event-triggered transmission, consecutive packet losses, and quantization errors. The resulting stability conditions capture the coupled effects of these communication imperfections and enable the joint determination of the PETQM and dynamic output feedback controller. Numerical examples confirmed that the proposed approach can reduce network transmissions while preserving closed-loop ℒ 2 -stability and control performance. Future work will investigate the extension of the proposed framework to NCSs with more general communication constraints, including time-varying delays and scheduling protocols.

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1] Lian, F.L., Moyne, J.R. and Tilbury, D.M. (2000) Control Performance Study of a Networked Machining Cell. Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No. 00CH36334), 42, 2337-2341.[CrossRef]
[2] Hassine, E., Thabet, A., Gasmi, N. and Bel Haj Frej, G. (2025) An Event-Triggered Observer-Based Control Approach for Enhancing Resilience of Cyber-Physical Systems under Markovian Cyberattacks. Actuators, 14, Article 412.[CrossRef]
[3] Pezzutto, M., Dey, S., Garone, E., Gatsis, K., Johansson, K.H. and Schenato, L. (2024) Wireless Control: Retrospective and Open Vistas. Annual Reviews in Control, 58, Article 100972.[CrossRef]
[4] Wei, Z.-J., Du, X., Liu, K.-Z. and Sun, X.-M. (2024) Data-Driven Dynamic Event-Triggered Control for NCSS under Denial-of-Service and Time-Varying Delays. IEEE Transactions on Intelligent Transportation Systems, 25, 11156-11167.[CrossRef]
[5] Qu, F.R., Liu, Z.W., Liu, X.K., Wang, Y.W. and Tian, E. G. (2024) Memory-Based Event-Triggered Control for Distributed Secondary Control in DC Microgrids with Quantized Communication. IEEE Transactions on Industrial Electronics, 71, 14864-14874.[CrossRef]
[6] Tabuada, P. (2007) Event-Triggered Real-Time Scheduling of Stabilizing Control Tasks. IEEE Transactions on Automatic Control, 52, 1680-1685.[CrossRef]
[7] Wu, Y.B., Guo, Z.R., Xue, L., Ahn, C.K. and Liu, J. (2024) Stabilization of Complex Networks under Asynchronously Intermittent Event-Triggered Control. Automatica, 161, Article 111493.[CrossRef]
[8] Zhang, X.M., Han, Q.L., Ge, X.H., Ding, D.R., Ning, B.D. and Zhang, B.L. (2025) An Overview of Recent Advances in Event-Triggered Control. Science China Information Sciences, 68, Article No. 161201.[CrossRef]
[9] Dolk, V. and Heemels, M. (2017) Event-Triggered Control Systems under Packet Losses. Automatica, 80, 143-155.[CrossRef]
[10] Wu, C., Zhao, X., Xia, W., Liu, J. and Başar, T. (2021)-Gain Analysis for Dynamic Event-Triggered Networked Control Systems with Packet Losses and Quantization. Automatica, 129, Article 109587.[CrossRef]
[11] Heemels, W.P.M.H., Donkers, M.C.F. and Teel, A.R. (2011) Periodic Event-Triggered Control Based on State Feedback. IEEE Conference on Decision and Control and European Control Conference, Orlando, 12-15 December 2011, 2571-2576.[CrossRef]
[12] Girard, A. (2015) Dynamic Triggering Mechanisms for Event-Triggered Control. IEEE Transactions on Automatic Control, 60, 1992-1997.[CrossRef]
[13] Borgers, D.P., Dolk, V.S. and Heemels, M.W.P.M.H. (2017) Dynamic Periodic Event-Triggered Control for Linear Systems. Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control, Pittsburgh, 18-20 April 2017, 179-186.[CrossRef]
[14] Hertneck, M., Linsenmayer, S. and Allgower, F. (2019) Nonlinear Dynamic Periodic Event-Triggered Control with Robustness to Packet Loss Based on Non-Monotonic Lyapunov Functions. 2019 IEEE 58th Conference on Decision and Control (CDC), Nice, 11-13 December 2019, 1680-1685.[CrossRef]
[15] Li, C.C., Xu, F.D., Wang, Y.H. and Zhao, X.D. (2024) Data-Driven Dynamic Periodic Event-Triggered Control of Cyber-Physical Systems under Packet Dropouts and DoS Attacks. IEEE Transactions on Information Forensics and Security, 19, 7187-7199.[CrossRef]
[16] Zhu, X.L., Zhang, X.X., Wei, J.M., Wen, C.Y. and Lin, H. (2026) Periodic Event-Triggered Quantized Control for Nonlinear Systems with Packet Losses and Large Transmission Delays. IEEE Transactions on Automatic Control, 71, 3926-3941.[CrossRef]
[17] Yu, Q.X., Fan, Z.H., Bu, X.H. and Hou, Z.S. (2024) Event-Triggered Based Predictive Iterative Learning Control with Random Packet Loss Compensation for Nonlinear Networked Systems. ISA Transactions, 148, 169-181.[CrossRef] [PubMed]
[18] Kooshkbaghi, M. and Marquez, H.J. (2020) Event-Triggered Discrete-Time Cubature Kalman Filter for Nonlinear Dynamical Systems with Packet Dropout. IEEE Transactions on Automatic Control, 65, 2278-2285.[CrossRef]
[19] Dolk, V.S. and Heemels, W.P.M.H. (2015) Dynamic Event-Triggered Control under Packet Losses: The Case with Acknowledgements. 2015 International Conference on Event-Based Control, Communication, and Signal Processing (EBCCSP), Krakow, 17-19 June 2015, 1-7.[CrossRef]
[20] Garcia, E. and Antsaklis, P.J. (2013) Model-Based Event-Triggered Control for Systems with Quantization and Time-Varying Network Delays. IEEE Transactions on Automatic Control, 58, 422-434.[CrossRef]
[21] El Chamie, M., Liu, J. and Basar, T. (2016) Design and Analysis of Distributed Averaging with Quantized Communication. IEEE Transactions on Automatic Control, 61, 3870-3884.[CrossRef]
[22] Liberzon, D. (2003) Hybrid Feedback Stabilization of Systems with Quantized Signals. Automatica, 39, 1543-1554.[CrossRef]
[23] Abdelrahim, M., Dolk, V.S. and Heemels, W.P.M.H. (2019) Event-Triggered Quantized Control for Input-to-State Stabilization of Linear Systems with Distributed Output Sensors. IEEE Transactions on Automatic Control, 64, 4952-4967.[CrossRef]
[24] Wu, C.Y., Zhao, X.D., Zong, G.D. and Liu, L.J. (2025) Dynamic Periodic Event-Triggered Control for Networked Control Systems with Dynamic Quantization and Time-Varying Delays. IEEE Internet of Things Journal, 12, 34102-34112.[CrossRef]
[25] Ren, Y.W., Cai, P.T., Fang, Y.X. and Niu, B. (2025) Dynamic Quantized Event-Triggered Predictive Control for Networked Control Systems with DoS Attacks: A Hybrid System Approach. IEEE Transactions on Signal and Information Processing over Networks, 11, 1138-1150.[CrossRef]
[26] Shan, Y., Xie, X.P., Sun, J.Y. and Park, J.H. (2024) Observer-Based Adaptive Event-Triggered Control for Nonlinear Networked Systems under Multiple Cyber Attacks. IEEE Transactions on Fuzzy Systems, 32, 5272-5284.[CrossRef]
[27] Lei, Y.F., Li, J.M. and Lu, X.J. (2026) Spatial Decentralized Dynamic Event-Triggered Quantized Control for Semilinear Parabolic Systems. IEEE Internet of Things Journal, 13, 3360-3370.[CrossRef]
[28] Coutinho, P.H.S., Pessim, P.S.P., Bessa, I., Peixoto, M.L.D.C. and Palhares, R.M. (2026) Handling Asynchronous Scheduling Functions in Periodic Event-Triggered Gain-Scheduled Control with Guaranteed Polytopic Inclusion. IEEE Transactions on Cybernetics, 56, 4206-4218.[CrossRef]
[29] Ban, J., Seo, M., Goh, T., Jeong, H. and Kim, S.W. (2020) Improved Co-Design of Event-Triggered Dynamic Output Feedback Controllers for Linear Systems. Automatica, 111, Article 108600.[CrossRef]
[30] Dolk, V.S., Borgers, D.P. and Heemels, W.P.M.H. (2017) Output-Based and Decentralized Dynamic Event-Triggered Control with Guaranteed-Gain Performance and ZeNo-Freeness. IEEE Transactions on Automatic Control, 62, 34-49.[CrossRef]
[31] Carnevale, D., Teel, A.R. and Nesic, D. (2007) A Lyapunov Proof of an Improved Maximum Allowable Transfer Interval for Networked Control Systems. IEEE Transactions on Automatic Control, 52, 892-897.[CrossRef]
[32] Liberzon, D., Nesic, D. and Teel, A.R. (2014) Lyapunov-Based Small-Gain Theorems for Hybrid Systems. IEEE Transactions on Automatic Control, 59, 1395-1410.[CrossRef]

Copyright © 2026 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.