Discussion of Three Examples to Recent Results of Finite- and Fixed-Time Convergent Algorithms
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 . Therefore, Lemma 1 of [1] is applicable to the systems studied in [2], only if , that is, is the origin. However, in this case, the system (2) of Section 3 in [1] has only the zero solution, , for , 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 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 -th derivative is equal to zero, , for all , where is a certain finite time and 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 holds after a certain finite .
Furthermore, those differentiators can be modified to achieve finite- or fixed-time convergence in the general situation by adding the term to the last differentiator equations, where is a uniform bound for the output -th derivative. For example, in case of the fixed-time convergent differentiator proposed in Theorem 2 of [3], the corresponding equations take the form
where the gains and satisfy the conditions of Theorem 2 of [3] and . 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 -th derivative of the output can be constructed by increasing the dimension of the differentiator (1) by one, i.e., adding the equation for and moving the term to this equation, provided that the condition 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 by assigning the eigenvalues of the matrix as the multiple roots of its characteristic polynomial in the form , where all and 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 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, , , and the condition required by Remark 9 and Proposition 10 of [1] does not hold, since . Further calculations yield that the corresponding matrix is given by
The right-hand side of the formula (22) in [1] takes the form . Assuming , the inequality holds for any , which is verified directly calculating the maximum eigenvalue of the matrix as a function of . For instance, , if .
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 . Validity of the formula (6) of Theorem 1 in [4] in this case is illustrated by the following simulations.
The -dimensional chain of integrators
is simulated for . The scalar control input is assigned according to Bhat and Bernstein algorithm [6]
where and the exponents , , are defined by , , , and . The control gains , , are assigned such that all multiple roots of its characteristic polynomial are equal to . Namely, , for ; , , for ; , , , for ; and , , , , for . The parameter is set to 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 | 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 | 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 | 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 | 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 |
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 , since both parts of the inequality (23) tend to zero as tends to zero. Following this logic, the example of Subsection 5.2 could be constructed only for initial values 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 in Theorem 2 in [4] are selected the same as : , . Then, assuming and setting to the identity matrix, the right-hand side of the formula (22) in the fixed-time convergence case is equal to
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
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.