
Circular intuitionistic fuzzy sets are further extensions of intuitionistic fuzzy sets with a stronger ability to express uncertain information than intuitionistic fuzzy sets. This paper firstly defines a new distance measure for circular intuitionistic fuzzy sets based on the theory of circular intuitionistic fuzzy sets, considering the information of four aspects: membership degree, non-membership degree, radius and the assignment of hesitation degree, and proves that the new distance satisfies the distance measure conditions. Secondly, by constructing a manual testing framework, the new distance is analyzed in comparison with the existing distance metric to show the rationality of the new method. Finally, the method is applied to fuzzy multi-criteria decision making to further demonstrate the effectiveness and practicality of the method.
Citation: Changlin Xu, Yaqing Wen. New measure of circular intuitionistic fuzzy sets and its application in decision making[J]. AIMS Mathematics, 2023, 8(10): 24053-24074. doi: 10.3934/math.20231226
[1] | Tian Xu, Jin-E Zhang . Intermittent control for stabilization of uncertain nonlinear systems via event-triggered mechanism. AIMS Mathematics, 2024, 9(10): 28487-28507. doi: 10.3934/math.20241382 |
[2] | Tao Xie, Xing Xiong . Finite-time synchronization of fractional-order heterogeneous dynamical networks with impulsive interference via aperiodical intermittent control. AIMS Mathematics, 2025, 10(3): 6291-6317. doi: 10.3934/math.2025287 |
[3] | Siyue Yao, Jin-E Zhang . Exponential input-to-state stability of nonlinear systems under impulsive disturbance via aperiodic intermittent control. AIMS Mathematics, 2025, 10(5): 10787-10805. doi: 10.3934/math.2025490 |
[4] | Huiling Li, Jin-E Zhang, Ailong Wu . Finite-time stabilization of nonlinear systems with partially known states via aperiodic intermittent control and event-triggered impulsive control. AIMS Mathematics, 2025, 10(2): 3269-3290. doi: 10.3934/math.2025152 |
[5] | Linni Li, Jin-E Zhang . Input-to-state stability of nonlinear systems with delayed impulse based on event-triggered impulse control. AIMS Mathematics, 2024, 9(10): 26446-26461. doi: 10.3934/math.20241287 |
[6] | Zhaohui Chen, Jie Tan, Yong He, Zhong Cao . Decentralized observer-based event-triggered control for an interconnected fractional-order system with stochastic Cyber-attacks. AIMS Mathematics, 2024, 9(1): 1861-1876. doi: 10.3934/math.2024091 |
[7] | Yidan Wang, Li Xiao, Yanfeng Guo . Finite-time stability of singular switched systems with a time-varying delay based on an event-triggered mechanism. AIMS Mathematics, 2023, 8(1): 1901-1924. doi: 10.3934/math.2023098 |
[8] | Jiaqi Liang, Zhanheng Chen, Zhiyong Yu, Haijun Jiang . Fixed-time consensus of second-order multi-agent systems based on event-triggered mechanism under DoS attacks. AIMS Mathematics, 2025, 10(1): 1501-1528. doi: 10.3934/math.2025070 |
[9] | Zuo Wang, Hong Xue, Yingnan Pan, Hongjing Liang . Adaptive neural networks event-triggered fault-tolerant consensus control for a class of nonlinear multi-agent systems. AIMS Mathematics, 2020, 5(3): 2780-2800. doi: 10.3934/math.2020179 |
[10] | Biwen Li, Yujie Liu . Quasi-synchronization of nonlinear systems with parameter mismatch and time-varying delays via event-triggered impulsive control. AIMS Mathematics, 2025, 10(2): 3759-3778. doi: 10.3934/math.2025174 |
Circular intuitionistic fuzzy sets are further extensions of intuitionistic fuzzy sets with a stronger ability to express uncertain information than intuitionistic fuzzy sets. This paper firstly defines a new distance measure for circular intuitionistic fuzzy sets based on the theory of circular intuitionistic fuzzy sets, considering the information of four aspects: membership degree, non-membership degree, radius and the assignment of hesitation degree, and proves that the new distance satisfies the distance measure conditions. Secondly, by constructing a manual testing framework, the new distance is analyzed in comparison with the existing distance metric to show the rationality of the new method. Finally, the method is applied to fuzzy multi-criteria decision making to further demonstrate the effectiveness and practicality of the method.
Due to human interference and environmental noise, stochastic disturbances increase the complexity and unpredictability of system dynamics[1]. Since the stochastic effects of the system are taken into account, the dynamics of industrial processes can be characterized more precisely. In recognition of this, stochastic nonlinear systems have drawn more attention and been thoroughly examined by numerous academics from a variety of disciplines, including mechanical systems, economics, and bioengineering[2,3,4,5,6].
The majority of stability-related issues are managed by state feedback, which necessitates constant decision-making and state observation on the part of the controller. This operation has limits and is costly for real-world applications. In order to conserve resources, time-triggered control in conjunction with event-triggered control (ETC) is suggested as a transmission or communication technique. Time-triggered control, as a traditional control scheme, has a preset control transmission and control time, but it often leads to an inefficient use of communication width and computational resources, so an effective alternative, ETC, is proposed on this basis[7,8,9]. Because ETC maintains the necessary closed-loop performance while updating control only when the state of the system at a given moment is above the threshold of the predetermined triggering mechanism, it further improves communication efficiency. A key concern in ETC design is ensuring a positive lower bound, which is the minimum time interval between consecutive events. Without this constraint, an infinite number of triggers could occur in a finite time, leading to undesirable Zeno behavior. In recent years, there has been a continuous increase in research related to ETC. For instance, [10] investigated the exponential stability of stochastic nonlinear systems using double-event-triggering mechanisms. In[11], the design of event-triggered control schemes for nonlinear systems subject to external disturbances and dynamic uncertainties was investigated. Despite these advancements, the ETC still has limitations, and further resource optimization remains an important research direction.
Intermittent control (IC) was first proposed as a discontinuous control method and has attracted increasing attention[12,13,14,15,16,17]. For example, [14] investigated the input-to-state stability of stochastic nonlinear systems under different event-triggering mechanisms—continuous, dynamic, and periodic—in combination with IC, providing valuable insights for further research. Unlike continuous control, fully controlling these systems in real-world applications is impractical, as it would impose a heavy communication burden on the controller and waste resources; therefore, the emergence of IC is of great significance. IC divides each control interval into 'working time' with operational control and 'rest time' without operational control. Additionally, IC limits the amount of transmitted information and extends the lifespan of the control equipment by allowing control signals to be applied only at predetermined time intervals. Periodically intermittent control (PIC) and aperiodically intermittent control (APIC) are two classifications of IC that depend on whether the control interval and control periods are fixed. However, the conditions might be conservative because PIC's control and free intervals must be fixed. The advantage of APIC is that it is no longer necessary to fix the length of the working time and rest time, which increases the randomness of the control intervals and therefore has a good application prospect. Therefore, with the advantages of APIC, many scholars have combined ETC with APIC to achieve better research results[18,19,20,21]. Reference[20] realized finite-time stabilization of nonlinear delayed systems under impulsive disturbance by designing time-triggered aperiodic intermittent control with event-triggered aperiodic intermittent control.
Quantization strategies as a control scheme not only ensure sufficient accuracy but also reduce the amount of transmitted information[22,23,24,25,26]. Quantizers perform a discontinuous mapping from a continuous space to a finite set. However, due to the precision and range limitations of quantization, numerical discrepancies arise between the behavior of the ideal system and the calculated values.
The concept of stability studies the asymptotic behavior of states that tend to infinity with time. However, a state's properties in the finite time domain must be considered in practical engineering, so finite-time stability (FTS) has been widely studied as one of the concepts describing the state in the finite time domain[27,28,29,30,31,32,33,34]. FTS due to the transient properties in the finite time sense can be divided into two categories of concepts: one is for a given initial value of the upper bound with a finite time interval, which is maintained within a finite time domain within another larger threshold value. The second concept states that the system's state reaches equilibrium in finite time. To avoid confusion, only the first concept is considered in this paper. However, finite-time stabilization alone is insufficient. A more practical approach is finite-time contraction stabilization (FTCS), which not only ensures boundedness but also requires that the system's state at the termination time must remain within a smaller bound compared with the initial upper limit. This makes FTCS particularly relevant for real-world applications. In[35,36], FTS is investigated in a stochastic sense, where, unlike stochastic finite-time stability under probability[37,38], such stability has states under expectation. Reference[39] investigated the FTS of linear systems combined with state quantization.
However, little research has focused on nonlinear stochastic systems that integrate these three aspects, since stochastic state fluctuations are a primary cause of the system's instability and poor performance. Therefore, using ETC with APIC, and combining ETC with APIC and state quantization enables a more effective assessment of a system's performance through well-designed triggering mechanisms while conserving control resources.
On the basis of the motivation and inspiration of the abovementioned research, this paper presents the FTS and FTCS of stochastic nonlinear systems with two ETMs under APIC. The control system follows established ISS control laws and provides two settings for QbE and QaE, where paired quantizers are taken into consideration. By integrating ETC with quantization control, the approach aims to minimize the communication overhead. The Zeno phenomenon, in which the control is updated infinitely in finite time, is then avoided by designing a static ETM. In addition, aperiodically intermittent controllers are introduced to reduce the computational burden on controllers and mitigate reliance on continuous transmission. There are relatively few papers on stochastic nonlinear systems in ETC with IC to achieve FTS, so the theoretical results of our study are of interest. The results show that (1) under APIC, both ETMs significantly reduce the number of trigger events, and the control interval length can be adjusted according to the specific objectives of the ETMs; (2) both ETMs can achieve FTS and FTCS of stochastic nonlinear systems, and the relevant sufficient conditions are obtained. Therefore, the main innovation of this paper lies in the combination of intermittent state quantization and an event-triggered mechanism, which further reduces the computational costs and communication burdens. Compared with [14,26], this paper employs an aperiodically intermittent controller to further alleviate the controller's burden and achieve finite-time stability. In contrast to [20,39], this work extends the general nonlinear system to a stochastic nonlinear system setting and employs intermittent quantization control to achieve finite-time stability and Lyapunov stability.
The rest of the paper is structured as follows: Section 2 describes the model and provides background information, Section 3 presents the primary results, Section 4 provides numerical examples, and finally, Section 5 summarizes the key conclusions and outlines directions for future research.
Notations: In the whole paper, we have used N to represent the set of natural numbers, R+=[0,+∞) denotes the set of positive real numbers. V(x,t)∈C2,1 denotes the family of all non-negative functions in Rd×[0,+∞) and is quadratically continuously differentiable with respect to x and once continuously differentiable with respect to t. E(⋅) stands for the expectation operator. IA(x) represents the characteristic function. When x∈A, IA(x)=1, and when x∉A, IA(x)=0. Define Z+ as the set of positive integers and N as the set of integers.
Let (Ω,F,Pr{⋅}) be a complete probability space with a filtration {Ft}t≥0 that meets the normal conditions. Study the following nonlinear stochastic system, which has a dynamical expression of the form
dx(t)=(f(x(t),t)+u(t))dt+g(x(t),t)dω(t) | (2.1) |
on t≥0 with the initial state x(t0)=x0, where x(t)∈Rn, f, g∈Rn×R+→Rn and satisfies f(0,t)=g(0,t)=0, where u(t)∈Rn is control input and ω(t) is defined as an n-dimensional Wiener process on the probability space satisfying the general conditions. Next, we define the intermittent control law as follows:
u(t)={α(q(x(tm,i))),t∈[tm,i,tm,i+1)∩[tm,tm+sm),0,t∈[tm+sm,tm+1), | (2.2) |
which is affected by state quantization and is event-triggered, where [tm,tm+1) represents the m+1th control period, [tm,tm+sm) represents the m+1th working interval, and [tm+sm,tm+1) represents the rest interval; tm,i is the time at which the ith event is activated in the m+1th work interval. This strategy has the advantage of allowing the controller to work for a while and then take a break to lessen the strain on communication. α:Rn→Rn stands for the controller function. Thus, with an intermittent control law u(t), the system's dynamic can be represented as follows:
dx(t)={(f(x(t),t)+u(t))dt+g(x(t),t)dω(t),t∈[tm,i,tm,i+1)∩[tm,tm+sm),f(x(t),t)dt+g(x(t),t)dω(t),t∈[tm+sm,tm+1), | (2.3) |
where q:Rn→Ξ, n∈Z+ represents the logarithmic quantization function, Ξ is a discrete set of quantization values, and {tm,i} indicates a time series consisting of the instant of event triggering. Next, we give a number of significant assumptions.
Assumption 2.1. [18] There are two constants θ, ω, satisfying 0<θ<ω and for k=1,2,3…, such that the following holds true:
{infk(sk)=θ>0,supk(tk+1−tk)=ω<+∞. |
Remark 2.1. Here, θ is the minimum work interval and ω−θ is the maximum rest interval, where the duration of the work interval will not be less than θ and the duration of the rest interval will not be greater than ω−θ. This prevents the controller from exerting control for long periods of time and ensures that the work interval alternates with the rest interval. The framework of the APIC strategy is shown in Figure 1.
Assumption 2.2. [22,39] The logarithmic quantizer q(⋅) is defined as follows:
q(v)={ξi,if11+δξi<v≤11−δξi,0,ifv=0,−q(−v),ifv<0, |
where q(v), v ∈R, without taking the finite quantization level into account Ξ={±ξ:ξi=ρiξ0;i∈N}∪{0}; 0<ρ<1; and ξ0>0, where δ=1−ρ1+ρ∈(0,1) is linked to the quantizer density ρ and is referred to as the sector bound. If q is a logarithmic quantization function and q(x)=Γ[q(ζx,1),q(ζx,2),⋯,q(ζx,n)]T, where ζx=Γ−1x=[ζx,1,ζx,2,⋯,ζx,n]T, x∈Rn. The nature of the quantizer is as follows:
|q(x)−x|≤δ|x|. |
Assumption 2.3. The following equation holds true for every x, ¯x∈Rn, t∈R+, assuming there are positive constants L1, L2, and L3:
(i)|f(x,t)|≤L1|x|,|g(x,t)|≤L2|x|,(ii)|α(x)−α(¯x)|≤L3|x−¯x|. |
Assumption 2.4. Positive definite functions V(x,t)∈C2,1(Rn×R+;R+) exist that are continuously differentiable in x twice and in t once. Positive variables c1, c2 also exist, so that for every x∈Rn, the equation that follows holds:
c1|x|2≤V(x,t)≤c2|x|2. | (2.4) |
The operator LV(x,t) is defined by
LV(x,t)≤φ(t)V(x,t), | (2.5) |
where φ(t)=φ1>0 for t∈[tm+sm,tm+1), φ(t)=φ2<0 for t∈[tm,tm+sm), and dV(x,t)=LV(x,t)dt+Vx(x,t)dω(t).
Assumption 2.5. [16] A positive definite function V(x,t)∈C2,1(Rn×R+) and a positive constant L4 exist, such that any x∈Rn ∂V(x,t)∂x≤L4|x| holds.
Definition 2.1. For the given constants T, ε1, and ε2 with 0<ε1<ε2 and any trajectory x(t), if there is a control law such that E|x0|≤ε1 implies E|x(t)|≤ε2, t∈[0,T], then the system (2.3) is called FTS with respect to (w.r.t) (T,ε1,ε2).
Definition 2.2. For the given constants T, ε1, ε2, ϱ, and τ, where 0<ϱ<ε1<ε2 and τ∈(0,T), the system (2.3) is FTCS with respect to (w.r.t) (T,ε1,ε2,ϱ,τ). If there is a control law such that E|x0|≤ε1 implies E|x(t)|≤ε2 for all t∈[0,T], for all t∈[T−τ,T], there is E|x(t)|≤ϱ.
Remark 2.2. (ⅰ) In Definition 2.1, all parameters ε1, ε2, and T are predesigned, and FTS indicates that the average value of the states from the initial data of the systems is within a predetermined initial bound and subsequently reaches another set bound after a finite amount of time. The FTS describes a kind of boundedness of the state of the system, whose state trajectory is depicted in Figure 2a.
(ⅱ) According to Definition 2.2, the trajectory of the system state reaches, within a small time interval [T−τ,T] of the terminal time, another threshold ϱ that is smaller than the initial threshold, as shown in Figure 2b. Thus, we can see that the conditions for FTCS are much more restrictive than FTS.
Lemma 2.1. [16] Consider stochastic nonlinear systems satisfying Assumptions 2.2, 2.4, and 2.5. When t∈[t1,t2), assuming the existence of some positive constants ^β1<0, ˇβ1>0, and −^β1>ˇβ1>0, for a positive definite function V(x(t),t), the following conditions are satisfied:
ELV(x(t),t)≤^β1EV(x(t),t)+ˇβ1supt1≤η<t2EV(x(η),η). |
Then, we can derive
supt1≤η<t2EV(x(η),η)=EV(x(t1),t1). |
To further investigate the connection between state quantization and ETMs under APIC, we designed the following two ETMs.
(Ⅰ). QbE: If the system's state is quantized before a trigger, the following ETM is available:
tm,i+1=inf{t≥tm,i+ϵ||q(x(tm,i))−x(t)|2≥λ|x(t)|2}. | (3.1) |
(Ⅱ). QaE: If the system's state is quantized after a trigger, the following ETM is available:
tm,i+1=inf{t≥tm,i+ϵ||(x(tm,i))−x(t)|2≥λ|x(t)|2}, | (3.2) |
where t0=0, ϵ, and λ are all constants, and (3.1) and (3.2) mean that the ETM will be suspended for a period of time ϵ after execution; after that, it will continue to execute the current predesigned trigger mechanism until the next trigger threshold condition is met. Since the stopping time ϵ is set in the ETM, the system (2.1) naturally avoids the Zeno behavior. Compared with traditional time-triggered, the event-triggered strategy used can further increase the time interval between events on this basis, due to the fact that the defined time sequence of event-triggered is determined by the current state of the system, thus reducing the network's communication burden. The description of ETM (3.1) and ETM (3.2) can be represented by the block diagrams in Figures 3 and 4. In addition, the utilization of APIC (2.2) can further save communication resources on this basis. Next, we give the following two error estimates e1(t)=q(x(tm,i))−x(t) and e2(t)=x(tm,i)−x(t).
Lemma 3.1. Under Assumptions 2.1–2.3, ϵ≥0, 0≤δ≤1, and ϵ<√112L23(2δ2+1) exist, and for the system (2.1), the following holds:
E|e1(t)|2≤κ1E∫tm,i+ϵtm,i|x(s)|2ds+κ2E|x(t)|2, | (3.3) |
where κ1=4(2δ2+1)(2ϵL21+L22)1−12ϵ2L23(2δ2+1), κ2=24ϵ2L23(2δ2+1)21−12ϵ2L23(2δ2+1)+4δ2+λ.
Proof. For any fixed t, define the set of time series Λi={γt=tm,i}, Λi,ϵ={γt=tm,i,andt≤tm,i+ϵ}. We estimate the error e1(t) in two separate cases.
Case 1: If t∈Λi∖Λi,ϵ, at this point, by ETM (3.1), we have |q(x(tm,i))−x(t)|2≤λ|x(t)|2 a.s.(almost sure) on Λi∖Λi,ϵ, which implies
E(IΛi∖Λi,ϵ|q(x(tm,i))−x(t)|2)≤E(IΛi∖Λi,ϵλ|x(t)|2)≤E(IΛi|x(t)|2). | (3.4) |
Case 2: If t∈Λi,ϵ, for the error e1(t), we have
E(IΛi,ϵ|q(x(tm,i))−x(t)|2)≤2E(IΛi,ϵ|q(x(tm,i))−x(tm,i)|2)+2E(IΛi,ϵ|x(tm,i)−x(t)|2)≤2δ2E(IΛi,ϵ|x(tm,i)|2)+2E(IΛi,ϵ|e2(t)|2)≤(4δ2+2)E(IΛi,ϵ|e2(t)|2)+4δ2E(IΛi,ϵ|x(t)|2). | (3.5) |
Next, we estimate e2(t) conditional on ETM (3.1). Based on the system (2.3), we have
E(IΛi,ϵ|e2(t)|2)=E(IΛi,ϵ|∫ttm,if(x(s),s)+u(s)ds+∫ttm,ig(x(s),s)dω(s)|2)≤4E(|IΛi,ϵ∫ttm,if(x(s),s)ds|2)+4E(|IΛi,ϵ∫ttm,iu(s)ds|2)+2E(|IΛi,ϵ∫ttm,ig(x(s),s)dω(s)|2). | (3.6) |
From H¨older's inequality and Assumption 2.3, we get
E(|IΛi,ϵ∫ttm,if(x(s),s)ds|2)≤ϵL21E(|IΛi,ϵ∫ttm,i|x(s)|2ds). | (3.7) |
From Assumptions 2.2 and 2.3
E(|IΛi,ϵ∫ttm,iu(s)ds|2)=E(|IΛi,ϵ∫ttm,iα(q(x(tm,i)))ds|2)≤ϵ2L23(EIΛi,ϵ|q(x(tm,i))−x(tm,i)+x(tm,i)−x(t)+x(t)|2)≤3ϵ2L23E(IΛi,ϵ|q(x(tm,i))−x(tm,i)|2)+3ϵ2L23E(IΛi,ϵ|x(tm,i)−x(t)|2)+3ϵ2L23E(IΛi,ϵ|x(t)|2)≤(6ϵ2L23δ2+3ϵ2L23)E(IΛi,ϵ|x(t)|2+IΛi,ϵ|e2(t)|2). | (3.8) |
Furthermore, from the Itˆo isometry and Assumption 2.3, we obtain
E(|IΛi,ϵ∫ttm,ig(x(s),s)dω(s)|2)≤L22E(IΛi,ϵ∫ttm,i|x(s)|2ds). | (3.9) |
Then, substituting (3.7), (3.8), and (3.9) into (3.6) yields
E(IΛi,ϵ|e2(t)|2)≤(4ϵL21+2L22)E(IΛi,ϵ∫ttm,i|x(s)|2ds)+(24ϵ2L23δ2+12ϵ2L23)E(IΛi,ϵ|x(t)|2)+(24ϵ2L23δ2+12ϵ2L23)E(IΛi,ϵ|e2(t)|2). |
Since ϵ<√112L23(2δ2+1), shifting the terms gives
E(IΛi,ϵ|e2(t)|2)≤4ϵL21+2L221−12ϵ2L23(2δ2+1)E(IΛi,ϵ∫ttm,i|x(s)|2ds)+24ϵ2L23δ2+12ϵ2L231−12ϵ2L23(2δ2+1)E(IΛi,ϵ|x(t)|2). | (3.10) |
Substituting the result of (3.10) into (3.5) gives
E(IΛi,ϵ|q(x(tm,i))−x(t)|2)≤(4δ2+24ϵ2L23(2δ2+1)21−12ϵ2L23(2δ2+1))E(IΛi,ϵ|x(t)|2)+4(2ϵL21+L22)(2δ2+1)1−12ϵ2L23(2δ2+1)E(IΛi,ϵ∫ttm,i|x(s)|2ds). | (3.11) |
Thus, combining (3.4) and (3.11), we get
E(IΛi|q(x(tm,i))−x(t)|2)=E(IΛi,ϵ|q(x(tm,i))−x(t)|2)+E(IΛi∖Λi,ϵ|q(x(tm,i))−x(t)|2)≤4(2ϵL21+L22)(2δ2+1)1−12ϵ2L23(2δ2+1)E(IΛi,ϵ∫ttm,i|x(s)|2ds)+(4δ2+24ϵ2L23(2δ2+1)21−12ϵ2L23(2δ2+1)+λ)E(IΛi|x(t)|2)≤4(2ϵL21+L22)(2δ2+1)1−12ϵ2L23(2δ2+1)E(IΛi∫tm,i+ϵtm,i|x(s)|2ds)+(4δ2+24ϵ2L23(2δ2+1)21−12ϵ2L23(2δ2+1)+λ)E(IΛi|x(t)|2). |
Therefore, when t∈[tm,tm+sm), there are up to ⌈smϵ⌉ communication times on [tm,tm+sm), m∈N+. As a result, we can arrive at
E|q(x(tm,i))−x(t)|2=⌈smϵ⌉∑i=0E(IΛi|q(x(tm,i))−x(t)|2)≤4(2ϵL21+L22)(2δ2+1)1−12ϵ2L23(2δ2+1)⌈smϵ⌉∑i=0E(IΛi∫tm,i+ϵtm,i|x(s)|2ds)+(4δ2+24ϵ2L23(2δ2+1)21−12ϵ2L23(2δ2+1)+λ)⌈smϵ⌉∑i=0E(IΛi|x(t)|2)=4(2ϵL21+L22)(2δ2+1)1−12ϵ2L23(2δ2+1)E(∫tm,i+ϵtm,i|x(s)|2ds)+(4δ2+24ϵ2L23(2δ2+1)21−12ϵ2L23(2δ2+1)+λ)E(|x(t)|2), |
let κ1=4(2δ2+1)(2ϵL21+L22)1−12ϵ2L23(2δ2+1), κ2=24ϵ2L23(2δ2+1)21−12ϵ2L23(2δ2+1)+4δ2+λ, we conclude that
E|e1(t)|2≤κ1E∫tm,i+ϵtm,i|x(s)|2ds+κ2E|x(t)|2, |
and the proof is completed. Next, we analyze the FTS and FTCS of the system (2.3) under APIC in terms of ETM (3.1) with state quantization.
Theorem 3.1. Under Assumptions 2.1–2.5 and Lemmas 2.1 and 3.1, there are ϵ<√112L23(2δ2+1) and some positive constants λ,ϵ,δ,ω,θ,˜μ1 that satisfy
−ˆβ1>ˇβ1>0, | (3.12) |
and
N(0,t)[φ1(ω−θ)−˜μ1θ]−lnc1ε22+lnc2ε21≤0, | (3.13) |
where N(0,t) delegates the number of the control period on (0,T] and T≠tn, ˇβ1=L3L4ϵ2c1κ1, and ˆβ1=L3L42c1κ2+L3L42c1+φ2, where κ1 and κ2 are the same as in Lemma 3.1. 0<˜μ1<μ1 and μ1 is the sole positive real root of equation μ1+ˇβ1eμ1Δ1+ˆβ1=0. The upper bound on the inter-event interval can be expressed as supm,i∈N{tm,i+1−tm,i}≤Δ1. We can then claim that the system (2.1) is capable of FTS (w.r.t) (T,ε1,ε2) under APIC with ETM (3.1).
Moreover, if for all t∈[T−τ,T], there are
N(0,t)[φ1(ω−θ)−˜μ1θ]−lnc1ϱ2+lnc2ε21≤0. | (3.14) |
Then, we claim that system (2.1) is capable of FTCS (w.r.t) (T,ε1,ε2,ϱ,τ) under APIC with ETM (3.1).
Proof. For 0<|x0|≤ε1, assume x(t)=x(t,0,x0) is a solution of the system (2.2) at (0,x0), when t∈[tm+sm,tm+1), from Assumption 2.4, we have
ELV(x(t),t)≤Eφ1V(x(t),t). | (3.15) |
Integrating (3.15) over the interval [tm+sm,t) gives
EV(x(t),t)≤Eeφ1(t−tm−sm)V(x(tm+sm),tm+sm). | (3.16) |
When t∈[tm,tm+sm), from Assumptions 2.4 and 2.5 and Condition (ⅱ) in Assumption 2.2, we obtain
ELV(x(t),t)≤Eφ2V(x(t),t)+E∂V(x,t)∂x|α(q(x(tm,i)))−αx(t)|≤φ2EV(x(t),t)+L3L42E(|x(t)|2+|q(x(tm,i))−x(t)|2). | (3.17) |
Substituting the result of Lemma 3.1 into (3.17) yields
ELV(x(t),t)≤φ2EV(x(t),t)+L3L42E(|x(t)|2)+L3L42E(|q(x(tm,i))−x(t)|2)≤φ2EV(x(t),t)+L3L42E(|x(t)|2)+L3L42E(κ1∫tm,i+ϵtm,i|x(s)|2ds+κ2|x(t)|2)≤L3L42c1κ1E∫tm,i+ϵtm,iV(x(s),s)ds+(L3L42c1κ2+L3L42c1+φ2)EV(x(t),t)≤L3L4ϵ2c1κ1suptm,i≤η<tm,i+ϵEV(x(η),η)+(L3L42c1κ2+L3L42c1+φ2)EV(x(t),t). | (3.18) |
Substituting the result of Lemma 2.1, ˇβ1=L3L4ϵ2c1κ1, and ˆβ1=L3L42c1κ2+L3L42c1+φ2 into Eq (3.18) yields
ELV(x(t),t)≤ˇβ1EV(x(tm,i),tm,i)+ˆβ1EV(x(t),t). | (3.19) |
Further, let ˙z(t)=ˇβ1z(tm,i)+ˆβ1z(t) and y(t)=z(t)e˜μ1(t−tm,i) and assume that z(t)=EV(x(t),t). Since z(tm,i)>0, we assert that ϕ>1 exists such that y(t)<ϕz(tm,i). Otherwise, t>tm,i exists such that y(t)>ϕz(tm,i), and we define ˆt=inf{t>tm,i|y(t)=ϕz(tm,i)}. Thus, we can derive y(ˆt)=ϕz(tm,i), which means that ˙y(ˆt)≥0. In this cases,
˙y(t)=e˜μ1(t−tm,i)(˜μ1z(t)+˙z(t))=e˜μ1(t−tm,i)(˜μ1z(t)+ˇβ1z(tm,i)+ˆβ1z(t))≤˜μ1y(t)+ˆβ1y(t)+ˇβ1e˜μ1(t−tm,i)y(tm,i)=(˜μ1+ˆβ1)y(t)+ˇβ1e˜μ1(t−tm,i)y(tm,i). |
When t=ˆt, the following equation holds:
˙y(ˆt)≤(˜μ1+ˆβ1)y(ˆt)+ˇβ1e˜μ1(ˆt−tm,i)y(tm,i)≤(˜μ1+ˆβ1+ˇβ1e˜μ1(ˆt−tm,i))y(ˆt)≤(˜μ1+ˆβ1+ˇβ1e˜μ1(tm,i+1−tm,i))y(ˆt)≤(˜μ1+ˆβ1+ˇβ1e˜μ1Δ1)y(ˆt). |
Next, we define ϑ(μ1)=μ1+ˆβ1+ˇβ1eμ1Δ1. We then have ϑ(μ1)′ and, by ϑ(0)<0 and ϑ(−ˆβ1)>0, a unique positive root μ1 exists such that μ1+ˆβ1+ˇβ1eμ1Δ1=0. Further, for 0<˜μ1<μ1, we have ˜μ1+ˆβ1+ˇβ1e˜μ1Δ1<0. In summary, we conclude that ˙y(ˆt)≤0. This is contradictory to the above. Thus, y(t)<ϕz(tm,i) holds. Therefore, when t∈[tm,i,tm,i+1) and when ϕ→1, by the comparison principle, we have
EV(x(t),t)≤Ee−˜μ1(t−tm,i)V(x(tm,i),tm,i). | (3.20) |
When t∈[tm,tm,1), Eq (3.20) becomes
EV(x(t),t)≤Ee−˜μ1(t−tm)V(x(tm),tm). |
If we let t=tm,1, then we have
EV(x(tm,1),tm,1)≤Ee−˜μ1(tm,1−tm)V(x(tm),tm). | (3.21) |
When t∈[tm,1,tm,2), we have
EV(x(t),t)≤Ee−˜μ1(t−tm,1)V(x(tm,1),tm,1). | (3.22) |
Substituting (3.21) into (3.22) yields
EV(x(t),t)≤Ee−˜μ1(t−tm)V(x(tm),tm),t∈[tm,1,tm,2). | (3.23) |
Suppose that the following equation still holds when t∈[tm,k,tm,k+1):
EV(x(t),t)≤Ee−˜μ1(t−tm)V(x(tm),tm),t∈[tm,k,tm,k+1), |
and when t=tm,k+1
EV(x(tm,k+1),tm,k+1)≤Ee−˜μ1(tm,k+1−tm)V(x(tm,k+1),tm,k+1),t∈[tm,k,tm,k+1). | (3.24) |
When t∈[tm,k+1,tm,k+2), we have
EV(x(t),t)≤Ee−˜μ1(t−tm,k+1)V(x(tm,k+1),tm,k+1). | (3.25) |
Substituting (3.24) into (3.25) gives
EV(x(t),t)≤Ee−˜μ1(t−tm)V(x(tm),tm),t∈[tm,k+1,tm,k+2). | (3.26) |
The assumption still holds when t∈[tm,k+1,tm,k+2). Hence, for any t∈[tm,i,tm,i+1) and 0≤i≤⌈smϵ⌉, we have EV(x(t),t)≤Ee−˜μ1(t−tm)V(x(tm),tm) holds true. Then for t∈[tm,tm+sm), we still have EV(x(t),t)≤Ee−˜μ1(t−tm)V(x(tm),tm).
In summary, we have
EV(x(t),t)≤Ee−˜μ1(t−tm)V(x(tm),tm),t∈[tm,tm+sm),EV(x(t),t)≤Eeφ1(t−tm−sm)V(x(tm+sm),tm+sm),t∈[tm+sm,sm+1), |
for 0≤t≤T, 0<ε1<ε2, and 0<|x0|≤ε1.
When t∈[t0,t0+s0), we have
EV(x(t),t)≤Ee−˜μ1(t−t0)V(x(t0),t0), | (3.27) |
and
EV(x(t0+s0),t0+s0)≤Ee−˜μ1s0V(x(t0),t0), | (3.28) |
for t∈[t0+s0,t1). Combining with (3.27) and (3.28), one has
EV(x(t),t)≤Eeφ1(t−t0−s0)V(x(t0+s0),t0+s0)≤Eeφ1(t−t0−s0)−˜μ1s0V(x(t0),t0), |
and
EV(x(t1),t1)≤Eeφ1(t1−t0−s0)−˜μ1s0V(x(t0),t0). | (3.29) |
When t∈[t1,t1+s1), we have
EV(x(t),t)≤Ee−˜μ1(t−t1)V(x(t1),t1), |
and
EV(x(t1+s1),t1+s1)≤Ee−˜μ1s1V(x(t1),t1). | (3.30) |
For t∈[t1+s1,t2), combining (3.27), (3.29), and (3.30), one has
EV(x(t),t)≤Eeφ1(t−t1−s1)V(x(t1+s1),t1+s1)≤Eeφ1(t−t1−s1)−˜μ1s1V(x(t1),t1)≤Eeφ1(t−t1−s1+t1−t0−s0)−˜μ1(s0+s1)V(x(t0),t0), |
and
EV(x(t2),t2)≤Eeφ1(t2−t1−s1+t1−t0−s0)−˜μ1(s0+s1)V(x(t0),t0). | (3.31) |
When t∈[t2,t2+s2), we have
EV(x(t),t)≤Ee−˜μ1(t−t2)V(x(t2),t2), |
and
EV(x(t2+s2),t2+s2)≤Ee−˜μ1s2V(x(t2),t2). | (3.32) |
For t∈[t2+s2,t3), combining (3.27), (3.31), and (3.32), one has
EV(x(t),t)≤Eeφ1(t−t2−s2)V(x(t2+s2),t2+s2)≤Eeφ1(t−t2−s2)−˜μ1s2V(x(t2),t2)≤Eeφ1(t−t2−s2+t2−t1−s1+t1−t0−s0)−˜μ1(s0+s1+s2)V(x(t0),t0), |
and
EV(x(t2),t2)≤Eeφ1(t3−t2−s2+t2−t1−s1+t1−t0−s0)−˜μ1(s0+s1+s2)V(x(t0),t0). |
In the same way, for t∈[tn+sn,tn+1) and using Assumption 2.1, we have
EV(x(t),t)≤Eeφ1[t−tn−sn+n−1∑i=0(ti+1−ti−si)]−˜μ1n∑i=0siV(x(t0),t0)≤Eeφ1[n∑i=0(ti+1−ti−si)]−˜μ1n∑i=0siV(x(t0),t0)≤Ee(n+1)φ1(ω−θ)−(n+1)˜μ1θV(x(t0),t0)≤EeN(0,t)(φ1(ω−θ)−˜μ1θ)V(x(t0),t0). |
From Condition (2.4) in Assumption 2.4 and (3.13), we can derive
|x(t)|2≤c2c1eN(0,t)(φ1(ω−θ)−˜μ1θ)|x0|2≤c2c1ε21eN(0,t)(φ1(ω−θ)−˜μ1θ)≤ε22, | (3.33) |
which means that |x(t)|≤ε2, and thus E|x(t)|≤ε2 holds on [0,T]. As described, it can be concluded that the system (2.3) can achieve FTS on [0,T]. The system (2.1) is FTS (w, r, t) (T,ε1,ε2) under APIC (2.2) with ETM (3.1).
When t∈[T−τ,T], if Condition (3.14) in Theorem 3.1 is satisfied, from (3.33) we have
|x(t)|2≤c2c1eN(0,t)(φ1(ω−θ)−˜μ1θ)|x0|2≤c2c1ε21eN(0,t)(φ1(ω−θ)−˜μ1θ)≤ϱ2, | (3.34) |
which shows that |x(t)|≤ϱ, and thus E|x(t)|≤ϱ hold on t∈[T−τ,T]. Then the system (2.1) can achieve FTCS (w, r, t) (T,ε1,ε2,ϱ,τ) under APIC (2.2) with ETM (3.1).
The proof is complete.
Lemma 3.2. Under Assumptions 2.1–2.3 and Lemma 3.1, ϵ≥0, 0≤δ≤1, and ϵ<√112L23(2δ2+1) exists, and for the system (2.1), the following holds:
E|e2(t)|2≤κ3E∫tm,i+ϵtm,i|x(s)|2ds+κ4E|x(t)|2, | (3.35) |
where κ3=2(2ϵL21+L22)1−12ϵ2L23(2δ2+1) and κ4=12ϵ2L23(2δ2+1)1−12ϵ2L23(2δ2+1)+λ.
Proof. Similarly to Lemma 3.1, we discuss the same in two cases.
Case 1: If t∈Λi∖Λi,ϵ, at this point, by ETM (3.2), we have |(x(tm,i)−x(t)|2≤λ|x(t)|2 a.s. on Λi∖Λi,ϵ, which implies
E(IΛi∖Λi,ϵ|x(tm,i)−x(t)|2)≤E(IΛi∖Λi,ϵλ|x(t)|2)≤E(IΛiλ|x(t)|2). | (3.36) |
Case 2: If t∈Λi,ϵ, using the results of (3.10) in Lemma 3.1, we have
E(IΛi,ϵ|e2(t)|2)≤4ϵL21+2L221−12ϵ2L23(2δ2+1)E(IΛi,ϵ∫ttm,i|x(s)|2ds)+12ϵ2L23(2δ2+1)1−12ϵ2L23(2δ2+1)E(IΛi,ϵ|x(t)|2). | (3.37) |
Thus, combining (3.36) and (3.37), we get
E(IΛi|x(tm,i)−x(t)|2)=E(IΛi,ϵ|x(tm,i)−x(t)|2)+E(IΛi∖Λi,ϵ|x(tm,i)−x(t)|2)≤2(2ϵL21+L22)1−12ϵ2L23(2δ2+1)E(IΛi∫tm,i+ϵtm,i|x(s)|2ds)+(12ϵ2L23(2δ2+1)1−12ϵ2L23(2δ2+1)+λ)E(IΛi|x(t)|2). |
The latter steps of the proof are similar to those in Lemma 3.1, so we omit this part of the proof process. In the end, we arrive at
E|e2(t)|2≤κ3E∫tm,i+ϵtm,i|x(s)|2ds+κ4E|x(t)|2. |
The proof is complete.
Theorem 3.2. Under Assumptions 2.1–2.5 and Lemmas 2.1 and 3.2, we have ϵ<√112L23(2δ2+1) and some positive constants λ,ϵ,δ,ω,θ,˜μ2 that satisfy
−ˆβ2>ˇβ1>0, | (3.38) |
and
N(0,t)[φ1(ω−θ)−˜μ2θ]−lnc1ε22+lnc2ε21≤0, | (3.39) |
where N(0,t) delegates the number of the control period on (0,T] and T≠tk, ˇβ1=L3L4κ3ϵ(2δ2+1)c1, ˆβ2=φ2+L3L42c1+2δ2L3L4c1+L3L4(2δ2+1)κ4c1, κ3, and κ4 are the same as in the Lemma 3.2. Moreover, κ3=κ12δ2+1, 0<˜μ2<μ2, where \mu_2 is the sole positive real root of the equation \mu_2+\check{\beta}_1e^{\mu_2\Delta_2}+\hat{\beta}_2 = 0 . The upper bound on the execution time between events can be expressed as \underset{m, i\in \mathbb{N}}{sup}\{t_{m, i+1}-t_{m, i}\}\leq \Delta_2 . We then claim that the system (2.1) is capable of FTS (w.r.t) (T, \varepsilon_1, \varepsilon_2) under APIC with ETM (3.2).
Moreover, for all t\in [T-\tau, T] , there are
\begin{equation} \mathcal{N}(0,t)[\varphi_1(\omega-\theta)-\tilde{\mu}_2\theta]-\ln{c_1\varrho^2}+\ln{c_2\varepsilon_1^2} \leq 0\,. \end{equation} | (3.40) |
Then, we claim that the system (2.1) is capable of FTCS (w.r.t) (T, \varepsilon_1, \varepsilon_2, \varrho, \tau) under APIC with ETM (3.2).
Proof. For 0 < |x_0|\leq \varepsilon_1 , assume that x(t) = x(t, 0, x_0) is a solution of the system (2.2) at (0, x_0) . When t \in [t_m+s_m, t_{m+1}) , from Assumption 2.4, we have
\begin{equation*} \mathbb{E}\mathcal{L}V(x(t),t) \leq \mathbb{E}\varphi_1 V(x(t),t). \end{equation*} |
Integrating the equation above over the interval [t_m+s_m, t) gives
\begin{equation*} \mathbb{E}V(x(t),t)\leq \mathbb{E}e^{\varphi_1(t-t_m-s_m)}V(x(t_m+s_m),t_m+s_m)\,. \end{equation*} |
When t \in [t_m, t_m+s_m) , from Assumptions 2.2, 2.4, and 2.5 and Condition (ⅱ) in Assumption 2.3, we obtain
\begin{equation} \begin{aligned} \mathbb{E}\mathcal{L}V(x(t),t) &\leq \mathbb{E}\varphi_2 V(x(t),t)+\mathbb{E}\frac{\partial V(x,t)}{\partial x}|\alpha (q(x(t_{m,i})))-\alpha x(t)|\\ &\leq \varphi_2\mathbb{E}V(x(t),t)+\frac{L_3L_4}{2}\mathbb{E}(|x(t)|^2+|q(x(t_{m,i}))-x(t)|^2)\\ &\leq \varphi_2\mathbb{E}V(x(t),t)+\frac{L_3L_4}{2}\mathbb{E}|x(t)|^2+L_3L_4\mathbb{E}(|q(x(t_{m,i}))-x(t_{m,i})|^2+|x(t_{m,i})-x(t)|^2)\\ &\leq \varphi_2\mathbb{E}V(x(t),t)+(\frac{L_3L_4}{2}+2\delta^2L_3L_4)\mathbb{E}|x(t)|^2+L_3L_4(2\delta^2+1)\mathbb{E}|e_2(t)|^2\,. \end{aligned} \end{equation} | (3.41) |
If we substitute the result of Lemma 3.2, the equation above becomes
\begin{equation} \begin{aligned} \mathbb{E}\mathcal{L}V(x(t),t) &\leq \varphi_2\mathbb{E}V(x(t),t)+(\frac{L_3L_4}{2}+2\delta^2L_3L_4)\mathbb{E}|x(t)|^2\\ & \quad +L_3L_4(2\delta^2+1)(\kappa_3 \mathbb{E} \displaystyle {\int}_{t_{m,i}}^{t_{m,i}+\epsilon} |x(s)|^2\mathrm{d}s+\kappa_4 \mathbb{E}|x(t)|^2)\\ &\leq (\varphi_2+\frac{L_3L_4}{2c_1}+\frac{2\delta^2L_3L_4}{c_1}+\frac{L_3L_4(2\delta^2+1)\kappa_4}{c_1})\mathbb{E}|x(t)|^2\\ & \quad +L_3L_4\kappa_3(2\delta^2+1)\mathbb{E} \displaystyle {\int}_{t_{m,i}}^{t_{m,i}+\epsilon} |x(s)|^2\mathrm{d}s\\ &\leq (\varphi_2+\frac{L_3L_4}{2c_1}+\frac{2\delta^2L_3L_4}{c_1}+\frac{L_3L_4(2\delta^2+1)\kappa_4}{c_1})\mathbb{E}V(x(t),t)\\ & \quad +\frac{L_3L_4\kappa_3\epsilon(2\delta^2+1)}{c_1}\sup\limits_{t_{m,i} \leq \eta < t_m+\epsilon}V(x(\eta),\eta)\,. \end{aligned} \end{equation} | (3.42) |
Substituting the result of Lemma 2.1, \check{\beta}_1 = \frac{L_3L_4\kappa_3\epsilon(2\delta^2+1)}{c_1} , and \hat{\beta}_2 = \varphi_2+\frac{L_3L_4}{2c_1}+\frac{2\delta^2L_3L_4}{c_1}+\frac{L_3L_4(2\delta^2+1)\kappa_4}{c_1} into Eq (3.42) yields
\begin{equation*} \mathbb{E}\mathcal{L}V(x(t),t) \leq \check{\beta}_1\mathbb{E}V(x(t_{m,i}),t_{m,i})+\hat{\beta}_2\mathbb{E}V(x(t),t). \end{equation*} |
The latter steps are omitted because they closely resemble those in Theorem 3.1.
Remark 3.1. The proofs of Theorems 3.1 and 3.2 rely on the upper bound condition of the execution time between events. However, due to the arbitrariness of t_{m, i+1}-t_{m, i} , determining the roots of the equation \mu_1+\hat{\beta}_1+\check{\beta}_1e^{\mu_1\Delta_1} = 0 is not straightforward. Nevertheless, it can be seen from the equation that if t_{m, i+1}-t_{m, i} is larger, then the roots of the equation \mu_1 can be appropriately small to satisfy 0 < \tilde{\mu}_1 < \mu_1 . Therefore, we have the existence of 0 < \tilde{\mu}_1^{*} < \mu_1\leq{\mu}_1^{*} for an arbitrary t_{m, i+1}-t_{m, i} , whose corresponding equation has the solution {\mu}_1^{*} , such that \tilde{\mu}_1^{*}+\hat{\beta}_1+\check{\beta}_1e^{\tilde{\mu}_1^{*}\Delta_1} < 0 holds.
Remark 3.2. Theorem 3.1 is obtained from the trigger mechanism (3.1) on the basis of the error estimate (3.3), and Theorem 3.2 is obtained from the trigger mechanism (3.2) on the basis of the error estimate (3.35). Since (3.1) is based on quantization first and then event-triggered determination, the scheme is applicable to the overall quantization nature of the state trajectories, while (3.2) is based on event-triggered of the system's state and then realizing the quantization, which is more suitable for exploring the local quantization nature of the state trajectories under intermittent control. Therefore, according to (3.14) in Theorem 3.1, \varrho can be reduced with the change in \theta by increasing \theta , which can better realize the 'contraction' in FTCS. By Eq (3.40) of Theorem 3.2, it can be seen that by decreasing \theta appropriately, \varrho can increase relatively with a change in \theta , which makes it easier to achieve FTCS. See Section 4 for details.
This section illustrates our design approach using two examples of real process simulation and numerical simulation.
Example 1. Consider the following stochastic nonlinear system:
\begin{equation} \begin{aligned} \mathrm{d}x(t) = f(x(t),t)\mathrm{d}t+g(x(t),t)\mathrm{d}\omega(t) \end{aligned} \end{equation} | (4.1) |
on t \geq 0 , where
\begin{equation*} \begin{aligned} f(x(t),t) = \begin{bmatrix} x_2(t)\\ -dx_1(t)-csinx_1(t)-ax_2(t) \end{bmatrix} \end{aligned} \end{equation*} |
and
\begin{equation*} \begin{aligned} g(x(t),t) = \begin{bmatrix} 0\\ -(b+e)x_2(t) \end{bmatrix}\,. \end{aligned} \end{equation*} |
Consider the initial state x_0 = (0.4, 0, 3)^T , where x(t) denotes the system's state vector and x_1(t) , x_2(t) are the state components of x(t) . Parameters a = 0.08 , b = 0.03 , c = 0.01 , d = 0.99 , and e = 0.03 . We select the Lyapunov function V(x) = x_1^2+x_2^2+0.1x_1x_2 . Then we define the aperiodically intermittent controller as follows:
\begin{equation} \begin{aligned} u(t) = \begin{bmatrix} 0\\ -x_1(t_{m,i})-x_2(t_{m,i}) \end{bmatrix}\,. \end{aligned} \end{equation} | (4.2) |
Then, from Assumptions 2.2 and 2.5, we can obtain
\begin{equation*} \begin{aligned} &|f(x(t),t)|^2 \leq x_2^2(t)+3d^2x_1^2(t)+3c^2x_1^2(t)+3a^2x_2^2(t);\\ &|g(x(t),t)|^2 \leq (b+e)^2x_2^2(t);\\ &|\alpha(q(x(t_{m,i})))-\alpha(x(t))|^2 \leq 2|-q(x_1(t_{m,i}))+x_1(t)|^2+2|-q(x_2(t_{m,i}))+x_2(t)|^2;\\ &\frac{\partial V(x,t)}{\partial x} \leq 2.1|x|\,. \end{aligned} \end{equation*} |
Hence, according to Assumptions 2.3 and 2.5, we choose the appropriate parameters L_1 = 1.8 , L_2 = 0.15 , L_3 = 1.42 , and L_4 = 2.1 . Then, from Assumption 2.4, \varphi_1 and \varphi_2 can be set as 0.5 and -2.8 . Next, we select the appropriate parameters on the basis of the results of Lemma 3.1 and Theorem 3.1: \delta = 0.01 , \epsilon = 0.01 , \lambda = 0.01 , and \Delta_1 = 0.14 . This makes it possible to calculate the roots of the equation \mu_1+\check{\beta}_1e^{\mu_1\Delta_1}+\hat{\beta}_1 = 0 in Theorem 3.1, selecting the appropriate \tilde{\mu}_1 . Assume the maximum control interval \omega = 2.5 and the minimum working interval \theta = 1.9 . From Definitions 2.1 and 2.2, let \varepsilon_1 = 0.51 and \varepsilon_2 = 0.55 . Substituting into Eq (3.13) in Theorem 3.1 yields
\begin{equation*} \begin{aligned} -1.6665\mathcal{N}(0,t)-\ln0.2723+\ln0.2861 \leq 0\,,\, \mathcal{N}(0,t) \geq 1. \end{aligned} \end{equation*} |
Further, by Definition 2.2, let \varrho = 0.07 and \tau = 1 , and use Formula (3.14) from Theorem 3.1
\begin{equation*} \begin{aligned} -1.6665\mathcal{N}(0,t)-\ln0.0009+\ln0.2861 \leq 0\,,\, \mathcal{N}(0,t) \geq 3. \end{aligned} \end{equation*} |
In summary, we can see that the system is not only FTS (w.r.t) (7.3, 0.51, 0.55) when t\in [0, 7.3] under the aperiodically intermittent ETM (3.1) with state quantization, but is also FTCS (w.r.t) (7.3, 0.51, 0.55, 0.07, 0.5) when t\in [6.8, 7.3] as shown in Figure 5. The state trajectory of the system, the ETM (3.1), the state quantization trajectory, and the intermittent controller are shown in Figures 6–9. As can be seen from Figures 5 and 6, the system (4.1) is not only FTCS but also has Lyapunov stability. Figure 6 shows the intermittent state quantization curve trajectory implemented on the basis of Figure 5. The ETM (3.1) is represented by Figure 7. The controller (4.2) is represented by Figure 8.
Similarly, we choose the maximum control interval \omega = 2.5 , the minimum working interval \theta = 1.6 , and the other parameters are the same as in Theorem 3.1, then we can find the solution to equation \mu_2+\check{\beta}_1e^{\mu_2\Delta_2}+\hat{\beta}_2 = 0 in Theorem 3.2, selecting the appropriate \tilde{\mu}_2 . Further we set \varepsilon_1 = 0.51 and \varepsilon_2 = 0.55 , replacing Eq (3.39) in Theorem 3.2 yields
\begin{equation*} \begin{aligned} -1.1381\mathcal{N}(0,t)-\ln0.2723+\ln0.2861 \leq 0\,,\, \mathcal{N}(0,t) \geq 1. \end{aligned} \end{equation*} |
Further by Definition 2.2, let \varrho = 0.09 and \tau = 1 , use formula (3.40) from Theorem 3.2
\begin{equation*} \begin{aligned} -1.1381\mathcal{N}(0,t)-\ln0.0109+\ln0.2861 \leq 0\,,\, \mathcal{N}(0,t) \geq 3. \end{aligned} \end{equation*} |
Therefore, it can be obtained that the system (4.1) is FTS (w.r.t) (7.3, 0.51, 0.55) when t\in [0, 7.3] under aperiodically intermittent ETM (3.2) with state quantization and is FTCS (w.r.t) (7.3, 0.51, 0.55, 0.09, 0.5) when t\in [6.8, 7.3] , as shown in Figure 10. Figures 11–14 represent the state quantization trajectory, the ETM (3.2), the intermittent controller, and the system state trajectory, respectively. Similarly, as shown in Figures 10 and 14, it can be seen that in Theorem 3.2, the system (4.1) is not only FTS but also has Lyapunov stability.
If we compare Figure 7 with Figure 12, it is clear that the number of ETM (3.1) communications is 118 and the number of ETM (3.2) communications is 100. Thus by decreasing \theta , the number of communications is reduced to some extent. According to Remark 3.2, due to the different schemes of the two ETMs, the first scheme is chosen if all the states of the system are to be quantized in a finite time, and the second scheme is chosen if the states of the system are to be quantized in a certain part of the system in a finite time, as shown in Figures 6 and 11. Since we use intermittent state quantization, if the first scheme is chosen, \theta can be increased appropriately to achieve better quantization. If the second scheme is chosen, \theta can be decreased appropriately as a way to reduce the work burden of the controller and achieve a local quantization effect.
Furthermore, in Example 1, the number of communications under different control methods and trigger mechanisms is investigated, as shown in Table 1, and it can be clearly seen that there is a significant reduction in the number of communications under the effect of APIC and ETMs. In addition, by adjusting the suspension time \epsilon and the triggering parameter \lambda , the number of communications can also be affected, as shown in Table 2.
Different trigger mechanisms | Theorem 3.1 | Theorem 3.2 | |
Continuous control | Time-triggered mechanism | 655 | 658 |
Event-triggered mechanism | 128 | 122 | |
Intermittent control | Time-triggered mechanism | 594 | 554 |
Event-triggered mechanism | 118 | 100 |
\epsilon | \lambda | Theorem 3.1 | Theorem 3.2 |
0.1 | 0.01 | 82 | 48 |
0.01 | 0.01 | 118 | 100 |
0.001 | 0.01 | 124 | 114 |
0.1 | 0.05 | 47 | 32 |
0.01 | 0.05 | 55 | 50 |
0.001 | 0.05 | 57 | 52 |
Example 2. To further verify the validity of the proposed theory, we consider the following stochastic nonlinear system whose parameters contain:
\begin{equation*} \begin{aligned} f(x(t),t) = \begin{bmatrix} 0.1sin(x_1(t))+0.1x_2(t)+0.2u(t)\\ 0.1x_1(t)-0.2x_2(t) \end{bmatrix} \end{aligned} \end{equation*} |
and
\begin{equation*} \begin{aligned} g(x(t),t) = \begin{bmatrix} 0.1x_1(t)\\ 0 \end{bmatrix}\,. \end{aligned} \end{equation*} |
Where t \geq 0 , consider the initial state x_0 = (0.5, -0, 5)^T and x(t) is defined as the state vector and x_1(t) , x_2(t) as the state components of x(t) . We select the Lyapunov function V(x) = 0.1x_1^2+0.1x_2^2 . Then we define the aperiodically intermittent controller as follows:
\begin{equation} \begin{aligned} u(t) = \begin{bmatrix} -2x_1(t)\\ 0 \end{bmatrix}\,. \end{aligned} \end{equation} | (4.3) |
Similarly, according to Assumptions 2.3 and 2.5, we choose the appropriate parameters L_1 = 0.6 , L_2 = 0.11 , L_3 = 2.1 , and L_4 = 0.21 . Then, from Assumption 2.4, \varphi_1 , \varphi_2 can be set as 0.5 and -3.4 . We select the appropriate parameters according to the results of Lemma 3.1 and Theorem 3.1, \delta = 0.01 , \epsilon = 0.01 , \lambda = 0.01 , and \Delta_1 = 0.45 . Similar to Example 1, we can also calculate the roots of equation \mu_1+\check{\beta}_1e^{\mu_1\Delta_1}+\hat{\beta}_1 = 0 according to the above parameters. Assume the maximum control interval \omega = 2.5 and the minimum working interval \theta = 2 . From Definitions 2.1 and 2.2, let \varepsilon_1 = 0.75 and \varepsilon_2 = 0.8 , then substituting into Eq (3.13) in Theorem 3.1 yields
\begin{equation*} \begin{aligned} -1.5412\mathcal{N}(0,t)-\ln0.0576+\ln0.0619 \leq 0\,,\, \mathcal{N}(0,t) \geq 1. \end{aligned} \end{equation*} |
Furthermore, by Definition 2.2, let \varrho = 0.083 and \tau = 0.7 , use formula (3.14) from Theorem 3.1
\begin{equation*} \begin{aligned} -1.5412\mathcal{N}(0,t)-\ln0.0007+\ln0.2861 \leq 0\,,\, \mathcal{N}(0,t) \geq 3. \end{aligned} \end{equation*} |
In summary, we can see that the system is not only FTS (w.r.t) (8.5, 0.75, 0.8) when t\in [0, 8.5] under the aperiodically intermittent ETM (3.1) with state quantization, but also FTCS (w.r.t) (8.5, 0.75, 0.8, 0.083, 0.7) when t\in [7.8, 8.5] , as shown in Figure 15. The state trajectory of the system, the ETM (3.1), the state quantization trajectory, and the intermittent controller are shown in Figures 16–19. As can be seen from Figures 15 and 19, the system (4.1) is not only FTCS but also has Lyapunov stability. Figure 16 shows the intermittent state quantization curve trajectory implemented on the basis of Figure 15. The ETM (3.1) is represented by Figure 17. The controller (4.2) is represented by Figure 18.
Similarly, choose the maximum control interval \omega = 2.5 and the minimum working interval \theta = 1.8 , and the other parameters are the same as in Theorem 3.1. Furthermore, we set \varepsilon_1 = 0.75 and \varepsilon_2 = 0.8 , and then replacing Eq (3.39) in Theorem 3.2 yields
\begin{equation*} \begin{aligned} -1.1658\mathcal{N}(0,t)-\ln0.0576+\ln0.2861 \leq 0\,,\, \mathcal{N}(0,t) \geq 1. \end{aligned} \end{equation*} |
Furthermore, by Definition 2.2, let \varrho = 0.15 and \tau = 0.8 , and use formula (3.40) from Theorem 3.2
\begin{equation*} \begin{aligned} -1.1381\mathcal{N}(0,t)-\ln0.0109+\ln0.2861 \leq 0\,,\, \mathcal{N}(0,t) \geq 3. \end{aligned} \end{equation*} |
Therefore, it can be seen that the system (4.1) is FTS (w.r.t) (7.8, 0.75, 0.8) when t\in [0, 7.8] under aperiodically intermittent ETM (3.2) with state quantization and is FTCS (w.r.t) (7.8, 0.75, 0.8, 0.15, 0.8) when t\in [7.0, 7.8] as shown in Figure 20. Figures 21–24 represent the state quantization trajectory, the ETM (3.2), the intermittent controller, and the system state trajectory, respectively. Similarly, as shown in Figures 10 and 14, it can be seen that in Theorem 3.2, the system (4.1) is not only FTS but also has Lyapunov stability. Comparing Figure 7 with Figure 12, it is clear that the number of ETM (3.1) communications is 33 and the number of ETM (3.2) communications is 50. If we set the controller to u(t) = 0 , the system is unstable, as shown in Figure 25.
This study uses ETC and APIC to investigate the FTS of stochastic nonlinear systems. First, the Zeno behavior is avoided by designing the hover time in ETM. After that, the state quantization strategy is introduced to implement the two triggering schemes, and quantization error estimation and sampling error estimation are used to further implement the FTS and the FTCS. The viability and efficacy of the theoretical results of state quantization and APIC are confirmed in two numerical examples, as are the feasibility and validity of the two ETMs that have been proposed. Finally, different triggering schemes can be selected by adjusting the size of the working interval to achieve different effects within a finite time, which further saves resources. However, since the logarithmic quantizer in Assumption 2.1 of this paper becomes more error-prone as the quantization level increases, exploring alternative quantization methods, such as dynamic quantization, could be a promising direction for future research. In addition, Assumptions 2.3 and 2.5 are more applicable to cases without time delay; therefore, these assumptions may no longer hold when studying a stochastic nonlinear time delay system. However, a similar approach is provided in [14]. Future research work on stochastic nonlinear systems containing delays with dynamic ETC is also needed.
Biwen Li: Supervision, writing–review and editing; Guangyu Wang: Writing–original draft. Both authors have read and approved the final version of the manuscript for publication.
The authors declare that they have not used artificial intelligence (AI) tools in the creation of this paper.
The authors would like to thank the editors and referees for their very helpful comments and suggestions.
The authors declare no conflicts of interest.
Parameters | |
t_{m, i} | Event-triggered sampling instants, where 0\leq i\leq \lceil \frac{s_m}{\epsilon} \rceil , \lceil \frac{s_m}{\epsilon} \rceil is the maximum number of communications on the interval [t_m, t_m+s_m) |
t_m | Starting point of the workspace |
s_m | Length of the working interval |
\theta | Minimum working interval length |
\omega | Maximum control interval length |
q(v) | System state quantization |
\delta | Constant related to the quantization density \rho and |
L_i | Positive constants in Assumptions 2.3 and 2.5 (i = 1, 2, 3, 4) |
\varepsilon_1 | Upper bound on the initial state of the system |
\varepsilon_2 | An upper bound on the state E|x(t)| of the system in finite time T |
\varrho | During the time interval [T-\tau, T] , the state E|x(t)| of the system does not exceed \varrho |
\epsilon | Suspension time, indicating that the next trigger moment is executed after at least \epsilon |
\lambda | Event-trigger related parameters for adjusting the trigger thresholds |
\kappa_i | The coefficients in Lemmas 3.1 and 3.2, consisting of \delta , \epsilon , \lambda , L_1 , L_2 , and L_3 |
\mathcal{N}(0, t) | Number of control intervals on interval (0, T] |
\hat{\beta_i} , \check{\beta_i} | The correlation coefficients in Theorems 3.1 and 3.2, consisting of L_1 , L_2 , L_3 , L_4 , \epsilon , c_1 , \varphi_2 , \kappa_1 , and \kappa_2 , where \varphi_1 , \varphi_2 and c_1 , c_2 are given by Assumption 2.4 (i = 1, 2) |
\Delta_i | Upper bound on the execution time between events in Theorems 3.1 and 3.2 (i = 1, 2) |
[1] | L. Zadeh, Fuzzy sets, Inf. Control, 8 (1965), 338–353. https://doi.org/10.1016/S0019-9958(65)90241-X |
[2] | K. Atanassov, Intuitionistic Fuzzy Sets, Heidelberg: Physica, 1999. https://doi.org/10.1007/978-3-7908-1870-3_1 |
[3] |
K. Atanassov, New operations defined over the intuitionistic fuzzy sets, Fuzzy Set. Syst., 61 (1994), 137–142. https://doi.org/10.1016/0165-0114(94)90229-1 doi: 10.1016/0165-0114(94)90229-1
![]() |
[4] |
E. Szmidt, J. Kacprzyk, Distances between intuitionistic fuzzy sets, Fuzzy Set. Syst., 114 (2000), 505–518. https://doi.org/10.1016/S0165-0114(98)00244-9 doi: 10.1016/S0165-0114(98)00244-9
![]() |
[5] |
Z. Liang, P. Shi, Similarity measures on intuitionistic fuzzy sets, Pattern Recogn. Lett., 24 (2003), 2687–2693. https://doi.org/10.1016/S0167-8655(03)00111-9 doi: 10.1016/S0167-8655(03)00111-9
![]() |
[6] |
W. Du, Subtraction and division operations on intuitionistic fuzzy sets derived from the Hamming distance, Inf. Sci., 571 (2021), 206–224. https://doi.org/10.1016/j.ins.2021.04.068 doi: 10.1016/j.ins.2021.04.068
![]() |
[7] |
J. Mahanta, S. Panda, A novel distance measure for intuitionistic fuzzy sets with diverse applications, Int. J. Intell. Syst., 36 (2021), 615–627. https://doi.org/10.1002/int.22312 doi: 10.1002/int.22312
![]() |
[8] |
F. Xiao, A distance measure for intuitionistic fuzzy sets and its application to pattern classification problems, IEEE T. Syst. Man Cy.-S., 51 (2019), 3980–3992. https://doi.org/10.1109/TSMC.2019.2958635 doi: 10.1109/TSMC.2019.2958635
![]() |
[9] |
V. Khatibi, G. A. Montazer, Intuitionistic fuzzy set vs. fuzzy set application in medical pattern recognition, Artif. Intell. Med., 47 (2009), 43–52. https://doi.org/10.1016/j.artmed.2009.03.002 doi: 10.1016/j.artmed.2009.03.002
![]() |
[10] |
B. Gohain, R. Chutia, P. Dutta, Distance measure on intuitionistic fuzzy sets and its application in decision‐making, pattern recognition, and clustering problems, Int. J. Intell. Syst., 37 (2022), 2458–2501. https://doi.org/10.1002/int.22780 doi: 10.1002/int.22780
![]() |
[11] |
W. Zeng, H. Cui, Y. Liu, Q. Yin, Z. S. Xu, Novel distance measure between intuitionistic fuzzy sets and its application in pattern recognition, Iran. J. Fuzzy Syst., 19 (2022), 127–137. https://doi.org/10.22111/ijfs.2022.6947 doi: 10.22111/ijfs.2022.6947
![]() |
[12] |
Z. Xu, Some similarity measures of intuitionistic fuzzy sets and their applications to multiple attribute decision making, Fuzzy Optim. Decis. Ma., 6 (2007), 109–121. https://doi.org/10.1007/s10700-007-9004-z doi: 10.1007/s10700-007-9004-z
![]() |
[13] |
J. Gao, F. Guo, Z. Ma, X. Huang, Multi-criteria decision-making framework for large-scale rooftop photovoltaic project site selection based on intuitionistic fuzzy sets, Appl. Soft Comput., 102 (2021), 107098. https://doi.org/10.1016/j.asoc.2021.107098 doi: 10.1016/j.asoc.2021.107098
![]() |
[14] |
S. Liu, J. Zhang, B. Niu, L. Liu, X. He, A novel hybrid multi-criteria group decision-making approach with intuitionistic fuzzy sets to design reverse supply chains for COVID-19 medical waste recycling channels, Comput. Ind. Eng., 169 (2022), 108228. https://doi.org/10.1016/j.cie.2022.108228 doi: 10.1016/j.cie.2022.108228
![]() |
[15] |
W. Wang, J. Zhan, J. Mi, A three-way decision approach with probabilistic dominance relations under intuitionistic fuzzy information, Inf. Sci., 582 (2022), 114–145. https://doi.org/10.1016/j.ins.2021.09.018 doi: 10.1016/j.ins.2021.09.018
![]() |
[16] |
K. Atanassov, G. Gargov, Interval valued intuitionistic fuzzy sets, Fuzzy Set. Syst., 31 (1989), 343–349. https://doi.org/10.1016/0165-0114(89)90205-4 doi: 10.1016/0165-0114(89)90205-4
![]() |
[17] |
K. Atanassov, Circular intuitionistic fuzzy sets, J. Intell. Fuzzy Syst., 39 (2020), 5981–5986. https://doi.org/10.3233/JIFS-189072 doi: 10.3233/JIFS-189072
![]() |
[18] |
C. Kahraman, N. Alkan, Circular intuitionistic fuzzy TOPSIS method with vague membership functions: Supplier selection application context, Notes Intuitionistic Fuzzy Set., 27 (2021), 24–52. http://dx.doi.org/10.7546/nifs.2021.27.1.24-52 doi: 10.7546/nifs.2021.27.1.24-52
![]() |
[19] |
C. Kahraman, I. Otay, Extension of VIKOR method using circular intuitionistic fuzzy sets, Int. Conf. Intell. Fuzzy Syst., 308 (2021), 48–57. https://doi.org/10.1007/978-3-030-85577-2_6 doi: 10.1007/978-3-030-85577-2_6
![]() |
[20] |
O. İrem, C. Kahraman, A novel circular intuitionistic fuzzy AHP & VIKOR methodology: An application to a multi-expert supplier evaluation problem, Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, 28 (2022), 194–207. http://doi.org/10.5505/pajes.2021.90023 doi: 10.5505/pajes.2021.90023
![]() |
[21] |
T. Chen, A circular intuitionistic fuzzy evaluation method based on distances from the average solution to support multiple criteria intelligent decisions involving uncertainty, Eng. Appl. Artif. Intell., 117 (2023), 105499. https://doi.org/10.1016/j.engappai.2022.105499 doi: 10.1016/j.engappai.2022.105499
![]() |
[22] |
E. Çakır, M. A. Taş, Circular Intuitionistic Fuzzy Analytic Hierarchy Process for Remote Working Assessment in Covid-19, Int. Conf. Intell. Fuzzy Syst., 504 (2022), 589–597. https://doi.org/10.1007/978-3-031-09173-5_68 doi: 10.1007/978-3-031-09173-5_68
![]() |
[23] |
S. Chen, J. Tan, Handling multicriteria fuzzy decision-making problems based on vague set theory, Fuzzy Set. Syst., 67 (1994), 163–172. https://doi.org/10.1016/0165-0114(94)90084-1 doi: 10.1016/0165-0114(94)90084-1
![]() |
[24] |
D. Hong, C. choi, Multicriteria fuzzy decision-making problems based on vague set theory, Fuzzy Set. Syst., 114 (2000), 103–113. https://doi.org/10.1016/S0165-0114(98)00271-1 doi: 10.1016/S0165-0114(98)00271-1
![]() |
[25] | E. Çakır, M. A. Taş, Z. Ulukan, Circular Intuitionistic Fuzzy Sets in Multi Criteria Decision Making, 11th International Conference on Theory and Application of Soft Computing, Computing with Words and Perceptions and Artificial Intelligence - ICSCCW-2021, 2022. https://doi.org/10.1007/978-3-030-92127-9_9 |
[26] |
K. Atanassov, E. Marinov, Four distances for circular intuitionistic fuzzy sets, Mathematics, 9 (2021), 1121. https://doi.org/10.3390/math9101121 doi: 10.3390/math9101121
![]() |
[27] |
N. Alkan, C. Kahraman, Circular intuitionistic fuzzy topsis method: Pandemic hospital location selection, J. Intell. Fuzzy Syst., 42 (2022), 295–316. https://doi.org/10.3233/JIFS-219193 doi: 10.3233/JIFS-219193
![]() |
[28] |
Y. Yang, F. Chiclana, Consistency of 2D and 3D distances of intuitionistic fuzzy sets, Expert Syst. Appl., 39 (2012), 8665–8670. https://doi.org/10.1016/j.eswa.2012.01.199 doi: 10.1016/j.eswa.2012.01.199
![]() |
[29] |
C. Xu, J. Shen, A new intuitionistic fuzzy set distance and its application in decision-making, Comput. Appl. Res., 37 (2020), 3627–3634. https://doi.org/10.19734/j.issn.1001-3695.2019.09.0545 doi: 10.19734/j.issn.1001-3695.2019.09.0545
![]() |
[30] |
X. Peng, New similarity measure and distance measure for Pythagorean fuzzy set, Complex Intell. Syst., 5 (2019), 101–111. https://doi.org/10.1007/s40747-018-0084-x doi: 10.1007/s40747-018-0084-x
![]() |
[31] |
X. Peng, H. Garg, Multiparametric similarity measures on Pythagorean fuzzy sets with applications to pattern recognition, Appl. Intell., 49 (2019), 4058–4096. https://doi.org/10.1007/s10489-019-01445-0 doi: 10.1007/s10489-019-01445-0
![]() |
[32] |
Y. Li, D. Olson, Z. Qin, Similarity measures between intuitionistic fuzzy (vague) sets: A comparative analysis, Pattern Recogn. Lett., 28 (2007), 278–285. https://doi.org/10.1016/j.patrec.2006.07.009 doi: 10.1016/j.patrec.2006.07.009
![]() |
[33] |
F. E. Boran, S. Genç, M. Kurt, D. Akay, A multi-criteria intuitionistic fuzzy group decision making for supplier selection with TOPSIS method, Expert Syst. Appl., 36 (2009), 11363–11368. https://doi.org/10.1016/j.eswa.2009.03.039 doi: 10.1016/j.eswa.2009.03.039
![]() |
[34] | M. J. Khan, W. Kumam, N. A. Alreshidi, Divergence measures for circular intuitionistic fuzzy sets and their applications. Eng. Appl. Artif. Intell., 116 (2022), 105455. https://doi.org/10.1016/j.engappai.2022.105455 |
[35] |
M. Akram, W. A. Dudek, F. Ilyas, Group decision-making based on pythagorean fuzzy TOPSIS method, Int. J. Intell. Syst., 34 (2019), 1455–1475. https://doi.org/10.1002/int.22103 doi: 10.1002/int.22103
![]() |
Different trigger mechanisms | Theorem 3.1 | Theorem 3.2 | |
Continuous control | Time-triggered mechanism | 655 | 658 |
Event-triggered mechanism | 128 | 122 | |
Intermittent control | Time-triggered mechanism | 594 | 554 |
Event-triggered mechanism | 118 | 100 |
\epsilon | \lambda | Theorem 3.1 | Theorem 3.2 |
0.1 | 0.01 | 82 | 48 |
0.01 | 0.01 | 118 | 100 |
0.001 | 0.01 | 124 | 114 |
0.1 | 0.05 | 47 | 32 |
0.01 | 0.05 | 55 | 50 |
0.001 | 0.05 | 57 | 52 |
Different trigger mechanisms | Theorem 3.1 | Theorem 3.2 | |
Continuous control | Time-triggered mechanism | 655 | 658 |
Event-triggered mechanism | 128 | 122 | |
Intermittent control | Time-triggered mechanism | 594 | 554 |
Event-triggered mechanism | 118 | 100 |
\epsilon | \lambda | Theorem 3.1 | Theorem 3.2 |
0.1 | 0.01 | 82 | 48 |
0.01 | 0.01 | 118 | 100 |
0.001 | 0.01 | 124 | 114 |
0.1 | 0.05 | 47 | 32 |
0.01 | 0.05 | 55 | 50 |
0.001 | 0.05 | 57 | 52 |