This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Discussion of Three Examples to Recent Results of Finite- and Fixed-Time Convergent Algorithms

Michael Basin111The authors thank the Mexican National Science and Technology Council (CONACyT) for financial support under Grant 250611. School of Physical and Mathematical Sciences, Autonomous University of Nuevo Leon, San Nicolas de los Garza, Nuevo Leon, Mexico, and ITMO University, St. Petersburg, Russia. [email protected] Pablo Rodriguez-Ramirez School of Physical and Mathematical Sciences, Autonomous University of Nuevo Leon, San Nicolas de los Garza, Nuevo Leon, Mexico. [email protected]

Abstract. This note discusses three examples given in the recent technical correspondence paper [1], which addresses the results presented in [2, 3, 4]. It is shown that the first example ([1], Section 3) is irrelevant to the results of [2]. The second example ([1], Section 4) establishes a well-known fact that a continuous differentiator can exactly differentiate a signal, only if its second derivative is equal zero. This note provides a method to extend the algorithms presented in [3] to the general case. Finally, the third example ([1], Section 5) presents a particular case related to Theorem 1 of [4]. Theorem 1 of [4] remains, however, valid in the most practical case of selecting control gains. The result of Theorem 2 in [4] estimating the fixed convergence time holds as well.

1 Introduction

The recently published technical correspondence paper [1] addresses the results presented in [2, 3, 4]. Three examples questioning validity of the obtained results are provided.

This note discusses the examples given in [1]. It is shown that the first example ([1], Section 3) is irrelevant to the results of [2]. The second example ([1], Section 4) establishes the well-known fact about the result of [3] that a continuous differentiator can exactly differentiate a signal, only if its second derivative is equal zero. This note provides a method to extend the algorithms presented in [3] to the general case. It is shown that if the signal second derivative is not equal to zero, the differentiator can be modified by including discontinuous terms to achieve the goal. Finally, the third example ([1], Section 5) presents a special case of control gains and initial conditions, where the result of Theorem 1 in [4] on estimating the finite convergence time does not hold. However, this note demonstrates that the result of Theorem 1 in [4] still remains valid in the most practical case of selecting control gains. The result of Theorem 2 in [4] on estimating the fixed convergence time holds as well.

This note is organized as follows. Section 2-4 subsequently discuss the examples given in Sections 3, 4, and 5 of [1]. Section 6 summarizes the discussions.

2 Discussion of Example of Section 3 in [1]

Following the notation of Lemma 1 in [1], note that the paper [2] considers only systems with initial conditions in the form [0,x20,x30,0][0,x_{20},x_{30},0]. Therefore, Lemma 1 of [1] is applicable to the systems studied in [2], only if a=b=0a=b=0, that is, x(t0)=[0,0,0,0]x(t_{0})=[0,0,0,0] is the origin. However, in this case, the system (2) of Section 3 in [1] has only the zero solution, x(t)=0x(t)=0, for t0t\geq 0, which is finite-time convergent to the origin. Remark 2 and Fig. 1 of Section 3 in [1] are not relevant to the result of [2], since k32=1<2k_{3}^{2}=1<2 and the conditions of Lemma 4 in [2] do not hold. Proposition 3 of Section 3 in [1] is not relevant to the result of [2] as well, since the paper [2] studies only attractivity (convergence) problems but not finite-time stability ones. The difference between finite-time stability and finite-time attractivity concepts can be consulted in Section 4 of [5].

3 Discussion of Example of Section 4 in [1]

This is a well-known fact that the finite- and fixed-time convergent differentiators proposed in Theorems 1 and 2 of [3] converge to the real system states exactly, only if the output nn-th derivative is equal to zero, y(n)(t)=0y^{(n)}(t)=0, for all tTt\geq T, where TT is a certain finite time and nn is the dimension of the differentiator. Note that in the series of papers mentioned in [1] the finite- or fixed-time convergent differentiators are used as parts of finite- or fixed-time convergent controllers, whose setpoints are represented by equilibria, that is, the condition y(n)(t)=0y^{(n)}(t)=0 holds after a certain finite TT.

