Next Article in Journal
Predefined-Time Neural Adaptive Control for Distributed Formation Control of Nonlinear Multiagent Systems with Full-State Constraints
Previous Article in Journal
Unconditionally Stable L1-2 FEMs for Nonlinear Schrödinger Equations with the Variable-Order Time-Fractional Derivative
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Finite-Time Practical Incremental Stability of Impulsive Systems with Application to Design of Impulsive Control

1
College of Science, Hunan University of Technology, Zhuzhou 412000, China
2
Department of Railway Power Supply and Electrical Engineering, Hunan Railway Professional Technology College, Zhuzhou 412007, China
*
Author to whom correspondence should be addressed.
Mathematics 2026, 14(10), 1657; https://doi.org/10.3390/math14101657
Submission received: 31 March 2026 / Revised: 29 April 2026 / Accepted: 5 May 2026 / Published: 13 May 2026
(This article belongs to the Section E2: Control Theory and Mechanics)

Abstract

This paper investigates finite-time practical incremental stability (FTPIS) for impulsive systems with application to the design of impulsive control. The notions of FTPIS and finite-time practical stability (FTPS) are proposed for impulsive systems. By employing the methods of Lyapunov-like function and dwell-time, FTPIS criteria with FTPIS settling time estimates are established for impulsive systems. The results are then used to design FTPIS-based impulsive control, including time-triggered impulsive control (T-IC), time-state-triggered impulsive control (TS-IC), and state-triggered impulsive control (S-IC). To verify the validity of the theoretical results, one example on the problem of finite-time practical tracking is given. Both theoretical results and numerical simulations show that, compared with T-IC and S-IC, TS-IC has advantages, with the shortest settling time, the least number of impulsive control required to reach the settling time, and the lowest impulse frequency. Additionally, the designed TS-IC improves the mechanism of impulsive control in the literature, which is either time-triggered or state-triggered.

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 R + be the set of nonnegative real numbers, R n the n-dimensional space of real vectors, and N the set of nonnegative integers, i.e., N = { 0 , 1 , 2 , } . λ max ( P ) ( λ min ( P ) ) denotes the maximal (minimal) eigenvalue of matrix P R n × n . For a R , [ a ] denotes the minimum integer not less than a. A function γ : R + R + is of class- K ( γ K ) if it is continuous and strictly increasing and γ ( 0 ) = 0 . It is of class- K if it is of class- K and unbounded.
Consider an impulsive system with the form:
x ˙ = f ( t , x ) , t T x ( t + ) = g k ( x ( t ) ) , t = t k T , x ( t 0 + ) = x 0 , k 1 , k N ,
where x ( t ) R n ; f : R + × R n R n is a continuous function satisfying f ( t , 0 ) = 0 , t t 0 ; x ( t + ) = lim s t + x ( s ) , g k : R n R n is the impulsive gain function and satisfies g k ( 0 ) = 0 , k N , and T = { t k } is the impulsive time sequence satisfying
t 0 < t 1 < t 2 < < t k < t k + 1 < .
For any initial condition ( t 0 , x 0 ) R + × R n , assume the solution to (1) exists uniquely for all t t 0 . Denote x ( t ) = x ( t , x 0 ) as the solution of (1) with x ( t 0 + ) = x 0 .
Definition 1.
For a given boundedness B > 0 , the system (1) is said to be finite-time practical incremental stable (FTPIS) w.r.t. B if ξ , η R n , there exists a time S 0 such that, for all t t 0 + S ,
x ( t , ξ ) x ( t , η ) B .
The infimum of such S is called the settling time of FTPIS. Noting that the settling time is dependent on the ξ η , B , and the sequence T = { t k } , we use S ( ξ η , B , T ) to denote the settling time of FTPIS w.r.t. B .
Based on Definition 1, for FTPIS of (1), set two systems as:
z ˙ 1 = f ( t , z 1 ) , t T , z 1 ( t + ) = g k ( z 1 ) , t = t k T ,
z ˙ 2 = f ( t , z 2 ) , t T , z 2 ( t + ) = g k ( z 2 ) , t = t k T ,
where z 1 , z 2 R n , and z 1 ( t 0 + ) = ξ , z 2 ( t 0 + ) = η R n for arbitrary initial states ξ and η .
Let e ( t ) = z 1 ( t ) z 2 ( t ) be the error of z 1 ( t ) and z 2 ( t ) . Additionally, z R n , define functions f ˜ ( t , e , z ) = f ( t , e + z ) f ( t , z ) and g ˜ k ( e , z ) = g k ( e + z ) g k ( z ) . The error system is
e ˙ = f ˜ ( t , e , z 2 ) , t T = { t k } , e ( t + ) = g ˜ k ( e , z 2 ) , t T = { t k } .
Definition 2.
For a given bound B > 0 , the system (6) is said to be finite-time practical stable (FTPS) w.r.t. B if for all e 0 = e ( t 0 ) R n , there exists some S 0 such that for all t t 0 + S
e ( t ) B , t t 0 + S .
Similar to Definition 1, we use S ( e 0 , B , T ) to denote the infimum of such S and call it settling time of FTPS w.r.t. B .
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 { z R n : z B } 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 { z R n : z B } in Definitions 1 and 2 can be changed to a bounded closed set Ω R n . 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 ξ , η U for some U R n with 0 U , 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 lim t e ( t ) = lim t x ( t , ξ ) x ( t , η ) = 0 .
Clearly, from Definitions 1 and 2, the following result can be derived.
Proposition 1.
For a given bound B > 0 , the system (1) is FTPIS w.r.t. B , with settling time S ( ξ η , B , T ) is equivalent to the error system (6) is FTPS with settling time S ( e 0 = ξ η , B , T ) .
Definition 3
([48,54]). Let N I ( t 0 , t ] be the number of impulses of (1) during ( t 0 , t ] . The impulse frequency (I.F.) of (1) during ( t 0 , t ] is defined by F I ( t 0 , t ] N I ( t 0 , t ] t t 0 .

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 T = { t k } , denote Δ k = t k t k 1 for all k 1 .
Theorem 1.
For a given bound B and the systems (4) and (5), suppose there exists a Lyapunov-like function U ( z 1 , z 2 ) : R n × R n R + satisfying: for z 1 , z 2 R n , constants α R , d k R , γ > 0 , function φ K , and k * N ,
φ ( z 1 z 2 ) U ( z 1 , z 2 ) , U z 1 f ( t , z 1 ) + U z 2 f ( t , z 2 ) α U , U ( g k ( z 1 ) , g k ( z 2 ) ) e d k U , α Δ k + d k γ , k [ 1 , k * ] , α Δ k + d k 0 , k > k * .
Then, the following statements are true.
(i) If α 0 and Δ sup sup k 1 { Δ k } < , then the system (1) is FTPIS w.r.t. B and the settling time satisfies S ( ξ η , B , T ) t k * t 0 , where k * = 1 γ ln φ ( B ) U ( ξ , η ) e α Δ sup .
(ii) If α < 0 , then the system (1) is FTPIS w.r.t. B and the settling time satisfies S ( ξ η , B , T ) t k * t 0 , where k * = 1 γ ln φ ( B ) U ( ξ , η ) .
Proof. 
Let V ( t ) = U ( z 1 ( t ) , z 2 ( t ) ) for all t t 0 . Note that e ( t ) = z 1 ( t ) z 2 ( t ) and e 0 = z 1 ( t 0 ) z 2 ( t 0 ) = ξ η . It follows from the conditions in (8) that
D + V | ( 4 ) ( 5 ) α V , t T = { t k } , V ( t + ) e d k V ( t ) , t = t k T .
Let y 0 = V ( t 0 ) . Consider a non-negative comparison system, such as the following:
D + y ( t ) = α y ( t ) , t T , y ( t + ) = e d k y ( t ) , t = t k T .
Solving (10), we determine that
y ( t ) = e α ( t t k ) y ( t k + ) , t ( t k , t k + 1 ] , y ( t k + 1 + ) e d k + 1 V ( t k + 1 ) = e α Δ k + 1 + d k + 1 y ( t k + ) ,
which yields that
y ( t k + ) e θ k y ( t k 1 + ) e i = 1 k θ i y ( t 0 + ) = e i = 1 k θ i V ( t 0 ) , k 1 ,
where θ k = α Δ k + d k and Δ k = t k t k 1 .
Case-(i): Suppose α 0 . In this case, by (8), we have d k 0 .
Notting k * 1 γ ln φ ( B ) V ( t 0 ) e α Δ sup , by (12) and (8), we have for k k * ,
y ( t k * + ) e γ k * V ( t 0 ) e α Δ sup φ ( B ) .
Thus, by (11) and (13), we have
y ( t ) = e α ( t t k ) y ( t k * + ) φ ( B ) , t ( t k * , t k * + 1 ] .
It follows that
y ( t k * + 1 + ) e d k * + 1 y ( t k * + 1 ) e d k * + 1 φ ( B ) .
From α 0 and (15), we determine that for t ( t k * + 1 , t k * + 2 ] ,
y ( t ) = e α ( t t k * + 1 ) y ( t k * + 1 + ) e α Δ k * + 1 + d k * + 1 φ ( B ) φ ( B ) .
It follows from (15) and (16) and d k 0 for all k 1 that
y ( t ) φ ( B ) , t [ t k * + 1 , t k * + 2 ] .
By using the Mathematical Induction, we determine for all i N with i 1 ,
y ( t ) φ ( B ) , t [ t k * + i , t k * + i + 1 ] .
By (18) and (14), we have
y ( t ) φ ( B ) , t > t k * .
By the comparison principle of impulsive systems [55] and (19), we obtain
φ ( e ( t ) ) V ( t ) y ( t ) φ ( B ) , t > t k * ,
which means that e ( t ) B for all t > t k * . Hence, the error system (6) is FTPS w.r.t. B with the settling time S ( e 0 , B , T ) t k * t 0 . Therefore, the impulsive system (1) is FTPIS with the settling time S ( e 0 , B , T ) t k * t 0 .
Case-(ii): Suppose α < 0 . It follows from y ( t 0 ) = V ( t 0 ) and α 0 and (11) and (12) and k * 1 γ ln φ ( B ) V ( t 0 ) that
y ( t k * + ) e γ k * V ( t 0 ) φ ( B ) ,
y ( t ) e α ( t t k * ) y ( t k * + ) y ( t k * + ) φ ( B ) , t ( t k * , t k * + 1 ] .
It follows from (21) and (22) and α Δ k * + 1 + d k * + 1 0 that
y ( t k * + 1 + ) = e d k * + 1 y ( t k * + 1 ) e α Δ k * + 1 + d k * + 1 y ( t k * + ) y ( t k * + ) φ ( B ) .
Thus, for all t ( t k * + 1 , t k * + 2 ] , it follows from (23) and α 0 that
y ( t ) = e α ( t t k * + 1 ) y ( t k * + 1 + ) y ( t k * + 1 + ) φ ( B ) .
It follows from (22)–(24) that
y ( t ) φ ( B ) , t [ t k * + 1 , t k * + 2 ] .
Now, we show that for all i N with i 1 ,
y ( t ) φ ( B ) , t [ t k * + i , t k * + i + 1 ] .
By (25), the inequality (26) holds for i = 1 . For i = 2 , by (8) and (25), we obtain
y ( ( t k * + 2 + ) e d k * + 2 y ( t k * + 2 ) e α Δ k * + 2 + d k * + 2 y ( t k * + 1 + ) y ( t k * + 1 + ) φ ( B ) .
y ( t ) e α ( t t k * + 2 ) y ( t k * + 2 + ) y ( t k * + 2 + ) φ ( B ) , t ( t k * + 2 , t k * + 2 ] .
It follows from (26)–(28) that the inequality (26) holds for i = 2 . Repeating the process for i = 1 and i = 2 , we determine that the inequality (26) holds for all i 1 . Thus, by (26) and (21) and (22), we have
y ( t ) φ ( B ) , t > t k * .
By using the same proof of (20) in Case-(i), we determine that the system (1) is FTPIS w.r.t. B with the settling time S ( e 0 , B , T ) t k * t 0 . □
Corollary 1.
For a given bound B and the systems (4) and (5), suppose there exists a Lyapunov-like function U ( z 1 , z 2 ) : R n × R n R + satisfying: z 1 , z 2 R n , some constants α * R , λ * > 0 , d k * R , 0 κ * λ * , 0 < η ξ < 1 , γ * > 0 , φ K and k * N ,
φ ( z 1 z 2 ) U ( z 1 , z 2 ) , U z 1 f ( t , z 1 ) + U z 2 f ( t , z 2 ) α * U + κ * U ξ λ * U η , U ( g k ( z 1 ) , g k ( z 2 ) ) e d k * U , ( α * + κ * ) Δ k + d k * γ * , k [ 1 , k * ] , ( α * + κ * ) Δ k + d k * 0 , k > k * .
Then, the statements of (i)–(ii) of Theorem 1 holds for α = ( 1 η ) ( α * + κ * ) , d k = ( 1 η ) d k * , and γ = ( 1 η ) γ * , and U ( ξ , η ) being replaced by U ( ξ , η ) 1 η in the settling time estimate.
Proof. 
Let V ( t ) = U ( z 1 ( t ) , z 2 ( t ) ) 1 η for all t t 0 . By (30), we determine that
D + V | ( 4 ) ( 5 ) = ( 1 η ) U η D + U | ( 4 ) ( 5 ) ( 1 η ) U η ( α * U + κ * U ξ λ * U η ) = ( 1 η ) α * V + ( 1 η ) κ * U ξ η ( 1 η ) λ * · sgn ( U ) .
Noting that U ξ η 1 · sgn ( U ) if U 1 and U ξ η U if U 1 , we obtain U ξ η max { 1 · sgn ( U ) , U } . It follows from (31) that
D + V | ( 4 ) ( 5 ) ( 1 η ) ( α * + κ * ) V ( 1 η ) ( λ * κ * ) sgn ( U ) α V , t T , V ( t + ) = U ( g k ( z 1 ) , g k ( z 2 ) ) 1 η e ( 1 η ) d k * U 1 η = e d k V , t = t k T .
Hence, the conditions in (8) of Theorem 1 are satisfied. Thus, the results follow from Theorem 1 with U ( ξ , η ) being replaced by U ( ξ , η ) 1 η in the settling time estimate. □
Remark 2.
In Theorem 1 and Corollary 1, if α 0 , then FTPIS of the system (1) is driven by its jump subsystem x ( t + ) = g ( x ) while its flow subsystem x ˙ = f ( t , x ) may be non-FTPIS. On the contrary, if α < 0 , 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 B and systems (4) and (5), assume there exists a Lyapunov-like function U ( z 1 , z 2 ) : R n × R n R + satisfying: for some φ , φ 2 K , and constants α, d k , c > 0 , and k * N ,
φ ( z 1 z 2 ) U ( z 1 , z 2 ) , z 1 , z 2 R n , U z 1 f ( t , z 1 ) + U z 2 f ( t , z 2 ) α U , U ( g k ( z 1 ) , g k ( z 2 ) ) max { e d k U c · s g n ( U ) , 0 } , k k * , U ( g k ( z 1 ) , g k ( z 2 ) ) e d k U , k > k * , α Δ k + d k 0 , k N .
Then, the following statements are true.
(i) If α 0 and Δ sup = sup k 1 { Δ k } < , then the system (1) is FTPIS w.r.t. B with the settling time S ( ξ η , B , T ) t k * t 0 , where k * = U ( ξ , η ) e α Δ sup φ ( B ) c .
(ii) If α < 0 , then the system (1) is FTPIS w.r.t. B with the settling time S ( ξ η , B , T ) t k * t 0 , where k * = U ( ξ , η ) φ ( B ) c .
Proof. 
Let V ( t ) = U ( z 1 ( t ) , z 2 ( t ) ) for all t t 0 . Noting that e ( t ) = z 1 ( t ) z 2 ( t ) and e 0 = z 1 ( t 0 ) z 2 ( t 0 ) = ξ η , by (33), we obtain
D + V | ( 9 ) α V , t T , V ( t + ) max { e d k V ( t ) c · sgn ( V ) , 0 } , t = t k , k k * , V ( t + ) e d k V ( t ) , t = t k , k > k * .
Let y 0 = V ( t 0 ) and let λ ˜ satisfy 0 < λ ˜ λ . Consider a non-negative comparison system as:
D + y ( t ) = α y ( t ) , t T , y ( t + ) = max { e d k y ( t ) c · sgn ( y ( t ) ) , 0 } , t = t k , k k * , y ( t + ) = e d k y ( t ) , t = t k , k > k * .
By solving (35), we determine that
y ( t ) = max { e α ( t t k ) ( e d k y ( t k ) c · sgn ( y ( t k ) ) ) , 0 } , t ( t k , t k + 1 ] , k k * ,
y ( t ) = e α ( t t k ) y ( t k + ) , t ( t k , t k + 1 ] , k > k * .
Noting from (34), if there is some k ˜ k * such that y ( t k ˜ + ) = 0 , then y ( t k + ) = 0 holds for all k k ˜ . Thus, y ( t ) = 0 holds for all t > t k ˜ . Additionally, the results in (i)–(ii) hold. Hence, in the following, suppose y ( t k + ) > 0 for all k k * .
Let b ( k ) = y ( t k + ) for all k N . It follows from (35) and (36) and (33) that for all k k * ,
b ( k ) = y ( t k + ) = max { e d k y ( t k ) c · sgn ( y ( t k ) ) , 0 } = max { e α Δ k + d k y ( t k 1 + ) c · sgn ( y ( t k 1 + ) ) , 0 } max { b ( k 1 ) c · sgn ( b ( k 1 ) ) , 0 } max { b ( 0 ) c · ( b ( 0 ) ) c · sgn ( b ( k 1 ) , 0 } = max { b ( 0 ) c · k , 0 }
(i) Suppose α 0 and Δ sup < . By (38), for k * = U ( ξ , η ) e α Δ sup φ ( B ) c y 0 e α Δ sup φ ( B ) c , we obtain
y ( t k * + ) max { y 0 c · k * , 0 } e α Δ sup φ ( B ) .
Note that, from (34), for some k, y ( t k + ) e α Δ sup φ ( B ) implies y ( t k + 1 + ) e α Δ sup φ ( B ) . Thus, by (39), we determine that
y ( t k + ) e α Δ sup φ ( B ) , k k * .
It follows from α > 0 and (40) and (37) that
y ( t ) e α Δ k + 1 y ( t k + ) φ ( B ) , t ( t k , t k + 1 ] , k k * .
By the comparison principle of impulsive systems (see [55]) and (33), we obtain
φ ( e ( t ) ) V ( t ) y ( t ) φ ( B ) , t t k * ,
which means that e ( t ) B for all t t k * . Hence, the error system (6) is FTPS w.r.t. B with the settling time S ( e 0 , B , T ) t k * t 0 . Therefore, the system (1) is FTPIS w.r.t. B with the settling time S ( e 0 , B , T ) t k * t 0 .
(ii) Suppose α < 0 . By (38), for k * = U ( ξ , η ) φ ( B ) c y 0 φ ( B ) c , we obtain
y ( t k * + ) max { y 0 c · k * , 0 } φ ( B ) .
Note that from (34), for some k k * , y ( t k + ) φ ( B ) implies y ( t k + 1 + ) = e d k + 1 y ( t k + 1 ) = e α Δ k + 1 + d k + 1 y ( t k + ) y ( t k + ) φ ( B ) . Thus, by (43), we determine that
y ( t k + ) φ ( B ) , k k * .
It follows from α 0 and (44) and (37) that
y ( t ) e α ( t t k ) y ( t k + ) y ( t k + ) φ ( B ) , t ( t k , t k + 1 ] , k k * .
By the comparison principle of impulsive systems (see [55]) and (45), we obtain φ ( e ( t ) ) V ( t ) y ( t ) φ ( B ) , t t k * , which means that
e ( t ) B , t t k * .
Hence, the error system (6) is FTPS w.r.t. B with the settling time S ( e 0 , B , T ) t k * t 0 . Therefore, the system (1) is FTPIS w.r.t. B with S ( e 0 , B , T ) t k * t 0 . □
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 k * = , 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 α Δ k + d k 0 for all k > k * 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:
x ˙ = A x + ϕ ( t , x ) + u
where x R n , A R n × n is a known unstable matrix, ϕ is a nonlinear function, and u is the impulsive control with form of
u = k = 1 δ ( t t k ) K x ,
where K R n × n is a control gain matrix, T = { t k } is the sequence of impulse instants, and the function δ is defined as δ ( 0 ) = 1 and δ ( s ) = 0 for s 0 .
Under the impulsive control (48), the system (47) becomes
x ˙ = A x + ϕ ( t , x ) , t T = { t k } , x + = x + K x , t T .
For the FTPIS w.r.t. a bound B of (49), choose two arbitrary initial states ξ and η , and let e ( t ) = x ( t , ξ ) x ( t , η ) be the error of solutions x ( t , ξ ) and x ( t , η ) . Then, the error system is
e ˙ = A e + ϕ ( t , e + x ( t , η ) ) ϕ ( t , x ( t , η ) ) , e + = e + K e . e ( t 0 ) = ξ η .
Assumption 1.
Assume there exists some L > 0 , σ ^ ( t ) 0 satisfing t 0 σ ^ ( t ) d t < , α 0 , and some positive definite matrix P > 0 , satisfying
ϕ ( t , e + z ) ϕ ( t , z ) ( L + σ ^ ( t ) ) z , e , z R n , t R + ,
P A + A T P + 2 ( L + σ ^ ( t ) ) λ max ( P ) λ min ( P ) α P 0 .
Remark 4.
(i) In Assumption 1, the time-varying Lipschitz condition (51) with function σ ^ ( t ) 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 σ ^ ( t ) is integrable and thus bounded and specifically, σ ^ ( t ) σ ^ 0 for some constant σ ^ 0 > 0 , we may choose P to be the identity matrix I and set α = 2 ( L + σ ^ 0 ) + λ max ( A + A T ) .
Now, for FTPIS w.r.t. B 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 V ( t ) = e T ( t ) P e ( t ) 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 d < γ < 0 ,
K T P K e d P , t k = t k 1 + γ d α , 1 k k ˜ min ( 1 ) = 1 γ ln λ min ( P ) B 2 V ( t 0 ) e d ; t k = t k 1 + d α , k > k ˜ min ( 1 ) .
Let k min ( 1 ) 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 B and the system (47) can achieve FTPIS w.r.t. B by T-IC satisfying (53) and the settling time satisfies S ( ξ η , B , T ) = t k min ( 1 ) t 0 t k ˜ min ( 1 ) t 0 .
Proof. 
From (50) and T-IC (53), we obtain, for t T ,
D + V | ( 50 ) = e T ( P A + A T P ) e + 2 e T P ( ϕ ( t , e + x ( t , η ) ) ϕ ( t , x ( t , η ) ) ) α V .
Additionally, for all t T , by (53), we have
V ( t + ) = e T K T P K e e d V ( t ) .
Note that Δ sup = d α . 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. B and the system (47) achieves FTPIS w.r.t. B by T-IC satisfying (53) with settling time S ( ξ η , B , T ) t k ˜ min ( 1 ) t 0 .
Moreover, noting that (47) is unstable, we determine that t k min ( 1 ) is the first time when the error state e ( t ) enters and remains in the region e ( t ) B . Hence, k min ( 1 ) k ˜ min ( 1 ) and S ( ξ η , B , T ) = t k min ( 1 ) t 0 . □
Remark 5.
(i) The parameter d in Theorem 3 can be set as d = ln λ max ( P 1 K T P K ) < 0 . Thus, T = { t k } can be set to satisfy: for some small γ > 0 ,
Δ k = γ ln λ max ( P 1 K T P K ) 2 L λ max ( P ) λ min ( P ) + λ max ( P A + A T P ) , k k min ( 1 ) , Δ k = ln λ max ( P 1 K T P K ) 2 L λ max ( P ) λ min ( P ) + λ max ( P A + A T P ) , k > k min ( 1 ) .
(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 B 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 k min ( 1 ) < k ˜ min ( 1 ) .
Time-State-triggered Impulsive Control (TS-IC): Let Assumption 1 hold and V ( t ) = e ( t ) T P e ( t ) . For the system (47) and a bound B > 0 , the impulsive control (48) is set to satisfy the TS-IC algorithm: for some constants γ and d with d < γ < 0 ,
K T P K e d P , t k = t k 1 + γ d α , 1 k k min ( 2 ) , k min ( 2 ) min { k : V ( t k ) λ min ( P ) B 2 } , t k = min { s : s > t k 1 , V ( s ) λ min ( P ) B 2 } , k > k min ( 2 ) .
Theorem 4.
Let Assumption 1 hold. Then, the following statements are true:
(i) k min ( 2 ) 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. B by TS-IC satisfying (56) with settling time S ( ξ η , B , T ) = t k min ( 2 ) t 0 .
Proof. 
(i) From the definition of k min ( 2 ) , it yields that k min ( 2 ) is the minimum number of impulses required for TS-IC to achieve the settling time.
(ii) Note that λ min ( P ) e ( t ) 2 V ( t ) λ max ( P ) e ( t ) 2 . By the definition of k min ( 2 ) in (56), we have V ( t k min ( 2 ) ) λ min ( P ) B 2 . Thus, we determine that
V ( t k min ( 2 ) + ) e d V ( t k min ( 2 ) ) e d λ min ( P ) B 2 .
By TS-IC algorithm (56) and the continuity of V ( t ) at t k min ( 2 ) + 1 , we obtain, for all t ( t k min ( 2 ) , t k min ( 2 ) + 1 ] ,
V ( t ) λ min ( P ) B 2 = V ( t k min ( 2 ) + 1 ) .
It follows from (56) and (58) that
V ( t k min ( 2 ) + 1 + ) e d V ( t k min ( 2 ) + 1 ) e d λ min ( P ) B 2 .
Repeating the process of (58) and (59), we determine that V ( t ) λ min ( P ) B 2 holds for all t > t k min ( 2 ) . Hence, e ( t ) B , t > t k min ( 2 ) . Therefore, the error system (50) is FTPS w.r.t. B by the TS-IC satisfying (56) with the settling time T ( e 0 , { t k } , B ) t k min ( 2 ) t 0 .
From (i), and knowing that the system (47) is unstable, we determine that, under TS-IC (56), t k min ( 2 ) is the first time when the error state e ( t ) enters and remains in the region e ( t ) B . Hence, S ( ξ η , B , T ) = t k min ( 2 ) t 0 .
Moreover, for k k min ( 2 ) , from the event-triggering condition in (56) and by the continuity of V ( t ) at t = t k , we have V ( t k ) = λ min ( P ) B 2 . From Assumption 1, we determine that for k > k min ( 2 ) ,
λ min ( P ) B 2 = V ( t k + 1 ) e α ( t k + 1 t k ) V ( t k + ) e α ( t k + 1 t k ) e d V ( t k ) e α ( t k + 1 t k ) e d λ min ( P ) B 2 .
From (60), it follows that
t k + 1 t k d α > 0 , k k min ( 2 ) .
For k k min ( 2 ) , noting that from TS-IC algorithm (56), we have t k t k 1 = γ d α holds for all k k min ( 2 ) . It yields that t k + 1 t k γ d α > 0 holds for all k N . Hence, the TS-IC satisfying (56) is non-Zeno. □
Remark 6.
From TS-IC algorithm (56), one can see that t k min ( 2 ) is the time when the error state e ( t ) first enters and remains in the region e ( t ) B . Additionally, before t k min ( 2 ) , the impulsive control is trigged by the time as in T-IC, while after t k min ( 2 ) , the impulsive control is triggered by the state. Additionally, the TS-IC is executed only when e ( t ) 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 V ( t ) = e ( t ) T P e ( t ) and Assumption 1 hold. For the system (47) and a bound B > 0 , the impulsive control (48) is set to satisfy the S-IC algorithm: for some constants γ and d with d < γ < 0 , and a check-period Δ with Δ > d α ,
K T P K e d P , t k = min { t : t Ψ k 1 } , i f Ψ k 1 Ø , o t h e r w i s e t k = t k 1 + Δ , 1 k k min ( 3 ) , k min ( 3 ) min { k : V ( t k ) λ min ( P ) B 2 } ; t k = min { s : s > t k 1 , V ( s ) λ min ( P ) B 2 } , k > k min ( 3 ) ,
where Ψ 0 = { t : t ( t 0 , t 0 + Δ ] , V ( t ) e γ d V ( t 0 ) } , and Ψ k 1 = { t : t ( t k 1 , t k 1 + Δ ] , V ( t ) e γ V ( t k 1 ) } for k 2 .
Theorem 5.
For a bound B > 0 , let Assumption 1 hold. Then, the following statements are true:
(i) k min ( 3 ) 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. B by S-IC satisfying (62) with settling time S ( ξ η , B , T ) = t k min ( 3 ) t 0 .
Proof. 
(i) The statement (i) follows directly from the definition of k min ( 3 ) .
(ii) It follows from the S-IC algorithm (62) that, if V ( t 0 ) > λ min ( P ) B 2 , then for k k min ( 3 ) , we have V ( t k + ) e d V ( t k ) e γ + d V ( t k 1 + ) . Since d + γ < 0 , there must exist a k min ( 3 ) such that V ( t k ) λ min ( P ) B 2 for k = k min ( 3 ) . Noting that, for k > k min ( 3 ) , 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 e ( t ) B , t > t k min ( 3 ) . Therefore, the error system (50) is FTPS w.r.t. B by the S-IC satisfying (62) with the settling time T ( e 0 , { t k } , B ) t k min ( 3 ) t 0 .
Additionally, from (i), and knowing that the system (47) is unstable, we determine that, under S-IC (62), t k min ( 3 ) is the first time when e ( t ) enters and remains in the region e ( t ) B . Hence, S ( ξ η , B , T ) = t k min ( 3 ) t 0 .
Moreover, for k k min ( 3 ) , if Ψ k Ø , then from the S-IC algorithm (62) and the continuity of V ( t ) at t = t k and Assumption 1, we have
e γ V ( t k 1 ) = V ( t k ) e α ( t k t k 1 ) V ( t k 1 + ) e α ( t k t k 1 ) + d V ( t k 1 ) ,
which implies that
t k t k 1 γ d α > 0 , k k min ( 3 ) .
If Ψ k = Ø , then, t k t k 1 = Δ > d α > γ d α . Thus, the inequality (64) always holds.
For k > k min ( 3 ) , from the event-triggering condition in S-IC algorithm (62) and the continuity of V ( t ) at t = t k , we have V ( t k ) = λ min ( P ) B 2 . From Assumption 1 and using the same proof of Theorem 4, we determine that the inequality (61) holds k > k min ( 3 ) , which implies
t k + 1 t k d α > 0 , k k min ( 3 ) .
It follows from (64) and (65) and d > γ > 0 that t k + 1 t k γ d α > 0 holds for all k N . Hence, the S-IC satisfying (62) is non-Zeno. □
Remark 7.
From S-IC algorithm (62), one can see that before or after t k min ( 3 ) , the impulsive control is always trigged by event conditions which are dependent on state. Additionally, before t k min ( 3 ) , 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 e ( t ) into the region e ( t ) B . Once e ( t ) enters into the region, the restriction from check-period will be eliminated. From S-IC algorithm (62), the check-period ( Δ > d α ) can be relatively large. It is worth noting that the check period is pre-selected to satisfy Δ > d α . 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 k min ( 1 ) , k min ( 2 ) , and k min ( 2 ) be the minimum number of impulses required for T-IC (53), TS-IC (56), S-IC (62), respectively, to achieve the settling time.
Let N ( 1 ) ( t 0 , t ] , N ( 2 ) ( t 0 , t ] , and N ( 3 ) ( t 0 , t ] be the number of impulses on the interval ( t 0 , t ] for T-IC satisfying (53), TS-IC satisfying (56), and S-IC satisfying (62), respectively.
Let F I ( 1 ) ( t 0 , t ] , F I ( 2 ) ( t 0 , t ] , and F I ( 3 ) ( t 0 , t ] be I.F. on the interval ( t 0 , t ] 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 T max max { t k min ( 1 ) , t k min ( 2 ) , t k min ( 3 ) } .
Theorem 6.
For a bound B and the unstable system (47), the following inequalities for T-IC (53), TS-IC (56), and S-IC (62) hold:
k min ( 2 ) k min ( 1 ) k min ( 3 ) ,
t k min ( 2 ) t k min ( 1 ) t k min ( 3 ) = T max ,
F I ( 2 ) ( t 0 , t ] F I ( 3 ) ( t 0 , t ] < F I ( 1 ) ( t 0 , t ] , t T max = t k min ( 3 ) .
Proof. 
Compare T-IC (53) and TS-IC (56): noting in T-IC (53), we have t k t k 1 = γ d α for 1 k k min ( 1 ) . Additionally, in TS-IC (56), t k t k 1 = γ d α for 1 k k min ( 2 ) . Additionally, from (13) in the proof of Theorem 1, we determine V ( t k min ( 1 ) + ) e α Δ sup φ ( B ) = e d λ min ( P ) B 2 < λ min ( P ) B 2 , while, from the definition of k min ( 2 ) in (56), we have k min ( 2 ) = min { k : V ( t k + ) e d λ min ( P ) B 2 } . Thus, we determine that
k min ( 1 ) k min ( 2 ) , t k min ( 1 ) t k min ( 2 ) .
Compare T-IC (53) and S-IC (62): noting in T-IC (53), t k t k 1 = γ d α for 1 k k min ( 1 ) , while in S-IC (62), from (64) in the proof of Theorem 5, t k t k 1 > γ d α for 1 k k min ( 3 ) , we determine that
k min ( 3 ) k min ( 1 ) , t k min ( 3 ) t k min ( 1 ) .
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 T max = t k min ( 3 ) . Additionally, noting in T-IC (53), t k t k 1 = d α > γ d α for k > k min ( 1 ) , while in TS-IC (56), by (61) in Theorem 4, t k t k 1 d α > γ d α for k > k min ( 2 ) , and, by (66) and (67), we determine that
N ( 1 ) ( t 0 , t ] N ( 2 ) ( t 0 , t ] , F I ( 1 ) ( t 0 , t ] F I ( 2 ) ( t 0 , t ] , t T max max { t k min ( 1 ) , t k min ( 2 ) } .
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, t k t k 1 d α > γ d α for k > k min ( 2 ) , and from (65) of Theorem 5, t k t k 1 d α > γ d α for k > k min ( 3 ) , we obtain N ( 3 ) ( t 0 , t ] N ( 2 ) ( t 0 , t ] , t T max = max { t k min ( 2 ) , t k min ( 3 ) } . Thus, we obtain
F I ( 3 ) ( t 0 , t ] F I ( 2 ) ( t 0 , t ] , t T max = max { t k min ( 2 ) , t k min ( 3 ) } = t k min ( 3 ) .
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, F I ( 3 ) ( t 0 , t ] F I ( 2 ) ( t 0 , t ] for t T max means that lim t F I ( 3 ) ( t 0 , t ] = lim t F I ( 2 ) ( t 0 , t ] .

5. Examples

In this section, we present one academic example with three cases for illustrations.
Example 1.
Consider Lorenz system with disturbances:
x ˙ = A x + B ( x ) x + ϕ ( t ) x + u ,
where x R 3 , A = 10 10 0 28 1 0 0 0 8 3 , B ( x ) = 0 0 0 x 3 0 x 1 x 2 x 1 0 , ϕ ( t ) 0 for all t 0 .
Note: when ϕ ( t ) = 0 and u = 0 , (73) is a standard Lorenz system x ˙ = A x + B ( x ) x , which is chaotic and unstable. Moreover, by ϕ ( t ) 0 , the system (73) is unstable and also non-incremental stability.
Now, design impulsive control u = k = 1 δ ( t t k ) K x including both T-IC and TS-IC, respectively, by which Lorenz system (73) is FTPIS w.r.t. the given boundedness B 0 .
Under the impulsive control, the system (73) becomes
x ˙ = A x + B ( x ) x + ϕ ( t ) x , x + = x + K x .
Note that B T ( x ) + B ( x ) = 0 x 3 x 2 x 3 0 0 x 2 0 0 , λ max ( B T ( x ) + B ( x ) ) = x 2 2 + x 3 2 x L .
Let U ( z 1 , z 2 ) = ( z 1 z 2 ) T P ( z 1 z 2 ) with P = 1 2 I , where I is the unity matrix. Then, we obtain P ( A + B ( x ) ) + ( A + B ( x ) ) T P + 2 ϕ ( t ) P ( ρ + σ ( t ) ) P , with ρ = L + 2 λ max ( A + A T 2 ) 45.2756 , and σ ( t ) = 2 ϕ ( t ) .
Case-I. FTPIS w.r.t. B via T-IC: For a bound B = 0.5 and the system (73) with ϕ ( t ) = 10 1 + t 2 and ξ = ( 1 , 0 , 1.5 ) T and η = ( 1 , 3 , 2.5 ) T as the initial states, T-IC u = k = 1 δ ( t t k ) K x with t 0 = 0 is set to satisfy the algorithm:
K = 0.68 I ; t k = t k 1 + γ d α = t k 1 + 0.0500 , 1 k k ˜ min ( 1 ) , k ˜ min ( 1 ) = 1 γ ln λ min ( P ) B 2 U ( ξ , η ) e d = 94 ; t k = t k 1 + 0.0505 , k > k ˜ min ( 1 ) = 94 ,
where k ˜ min ( 1 ) = 94 with d = 2 ln 0.32 = 2.2789 , γ = 0.015 > 0 .
By Theorem 3, then, Lorenz system (73) is FTPIS w.r.t. B by T-IC satisfying (75) with the settling time S ( 1 ) ( ξ η , B , T ) t k ˜ min ( 1 ) = 4.7 . 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 S ( 1 ) ( ξ η , B , T ) = t k min ( 1 ) = 0.85 with k min ( 1 ) = 17 .
Case-II. FTPIS w.r.t. B via TS-IC: For the bound B = 0.5 and (73) with same ϕ ( t ) and the initial states as in Case-I, i.e., ϕ ( t ) = 10 1 + t 2 , ξ = ( 1 , 0 , 1.5 ) T , and η = ( 1 , 3 , 2.5 ) T , TS-IC u = k = 1 δ ( t t k ) K x with t 0 = 0 is set to satisfy the algorithm:
K = 0.68 I ; t k = t k 1 + γ d α = t k 1 + 0.0500 , 1 k k min ( 2 ) , k min ( 2 ) min { k : e ( t k ) B } , t k = min { s : s > t k 1 , e ( s ) B } , k > k min ( 2 ) ,
where d = 2 ln 0.32 = 2.2789 and γ = 0.015 > 0 .
By Theorem 4, the system (73) is FTPIS w.r.t. B by TS-IC satisfying (76) with the settling time S ( 2 ) ( ξ η , B , T ) = t k min ( 2 ) = 0.65 with k min ( 2 ) = 13 . The simulation is given in Figure 2.
Case-III. FTPIS w.r.t. B via S-IC: For the bound B = 0.5 and (73) with with same ϕ ( t ) and the initial states as in Case-I and Case-II, i.e., ϕ ( t ) = 10 1 + t 2 , ξ = ( 1 , 0 , 1.5 ) T , and η = ( 1 , 3 , 2.5 ) T , S-IC u = k = 1 δ ( t t k ) K x with t 0 = 0 is set to satisfy the S-IC algorithm:
K = 0.68 I ; t k = min { t : t Ψ k 1 } , i f Ψ k 1 Ø , otherwise t k = t k 1 + Δ , 1 k k min ( 3 ) , k min ( 3 ) min { k : e ( t k ) B } ; t k = min { s : s > t k 1 , e ( s ) B } , k > k min ( 3 ) ,
where Ψ 0 = { t : t ( t 0 , t 0 + Δ ] , e ( t ) e γ d 2 e ( t 0 ) } , Ψ k 1 = { t : t ( t k 1 , t k 1 + Δ ] , e ( t ) e γ 2 e ( t k 1 ) } for k 2 , d = 2 ln 0.32 = 2.2789 , γ = 0.015 > 0 , and the check-period Δ = 1 > d α = 0.0505 . By Theorem 5, the system (73) is FTPIS w.r.t. B by S-IC satisfying (77) with the settling time S ( 3 ) ( ξ η , B , T ) = t k min ( 3 ) = 2.8491 with k min ( 3 ) = 26 . 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, ξ = ( 1 , 0 , 1.5 ) T and η = ( 4 , 3 , 2.5 ) T .
Here, the performances including the settling time S ( ξ η , B , T ) (here, S ( ξ η , B , T ) = t k min ), the minimum number k min of impulses required for achieving settling time, and the total number of impulses N ( 0 , t ] during ( 0 , t ] , and the impulse frequency (I.F.) F I ( 0 , t ] during ( 0 , t ] , 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 e ( t ) B , than S-IC and TS-IC. S-IC has the lowest I.F., but S-IC has the longest settling time.

6. Conclusions

In this paper, the finite-time practical incremental stability (FTPIS) for impulsive systems and the FTPIS-based impulsive control design have been studied. The notions of FTPIS and finite-time practical stability (FTPS) were proposed. By using the Lyapunov-like function method, criteria of FTPIS and FTPIS settling time estimates were derived. The results were used to design 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), have been designed respectively for FTPIS. One example on the practical finite-time tracking was presented for the effectiveness of theoretical results. Both theoretical results and numerical simulations have shown that TS-IC can achieve the best performance 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. Moreover, the designed TS-IC improves the mechanism of impulsive control in the literature, which is either time-triggered or state-triggered. The proposed FTPIS-based impulsive control including TS-IC and S-IC may be a control tool for FTS of practical systems with uncertainties and disturbances. For the future work, the FTPIS-based impulsive control for finite-time load frequency control of microgrids and the precision control of missile dynamics will be possible application areas.

Author Contributions

Conceptualization, B.L.; methodology, M.-H.J. and D.-N.L.; software, L.L. and M.-H.J.; formal analysis, D.-N.L.; investigation, D.-N.L., L.L., B.L. and M.-H.J.; resources, B.L.; data curation, L.L. and M.-H.J.; writing—original draft, B.L.; writing—review & editing, B.L.; project administration, D.-N.L. and B.L.; funding acquisition, D.-N.L. and B.L. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (No. 62073132), the Excellent Youth Fund Project of Hunan Provincial Department of Education (No. 23B0568), and the Hunan Provincial Natural Science Foundation of China (No. 2025JJ50402).

Data Availability Statement

The data presented in this study are available on request from the corresponding author due to protection of an ongoing study.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Fromion, V.; Monaco, S.; Normand-Cyrot, D. Asymptotic properties of incrementally stable systems. IEEE Trans. Autom. Control 1996, 41, 721–723. [Google Scholar] [CrossRef] [Scilit]
  2. Fromion, V.; Scorletti, G.; Ferreres, G. Nonlinear performance of a PI controlled missile: An explanation. Int. J. Robust Nonlinear Control 1999, 9, 485–518. [Google Scholar] [CrossRef]
  3. Angeli, D. A Lyapunov approach to incremental stability properties. IEEE Trans. Autom. Control 2002, 47, 410–421. [Google Scholar] [CrossRef] [Scilit]
  4. Franci, A.; Chaillet, A.; Pasillas-Lepine, W. Phase-locking between Kuramoto oscillators: Robustness to time-varying natural frequencies. In Proceedings of the IEEE Conference on Decision and Control, Atlanta, GA, USA, 15–17 December 2010; IEEE: New York, NY, USA, 2010; pp. 1587–1592. [Google Scholar]
  5. Girard, A.; Pola, G.; Tabuada, P. Approximately bisimilar symbolic models for incrementally stable switched systems. IEEE Trans. Autom. Control 2009, 55, 116–126. [Google Scholar] [CrossRef] [Scilit]
  6. Zamani, M.; van de Wouw, N. Controller synthesis for incremental stability: Application to symbolic controller synthesis. In Proceedings of the European Control Conference, Zurich, Switzerland, 17–19 July 2013; IEEE: New York, NY, USA, 2013; pp. 2198–2203. [Google Scholar]
  7. Richter, J.H.; Heemels, W.P.M.H.; van de Wouw, N.; Lunze, J. Reconfigurable control of piecewise affine systems with actuator and sensor faults: Stability and tracking. Automatica 2011, 47, 678–691. [Google Scholar] [CrossRef] [Scilit]
  8. Hamadeh, A.; Stan, G.-B.; Sepulchre, R.; Goncalves, J. Global state synchronization in networks of cyclic feedback systems. IEEE Trans. Autom. Control 2012, 57, 478–483. [Google Scholar] [CrossRef] [Scilit]
  9. Russo, G.; di Bernardo, M. Contraction theory and master stability function: Linking two approaches to study synchronization of complex networks. IEEE Trans. Circuits Syst. II 2009, 56, 177–181. [Google Scholar] [CrossRef] [Scilit]
  10. Liu, T.; Hill, D.J.; Zhao, J. Output synchronization of dynamical networks with incrementally dissipative nodes and switching topology. IEEE Trans. Circuits Syst. I Regul. Pap. 2015, 62, 2312–2323. [Google Scholar] [CrossRef] [Scilit]
  11. Rantzer, A. A performance criterion for antiwindup compensators. Eur. J. Control 2000, 6, 449–452. [Google Scholar] [CrossRef] [Scilit]
  12. Giaccagli, M.; Astolfi, D.; Andrieu, V.; Marconi, L. Incremental stabilization of cascade nonlinear systems and harmonic regulation: A forwarding-based design. IEEE Trans. Autom. Control 2024, 69, 4828–4835. [Google Scholar] [CrossRef] [Scilit]
  13. Ruffer, B.S.; van de Wouw, N.; Mueller, M. Convergent systems vs. incremental stability. Syst. Control Lett. 2013, 62, 277–285. [Google Scholar] [CrossRef] [Scilit]
  14. Waitman, S.; Bako, L.; Massioni, P.; Scorletti, G.; Fromion, V. Incremental stability of Lur’e systems through piecewise-affine approximations. IFAC-PapersOnLine 2017, 50, 1673–1679. [Google Scholar] [CrossRef] [Scilit]
  15. Lohmiller, W.; Slotine, J.-J.E. On contraction analysis for nonlinear systems. Automatica 1998, 34, 683–696. [Google Scholar] [CrossRef] [Scilit]
  16. Lohmiller, W.; Slotine, J.-J.E. Control system design for mechanical systems using contraction theory. IEEE Trans. Autom. Control 2000, 45, 984–989. [Google Scholar] [CrossRef] [Scilit]
  17. Jouroy, J. A simple extension of contraction theory to study incremental stability properties. In Proceedings of the European Control Conference, Cambridge, UK, 1–4 September 2003; IEEE: New York, NY, USA, 2003. [Google Scholar]
  18. Jouroy, J.; Fossen, T.I. A tutorial on incremental stability analysis using contraction theory. Model. Identif. Control 2010, 31, 93–106. [Google Scholar]
  19. Fiore, D.; Hogan, S.J.; di Bernardo, M. Contraction analysis of switched systems via regularization. Automatica 2016, 73, 279–288. [Google Scholar] [CrossRef] [Scilit]
  20. Rifai, K.E.; Slotine, J.-J.E. Compositional contraction analysis of resetting hybrid systems. IEEE Trans. Autom. Control 2006, 51, 1536–1541. [Google Scholar] [CrossRef] [Scilit]
  21. Jiang, H.; Bi, Q. Contraction theory based synchronization analysis of impulsively coupled oscillators. Nonlinear Dyn. 2012, 67, 781–791. [Google Scholar] [CrossRef] [Scilit]
  22. Li, X.; Bohner, M.; Wang, C.-K. Impulsive differential equations: Periodic solutions and applications. Automatica 2015, 52, 173–178. [Google Scholar] [CrossRef] [Scilit]
  23. Xu, H.; Zhu, Q.; Zheng, W.X. Exponential stability of stochastic nonlinear delay systems subject to multiple periodic impulses. IEEE Trans. Autom. Control 2024, 69, 2621–2628. [Google Scholar] [CrossRef] [Scilit]
  24. Liu, B.; Xu, B.; Sun, Z. Incremental stability and contraction via impulsive control for continuous-time dynamical systems. Nonlinear Anal. Hybrid Syst. 2021, 39, 100981. [Google Scholar] [CrossRef] [Scilit]
  25. Kawano, Y.; Cao, M. Contraction analysis of virtually positive systems. Syst. Control Lett. 2022, 168, 105358. [Google Scholar] [CrossRef] [Scilit]
  26. Gokul, P.; Soundararajan, G.; Kashkynbayev, A.; Rakkiyappan, R. Finite-time contractive stability for fractional-order nonlinear systems with delayed impulses: Applications to neural networks. Neurocomputing 2024, 610, 128599. [Google Scholar] [CrossRef] [Scilit]
  27. Zhang, L.; Guo, W. Finite-time contraction stability and optimal control for mosquito population suppression model. Mathematics 2024, 12, 22. [Google Scholar] [CrossRef] [Scilit]
  28. Yang, X.; Li, X. Finite-time stability of nonlinear impulsive systems with applications to neural networks. IEEE Trans. Neural Netw. Learn. Syst. 2023, 34, 243–251. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  29. Bhat, S.P.; Bernstein, D.S. Finite-time stability of continuous autonomous systems. SIAM J. Control Optim. 2000, 38, 751–766. [Google Scholar] [CrossRef] [Scilit]
  30. Moulay, E.; Perruquetti, W. Finite time stability and stabilization of a class of continuous systems. J. Math. Anal. Appl. 2006, 323, 1430–1443. [Google Scholar] [CrossRef] [Scilit]
  31. Hong, Y.; Jiang, Z.-P.; Feng, G. Finite-time input-to-state stability and applications to finite-time control design. SIAM J. Control Optim. 2010, 48, 4395–4418. [Google Scholar] [CrossRef] [Scilit]
  32. He, X.; Li, X.; Nieto, J.J. Finite-time stability and stabilization for time-varying systems. Chaos Solit. Fractals 2021, 148, 111076. [Google Scholar] [CrossRef] [Scilit]
  33. Yu, X.; Yin, J.; Khoo, S. Generalized Lyapunov criteria on finite-time stability of stochastic nonlinear systems. Automatica 2019, 107, 183–189. [Google Scholar] [CrossRef] [Scilit]
  34. Yan, Z.; Zhou, X.; Chang, G.; Gao, Z. Finite-time annular domain stability and stabilization of stochastic systems with semi-Markovian switching. IEEE Trans. Autom. Control 2023, 68, 6247–6254. [Google Scholar] [CrossRef] [Scilit]
  35. Zhu, Z.; Liao, S.; Jia, F. Nonovershooting prescribed finite-time control for nonlinear pure-feedback systems. Complex Syst. Stab. Control 2025, 1, 4. [Google Scholar]
  36. Amato, F.; Ambrosino, R.; Ariola, M.; Cosentino, C. Finite-time stability of linear time-varying systems with jumps. Automatica 2009, 45, 1354–1358. [Google Scholar] [CrossRef] [Scilit]
  37. Cheng, M.; Zhao, J.; Xie, X.; Sun, Z.-Y. A novel finite-time stability criteria and controller design for nonlinear impulsive systems. Appl. Math. Comput. 2024, 479, 128876. [Google Scholar] [CrossRef] [Scilit]
  38. Liang, Z.; Liu, X. Finite-time hybrid impulsive formation tracking control of multi-agent systems via aperiodic intermittent communication. ISA Trans. 2024, 155, 20–33. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  39. Xing, Y.; He, X.; Li, X. Finite-time stabilization of nonlinear time-varying systems involving impulsive action. Commun. Nonlinear Sci. Numer. Simul. 2024, 131, 107818. [Google Scholar] [CrossRef] [Scilit]
  40. Jiang, M.-H.; Liu, B.; Mo, S.-H.; Liu, D.-H. Finite-time practical stability of impulsive systems with application to design of impulsive control. Asian J. Control 2025. [Google Scholar] [CrossRef] [Scilit]
  41. Zhang, T.; Cao, J.; Li, X. Lyapunov conditions for finite-time input-to-state stability of impulsive switched systems. IEEE/CAA J. Autom. Sin. 2024, 11, 1057–1059. [Google Scholar] [CrossRef] [Scilit]
  42. Fu, L.; Peng, S.; Wang, J. Semiglobal finite-time stability of impulsive systems. IEEE Trans. Circuits Syst. I Regul. Pap. 2025, 72, 932–940. [Google Scholar] [CrossRef] [Scilit]
  43. Li, X.; Ho, D.W.C.; Cao, J. Finite-time stability and settling-time estimation of nonlinear impulsive systems. Automatica 2019, 99, 361–368. [Google Scholar] [CrossRef] [Scilit]
  44. Ai, Z.; Zong, G. Finite-time stochastic input-to-state stability of impulsive switched stochastic nonlinear systems. Appl. Math. Comput. 2014, 245, 462–473. [Google Scholar]
  45. Hu, H.; Gao, B.; Xu, L. Finite-time and fixed-time attractiveness for nonlinear impulsive systems. IEEE Trans. Autom. Control 2022, 67, 5586–5593. [Google Scholar] [CrossRef] [Scilit]
  46. Liu, Y.; Liu, B.; Fu, Z.; Yang, X. Exponential input-to-state stability of load frequency control system of island microgrid with time-delay under aperiodic intermittent control. Asian J. Control 2025, 27, 2940–2949. [Google Scholar] [CrossRef] [Scilit]
  47. Dashkovskiy, S.; Feketa, P. Input-to-state stability of impulsive systems and their networks. Nonlinear Anal. Hybrid Syst. 2017, 26, 190–200. [Google Scholar] [CrossRef] [Scilit]
  48. Mancilla-Aguilar, J.L.; Haimovich, H.; Feketa, P. Uniform stability of nonlinear time-varying impulsive systems with eventually uniformly bounded impulse frequency. Nonlinear Anal. Hybrid Syst. 2020, 38, 100933. [Google Scholar] [CrossRef] [Scilit]
  49. Li, P.; Liu, B.; Jiang, M.-H.; Cheng, J.; Wang, X. Input-delayed time/event-triggered intermittent control for incremental stability. ISA Trans. 2026. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  50. Yang, T. Impulsive Control Theory; Springer: Berlin, Germany, 2001. [Google Scholar]
  51. Haddad, W.M.; Chellaboina, V.-S.; Nersesov, S.G. Impulsive and Hybrid Dynamical Systems; Princeton University Press: Princeton, NJ, USA, 2006. [Google Scholar]
  52. Ai, Z.; Peng, L.; Zong, G.; Shi, K. Impulsive control for nonlinear systems under DoS attacks: A dynamic event-triggered method. IEEE Trans. Circuits Syst. II Express Briefs 2022, 69, 3839–3843. [Google Scholar] [CrossRef] [Scilit]
  53. Chen, W.-H.; Xu, W.; Zheng, W.X. Sliding-mode-based impulsive control for a class of time-delay systems with input disturbance. Automatica 2024, 164, 111633. [Google Scholar] [CrossRef] [Scilit]
  54. Liu, B.; Sun, Z.; Li, M.; Liu, D.-N. Stabilization via event-triggered impulsive control with constraints for switched stochastic systems. IEEE Trans. Cybern. 2022, 52, 11834–11846. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  55. Lakshmikantham, V.; Bainov, D.D.; Simeonov, P.S. Theory of Impulsive Differential Equations; World Scientific: Singapore, 1989. [Google Scholar]
Figure 1. (Top) The error state e ( t ) = x ( t , ξ ) y ( t , η ) under T-IC satisfying (75) for Lorenz system (73), where x ( t , ξ ) and y ( t , η ) are the solutions of the system (74) with initial states ξ and η , respectively. (Bottom) FTPIS of Lorenz system (73) via T-IC satisfying (75).
Figure 1. (Top) The error state e ( t ) = x ( t , ξ ) y ( t , η ) under T-IC satisfying (75) for Lorenz system (73), where x ( t , ξ ) and y ( t , η ) are the solutions of the system (74) with initial states ξ and η , respectively. (Bottom) FTPIS of Lorenz system (73) via T-IC satisfying (75).
Mathematics 14 01657 g001
Figure 2. (Top) The error state e ( t ) = x ( t , ξ ) y ( t , η ) under TS-IC satisfying (76) for Lorenz system (73), where x ( t , ξ ) and y ( t , η ) are the solutions of the system (68) with initial states ξ and η , respectively. (Bottom) FTPIS of Lorenz system (73) via TS-IC satisfying (76).
Figure 2. (Top) The error state e ( t ) = x ( t , ξ ) y ( t , η ) under TS-IC satisfying (76) for Lorenz system (73), where x ( t , ξ ) and y ( t , η ) are the solutions of the system (68) with initial states ξ and η , respectively. (Bottom) FTPIS of Lorenz system (73) via TS-IC satisfying (76).
Mathematics 14 01657 g002
Figure 3. (Top) The error state e ( t ) = x ( t , ξ ) y ( t , η ) under S-IC satisfying (77) for Lorenz system (73), where x ( t , ξ ) and y ( t , η ) are the solutions of (74) with initial states ξ and η , respectively. (Bottom) FTPIS of Lorenz system (73) via S-IC satisfying (77).
Figure 3. (Top) The error state e ( t ) = x ( t , ξ ) y ( t , η ) under S-IC satisfying (77) for Lorenz system (73), where x ( t , ξ ) and y ( t , η ) are the solutions of (74) with initial states ξ and η , respectively. (Bottom) FTPIS of Lorenz system (73) via S-IC satisfying (77).
Mathematics 14 01657 g003
Figure 4. (Top) The error state e ( t ) = x ( t , ξ ) y ( t , η ) under T-IC satisfying (75) for Lorenz system (73), where x ( t , ξ ) and y ( t , η ) are the solutions of the system (74) with ξ = ( 1 , 0 , 1.5 ) T , η = ( 4 , 3 , 2.5 ) T , respectively. (Bottom) FTPIS of Lorenz system (73) via T-IC satisfying (75).
Figure 4. (Top) The error state e ( t ) = x ( t , ξ ) y ( t , η ) under T-IC satisfying (75) for Lorenz system (73), where x ( t , ξ ) and y ( t , η ) are the solutions of the system (74) with ξ = ( 1 , 0 , 1.5 ) T , η = ( 4 , 3 , 2.5 ) T , respectively. (Bottom) FTPIS of Lorenz system (73) via T-IC satisfying (75).
Mathematics 14 01657 g004
Figure 5. (Top) The error state e ( t ) = x ( t , ξ ) y ( t , η ) under TS-IC satisfying (76) for Lorenz system (73), where x ( t , ξ ) and y ( t , η ) are the solutions of the system (68) with ξ = ( 1 , 0 , 1.5 ) T , η = ( 4 , 3 , 2.5 ) T , respectively. (Bottom) FTPIS of Lorenz system (73) via TS-IC satisfying (76).
Figure 5. (Top) The error state e ( t ) = x ( t , ξ ) y ( t , η ) under TS-IC satisfying (76) for Lorenz system (73), where x ( t , ξ ) and y ( t , η ) are the solutions of the system (68) with ξ = ( 1 , 0 , 1.5 ) T , η = ( 4 , 3 , 2.5 ) T , respectively. (Bottom) FTPIS of Lorenz system (73) via TS-IC satisfying (76).
Mathematics 14 01657 g005
Figure 6. (Top) The error state e ( t ) = x ( t , ξ ) y ( t , η ) under S-IC satisfying (77) for Lorenz system (73), where x ( t , ξ ) and y ( t , η ) are the solutions of (74) with ξ = ( 1 , 0 , 1.5 ) T , η = ( 4 , 3 , 2.5 ) T , respectively. (Bottom) FTPIS of Lorenz system (73) via S-IC satisfying (77).
Figure 6. (Top) The error state e ( t ) = x ( t , ξ ) y ( t , η ) under S-IC satisfying (77) for Lorenz system (73), where x ( t , ξ ) and y ( t , η ) are the solutions of (74) with ξ = ( 1 , 0 , 1.5 ) T , η = ( 4 , 3 , 2.5 ) T , respectively. (Bottom) FTPIS of Lorenz system (73) via S-IC satisfying (77).
Mathematics 14 01657 g006
Table 1. Data for T-IC satisfying (75), TS-IC satisfying (76), and S-IC satisfying (77), where ξ = ( 1 , 0 , 1.5 ) T , η = ( 1 , 3 , 2.5 ) T , B = 0.5 , and the simulations refer to Figure 1, Figure 2 and Figure 3.
Table 1. Data for T-IC satisfying (75), TS-IC satisfying (76), and S-IC satisfying (77), where ξ = ( 1 , 0 , 1.5 ) T , η = ( 1 , 3 , 2.5 ) T , B = 0.5 , and the simulations refer to Figure 1, Figure 2 and Figure 3.
Impulsive ControlT-ICTS-ICS-IC
S ( ξ η , B , T ) = t k min 0.850.652.8491
k min 171326
N ( 0 , 10 ] 199119103
F I ( 0 , 10 ] 199/10119/10103/10
Table 2. Data for T-IC satisfying (75), TS-IC satisfying (76), and S-IC satisfying (77), where ξ = ( 1 , 0 , 1.5 ) T , η = ( 4 , 3 , 2.5 ) T , B = 0.5 , and the simulations refer to Figure 4, Figure 5 and Figure 6.
Table 2. Data for T-IC satisfying (75), TS-IC satisfying (76), and S-IC satisfying (77), where ξ = ( 1 , 0 , 1.5 ) T , η = ( 4 , 3 , 2.5 ) T , B = 0.5 , and the simulations refer to Figure 4, Figure 5 and Figure 6.
Impulsive ControlT-ICTS-ICS-IC
S ( ξ η , B , T ) = t k min 1.00.811.9835
k min 2016139
N ( 0 , 10 ] 397224224
F I ( 0 , 10 ] 397/20224/20224/2
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Liu, D.-N.; Li, L.; Liu, B.; Jiang, M.-H. Finite-Time Practical Incremental Stability of Impulsive Systems with Application to Design of Impulsive Control. Mathematics 2026, 14, 1657. https://doi.org/10.3390/math14101657

AMA Style

Liu D-N, Li L, Liu B, Jiang M-H. Finite-Time Practical Incremental Stability of Impulsive Systems with Application to Design of Impulsive Control. Mathematics. 2026; 14(10):1657. https://doi.org/10.3390/math14101657

Chicago/Turabian Style

Liu, Dong-Nan, Ling Li, Bin Liu, and Ming-Han Jiang. 2026. "Finite-Time Practical Incremental Stability of Impulsive Systems with Application to Design of Impulsive Control" Mathematics 14, no. 10: 1657. https://doi.org/10.3390/math14101657

APA Style

Liu, D.-N., Li, L., Liu, B., & Jiang, M.-H. (2026). Finite-Time Practical Incremental Stability of Impulsive Systems with Application to Design of Impulsive Control. Mathematics, 14(10), 1657. https://doi.org/10.3390/math14101657

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop