1. Introduction
In recent years, the research on incremental stability [
1,
2,
3] is increasing due to its wide range of potential applications, e.g., analysis of missile performance [
2], constructions of the attraction region [
4] and symbolic models [
5,
6], reconstructing the control for piecewise affine systems [
7], synchronization [
8,
9,
10], and anti-windup control [
11], etc. The incremental stability focuses on the convergence of all trajectories with respect to each other [
1,
2], which is different from Lyapunov stability, where the attraction of all trajectories is only for the trivial solution. In the literature, incremental stability has been investigated for nonlinear systems. An incremental norm approach was proposed in [
1,
2]. By using Lyapunov dissipation inequalities, the incremental input-to-state stability was characterized in [
3]. The incremental stabilization and harmonic regulation have been designed in [
12] for cascade systems. The comparisons with necessary and sufficient characterizations of convergence and incremental stability have been given in [
13]. A piecewise-affine approximation method for incremental stability was proposed in [
14]. For incremental exponential stability, the contraction approach was proposed in [
15,
16]. Additionally, by using virtual displacements, the equivalence of the exponential incremental stability and the contraction was derived in [
17,
18] for systems, where it requires the vector field to be continuously differentiable. The incremental stability was also extended to systems with complex vector fields, e.g., the piecewise smooth systems [
19], hybrid systems [
20], oscillators coupling impulses [
21], periodic systems with single or multiple periodic impulses [
22,
23], impulsive controlled systems [
24], and virtually positive systems [
25]. However, the analysis on incremental stability for nonlinear systems with non-smooth and hybrid dynamics remains relatively undeveloped. Additionally, the reported results on incremental stability are mainly concerned with the long-term dynamical behavior of the trajectories, i.e., on infinite time scales. In many practical systems, it is infeasible to achieve stability in infinite time. There are fewer results on finite-time incremental stability (FTIS) in the literature, although the finite-time contractive stability was reported very recently in [
26,
27,
28]. However, the finite-time contractive stability in [
26,
27,
28] focuses solely on finite-time boundedness within a finite time interval, offering no guarantee that this boundedness will persist beyond that finite period. Moreover, fewer studies are devoted to designing controls that enable systems to achieve FTIS. There is a growing need to develop design methods rendering control systems finite-time incrementally stable.
It has been noted that the finite-time stability (FTS) and FTS-based stabilization have been studied for nonlinear systems, e.g., see [
29,
30,
31,
32,
33,
34,
35] and references therein. More recently, FTS and FTS-based control for impulsive systems have also been reported, e.g., see [
36,
37,
38,
39,
40,
41,
42] and references therein. However, it is noted that FTS is usually defined as a Lyapunov asymptotic stability with
finite-time convergence to the equilibrium point [
43,
44,
45,
46]. Clearly, complete convergence to an equilibrium point within a finite time may be unrealistic although “finite time” is meaningful for many practical systems. Taking the power system as an example, it is not necessary and may not be feasible for its voltage, frequency and other states to converge completely to the equilibrium point within a finite time.
Motivated by the above observations on incremental stability and related FTS and FTS-based control, this paper studies finite-time practical incremental stability (FTPIS) for impulsive systems with application to FTPIS-based impulsive control design. Regarding “finite-time incremental stability” (FTIS), theoretically, from Lyapunov’s stability theory and the uniqueness of solutions to ordinary differential equations, it can be seen that the main problem of FTIS is that the difference between two adjacent trajectories cannot converge to the equilibrium point within any finite time. In order to solve this problem, “finite time converging to target region” is used to replace “finite time converging to the equilibrium point”. Thus, the practical FTIS, namely, FTPIS, is proposed to replace FTIS. Then, by using the methods of Lyapunov-like function and dwell-time [
47], the criteria of finite-time practical stability (FTPS) is obtained for the error system of two adjacent trajectories and thus FTPIS criteria are derived for the impulsive system. Additionally, the FTPIS settling time estimates are also derived. The results are subsequently applied to the design of FTPIS-based impulsive control. Three types of impulsive control, including time-triggered impulsive control (T-IC), time-state-triggered impulsive control (TS-IC), and state-triggered impulsive control (S-IC), are designed, respectively. It is shown that FTPIS can be achieved by the designed T-IC, TS-IC, and S-IC. Additionally, with respect to settling time, number of impulsive control for reaching the settling time, and impulse frequency [
48], the theoretical comparison is given among T-IC, TS-IC, and S-IC. Finally, two examples, with one being the problem of finite-time practical tracking (FTPT) via hybrid impulsive control, are given in order to verify the validity of the theoretical results.
The contributions of this paper include (i) the notions of FTPIS including FTPS are proposed, which improves upon the concept of finite-time contractive stability in the literature (e.g., [
26,
27,
28]), which only guaranteed the boundedness within a finite time; (ii) the FTPIS criteria with the settling time estimates are obtained for impulsive systems, which improves upon existing results regarding incremental stability (e.g., [
24,
49]) that primarily focus on infinite time scales and in the sense of Lyapunov asymptotic stability; (iii) three types of impulsive control (T-IC, S-IC, and TS-IC) are designed, and it is proven that TS-IC has more advantages than T-IC and S-IC with the shortest settling time, the least number of impulsive control required to reach the settling time, and almost the lowest impulse frequency; and (iv) the designed TS-IC improves the mechanism of impulsive control in the literature, which is either time-triggered or state-triggered (e.g., [
49,
50,
51,
52,
53,
54]).
The organisation of the paper is as follows. In
Section 2, we provide some preliminaries. In
Section 3, FTPIS criteria with the estimates of settling time are established for impulsive systems. In
Section 4, three types of impulsive control, including T-IC, S-IC, and TS-IC, are designed, respectively, for FTPIS, and the theoretical comparison is given among T-IC, TS-IC, and S-IC. One example with three cases and simulations are presented in
Section 5. Additionally, in
Section 6, it concludes the paper.
2. Preliminaries and Notions of FTPIS
Let be the set of nonnegative real numbers, the n-dimensional space of real vectors, and the set of nonnegative integers, i.e., . () denotes the maximal (minimal) eigenvalue of matrix . For , denotes the minimum integer not less than a. A function is of class- () if it is continuous and strictly increasing and . It is of class- if it is of class- and unbounded.
Consider an impulsive system with the form:
where
;
is a continuous function satisfying
,
;
,
is the impulsive gain function and satisfies
,
, and
is the impulsive time sequence satisfying
For any initial condition , assume the solution to (1) exists uniquely for all . Denote as the solution of (1) with .
Definition 1. For a given boundedness , the system (1) is said to be finite-time practical incremental stable (FTPIS) w.r.t. if , there exists a time such that, for all , The infimum of such is called the settling time of FTPIS. Noting that the settling time is dependent on the , , and the sequence , we use to denote the settling time of FTPIS w.r.t. .
Based on Definition 1, for FTPIS of (1), set two systems as:
where
, and
,
for arbitrary initial states
and
.
Let
be the error of
and
. Additionally,
, define functions
and
. The error system is
Definition 2. For a given bound , the system (6) is said to be finite-time practical stable (FTPS) w.r.t. if for all , there exists some such that for all Similar to Definition 1, we use to denote the infimum of such and call it settling time of FTPS w.r.t. .
Remark 1. (i) By Definition 1, FTPIS is a weaker stability than Lyapunov asymptotic stability and FTS. In FTPIS, it relaxes the requirement of Lyapunov asymptotic stability for convergence to the equilibrium point and further relaxes the requirement of FTS for reaching the equilibrium point within a finite time. It only requires that solutions starting from different initial states enter a given bounded region in a finite time. So FTPIS is a practical stability concept for dynamical systems that do not necessarily require strong stability.
(ii) The bounded region in Definitions 1 and 2 can be changed to a bounded closed set . Thus, FTPIS and FTPS can be defined w.r.t. Ω.
(iii) The concepts FTPIS and FTPS in Definitions 1 and 2 are global. If we constrain all the initial states for some with , then, FTPIS and FTPS are local.
(iv) It should also be noted that the finite-time contractive stability (FTCS) was defined in the literature (e.g., [26,27]). From Definitions 5 and 6 for FTCS of [26], FTCS focuses only on finite-time boundedness within a finite time interval and no guarantee is offered that this boundedness will persist beyond that finite period. While in FTPIS, by Definition 1, the boundedness can be guaranteed after the settling time. Moreover, compared with existing concepts of incremental stability (e.g., [24,49]), FTPIS, as defined in Definitions 1 and 2, relaxes the requirement for the asymptotic stability of the error system with . Clearly, from Definitions 1 and 2, the following result can be derived.
Proposition 1. For a given bound , the system (1) is FTPIS w.r.t. , with settling time is equivalent to the error system (6) is FTPS with settling time .
Definition 3 ([
48,
54])
. Let be the number of impulses of (1) during . The impulse frequency (I.F.) of (1) during is defined by . 3. Practical Finite-Time Incremental Stability
In this section, we establish the criteria of FTPIS for the impulsive system (1).
For the impulse time sequence , denote for all .
Theorem 1. For a given bound and the systems (4) and (5), suppose there exists a Lyapunov-like function satisfying: for , constants , , , function , and , Then, the following statements are true.
(i) If and , then the system (1) is FTPIS w.r.t. and the settling time satisfies , where .
(ii) If , then the system (1) is FTPIS w.r.t. and the settling time satisfies , where .
Proof. Let
for all
. Note that
and
. It follows from the conditions in (8) that
Let
. Consider a non-negative comparison system, such as the following:
Solving (10), we determine that
which yields that
where
and
.
Case-(i): Suppose . In this case, by (8), we have .
Notting
, by (12) and (8), we have for
,
Thus, by (11) and (13), we have
From
and (15), we determine that for
,
It follows from (15) and (16) and
for all
that
By using the Mathematical Induction, we determine for all
with
,
By (18) and (14), we have
By the comparison principle of impulsive systems [
55] and (19), we obtain
which means that
for all
. Hence, the error system (6) is FTPS w.r.t.
with the settling time
. Therefore, the impulsive system (1) is FTPIS with the settling time
.
Case-(ii): Suppose
. It follows from
and
and (11) and (12) and
that
It follows from (21) and (22) and
that
Thus, for all
, it follows from (23) and
that
It follows from (22)–(24) that
Now, we show that for all
with
,
By (25), the inequality (26) holds for
. For
, by (8) and (25), we obtain
It follows from (26)–(28) that the inequality (26) holds for
. Repeating the process for
and
, we determine that the inequality (26) holds for all
. Thus, by (26) and (21) and (22), we have
By using the same proof of (20) in Case-(i), we determine that the system (1) is FTPIS w.r.t. with the settling time . □
Corollary 1. For a given bound and the systems (4) and (5), suppose there exists a Lyapunov-like function satisfying: , some constants , , , , , , and , Then, the statements of (i)–(ii) of Theorem 1 holds for , , and , and being replaced by in the settling time estimate.
Proof. Let
for all
. By (30), we determine that
Noting that
if
and
if
, we obtain
. It follows from (31) that
Hence, the conditions in (8) of Theorem 1 are satisfied. Thus, the results follow from Theorem 1 with being replaced by in the settling time estimate. □
Remark 2. In Theorem 1 and Corollary 1, if , then FTPIS of the system (1) is driven by its jump subsystem while its flow subsystem may be non-FTPIS. On the contrary, if , then FTPIS of the system (1) is driven by its flow subsystem while its jump subsystem may be non-FTPIS.
Theorem 2. For a bound and systems (4) and (5), assume there exists a Lyapunov-like function satisfying: for some , and constants α, , , and , Then, the following statements are true.
(i) If and , then the system (1) is FTPIS w.r.t. with the settling time , where .
(ii) If , then the system (1) is FTPIS w.r.t. with the settling time , where .
Proof. Let
for all
. Noting that
and
, by (33), we obtain
Let
and let
satisfy
. Consider a non-negative comparison system as:
By solving (35), we determine that
Noting from (34), if there is some such that , then holds for all . Thus, holds for all . Additionally, the results in (i)–(ii) hold. Hence, in the following, suppose for all .
Let
for all
. It follows from (35) and (36) and (33) that for all
,
(i) Suppose
and
. By (38), for
, we obtain
Note that, from (34), for some
k,
implies
. Thus, by (39), we determine that
It follows from
and (40) and (37) that
By the comparison principle of impulsive systems (see [
55]) and (33), we obtain
which means that
for all
. Hence, the error system (6) is FTPS w.r.t.
with the settling time
. Therefore, the system (1) is FTPIS w.r.t.
with the settling time
.
(ii) Suppose
. By (38), for
, we obtain
Note that from (34), for some
,
implies
. Thus, by (43), we determine that
It follows from
and (44) and (37) that
By the comparison principle of impulsive systems (see [
55]) and (45), we obtain
which means that
Hence, the error system (6) is FTPS w.r.t. with the settling time . Therefore, the system (1) is FTPIS w.r.t. with . □
Remark 3. There are two aspects to be noted. One is that the FTPIS criteria in Theorems 1 and 2 and Corollary 1 are the extensions of finite-time stability results reported for impulsive systems in the literature, e.g., [38,39,40,43,44,45,46]. In (8), (30) and (33), if , then the conditions in Theorems 1 and 2 and Corollary 1 are degenerated to those of FTS (e.g., [40,46]). The other one is that, from the condition for all in Theorems 1 and 2 and Corollary 1, one can see that these FTPIS conditions for impulsive systems are not only weaker than those for FTS (e.g., [38,39,40,43,44,45,46]), but also weaker than incremental stability (e.g., [20,21,22,24]) and weaker than Lyapunov asymptotic stability (e.g., [48,51,55]), which is exactly what is needed for practical stability. 4. FTPIS-Based Impulsive Control Design
In this section, we design three types of impulsive control, including time-triggered impulsive control (T-IC), time-state-triggered impulsive control (TS-IC), and state-triggered impulsive control (S-IC), respectively, for the stabilization to FTPIS of affine-type unstable systems. Additionally, the theoretical comparison are given among T-IC, TS-IC, and S-IC.
Consider an affine-type unstable dynamical system as:
where
,
is a known unstable matrix,
is a nonlinear function, and
u is the impulsive control with form of
where
is a control gain matrix,
is the sequence of impulse instants, and the function
is defined as
and
for
.
Under the impulsive control (48), the system (47) becomes
For the FTPIS w.r.t. a bound
of (49), choose two arbitrary initial states
and
, and let
be the error of solutions
and
. Then, the error system is
Assumption 1. Assume there exists some , satisfing , , and some positive definite matrix , satisfying Remark 4. (i) In Assumption 1, the time-varying Lipschitz condition (51) with function means that it may be suitable for a wider class of systems.
(ii) The inequality (52) is a LMI-like condition, which is solvable even for an unstable matrix A. Since is integrable and thus bounded and specifically, for some constant , we may choose P to be the identity matrix I and set .
Now, for FTPIS w.r.t. of (47), design time-triggered impulsive control (T-IC), state-triggered impulsive control (S-IC), and time-state-triggered impulsive control (TS-IC), respectively.
Time-triggered Impulsive Control (T-IC): Let Lyapunov-like function satisfy Assumption 1 for some positive definite matrix P. The impulsive control (48) is set to satisfy the T-IC algorithm: for some constants γ and d with , Let be the minimum number of impulses required for T-IC to achieve the settling time.
Theorem 3. Let Assumption 1 be satisfied. Then, the error system (50) is FTPS w.r.t. a bound and the system (47) can achieve FTPIS w.r.t. by T-IC satisfying (53) and the settling time satisfies .
Proof. From (50) and T-IC (53), we obtain, for
,
Additionally, for all
, by (53), we have
Note that . From (54) and (55), the conditions for Theorem 1 (i) are satisfied. Hence, by Theorem 1 (i), the error system (50) is FTPS w.r.t. and the system (47) achieves FTPIS w.r.t. by T-IC satisfying (53) with settling time .
Moreover, noting that (47) is unstable, we determine that is the first time when the error state enters and remains in the region . Hence, and . □
Remark 5. (i) The parameter d in Theorem 3 can be set as Thus, can be set to satisfy: for some small , (ii) Note that all chaotic systems, e.g., Lorenz system and Chua’s circuit, have the form of (47) and satisfy Assumption 1. By Theorem 3, all chaotic systems can achieve FTPIS w.r.t. a bound under the designed T-IC satisfying (53), even though all chaotic systems themselves are non-stable and non-synchronous.
(iii) It should be noted that the T-IC algorithm (53) is based on the incremental stability conditions in Theorem 1 (i), which is sufficient and not necessary. Thus, there may exist conservativeness for T-IC algorithm (53). For example, the number of impulses in T-IC may be too high and the impulse frequency (I.F.) of T-IC may be too high, and .
Time-State-triggered Impulsive Control (TS-IC): Let Assumption 1 hold and . For the system (47) and a bound , the impulsive control (48) is set to satisfy the TS-IC algorithm: for some constants γ and d with , Theorem 4. Let Assumption 1 hold. Then, the following statements are true:
(i) is the minimum number of impulses required for TS-IC to achieve the settling time.
(ii) TS-IC satisfying (56) is non-Zeno and the system (47) achieves FTPIS w.r.t. by TS-IC satisfying (56) with settling time .
Proof. (i) From the definition of , it yields that is the minimum number of impulses required for TS-IC to achieve the settling time.
(ii) Note that
. By the definition of
in (56), we have
. Thus, we determine that
By TS-IC algorithm (56) and the continuity of
at
, we obtain, for all
,
It follows from (56) and (58) that
Repeating the process of (58) and (59), we determine that holds for all . Hence, . Therefore, the error system (50) is FTPS w.r.t. by the TS-IC satisfying (56) with the settling time .
From (i), and knowing that the system (47) is unstable, we determine that, under TS-IC (56), is the first time when the error state enters and remains in the region . Hence, .
Moreover, for
, from the event-triggering condition in (56) and by the continuity of
at
, we have
. From Assumption 1, we determine that for
,
From (60), it follows that
For , noting that from TS-IC algorithm (56), we have holds for all . It yields that holds for all . Hence, the TS-IC satisfying (56) is non-Zeno. □
Remark 6. From TS-IC algorithm (56), one can see that is the time when the error state first enters and remains in the region . Additionally, before , the impulsive control is trigged by the time as in T-IC, while after , the impulsive control is triggered by the state. Additionally, the TS-IC is executed only when reaches the boundary of the region. Hence, compared with T-IC, the number of impulses and the impulse frequency (I.F.) in TS-IC all may be lower.
State-triggered Impulsive Control (S-IC): Let and Assumption 1 hold. For the system (47) and a bound , the impulsive control (48) is set to satisfy the S-IC algorithm: for some constants γ and d with , and a check-period Δ
with ,where , and for . Theorem 5. For a bound , let Assumption 1 hold. Then, the following statements are true:
(i) is the minimum number of impulses required for S-IC to achieve the settling time.
(ii) S-IC satisfying (62) is non-Zeno and the system (47) achieves FTPIS w.r.t. by S-IC satisfying (62) with settling time .
Proof. (i) The statement (i) follows directly from the definition of .
(ii) It follows from the S-IC algorithm (62) that, if , then for , we have . Since , there must exist a such that for . Noting that, for , the TS-IC algorithm (56) and the S-IC algorithm (62) are same, it follows that the inequalities (58) and (59) still hold. Thus, by using the same proof of Theorem 4, we determine that . Therefore, the error system (50) is FTPS w.r.t. by the S-IC satisfying (62) with the settling time .
Additionally, from (i), and knowing that the system (47) is unstable, we determine that, under S-IC (62), is the first time when enters and remains in the region . Hence, .
Moreover, for
, if
, then from the S-IC algorithm (62) and the continuity of
at
and Assumption 1, we have
which implies that
If , then, . Thus, the inequality (64) always holds.
For
, from the event-triggering condition in S-IC algorithm (62) and the continuity of
at
, we have
. From Assumption 1 and using the same proof of Theorem 4, we determine that the inequality (61) holds
, which implies
It follows from (64) and (65) and that holds for all . Hence, the S-IC satisfying (62) is non-Zeno. □
Remark 7. From S-IC algorithm (62), one can see that before or after , the impulsive control is always trigged by event conditions which are dependent on state. Additionally, before , the maximal interval between two adjacent impulsive control is no more than the check-period Δ. So the check-period Δ is used to inspect and push the error state into the region . Once enters into the region, the restriction from check-period will be eliminated. From S-IC algorithm (62), the check-period () can be relatively large. It is worth noting that the check period is pre-selected to satisfy . The lower bound on Δ is required to avoid the Zeno phenomenon. A smaller Δ may yield a faster response but also may result in more frequent impulses.
At the end of the section, we give comparison on the performances including the settling time, the number of impulses, and the impulse frequency (I.F.) among the three types of impulsive control: T-IC satisfying (53), TS-IC satisfying (56), and S-IC satisfying (62).
Let , , and be the minimum number of impulses required for T-IC (53), TS-IC (56), S-IC (62), respectively, to achieve the settling time.
Let , , and be the number of impulses on the interval for T-IC satisfying (53), TS-IC satisfying (56), and S-IC satisfying (62), respectively.
Let , , and be I.F. on the interval for T-IC satisfying (53), TS-IC satisfying (56), and S-IC satisfying (62), respectively.
Additionally, for T-IC (53), TS-IC (56), and S-IC (62), define .
Theorem 6. For a bound and the unstable system (47), the following inequalities for T-IC (53), TS-IC (56), and S-IC (62) hold: Proof. Compare T-IC (53) and TS-IC (56): noting in T-IC (53), we have
for
. Additionally, in TS-IC (56),
for
. Additionally, from (13) in the proof of Theorem 1, we determine
, while, from the definition of
in (56), we have
. Thus, we determine that
Compare T-IC (53) and S-IC (62): noting in T-IC (53),
for
, while in S-IC (62), from (64) in the proof of Theorem 5,
for
, we determine that
Therefore, from (69) and (70), we determine that the relations in (66) and (67) hold.
For the comparison on I.F., from (67), we have
. Additionally, noting in T-IC (53),
for
, while in TS-IC (56), by (61) in Theorem 4,
for
, and, by (66) and (67), we determine that
Noting the event triggering conditions after the settling time in TS-IC (56) and S-IC (62) are the same, and from (61) of Theorem 4,
for
, and from (65) of Theorem 5,
for
, we obtain
Thus, we obtain
Therefore, from (71) and (72), we determine that the relation (68) on I.F. also holds. □
Remark 8. According to Theorem 6, TS-IC (56) outperforms T-IC (53) and S-IC (62) in terms of settling time, the number of impulses required to reach the settling time, and I.F. Note that in Theorem 6, for means that .
5. Examples
In this section, we present one academic example with three cases for illustrations.
Example 1. Consider Lorenz system with disturbances:where , , , for all . Note: when and , (73) is a standard Lorenz system which is chaotic and unstable. Moreover, by , the system (73) is unstable and also non-incremental stability.
Now, design impulsive control including both T-IC and TS-IC, respectively, by which Lorenz system (73) is FTPIS w.r.t. the given boundedness .
Under the impulsive control, the system (73) becomes
Note that
Let with , where I is the unity matrix. Then, we obtain with and .
Case-I. FTPIS w.r.t. via T-IC: For a bound
and the system (73) with
and
and
as the initial states, T-IC
with
is set to satisfy the algorithm:
where
with
,
.
By Theorem 3, then, Lorenz system (73) is FTPIS w.r.t.
by T-IC satisfying (75) with the settling time
. The simulation is given in
Figure 1.
Note: Due to the conservativeness of T-IC algorithm (75) (see Remark 5 (iii)), the real settling time of T-IC in the simulation is with .
Case-II. FTPIS w.r.t. via TS-IC: For the bound
and (73) with same
and the initial states as in Case-I, i.e.,
,
, and
, TS-IC
with
is set to satisfy the algorithm:
where
and
.
By Theorem 4, the system (73) is FTPIS w.r.t.
by TS-IC satisfying (76) with the settling time
with
. The simulation is given in
Figure 2.
Case-III. FTPIS w.r.t. via S-IC: For the bound
and (73) with with same
and the initial states as in Case-I and Case-II, i.e.,
,
, and
, S-IC
with
is set to satisfy the S-IC algorithm:
where
,
for
,
,
, and the check-period
. By Theorem 5, the system (73) is FTPIS w.r.t.
by S-IC satisfying (77) with the settling time
with
. The simulation is given in
Figure 3.
Comparison among T-IC, S-IC, and TS-IC: From
Figure 1,
Figure 2 and
Figure 3. In the simulations, the FTPIS of Lorenz system (73) can be achieved by T-IC, TS-IC, and S-IC, respectively. For more comparison, we give the simulations under different initial conditions.
Figure 4,
Figure 5 and
Figure 6 are the simulations of Case-I and Case-III under different initial conditions. Here, in
Figure 4,
Figure 5 and
Figure 6,
and
.
Here, the performances including the settling time
(here,
), the minimum number
of impulses required for achieving settling time, and the total number of impulses
during
, and the impulse frequency (I.F.)
during
, are used to give the comparison.
Table 1 is the data collected from the simulations of
Figure 1,
Figure 2 and
Figure 3. Additionally,
Table 2 is from the simulations of
Figure 4,
Figure 5 and
Figure 6. From
Table 1 and
Table 2, one can see that TS-IC performs best in terms of the shortest settling time and the least number of impulses required to reach the settling time. Additionally, the impulse frequency of TS-IC is close to that of S-IC, but the latter has the longest settling time. Therefore, the result of Theorem 6 is verified.
Remark 9. From Example 1, among T-IC, TS-IC, and S-IC, the TS-IC has advantages to achieve FTPIS, including the shortest settling time, the least number of impulses required for achieving the settling time, and almost the lowest I.F. It is also noted that T-IC is the strongest impulsive control with maximum total number of impulses, highest I.F., and the minimum error when entering into the target region , than S-IC and TS-IC. S-IC has the lowest I.F., but S-IC has the longest settling time.