Furthermore, those differentiators can be modified to achieve finite- or fixed-time convergence in the general situation by adding the term λsign(z1(t)y(t))-\lambda sign(z_{1}(t)-y(t)) to the last differentiator equations, where λ>y(n)(t)\lambda>\mid y^{(n)}(t)\mid is a uniform bound for the output nn-th derivative. For example, in case of the fixed-time convergent differentiator proposed in Theorem 2 of [3], the corresponding equations take the form

z˙1(t)=z2(t)k1z1(t)y(t)α1sign(z1(t)y(t))\dot{z}_{1}(t)=z_{2}(t)-k_{1}\mid z_{1}(t)-y(t)\mid^{\alpha_{1}}sign(z_{1}(t)-y(t))
κ1z1(t)y(t)β1sign(z1(t)y(t)),-\kappa_{1}\mid z_{1}(t)-y(t)\mid^{\beta_{1}}sign(z_{1}(t)-y(t)), (1)
\vdots
z˙i(t)=zi+1(t)kiz1(t)y(t)αisign(z1(t)y(t))\dot{z}_{i}(t)=z_{i+1}(t)-k_{i}\mid z_{1}(t)-y(t)\mid^{\alpha_{i}}sign(z_{1}(t)-y(t))
κiz1(t)y(t)βisign(z1(t)y(t)),-\kappa_{i}\mid z_{1}(t)-y(t)\mid^{\beta_{i}}sign(z_{1}(t)-y(t)),
i=1,,n1\quad i=1,\dots,n-1
\vdots
z˙n(t)=knz1(t)y(t)αnsign(z1(t)y(t))\dot{z}_{n}(t)=-k_{n}\mid z_{1}(t)-y(t)\mid^{\alpha_{n}}sign(z_{1}(t)-y(t))
κnz1(t)y(t)βnsign(z1(t)y(t))-\kappa_{n}\mid z_{1}(t)-y(t)\mid^{\beta_{n}}sign(z_{1}(t)-y(t))
λsign(z1(t)y(t)),-\lambda sign(z_{1}(t)-y(t)),
k1,,kn,λ>0,k_{1},\dots,k_{n},\lambda>0,

where the gains k1,,knk_{1},\dots,k_{n} and κ1,,κn\kappa_{1},\dots,\kappa_{n} satisfy the conditions of Theorem 2 of [3] and λ>y(n)(t)\lambda>\mid y^{(n)}(t)\mid. This modification keeps the convergence fixed time estimates given in Theorem 2 of [3] and the convergence finite time estimates given in Theorem 1 of [3] in the most practical case of selecting the control gains, as noted in the next section.

The differentiator (1) is not smooth; however, a smooth differentiator for (n1)(n-1)-th derivative of the output can be constructed by increasing the dimension of the differentiator (1) by one, i.e., adding the equation for zn+1z_{n+1} and moving the term λsign(z1(t)y(t))-\lambda sign(z_{1}(t)-y(t)) to this equation, provided that the condition λ>y(n+1)(t)\lambda>\mid y^{(n+1)}(t)\mid holds.

4 Discussion of Example of Section 5 in [1]

4.1 The result of Theorem 1 in [4] remains valid in the most practical case or after imposing an additional condition

Indeed, the result of Theorem 1 in [4] remains valid in the most practical case of selecting the control gains k1,k2,,knk_{1},k_{2},\ldots,k_{n} by assigning the eigenvalues of the matrix AA as the multiple roots of its characteristic polynomial in the form (λμi)n=0(\lambda-\mu_{i})^{n}=0, where all μi=μ\mu_{i}=-\mu and μ>0\mu>0 is a positive real number. This is the assignment scheme mostly used by control scientists and engineers, which is commonly implemented due to its simplicity and the fact that increasing the absolute value of μ\mu leads to accelerating the convergence of a linear system state towards the origin.

To see this, consider the example given in Section 5 of [1]. Then, k1=μ2k_{1}=\mu^{2}, k2=2μk_{2}=2\mu, and the condition required by Remark 9 and Proposition 10 of [1] does not hold, since k224k1=4μ24μ2=0k_{2}^{2}-4k_{1}=4\mu^{2}-4\mu^{2}=0. Further calculations yield that the corresponding matrix PP is given by

