Abstract
Two different structures of saturated super-twisting algorithms are presented. Both structures switch from a relay controller to super-twisting algorithm through a switching law that is based on Lyapunov-level curves allowing the algorithms to generate bounded control signals. The relay controller provides a saturated control signal enforcing the system trajectories to reach a predefined neighborhood of the origin in which the super-twisting algorithm dynamics does not saturate, ensuring finite-time convergence to the origin. In order to increase the maximal admissible bound of the perturbations, the second algorithm also includes a perturbation estimator setting super-twisting’s integrator to the theoretically exact perturbation estimation. Experimental results are presented to validate the proposed algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
http://www.ecpsystems.com (accessed on June 25, 2020).
References
Castillo, I., Steinberger, M., Fridman, L., Moreno, J., Horn, M.: Saturated Super-Twisting Algorithm based on perturbation estimator. In: 2016 IEEE 55th Conference on Decision and Control (CDC), pp. 7325–7328. 2016 IEEE 55th Conference on Decision and Control (CDC) (2016). 10.1109/CDC.2016.7799400
Castillo, I., Steinberger, M., Fridman, L., Moreno, J.A., Horn, M.: Saturated Super-Twisting Algorithm: Lyapunov based approach. In: 2016 14th International Workshop on Variable Structure Systems (VSS), pp. 269–273. 2016 14th International Workshop on Variable Structure Systems (VSS) (2016). 10.1109/VSS.2016.7506928
Cruz-Zavala, E., Moreno, J.A.: Lyapunov functions for continuous and discontinuous differentiators. IFAC-PapersOnLine 49(18), 660–665 (2016). http://dx.doi.org/10.1016/j.ifacol.2016.10.241. http://www.sciencedirect.com/science/article/pii/S2405896316318213
Davila, J., Fridman, L., Poznyak, A.: Observation and identification of mechanical systems via second order sliding modes. Int. J. Control. 79(10), 1251–1262 (2006). 10.1080/00207170600801635. http://dx.doi.org/10.1080/00207170600801635
Edwards, C., Spurgeon, S.: Sliding Mode Control: Theory and Applications. CRC Press (1998)
Golkani, M.A., Koch, S., Reichhartinger, M., Horn, M.: A novel saturated super-twisting algorithm. Syst. Control. Lett. 119, 52–56 (2018). 10.1016/j.sysconle.2018.07.001. https://linkinghub.elsevier.com/retrieve/pii/S0167691118301178
Hippe, P.: Windup in Control: Its Effects and Their Prevention. Springer Science & Business Media (2006)
Levant, A.: Sliding order and sliding accuracy in sliding mode control. Int. J. Control. 58(6), 1247–1263 (1993)
Levant, A.: Robust exact differentiation via sliding mode technique. Automatica 34(3), 379–384 (1998). http://dx.doi.org/10.1016/S0005-1098(97)00209-4. http://www.sciencedirect.com/science/article/pii/S0005109897002094
Ludwiger, J., Steinberger, M., Horn, M.: Spatially distributed networked sliding mode control. IEEE Control. Syst. Lett. (2019)
Moreno, J.A., Osorio, M.: A Lyapunov approach to second-order sliding mode controllers and observers. In: 47th IEEE Conference on Decision and Control, 2008. CDC 2008, pp. 2856–2861. IEEE 47th IEEE Conference on Decision and Control (2008)
Polyakov, A., Efimov, D., Perruquetti, W.: Homogeneous differentiator design using implicit Lyapunov function method. In: 2014 European Control Conference (ECC), pp. 288–293. IEEE 2014 European Control Conference (ECC) (2014)
Polyakov, A., Poznyak, A.: Reaching time estimation for super-twisting second order sliding mode controller via Lyapunov function designing. IEEE Trans. Autom. Control. 54(8), 1951–1955 (2009)
Shtessel, Y., Edwards, C., Fridman, L., Levant, A.: Sliding Mode Control and Observation. Springer (2014)
Steinberger, M., Castillo, I., Horn, M., Fridman, L.: Model predictive output integral sliding mode control. In: 2016 14th International Workshop on Variable Structure Systems (VSS), pp. 228–233. IEEE (2016)
Steinberger, M., Castillo, I., Horn, M., Fridman, L.: Robust output tracking of constrained perturbed linear systems via model predictive sliding mode control. Int. J. Robust Nonlinear Control. (2019)
Utkin, V.I.: Sliding Modes in Control and Optimization, vol. 116. Springer (1992)
Acknowledgements
We gratefully acknowledge the financial support of (i) the Christian Doppler Research Association, the Austrian Federal Ministry for Digital and Economic Affairs and the National Foundation for Research, Technology and Development; (ii) CONACYT (Consejo Nacional de Ciencia y Tecnología) grant 282013; PAPIIT-UNAM (Programa de Apoyo a Proyectos de Investigación e Innovación Tecnológica) grant IN 115419; and (iii) the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement no. 734832.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
1.1 Proof of Theorem 1
This proof is based on Castillo et al. [2] in which it was shown that the RC forces the trajectories to the neighborhood of the origin in finite time. It is shown in Moreno et al. [11] that if the parameters \(\alpha _1\) and \(\alpha _2\) of the STA are designed as in (8), the function
and vector \(\xi ^T = \left[ \xi _1 \;\;\; \xi _2 \right] = \left[ \lceil x \rfloor ^{\frac{1}{2}} \;\;\; z \right] \) is a Lyapunov function for system (2) in closed loop with the STA (1). It ensures the finite-time convergence of the state to the origin and the exact compensation of the perturbation.
Next, the admissible range for threshold \(\delta >0\) based on Positive Invariant Sets (PINS) for the closed loop with RC and STA is derived. If the control signal \(u=\pm \rho \), one get the sets
See the black dashed lines in the (x, z) plane shown in Fig. 10.
The PINS contained between the two saturation sets (that only touches the saturation sets in only one point) is defined as \(\Omega _s = \lbrace \xi \in \mathbb {R}^2 | V_s \le c_s \rbrace \). In order to find \(c_s\), one evaluates Lyapunov function (26) at the (upper) saturation set \(\mathbb {U_+}\) such that \(V_{s}\left( \xi _1, \rho + \alpha _1 \xi _1\right) - c_s = 0\). Saturation set \(\mathbb {U_-}\) is not considered due to symmetry. This relation can be written as quadratic equation in terms of \(\xi _1\) as \(a_N \xi _1^2 + b_N \xi _1 + c_N = 0\) where \(a_N = p_{22} \alpha _1^2 - 2 p_{12} \alpha _1 + p_{11}\), \(b_N = -2 \rho \left( p_{12} - \alpha _1 p_{22}\right) \), and \(c_N = p_{22}^{2} \rho - c_s\). To achieve a unique solution that only touches the saturation set in one point, the discriminant \(b_N^2 - 4 a_N c_N\) of this quadratic equation has to vanish. Solving for \(c_s\) yields
As shown in Fig. 10(left), \(V_s(\delta _{max},z=0)= c_s\) defines the maximum value of \(\delta \) such that PINS does not exceed the saturation set in the nominal case, i.e., \(\phi _{max}=0\), such that \(V_s(x,0) = p_{11}|x| = c_s \). The maximum admissible value for |x| to guarantee that the trajectory stays in the PINS is given by
Subsequently, the case with perturbation is considered, where \(\xi _2 = z + \phi (t)\) holds. To find the maximum bound for the perturbation (9) that can be rejected, a level curve from Lyapunov function (26) in presence of the perturbation is evaluated in one of the saturation sets, i.e., \(V_{s}\left( \xi _1,\rho +\alpha _1 \xi _1-\phi _{max}\right) = \ell _{\rho }\), that can be represented as a quadratic equation \(a_{\rho } \xi _1^2 + b_{\rho } \xi _1 + c_{\rho } = 0\). In contrast to the nominal case, the size and the center of the level curves now depend on the maximum perturbation as shown in Fig. 10(right). Setting the discriminant to zero, one can find the level curve that touches the boundary \(|u| = \rho \) at only one point, i.e., \(b_{\rho }^2 -4a_{\rho }c_{\rho } = 0\), and one gets \(\ell _{\rho } = \left( \phi _{max} - \rho \right) ^2 \mu \).
In order to find the relation between \(\phi _{max}\) and \(\delta \), the level curve is evaluated at \(x=\delta \) and \(z=0\) resulting in
-
1.
Solving (30) for \(\delta \) depending on \(\phi _{max}\) yields a quadratic equation in \(\sqrt{\delta }\) as \(a_\delta \delta + b_\delta \sqrt{\delta } + c_\delta = 0\) where \(a_\delta = p_{11}\), \(b_\delta = 2 p_{12} \phi _{max}\), and \(c_\delta = p_{22} \phi _{max}^2 - \mu \left( \phi _{max} - \rho \right) ^2\). Then, the parameter \(\delta \) is chosen less or equal than the minimum quadratic absolute values of the roots \(0 \le \delta \le \delta _{max}\),
$$\begin{aligned} \begin{array}{rl} \delta _{max} =&\min \left[ \left( \frac{- p_{12} \phi _{max} + \sqrt{\Delta _\delta (\phi _{max})} }{ p_{11}} \right) ^2, \left( \frac{- p_{12} \phi _{max} - \sqrt{\Delta _\delta (\phi _{max})} }{ p_{11}} \right) ^2 \right] = \left( \frac{- p_{12} \phi _{max} + \sqrt{\Delta _\delta (\phi _{max})} }{ p_{11}} \right) ^2 \end{array} \end{aligned}$$(31)where \(\Delta _\delta \left( \phi _{max}\right) = \left( p_{12}^2+ \mu p_{11} - p_{11} p_{22}\right) \phi _{max}^2- 2 \mu p_{11} \phi _{max} \rho + \mu p_{11} \rho ^2 = p_{12}^2 \phi _{max}^2 - p_{11} \left( p_{22} \phi _{max}^2 -\mu \left( \phi _{max}-\rho \right) ^2 \right) .\)
-
2.
Solving (30) for the maximum perturbation bound \(\phi _{max}\) depending on the choice of parameter \(\delta \), a quadratic equation in \(\phi _{max}\) as \(a_\phi \phi _{max}^2 + b_\phi \phi _{max} + c_\phi = 0\) where \(a_\phi = p_{22}-\mu \), \(b_\phi = 2 \mu \rho + 2 p_{12} \sqrt{\delta }\), and \(c_\phi = p_{11} \delta - \mu \rho ^2\) is considered. Then, the maximum bound \(\phi _{max}\) that the algorithm can suppress is given by the minimum absolute value of the roots
$$\begin{aligned} \begin{array}{rl} \phi _{max} =&\min \left[ \left| \frac{\mu \rho + p_{12} \sqrt{\delta } - \sqrt{\Delta _{\rho }(\delta )}}{\mu - p_{22}} \right| , \left| \frac{\mu \rho + p_{12} \sqrt{\delta } + \sqrt{\Delta _{\rho }(\delta )}}{\mu - p_{22}} \right| \right] = \frac{\mu \rho + p_{12} \sqrt{\delta } - \sqrt{\Delta _{\rho }(\delta )}}{\mu - p_{22}}, \end{array} \end{aligned}$$where \(\Delta _{\rho }\left( \delta \right) = \left( p_{12}^2 + \mu p_{11} - p_{11} p_{22} \right) \delta + 2 \mu p_{12} \rho \sqrt{\delta } + \mu p_{22} \rho ^2 = \left( \mu \rho +\right. \left. p_{12} \sqrt{\delta } \right) ^2 - \left( \mu \rho ^2 - p_{11} \delta \right) \,\left( \mu - p_{22}\right) .\) If \(\delta \) is set to zero, \(\phi _{max}\) reduces to
$$\begin{aligned} \phi _{max} = \kappa \rho \qquad \text {with}\qquad \kappa = \frac{\mu - \sqrt{\mu }}{\mu -1} . \end{aligned}$$(32)Substituting (26) and (28) into (32) results in
$$\begin{aligned} \kappa = \frac{\mu - \sqrt{\mu }}{ (\mu -1)} \cdot \frac{\mu + \sqrt{\mu }}{\mu + \sqrt{\mu }} = \frac{1}{1 + \frac{\sqrt{\mu }}{\mu } \cdot \frac{\sqrt{\mu }}{\sqrt{\mu }}} = \frac{1}{1 + \frac{1}{\sqrt{\mu }}} = \frac{1}{1 + \sqrt{1 + \frac{\alpha _1^2}{\alpha _1^2 + 8 \alpha _2}}} \end{aligned}$$(33)which is clearly less than \(\frac{1}{2}\).
Taking the values of the Lyapunov function (26) depending on \(\alpha _1\), \(\alpha _2\), together with (28), (32), and (31) leads to (9)–(10), respectively. This completes the proof. \(\blacksquare \)
1.2 Proof of Theorem 2
The proof is performed in two steps. First, it is shown how the estimator has to be tuned to achieve convergence before the RC switches to STA. Then, conditions for the STA parameters are derived. The error dynamics of estimator (12) are
with \(e_2 = \hat{x}_2 + \phi (t)\). Therefore, there exist gains \(\beta _1\) and \(\beta _2\) depending on (3) and a time \(T_e>0\) where \(e_1 = e_2 = 0\) as shown in [11, 13]. This implies that \(\hat{x}_2 = - \phi (t)\) for all future time \(t>T_e\). For the SSTA, we design the estimator gains to make the time \(T_e\) smaller than the minimum time of convergence of the state under relay control.
The estimation of the minimum reaching time \(T_{cmin}\) of the RC is made considering the case when the perturbation helps the system trajectories to converge to a vicinity of the origin \(|x(t)|\le \delta \), starting from an initial condition \(x_0 = x(0)\) outside of the vicinity \(|x_0|> \delta \). Then, using Lyapunov function \(V_{c}(x) = c_1|x|, c_1 > 0\) from Castillo et al. [2] yields the time derivative
If one selects \(c_1 = 1/\left( \rho + \phi _{max}\right) \), the Lyapunov function derivative becomes \(\dot{V}_c \ge -1\). In order to estimate to time of convergence from the initial condition to the neighborhood \(\delta \), distance \(|x_0|-\delta \) is considered in the Lyapunov function, i.e.,
for \(t_0 = 0\). This shows that \(V_c\) reduces to \(c_1 \delta \) no earlier than \(T_{cmin}\) given in (19).
For the second part of the proof, consider the Lyapunov function from Polyakov et al. [13]
where \(\bar{e}= [e_1 \;\; e_2]^T\). The terms \(k(\bar{e})\) and \(k_0(\bar{e})\) depend on the state \(e_1\) and \(e_2\), and \(\bar{k}\) is a design parameter depending on L and the gains \(\beta _1\) and \(\beta _2\). Expressions \(s(\bar{e})\) and \(m(\bar{e})\) are also nonlinear functions of the state.
Note that with the knowledge of the initial condition \(x_0\) it is possible to set \(\hat{x}_1(0)= x_0\), and therefore \(e_1(0) = x_0 - \hat{x}_1(0) = 0\) and as a result to use the second case of (37). We choose a parametrization of the estimator gains
with \(\epsilon >0\), such that the conditions of Theorem 1 in Polyakov et al. [13] hold, i.e.,
and
In order to design \(\bar{k}\) in (37), parameter \(g = 8 \gamma /\beta _1^2 \) with \(\gamma = \beta _2 - L \text {sign}\left( e_1e_2\right) \) as shown in Polyakov et al. [13] is considered. It may take two possible values \(g^-=8(\beta _2-L)/\beta _1^2\) and \( g^+=8(\beta _2+L)/\beta _1^2\) depending on the values of \(\gamma \in \left\{ \beta _2+L,\beta _2-L \right\} \). Taking into account (38), function \(g = \frac{2(14L + \epsilon \pm L)}{18L + \epsilon }\) also varies depending on the selection of the parameter \(\epsilon \). Note that g is monotone with respect to \(\epsilon \) since its derivative with respect to \(\epsilon \) is positive, i.e.,
Therefore, the limits of \(g^-\) and \(g^+\) when \(\epsilon \rightarrow 0\) and \(\epsilon \rightarrow \infty \) are taken
The whole range of variation of g depending on \(\gamma \) and \(\epsilon \) is \(g \in \left[ g_m,\; g_M\right] =\left[ \frac{13}{9},\; 2\right] \).
Parameter \(\bar{k}\) should belong to a intersection set of the intervals \(I\left( g_m\right) \cap I\left( g_M\right) \ne 0 \), where the interval \(I\left( g\right) \) is given by
Evaluating the endpoints of g yields \(I(g^-) = [1.4027, \;\; 2.01]\) and \(I(g^+) = [1.0670, \;\; 1.5509]\). Parameter \(\bar{k}\) can be selected as \(\bar{k}= 1.4768\).
Using Theorem 1 in Polyakov et al. [13], we ensure that the time derivative of (37) along the trajectories of the system satisfies
and if the bound for \(|e_2(0)|= |\phi (0)| = \phi _{max} \), the reaching time estimate can be referred to as
with
and
Evaluating f with the two limits \(g_m\) and \(g_M\) and the parametrization of g, \(f(g,\epsilon ) \in \left[ f_m,\; f_M\right] = [0.1550,\; 2.8066 ]\), and \(k_{min} = \frac{\beta _1}{\sqrt{8}}f_m\).
From (37), (45), and setting the reaching time of the estimator \(T_e\) less than the minimum reaching time of the state \(T_{cmin}\), one gets
Substituting (19) in (48) and solving for \(\beta _1\) result in
From \(\beta _1\) parametrization (38), we solve for \(\epsilon \) such that
Substituting (50) in \(\beta _2\) parametrization (38) yields
Using the equality case of (49) results in
Note that the value of the gains \(\beta _1\) and \(\beta _2\) tends to zero and to \(-4L\), respectively, as \(x_0\) tends to infinity because the restriction \(\epsilon >0\) disappeared in these expressions. Therefore, conditions (49) and (52) are expressed as the maximum of two values to get and (17).
As shown before and in Castillo et al. [2], the PINS for STA (red curves in Fig. 11) move up or down in the (x, z)-plane depending on \(\phi _{max}\). In addition, they change its size depending on \(\delta \).
With the exact estimate of the perturbation, the integral control is set to \(z(t_1) = - \phi (t_1)\) when the trajectory enters the neighborhood \(|x(t_1)|\le \delta \) at time \(t_1\), then equation (30) becomes
The set of possible choices of the parameter \(\delta \) depending on \(\phi _{max}\) is then given by
The set of maximum perturbation bound \(\phi _{max}\) depending on the choice of parameter \(\delta \) is
Note that the maximal rejectable perturbation depends on \(\delta \), i.e., the smaller \(\delta \), the higher maximum perturbation up to \(\phi _{max} < \rho \), when \(\delta = 0\).
The big red region in Fig. 11 equals a PINS for the choice \(\delta =\delta _1\). As a result, perturbations with maximum \(|\phi _{max1}|\) can be rejected. A choice of \(\delta =\delta _2<\delta _1\) gives a smaller red region as shown in Fig. 11. As a consequence, perturbations with higher magnitude \(|\phi _{max2}|>|\phi _{max1}|\) can be eliminated.
Using the values of the Lyapunov function (26) depending on \(\alpha _1\), \(\alpha _2\), together with (28), (55), and (54), we get (15) and (16), respectively.
This completes the proof. \(\blacksquare \)
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Castillo, I., Steinberger, M., Fridman, L., Moreno, J.A., Horn, M. (2021). A Lyapunov based Saturated Super-Twisting Algorithm. In: Mehta, A., Bandyopadhyay, B. (eds) Emerging Trends in Sliding Mode Control. Studies in Systems, Decision and Control, vol 318. Springer, Singapore. https://doi.org/10.1007/978-981-15-8613-2_2
Download citation
DOI: https://doi.org/10.1007/978-981-15-8613-2_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-8612-5
Online ISBN: 978-981-15-8613-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)