1.
Introduction
The modeling of the vast majority of real engineering systems involves the use of various types of linear or nonlinear dynamic differential equations [1,2,3,4,5,6,7,8,9,10]. Throughout the modeling process, it is inevitable to encounter unknown parameters or functions. If these unknowns are ignored in controller design, control performance may be degraded, or even lead to system instability. Thankfully, many methods have been devised to handle unknowns. FLSs have become a significant method used to deal with uncertainties in the dynamics of nonlinear systems. Since the introduction of fuzzy sets by Zadeh [11], FLSs have been able to approximate any real continuous function on a tight set, which has been further demonstrated in research [12]. In particular, the combination of FLSs with adaptive backstepping techniques to construct adaptive fuzzy controllers has become a considerably effective control technique, and has been applied in a variety of different types of nonlinear systems [16,17].
Despite the aforementioned solutions, it is essential to note that only the infinite-time stability of the system is taken into account. However, in many engineering applications, it is unrealistic for the tracking error to converge to the origin or desired value in an infinite time. Consequently, finite-time techniques have been developed and applied to adaptive control of various types of dynamical systems [18,19,20,21,22]. Li's [23] contribution is notable as he established a new finite-time stability (FTS) criterion for finite-time asymptotic tracking control by introducing a scalar function. Unfortunately, the convergence time may be unacceptably long and the target performance of the system may be difficult to achieve if the initial conditions in finite-time control are too large. Moreover, the convergence time cannot be calculated in cases where the initial conditions are difficult to obtain or unknown.
In 2012, Polyakov [24] introduced fixed-time control as an effective solution to the tracking control problem. His work has been influential, as many scholars have applied fixed-time control to this problem and achieved significant results over the past few years [25,26,27]. Fixed-time techniques have been extensively employed in delay systems [28] and multi-intelligent systems [29,30]. Sun [31] solves the problem of tracking control of UNS affected by actuator saturation. However, unknown factors in actual modeling projects can make tracking errors only converge to an adjustable region rather than zero. With increasing demand for accuracy, achieving practical fixed-time stability (PFXTS) while asymptotically converging to zero is of considerable significance. In recent years, some relevant results [32,33] have emerged. In [32], an event-triggered adaptive fuzzy asymptotic tracking control scheme with prescribed performance was developed for nonlinear pure feedback systems. In [33], an asymptotic predefined-time tracking controller was designed for high-speed aircraft with input quantization and faults. Although both of them can make the tracking error converge to a small neighborhood of zero within a finite time and ultimately converge asymptotically to zero, they are both achieved by combining some control techniques with traditional asymptotic tracking control (ATC) techniques, rather than directly analyzing the AFXTS of the system. It complicates the design process of the controller. Therefore, the main motivation of this paper is to construct an AFXTS determination criterion to simplify the controller design process.
In practical systems, the presence of various constraints is inevitable and requires careful consideration during controller design, as system performance can be affected. Over the past several years, numerous fixed-time control problems with state constraints have been addressed. Current research [34,35,36,37] frequently employs BLF within the framework of backstepping control design to develop controllers for constrained nonlinear systems, which approach infinity near a certain limit. Typically, state constraints in these problems are expressed as constants [38,39,40] or time-varying functions [41,42,43,44]. However, the representation of constraint bounds as a time-dependent and state-variant functional form has recently gained attention as a trending research topic. Pure state constraints, where the constraints on state variables depend directly on time and state variables of systems such as industrial robots, oscillators, and spacecraft, have been studied previously [45,46]. Limited studies have been dedicated to fixed-time control issues under pure state constraints. In this study, the AFXTTC problem is addressed under pure state constraints, building on prior research.
Based on the aforementioned observations, the key contributions of the present study are as follows:
(1) Due to the presence of unknown nonlinear functions and disturbances, it is often challenging for the tracking error to converge to zero, rendering traditional fixed-time methods inapplicable. To address this issue, a new fixed-time stability (FXTS) criterion is proposed in Lemma 1, and a useful tool for analyzing AFXTS is constructed in Lemma 2 on its basis.
(2) We introduce a first-order filter along with the backstepping method to construct a DSC framework to avoid the complexity explosion problem. Based on this, we have developed an adaptive fuzzy asymptotic fixed-time controller using BLF and FLSs. It not only can achieve AFXTTC, but also guarantees that the entire state is confined within a specified range.
(3) Different from [32,33], this paper directly uses the AFXTS criterion to analyze the system's AFXTS. It not only simplifies the controller design process, but also ensures that the remaining signals of the closed-loop system are not only bounded but also PFXTS.
(4) Different from constant state constraints [38,39,40] and time-varying state constraints [41,42,43,44], the proposed control scheme in this paper can guarantee pure state constraints, which is more in line with the needs of some practical systems. Currently, there is relatively little research on this type of state constraint, especially for the tracking control problem of UNS.
Additional sections of this paper are organized as follows. Section 2 gives problem formulation and necessary preparation. In Section 3, we provide the design process for the controller. And the stability analysis is given in Section 4. The simulations are illustrated in Section 5. Finally, the conclusion is given in Section 6.
2.
System description and preliminaries
2.1. Asymptotic fixed-time stability
Consider the following nonlinear system:
where v=[v1,v2,…,vn]T∈Rn is the system state, and f: R×Rn→Rn is a nonlinear function vector.
Definition 1. [24] The origin of system (2.1) is the FXTS if, for each ε > 0, there is δ = δ(ε,0) > 0 such that for all ‖v0‖ < δ and t ≥ 0, the solution ‖v(t,v0)‖ < ε, and ∃ Tp > 0, ∀ v0 ∈ Rn, ‖v‖ = 0 for all t > Tp.
Definition 2. [31] The origin of system (2.1) is the PFXTS if ∃ Δ > 0, ∃ Tp > 0, ∀ v0 ∈ Rn, ‖v‖ < Δ for all t > Tp.
Definition 3. The origin of system (2.1) is the AFXTS if ∃ Δ > 0, ∃ Tp > 0, ∀ v0 ∈ Rn, ‖v‖ < Δ for all t > Tp, and ‖v‖ → 0 as t → ∞.
Lemma 1. The origin of system (2.1) is the FXTS if there exists a continuous, continuous differentiable, and positive definitefunction W : Rn→R≥0 such that
where r1,r2>0, 0<m<1, n>1, μ>0. Moreover, the settling time can be given by the following equation
Proof. See the Appendix. □
Lemma 2. The origin of system (2.1) is the AFXTS if there exists a continuous, continuous differentiable, and positive definite function W : Rn→R≥0 such that
where r1,r2,r3,b>0, 0<m<1, n>1, μ>0. Moreover, the settling time can be given by the following equation
Proof. See the Appendix. □
Remark 1. Inspired by reference [47], the notion of AFXTS was introduced in the Definition 3, providing theoretical support for the design of AFXTTC schemes and stability analysis. The advantages of the AFXTTC scheme over some existing tracking control schemes are apparent. On one hand, compared to ATC schemes based on asymptotic stability, the AFXTTC scheme not only guarantees asymptotic convergence of tracking errors to zero but also ensures fast convergence of tracking errors to a tiny neighborhood of zero point. On the other hand, compared to practical fixed-time tracking control (PFXTTC) schemes based on PFXTS, the AFXTTC scheme, while ensuring convergence of tracking errors to a tiny neighborhood of zero point within a fixed time, also achieves asymptotic convergence of tracking errors to zero. The aforementioned advantages are clearly demonstrated in Figure 5 of the Section 5.
Remark 2. In recent years, FTS/FXTS problems have received much research attention. The study of such problems usually requires the assistance of various forms of Lemma 1 [19] or Lemma 1 [31], which requires a positive definite function W satisfying ˙W(x) ≤ −αW(x)−βWm(x)+b or ˙W(x) ≤ −αWm(x)−βWn(x)+b where α,β>0, 0<m<1, n>1 and b is a normal number. Inspired by [23], we establish a new FXTS characterization criterion by introducing a scalar function. Based on this, we provide Lemma 2 as a direct means of analyzing the AFXTS property of a system, which distinguishes our findings from those of [32,33]. Furthermore, for ease of reading, we have provided a glossary of abbreviations of terms in Table 1.
2.2. Problem statements
Regard the following nonlinear strict feedback systems:
where ˉxi=[x1,x2,…,xi]T∈Ri (i=1,2,…,n) is the state vector, u ∈R is the control input, and y ∈R is the system output. fi(ˉxi) is an unknown but smooth nonlinear function. Furthermore, di(t) is a bounded function such that |di(t)| ≤ d∗i with d∗i∈R+, which represents an unknown external disturbance.
Then, the control objective of this paper is to conceive an AFXTTC scheme for the proposed system (2.6) such that it satisfies the following conditions:
O1: The tracking error y−yd must converge to a tiny neighborhood of zero point within a fixed time and asymptotically converge to zero, where y is the output of system (2.6) and yd is the reference signal.
O2: All signals of closed-loop systems must remain bounded within a fixed time.
O3: Full state are constrained as |xi|<Ψi(ˇxi−1,t) with ˇx1=yd and ˇxi−1=[yd,x1,…,xi−1]T∈Ri (i=2,…,n), where Ψi(ˇxi−1,t)∈R is a known time-varying function of state variables and time.
To accomplish these goals, some of the required assumptions are given below:
Assumption 1. [46] For ∀t≥0, ∂ψi∂yd, ∂ψi∂x1, …, ∂ψi∂xi−1 are exist and bounded, where ψi is a constraint on error variable, i.e., ψi=Ψi−ωi, where the definition of ωi will be given at the beginning of Section 3.
Assumption 2. [39] yd and ˙yd are bounded, smooth and known with |yd| < Ψ1(yd,t). In addition, |xi(0)| < Ψi(ˇxi−1(0),0).
Remark 3. Based on our survey, there is a noticeable dearth of research on tracking control problems involving pure state constraints. Compared to general state constraints, pure state constraints are more practical, rendering tracking problems with pure state constraints more significant and worthy of investigation. Different from previous studies, such as [45], the present inquiry focuses on systems containing uncertain nonlinear functions, making the systems more general while also incorporating an unknown disturbance term to enhance the control system's reliability. Moreover, previous research studies [45,46] focused on infinite time stability, whereas our study explores AFXTS problems. All these aforementioned discrepancies underscore the heightened significance of our present study, which are reflected in Table 2.
Remark 4. Similar to [46], it is necessary to use FLSs for handling the unknown terms that arise from taking derivatives of pure state constraint functions, which requires assuming Assumption 1 to ensure that these terms are confined to a compact set for approximation with FLSs. This is also the difficulty inherent in solving pure state constraint problems, and relaxing these assumption conditions represents one of our future research directions. Assumption 2 is indispensable in solving state constraint problems since if the initial value of the system state does not satisfy the constraint conditions, achieving the control objective is impossible.
2.3. Some useful lemmas
Then, we introduce some useful lemmas:
Lemma 3. [46] Consider the continuous function H(χ), which is provided for the compact set Ω. Then, for ∀ε>0, there exists the FLS: F(χ) = ΘTΦ(χ) such that supχ∈Ω|H(χ)−ΘTΦ(χ)| ≤ ε, where χ=[χ1,…,χn]T and F are the input and output of the FLS, Θ=[Θ1,…,Θq]T, q≥1 is the number of fuzzy rules, Φ=[Φ1,…,Φq]T, and Φl=∏ni=1μFli(χi)∑ql=1[∏ni=1μFli(χi)], where μFli(χi) is commonly selected as a Gaussian function.
Lemma 4. [26] For arbitrary τ>0 and x∈R, an inequality holds for the following: 0<|x|−xtanh(xτ)≤0.2785τ.
Lemma 5. [26] For arbitrary variable ak∈R, k=1,…,m, and a positive real number γ>0, an inequality holds for the following:
Lemma 6. [26] For any real variables ζ1, ζ2, positive constants a1, a2, and a3, there exists an inequality as follows:
Lemma 7. [26] Consider any variable of real numbers α≥0, β>0 and arbitrary real numbers γ>0, the following inequality holds: αγ(β−α)≤11+γ(β1+γ−α1+γ).
Lemma 8. [26] For any real numbers ρ>0, ϱ≤ρ and any constant m>1, the following inequality holds: (ρ−ϱ)m≥ϱm−ρm.
Lemma 9. [45] For arbitrary x,y∈R, |x|<|y|, an inequality holds for the following: x2y2<lny2y2−x2<x2y2−x2.
3.
Control design
In this section, the controller u will be synthesized through the implementation of both DSC and adaptive fuzzy control scheme techniques, while BLF methodology will be employed to ensure the constraint is consistently satisfied.
Define the following coordinate transformation:
where v1 is the tracking error, vi(i=2,3,…,n) is dynamic surface error, αi−1 is the virtual controller to be designed in step i−1, ω1=yd and ωi is the output of the following first-order command filter
where ιi>0 is a design constant and si is first order filter output error.
For achieving asymptotic tracking control, we perform the following error transformation
where μ>0.
Step 1. From (3.1), (3.3) and (3.5), one has
Then choose the Lyapunov function as
where ψ1(yd,t)=Ψ1(yd,t)−yd, ˜θ1=θ∗1−ˆθ1, θ∗1 is the norm of the unknown optimal parameters of FLSs and ˆθ1 is the estimate of θ∗1.
Combining (3.6), the time derivative of W1 is
where Q1=ψ21−z21.
Using Young's inequality, we get
Then, it produces
Let
According to Lemma 3, we have
where χ1=[ˉx1,yd,˙yd,ψ1,∂ψ1∂yd,1eμt]T.
Clearly we have
with θ∗1=‖ΘT1‖, ϕ1=‖Φ1‖.
Then substituting (3.11)–(3.13) into (3.10) yields
The virtual control α1 the parameter adaptive rules for θ∗1 is chosen as
where k11, k12, k13, B1, τ1, σ11, σ12 are positive constants, p1=2m−12m+1, p2=2m+12m−1 with m≥2 is an integer.
Next, substituting (3.15) and (3.16) into (3.14) yields
Utilizing Young's inequality and Lemma 4 results in
where C1 = max{0,(ε1−B1)} is a positive number. If B1 is selected to satisfy B1≥ε1, we have C1=0.
Putting (3.18) into (3.17) yields
where D1=12d∗21+0.2785τ1+12C21.
Step ⅰ. From (3.2), (3.3), and (3.5), one has
Then choose the Lyapunov function as
where ψi(ˇxi−1,t)=Ψi(ˇxi−1,t)−ωi, ˜θi=θ∗i−ˆθi, θ∗i is the norm of the unknown optimal parameters of FLSs and ˆθi is the estimate of θ∗i.
The time derivative of Wi is
where Qi=ψ2i−z2i.
Utilizing Young's inequality, we have
Then, one has
Let
Combining Lemma 3, one has
where χi=[ˉxi,˙yd,ωi,αi−1,ψi,∂ψi∂yd,∂ψi∂x1,…,∂ψi∂xi−1,ψi−1,ωi−1,1eμt]T.
Obviously, we have
with θ∗i=‖ΘTi‖, ϕi=‖Φi‖.
From (3.25)–(3.27), we can obtain that
The virtual control αi the parameter adaptive rules for θ∗i is chosen as
where ki1, ki2, ki3, Bi, τi, σi1, σi2 are positive constants.
Then substituting (3.29) and (3.30) into (3.28) yields
Similar to Step 1, utilizing Young's inequality and Lemma 4 results in
where Ci=max{0,(εi−Bi)} is a positive number. If Bi is selected to satisfy Bi≥εi, we have Ci=0.
Putting (3.32) into (3.31) obtains
where Di=12∑ij=1(i−j+1)d∗2j+0.2785∑ij=1τj+12∑ij=1C2j.
Step n. Similar to Step i, zn is given by
Define
where ψn(ˇxn−1,t)=Ψn(ˇxn−1,t)−ωn, ˜θn=θ∗n−ˆθn, θ∗n is the norm of the unknown optimal parameters of FLSs and ˆθn is the estimate of θ∗n.
The time derivative of Wn is
where Qn=ψ2n−z2n.
Using Young's inequality, one has
Then, we have
Let
Based on Lemma 3, one has
where χn=[ˉxn,˙yd,ωn,αn−1,ψn,∂ψn∂yd,∂ψn∂x1,…,∂ψn∂xn−1,ψn−1,ωn−1,1eμt]T.
Clearly we have
with θ∗n=‖ΘTn‖, ϕn=‖Φn‖.
By incorporating (3.39)–(3.41) into (3.38), we have
The virtual control αn the parameter adaptive rules for θ∗n is chosen as
where kn1, kn2, kn3, Bn, τn, σn1, σn2 are positive constants.
Substituting (3.43) and (3.44) into (3.42) yields
Similar to Step 1, according to Young's inequality and Lemma 4
where Cn=max{0,(εn−Bn)} is a positive number. If Bn is selected to satisfy Bn≥εn, we have Cn=0.
Substituting (3.46) into (3.45) yields
where Dn = 12 ∑nj=1 (n−j+1) d∗2j +0.2785 ∑nj=1 τj +12∑nj=1C2j.
To date, we have formulated the virtual controller (3.15), (3.29), the controller (3.43), and the adaptive rule (3.16), (3.30), and (3.44). The adaptive control scheme flow chart, as depicted in Figure 1, outlines the proposed methodology. In the subsequent section, we shall conduct an analysis of system stability to substantiate the theoretical capability of our control scheme to attain the desired control objective.
4.
Asymptotic fixed-time stability analysis
Then, the main results of this study will be summarized.
Theorem 1. For the nonlinear strict feedback system (2.6), if it is achievable that Assumptions 1 and 2, by devising an adaptive fuzzy controller (3.43), virtual controllers (3.15), (3.29), and adaptive laws (3.16), (3.30), and (3.44), it is ensured that all signals of the closed-loop system are PFXTS, and the tracking error y−yd, is capable of converging to a small neighborhood of zero within a fixed time, and ultimately asymptotically converging to zero. At the same time, all of the state variables never violate their constraints.
Proof. Let
By combining Lemma 5, we can obtain that
where k1 = min{k11,…,kn1}, k2 = min{k12, …, kn2}, k3 = min{k13,…,kn3}.
Base on ˜θi=θ∗i−ˆθi, we have
According to Lemma 6, let ζ1=σi14˜θ2i, ζ2=1, a1=p1, a2=1−p1, a3=p−11, we get
From (4.2) and (4.3), we can get
Then, utilizing Lemma 7, we have
And applying Lemma 8 to (4.5), one has
Putting (4.4) and (4.6) in (4.1), we have
where σ1 = min {(σ112)p1, …, (σn12)p1}, σ2= min {σ1221−p2p2, …, σn221−p2p2}, σ3 = min {σ112, …, σn12}, D = Dn +∑ni=1σi12θ∗2i +n(1−p1)pp11−p11 +∑ni=1σi2p2θ∗2p2i.
According to Lemma 5, we get
where r1 = min {k1,σ1}, r2 = min {k2n1−p2, σ2n1−p2}, r3 = min {k3, σ3}.
Using Lemma 9, we have
By Lemma 2, W is PFXTS, so lnψ2iψ2i−z2i, ˜θi are PFXTS. Furthermore, it can be inferred that |xi|<Ψi(ˇxi−1,t). Meanwhilewe, we can know ˆθi is PFXTS due to the PFXTS of ˜θi. And the tracking error x1−yd is AFXTS with the fixed time
□
Remark 5. In the present study, the fuzzy adaptive controller constructed by constructing a Lyapunov function analysis on z can make z bounded. Since z = eμtv, that is, v=e−μtz, v clearly converges to zero when t→∞, which explains why the introduction of the scalar function eμt in Lemma 2 enables the follow-up error to narrow to zero. Such findings are also reflected in Figure 4(a) in the simulation.
Remark 6. Prior researches [18,19,21,22,26,27,29,30,31], have addressed the issue of finite/fixed time tracking, but only an adjustable region could be reached. However, this studys' finding indicate the eventual convergence of the tracking error to zero, which is more aligned with our increasing demand for precision.
Remark 7. Previously conducted researches [48,49,50] have demonstrated that the tracking error in asymptotic tracking problems can eventually converge to zero. However, it fails to provide assurance for the convergence of the error to a bound within a finite period, rendering it unsuitable for certain practical applications. As such, the finite/fixed time theory presents a crucial approach to addressing this issue.
5.
Simulation results
We present in this section the simulation of a single-linked robot arm consisting of rigid links. Its dynamic equations are
where ¨ϱ, ˙ϱ, and ϱ represent the link angular acceleration, velocity, and displacement, respectively. Meanwhile, ϱ is the system output, u is the control input, M and L are the mass and length of the link, g is the acceleration of gravity, E is the constant of the damping and J is the moment of inertia.
Define x1=ϱ, x2=˙ϱ, and select a disturbance as d1(t)=−0.5sin(t), d2(t)=0.2cos(0.5t), we can establish (63) as
where M=1kg, L=1m, g=10m/s2, E=2N ⋅ m ⋅ s, J=1kg ⋅ m2. The states are constrained by |x1| < Ψ1(yd,t)=e−0.1yd+e−t+0.3, |x2|<Ψ2(yd,x1,t)=0.2sin(0.5t)+e−0.5x21+0.2cos(0.5yd)+0.5. The reference singal is defined as yd=0.3(cos(−0.4t)+sin(0.5t)) and the system output y=x1 is anticipated to be consistent with the reference singal yd will be depicted by Figure 2.
Then, choose the fuzzy membership functions as
where ı=1,…,7.
where j=1,…,7.
The virtual controller, adaptive fuzzy controller, and adaptive laws of this paper are described as:
where z1=eμt(x1−yd),z2=eμt(x2−ω2),Q1=ψ21−z21,Q2=ψ22−z22,χ1=[x1,yd,˙yd,ψ1,∂ψ1∂yd,1eμt]T,χ2=[ˉx2,˙yd,ψ2,∂ψ2∂yd,∂ψ2∂x1,ω2,α1,1eμt,ψ1,yd]T.
The controller parameters are engineered in the simulation as: μ=0.5, k11=0.2, k12=50, k13=1, k21=0.2, k22=50, k23=1, σ11 =σ12 =σ21 =σ22 =2, ι2=0.1, τ1 =τ2 =1, B1 =B2 =2, p1=911, p2=119. And the initial values are chosen as x(0)=[0.5−1]T,ˆθ(0)=[0.10.1]T,ω2=0.1.
The simulation results are shown in Figures 2–5. Figure 2 shows the trajectory of the system with all states under the action of the controller u. It is easy to obtain that all states are guaranteed to be purely state constraints and that the output x1 can track to yd. Figure 3 illustrates the trajectories of ω2, α1, ˆθ1 and ˆθ2 which the closed loop system in which all signals are bounded. Figure 4(a) displays the trajectory of the tracking error v1, which rapidly converges within the fixed time Tp =5.5035 and asymptotically converges to zero. Figure 4(b) showcases the trajectory of the control input u, where its bounds are demonstrated. In Figure 5, we compare our results with the ATC [50] and PFXTTC [31]. Compared to ATC [50], the proposed controller in this article can enable rapid convergence of tracking error to a smaller value. Compared to PFXTTC [31], the proposed controller in this article can ensure asymptotic convergence of tracking error to zero. All of these demonstrate the superiority of the controller constructed in this article.
6.
Conclusions
In summary, this paper investigates the challenging problem of AFXTTC for a class of uncertain nonlinear systems with pure state constraints. Specifically, an improved FXTS determination theorem is proposed and an AFXTS determinacy theorem framework is established. A novel adaptive fuzzy asymptotic fixed-time controller is introduced by combining DSC, FLSs, and BLF. Our research results demonstrate that the tracking error can converge to zero within a fixed time domain independent of the initial values, and then asymptotically converge to zero while satisfying a set of specific constraints that are not only time-dependent but also state-dependent. Simulation results not only demonstrate the effectiveness of the proposed approach but also confirm its superiority by comparing the results with those obtained by the ATC and PFXTTC schemes. By the way, in recent years, constrained logical dynamic systems have been extensively studied [37,51]. Future work will focus on generalizing the findings of this study to constrained logical dynamic systems.
Use of AI tools declaration
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
Acknowledgments
The authors thank the editors and the anonymous reviewers for their resourceful and valuable comments and constructive suggestions.
This work was supported by the National Natural Science Foundation of China (11871231, 62076104), the Science Foundation for Distinguished Youth Scholars of Fujian Province (2021J06025), and Humanity and Social Science Youth foundation of Ministry of Education of China (NO:22YJCZH009).
Conflict of interest
The authors declare no conflict of interest in this paper.
Appendix
1. Proof of the Lemma 1
Since there exists a Lyapunov function W: R→R≥0 such that inequality (2.3) holds, the origin of system (2.1) is asymptotically stable [2]. Here we will complete our proof in two steps:
Step 1. In case of W>1, we can let v(t,v(0)) be a solution of (2.2) and let y1(t):R≥0→R≥0 be a function that satisfies
and W(z(0)) ≤ y1(0). Hence, if 0 ≤ t < 1μln[μr2(n−1)(1−y1−n1(0))+1], y1 = [r2(n−1)μ(eμt−1)+y1−n1(0)]11−n, and if t ≥ 1μln[μr2(n−1)(1−y1−n1(0))+1], y1≤1. By the comparison lemma [2], we have W(v(t,v0))≤y1(t). Let
thus, W(v(t,v0))≤1 for t ≥ t1.
Step 2. When t ≥ t1, W ≤ 1, we can let y2(t):R≥0→R≥0 be a function that satisfies
and W(z(t1)) ≤ y2(t1) = 1. Hence, if t1 ≤ t < 1μln[μr1(1−m)+μr2(n−1)+1], y2 = [r1(1−m)μ(eμt1−eμt)+y1−m2(t1)]11−n, and if t ≥ 1μln[μr1(1−m)+μr2(n−1)+1], y2=0. By the comparison lemma [2], we have W(v(t,v0))≤y2(t). Let
thus, W(v(t,v0)) = 0 for t ≥ Tp. This shows that the trajectories of (1) can reach the origin in fixed time Tp. Hence, by Definition 1, the origin of system (2.1) is FXTS. □
2. Proof of the Lemma 2
Our proof is divided into two steps:
Step 1. Let B={x∈R∣W(x)≤(b/r3)}. Due to the fact that W is continuous and positive definite, the set B is nonempty and closed. So, we can consider the following two cases.
Case Ⅰ. If z∈B, due to ˙W(z)≤0, once the trajectory of z reaches the boundary of B, it does not exceed the set of B.
Case Ⅱ. If z∉B, obviously, z(0)∉B, because if z(0)∈B, from Case I, ∀ t ∈ R≥0, we get z(t)∈B, which contradicts the previous text. Then, there exists a minimum moment t2 such that the inequality W(z(t2))≤(b/r3) holds, i.e., ∀ t ∈ [0,t2), W(z(t2))>(b/r3), which implies that
We have z(t)∈B for t≥t2 by Case I and Tp≥t2 by Lemma 1. Thus, we have z(t)∈B for t≥ Tp.
From Case I and Case II, we have z(t)∈B for any t≥ Tp. Let Δ1∈(0,+∞) be a sufficiently large constant, and B1={x∈B∣‖x‖≤Δ1}. It is clear that the set B1⊆B is non-empty, bounded, and closed, this means that there must be a bounded constant Δ>0 such that ‖z‖≤Δ is true for all z ∈ B1. Thus, the origin of system (2.2) transformed by inequality (2.5) is PFXTS according to Definition 2. There must be a bounded constant Δ>0 such that ‖z‖≤Δ for all t≥ Tp.
Step 2. From (2.4) and Definition 3, ‖v‖ ≤ Δ/eμt) ≤ Δ for all t≥ Tp. As t → ∞, due to eμt → ∞ but z=eμtv is bounded, so ‖v‖ → 0. Thus, the origin of system (2.1) is AFXTS. □