P=(1μ+μ2+14μ212μ212μ2μ2+14μ3).P=\left(\begin{array}[]{cc}\frac{1}{\mu}+\frac{\mu^{2}+1}{4\mu^{2}}&\frac{1}{2\mu^{2}}\\ \frac{1}{2\mu^{2}}&\frac{\mu^{2}+1}{4\mu^{3}}\end{array}\right).

The right-hand side of the formula (22) in [1] takes the form μλmax(P)λmin(Q)\mu\frac{\lambda_{max}(P)}{\lambda_{min}(Q)}. Assuming λmin(Q)=1\lambda_{min}(Q)=1, the inequality μλmax(P)>1\mu\lambda_{max}(P)>1 holds for any μ>0\mu>0, which is verified directly calculating the maximum eigenvalue of the matrix PP as a function of μ\mu. For instance, μλmax(P)=1+22\mu\lambda_{max}(P)=1+\frac{\sqrt{2}}{2}, if μ=1\mu=1.

Thus, Theorem 1 in [4] still provides a method to estimate the finite convergence time for Bhat and Bernstein algorithm [6] in the most practical and broadly employed case of selecting its control gains k1,k2,,knk_{1},k_{2},\ldots,k_{n}. Validity of the formula (6) of Theorem 1 in [4] in this case is illustrated by the following simulations.

The nn-dimensional chain of integrators

x˙1(t)=x2(t),x1(t0)=x10,\dot{x}_{1}(t)=x_{2}(t),\quad x_{1}(t_{0})=x_{10},
x˙2(t)=x3(t),x2(t0)=x20,\dot{x}_{2}(t)=x_{3}(t),\quad x_{2}(t_{0})=x_{20},
\cdots
x˙n(t)=u(t),xn(t0)=xn0,\dot{x}_{n}(t)=u(t),\quad x_{n}(t_{0})=x_{n0},

is simulated for n=2,3,4,5n=2,3,4,5. The scalar control input u(t)u(t) is assigned according to Bhat and Bernstein algorithm [6]

u(t)=v1(t)+v2(t)++vn(t),u(t)=v_{1}(t)+v_{2}(t)+\ldots+v_{n}(t),

where vi(t)=kixi(t)γisign(xi(t))v_{i}(t)=-k_{i}\mid x_{i}(t)\mid^{\gamma_{i}}sign(x_{i}(t)) and the exponents γi\gamma_{i}, i=1,,ni=1,\ldots,n, are defined by γi1=γiγi+1/(2γi+1γi)\gamma_{i-1}=\gamma_{i}\gamma_{i+1}/(2\gamma_{i+1}-\gamma_{i}), i=2,,ni=2,\ldots,n, γn+1=1\gamma_{n+1}=1, and γn=γ\gamma_{n}=\gamma. The control gains kik_{i}, i=1,,ni=1,\ldots,n, are assigned such that all multiple roots of its characteristic polynomial (λμi)n=0(\lambda-\mu_{i})^{n}=0 are equal to μi=1\mu_{i}=-1. Namely, k1=1k_{1}=1, k2=2k_{2}=2 for n=2n=2; k1=1k_{1}=1, k2=3k_{2}=3, k3=3k_{3}=3 for n=3n=3; k1=1k_{1}=1, k2=4k_{2}=4, k3=6k_{3}=6, k4=4k_{4}=4 for n=4n=4; and k1=1k_{1}=1, k2=5k_{2}=5, k3=10k_{3}=10, k4=10k_{4}=10, k5=5k_{5}=5 for n=5n=5. The parameter γ\gamma is set to γ=10/11\gamma=10/11 in all simulations. The convergence time estimated is computed according to the formula (6) of Theorem 1 in [4].

The simulation results are given in the following tables, which confirm validity of the formula (6) of Theorem 1 in [4].

Convergence time n=2
Initial Conditions xi(0)x_{i}(0) 0.01 1 100 10,000 1’000,000
Simulation (s) 7.7 13.9 23.1 37 58.05.5
Estimated Time (s) 7.95 17.07 37.08 82.56 188.59
Rate 1.03 1.22 1.60 2.23 3.24
Convergence time n=3
Initial Conditions xi(0)x_{i}(0) 1 100 10,000 1’000,000
Simulation (s) 25.33 39.1 59.7 90.6
Estimated Time (s) 46.48 92.99 209.29 500.43
Rate 1.83 2.37 3.50 5.52
Convergence time n=4
Initial Conditions xi(0)x_{i}(0) 1 100 10,000 1’000,000
Simulation (s) 40.6 60 89 132.3
Estimated Time (s) 146.09 289.71 650.98 1528.4
Rate 3.59 4.82 7.31 11.55
Convergence time n=5
Initial Conditions xi(0)x_{i}(0) 1 100 10,000 1’000,000
Simulation (s) 60.8 87.4 126.6 185.1
Estimated Time (s) 508.21 998.29 2208.8 5108.2
Rate 8.35 11.42 17.44 27.59

The authors thank the author of [1] for the example given in Section 5 of [1] as the really relevant and insightful one.

4.2 The result of Theorem 2 in [4] remains valid

It is argued in Subsection 5.3 of [1] that the inequality (23) there is not valid for all xRnx\in R^{n}, since both parts of the inequality (23) tend to zero as xx tends to zero. Following this logic, the example of Subsection 5.2 could be constructed only for initial values x0x_{0} sufficiently close to zero. Furthermore, the result of Theorem 2 in [4] providing an upper estimate for fixed convergence time would remain valid, since it takes into account initial values arbitrarily distant from zero.

Indeed, consider the example given in Section 5 of [1]. Let the gains κ1,κ2\kappa_{1},\kappa_{2} in Theorem 2 in [4] are selected the same as k1,k2k_{1},k_{2}: k1=κ1=1k_{1}=\kappa_{1}=1, k2=κ2=6k_{2}=\kappa_{2}=6. Then, assuming P1=PP_{1}=P and setting Q1=QQ_{1}=Q to the 2×22\times 2 identity matrix, the right-hand side of the formula (22) in the fixed-time convergence case is equal to

2k2k224k12λmax(P)λmin(Q)=(38)(103+10)1.14447>1.2\frac{k_{2}-\sqrt{k_{2}^{2}-4k_{1}}}{2}\frac{\lambda_{max}(P)}{\lambda_{min}(Q)}=(3-\sqrt{8})(\frac{10}{3}+\sqrt{10})\approx 1.14447>1.

Thus, the result of Theorem 2 in [4] remains valid and, in addition, provides a practically useful upper estimate for fixed convergence time in the example given in Section 5 of [1]. It should be noted that convergence time estimates based on Lyapunov functions proposed in [7] are too conservative and cannot be used for practical estimation of fixed convergence time.

5 Conclusions

This note discussed the examples given in [1]. It has been shown that the results opposed in [1] remain valid in most practical cases or can be successfully modified or are irrelevant to the given examples.

6 Ackowledgments

The authors thank Prof. Y. Shtessel, with the University of Alabama in Huntsville, for his valuable and very useful discussions, comments, and suggestions.

References

  • [1] R. Seeber, Three counterexamples to recent results on finite- and fixed-time convergent controllers and observers, Automatica 112 (108678) (2020).
  • [2] M. Basin, P. Rodriguez-Ramirez, A super-twisting algorithm for systems of dimension more than one, IEEE Transactions on Industrial Electronics 61 (11) (2014) 6472–6480.
  • [3] M. Basin, P. Yu, Y. Shtessel, Finite- and fixed-time differentiators utilising HOSM techniques, IET Control Theory and Applications 11 (8) (2017) 1144–1152.
  • [4] M. Basin, Y. Shtessel, F. Aldukali, Continuous finite- and fixed-time high-order regulators, Journal of The Franklin Institute 353 (18) (2016) 5001–5012.
  • [5] A. Polyakov, L. Fridman, Stability notions and Lyapunov functions for sliding mode control systems, Journal of the Franklin Institute 351 (4) (2014) 1831 – 1865.
  • [6] S. P. Bhat, D. S. Bernstein, Geometric homogeneity with applications to finite-time stability, Mathematics of Control, Signals and Systems 17 (2) (2005) 101–127.
  • [7] E. Cruz-Zavala, J. Moreno, L. Fridman, Uniform robust exact differentiator, IEEE Transactions on Automatic Control 56 (11) (2011) 2727–2733.