Next Article in Journal
Special Issue of Mathematics: Analytical and Numerical Methods for Linear and Nonlinear Analysis of Structures at Macro, Micro and Nano Scale
Next Article in Special Issue
Spectral Decompositions of Gramians of Continuous Stationary Systems Given by Equations of State in Canonical Forms
Previous Article in Journal
The Influence of Service Quality on User’s Perceived Satisfaction with Light Rail Transit Service in Klang Valley, Malaysia
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The New Second-Order Sliding Mode Control Algorithm

by
Sergey Kochetkov
*,
Svetlana A. Krasnova
and
Victor A. Utkin
V.A. Trapeznikov Institute of Control Sciences of RAS, 117997 Moscow, Russia
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(13), 2214; https://doi.org/10.3390/math10132214
Submission received: 9 May 2022 / Revised: 16 June 2022 / Accepted: 22 June 2022 / Published: 24 June 2022
(This article belongs to the Special Issue Dynamics and Control Theory with Applications)

Abstract

:
A new class of regulators on the basis of the second-order sliding mode control is proposed. For the second-order system with smooth disturbances, special feedback is chosen with a discontinuous component and a radical function component. The synthesized control law provides a transient oscillatory process with decaying amplitudes, which converge to zero in finite time. In contrast to existing algorithms, the condition of homogeneity of the closed-loop system differential equations is omitted. In comparison to the “twisting”-algorithm, which is well known, designed feedback provides an invariance property with respect to smooth external perturbation with less relay amplitude. With the help of a special Lyapunov function, the convergence proof is considered by using the averaging approach. It is shown that the average oscillation period convergence speed is strictly negative, and the estimation of the convergence time is presented. The simulation results of the designed control law for the one link robot-manipulator are presented, which shows less steady-state oscillations in comparison to existing approaches.

1. Introduction

The sliding mode technique is a well-known method suitable for solving control and observation problems for systems under the influence of external perturbations and mathematical model uncertainties [1,2]. There are three main properties concerned with the sliding mode control approach:
  • finite time convergence to the sliding manifold;
  • full suppression of bounded external perturbations, which belong to the control space;
  • reduction of the dynamical order of the system during motion along the sliding manifold.
The conventional sliding mode technique implies that the control input appears after the first differentiation of the sliding manifold [1,2]; in other words, the relative degree of the sliding manifold is equal to one. For the systems where the relative degree is greater than one, higher-order sliding mode methods have been developed, which have attracted considerable research interest in the last three decades [3,4,5,6,7,8]. In this paper, the new second-order sliding mode control law is developed. According to the definitions [5,8,9], for the second-order sliding mode, the relative degree is equal to two and the trajectories of the system converge to the intersection of the sliding manifold and its derivative in finite time. It is proposed to modify the, so called, “twisting” algorithm [5] by excluding one of the discontinuous components from the control law. This can be done with the help of the recent results in the invariance theory [10,11], with the help of the “vortex” algorithm. The proposed class of regulators is not a combination of any algorithm. We propose another paradigm. The designed control input includes continuous and discontinuous components. The discontinuous one provides nonlinear oscillations in the closed-loop system as it was done in “twisting” [12] or ”super-twisting” algorithms [13,14,15,16] and their modifications [12,17,18]. The continuous component yields the amplitudes of the oscillations to zero in finite time. The continuous term is the sum of the linear function and non-Lipschitz function [19]. In this paper, the radical function with power from zero to one is chosen as the non-Lipschitz candidate function. The continuous component has an infinite gain coefficient in origin, and this feature causes the finite time convergence property of the closed-loop system. It is necessary to note that using feedback with an arbitrary radical function has not been considered previously in the second-order sliding mode controllers, and the convergence proof for such a type of function is the challenge. From other points of view, the super-twisting algorithm supposes that the control input appears after the first differentiation of the sliding manifold. In our problem statement, the sliding surface must be twice differentiated to get the control input on the right-hand side. This is the main distinction with respect to the super-twisting algorithm and all its modifications, and it corresponds to the restriction on the class of the control plants for the super-twisting control methodology. The main advantage of the proposed controller is the reduction of the discontinuous term amplitude, which can be chosen as two times less in comparison to the ”twisting” algorithm. This is a very valuable result for adaptive [12,16] or modified [17] ”twisting” controllers, where the tuning relay bounds may be twice reduced from below.
It is necessary to note that all properties discussed above are valid only for the “ideal sliding mode”, which implies infinite switching frequency of the discontinuous control input [1]. In real practice, application designers and engineers must consider the “real sliding mode” with a finite switching frequency when the trajectories of the system belong to some small Δ -vicinity of the sliding manifold. This phenomenon is called the “chattering” effect [1,7], and it is concerned with imperfections of the discontinuous functions in the real world. During “chattering”, the small amplitude oscillations appear in the output variable, which causes extra heat losses, time life reduction of the mechanical parts of the plant and low control accuracy. The steady-state oscillations amplitude strictly depends on the discontinuous control bounds, and one of the direct ways to decrease “chattering” is to reduce these. This idea is realized for the “twisting” second-order sliding mode algorithm, which is modified by the approach proposed above.
This paper is organized as follows. In Section 2, the basic definitions are introduced, and the main methods used in the paper are described. The problem statement and main idea of the synthesis of the proposed control law are presented in Section 3, and the properties of the radical function are also discussed. In Section 4, the convergence of the closed-loop system with the combined control law containing arbitrary radical function and discontinuous components is proven by qualitative analysis of the transient process and the Lyapunov function method is applied to prove the finite time reaching of the second-order sliding mode set and to get its reaching time estimation. The efficiency of the designed control laws is demonstrated in Section 5 for the one-link robot manipulator regulation. Finally, in Section 6, some concluding comments about the presented results are given and further investigation directions are discussed.

2. Basic Definitions and Methods

Consider the dynamical system
x ˙ = f ( t , x )
where x R n is the state space vector, t is the time, f ( t , x ) = ( f 1 , f 2 , , f n ) T , f ( t , x ) is the piece-wise continuous vector function in a finite domain G of an ( n + 1 ) -dimensional space that undergoes discontinuities on the manifold
s ( t , x ) = 0 , s R .
Definition 1
([20]). The solution of (1) is a continuous vector function x ( t ) determined in the time interval I, for which the differential inclusion is fulfilled almost everywhere.
x ˙ F ( t , x ) ,
where set F ( t , x ) contains one point if f ( t , x ) is continuous, and if f ( t , x ) is discontinuous, the set F ( t , x ) is given by
F = c o n v F 0 ( t , x ) ,
where F 0 ( t , x ) is the set of all possible limits of f ( t , x ) as x * ( t ) s ( x , t ) = 0 , x * x , where x * is the continuity point of f ( t , x ) ; conv means convex closure.
Definition 2
([5]). Let Γ be a smooth manifold. The set Γ itself is called the first-order sliding point set. The second-order sliding point set is defined as the set of points x Γ , where F ( x ) lies in the tangential space T y Γ of manifold Γ at the point x.
Definition 3
([5]). It can is said that there exists the first (or the second)-order sliding mode on the manifold Γ in the vicinity of a first (or second)-order sliding point x 0 if, in the vicinity of the point x 0 , the first (or second)-order sliding set is an integral set, i.e., consists of the Filippov’s sense solutions.
Consider the closed-loop control system
x ˙ = f ( t , x , u ) ,
u = U ( t , x , ζ ) ,
ζ ˙ = Ψ ( t , x , ζ ) ,
where u R 1 is a control input, which may be chosen in an appropriate way, U is a feedback operator, ζ is a special auxiliary parameter. The initial value of ζ may be defined by a special function ζ ( t 0 ) = ζ 0 ( t 0 , x 0 ) or considered to be arbitrary.
Let s ( t , x ) = 0 , s R 1 be the desirable constraint s C 1 , x s 0 .
Definition 4
([1]). With the help of an equivalent control method, the motion of system (4) with s ( t , x ) = 0 is described by the equation
x ˙ = f ( t , x , u e q ( t , x ) ) ,
where u e q ( t , x ) is the equivalent control that is evaluated from the equation
s ˙ = s t ( t , x ) + s x ( t , x ) f ( t , x , u e q ( t , x ) ) = 0 ,
where s t , s x are the corresponding derivatives.
Definition 5
([5]). Equations (5) and (6) are called the first and second-order sliding algorithms on constraint s ( x , t ) = 0 if a stable sliding mode of the first (second)-order on the manifold s ( x , t ) = 0 is achieved, and with every initial condition ( t 0 , x 0 ) the state x is transformed to the sliding mode in finite time.
Definition 6
([5]). Let ( t , x ( t , ε ) ) from (4) be a family of trajectories indexed by ε R with the common initial condition ( t 0 , x 0 ) , and let t t 0 (or t [ t 0 , T ] ). Assume that there exists t 1 t 0 (or t 1 [ t 0 , T ] ) such that on every segment [ t , t ] , where t t 1 (or on [ t 1 , T ] ), the function s ( t , x ( t , ε ) ) tends uniformly to zero with ε tending to zero. In this case, we call such a family a real sliding family on the constraint s ( x , t ) = 0 . We call the motion on the interval [ t 0 , t 1 ] a transient process and the motion on the interval [ t 1 , ] (or [ t 1 , T ] ) a steady-state process.
Definition 7
([5]). Let γ ( ε ) be a real-valued function such that γ ( ε ) 0 as ε 0 . A real sliding algorithm on the constraint s = 0 is said to be of the second-order with respect to γ ( ε ) if, for any compact set of initial conditions, and for any time interval [ T 1 , T 2 ] , there exists a constant C, such that the steady-state process satisfies
| s ( t , x ( t , ε ) ) | C | γ ( ε ) | 2
for t [ T 1 , T 2 ] .
Let ( t , x ( t , ε ) ) be a real sliding family with ε 0 , t belongs to a bounded interval. Let s ( t , x ) be a smooth constraint function, and r = 2 be the real sliding order with respect to τ ( ε ) , where τ ( ε ) > 0 is the smallest time interval of smoothness of the piecewise smooth function x ( t , ε ) .
Proposition 1
([5]). If the derivative s ˙ ( t , x ( t , ε ) ) is uniformly bounded in ε for the steady-state part of x ( t , ε ) , then there exists a positive constant C 1 such that for the steady-state process, the following inequality holds
| s ˙ ( x , t ) | C 1 ε .
There are not so many methods for investigation of the systems with higher-order sliding modes. One of the most used approaches is to provide, if it is possible, the homogeneity property of the closed-loop system with an appropriate choice of the control input [6,21,22]. In particular, if an asymptotic convergence of the closed-loop system is proven, then for the system of homogeneous differential equations, it leads to finite time convergence. The homogeneity requirement restricts the class of systems and control algorithms that can be used during feedback design.
The classical Lyapunov functions method [23] has been extended for the systems with differential inclusions (2) in [24,25]. In [26], a non-smooth Lyapunov function is used to prove the finite-time convergence of the closed-loop system with one of the second-order sliding mode control algorithms.
The modification of V.I. Zubov’s method [27,28,29] for finding the appropriate Lyapunov function for the second-order sliding mode algorithm is proposed in [30,31,32].
The difficulties of the evaluation of a suitable Lyapunov function are slightly relaxed in [33], where an alternative approach on the basis of the combination of the Lyapunov method and the averaging approach [34] is introduced for the stability proof. This can be performed by evaluating the average decaying rate of a positive semi-definite function of the state space variables. If the upper negative bound is found for the average decaying speed, then it yields to the second-order sliding mode. This method is used in this paper for the finite time convergence proof and its estimation. The benefit of this approach is that only the upper bound of the average descending speed of some positive semi-definite function must be estimated, and only the functions for which this estimation is negative must be found. Due to this methodology, in the oscillation period, the derivative of the Lyapunov candidate function may be positive for some time interval, and in this period, only the averaged derivative must be negative. This alternative way sufficiently simplifies the search for the Lyapunov candidate function.
The methods of the classical mathematical analysis [19] are used as an auxiliary tool during each proof step.

3. Problem Statement

Consider the system
s ˙ 1 = s 2 , s ˙ 2 = u + ξ ( t ) ,
where s 1 , s 2 R are the measured state variables, u R is the control input, | ξ ( t ) | < Ξ = const > 0 is an unknown function of external perturbations of the system, which is assumed to be bounded and differentiable with respect to time:
| ξ ˙ ( t ) | Ξ ¯ = const > 0 ,
the constants Ξ and Ξ ¯ are known.
The problem of the stabilization of state variables in a finite time is stated in
s 1 ( t ) = s 2 ( t ) = 0 , t > t r
by synthesis, the static feedback u = U ( s 1 , s 2 ) . The constant t r is not predetermined, and only its existence and evaluation are investigated.

4. Main Result

4.1. Motivation

There exists the well-known “twisting”, algorithm [3,4,5], which solves the stated problem (10). According to this feedback law, the control input is chosen in the form
u = M 2 sign ( s 2 ) M 1 sign ( s 1 ) ,
where M 1 = const > 0 , M 2 = const > 0 , ( · ) is the sign function
sign ( y ) = 1 , y > 0 ; 1 , y < 0 ,
for y = 0 the solutions of the closed-loop system are (8), (9) and (11) are understood in Filippov’s sense of (2) and (3), sign ( y ) [ 1 , 1 ] .
In [1,5,21,30,31], it was proven that “twisting” is a second-order sliding mode algorithm (Definition 5) under conditions
M 1 > M 2 + Ξ , M 2 > Ξ .
All second-order sliding mode algorithms are based on relay feedback [7,9], which provides an oscillatory character of the transient process for system variables. Adding to relay some signal that dissipates the energy, the asymptotic or finite-time convergence of controlled variables to zero can be established. In [10,11], it was shown that using the static feedback
u = α s 2 M sign ( s 1 ) , M > Ξ , α ( M Ξ ) > Ξ ¯ ,
in (8) leads to asymptotic convergence of the variables s 1 and s 2 to the origin. The control algorithm (13) was named “vortex” due to the image of the transient process. Moreover, if the twice differentiable disturbance is included on the right-hand side of the equation for s 1 , then the asymptotic convergence is provided for the “unmatched” perturbation (out of control space).
The nonlinear oscillator is organized by the relay component M sign ( s 1 ) , and the α s 2 component, such as viscous friction, ensures energy dissipation in the closed-loop system. According to the stated problem, the dissipation component may be chosen in such a way to provide finite time convergence. In this paper, it is proposed to add a radical function to the feedback. It is well known [35,36,37] that the differential equation for scalar variable y with the square root function
y ˙ = | y | sign ( y )
has the property of finite-time convergence. In the next subsection, a radical function will be used in the control law to provide the finite time convergence property.

4.2. Control Algorithm Choice

In this subsection, the following control input is introduced
u = α s 2 α | s 2 | β sign ( s 2 ) M sign ( s 1 ) , β = const > 0 , 0 < β < 1 ; α ( M Ξ ) > Ξ ¯ , M > Ξ , α = const > 0 , M = const > 0 .
Further, it will be proven that (14) is the second-order sliding mode control algorithm (Definition 5), and this result for systems (8) and (9) is achieved with two times less relay amplitude in comparison to (11).
For further considerations, the following comparison system is used
y ˙ 1 = y 2 , y ˙ 2 = α y 2 M sign ( y 1 ) + Ξ sign ( y 2 ) .
The component M sign ( s 1 ) provides the oscillating behavior of the phase trajectories, and the phase portrait methods analysis is one of the main methods that can be used for convergence proof. However, for different initial conditions, the transient process for the closed-loop system can vary significantly. Further analysis will show that after one or two times switching the relay function, the state variables are involved in the oscillating character of the convergence process. In this regime, the previous results [10,11] may be used for asymptotical convergence proof. Let us clarify this idea. The following area is introduced into consideration
| s 2 | + | s 2 | β M Ξ α .
It is obvious that (the formula was changed from | s 2 | + | s 2 | β sign ( s 2 ) | s 2 | )
| s 2 | + | s 2 | β | s 2 | .
In this area, it was shown in [10,11] that for identical initial conditions, phase portraits of (8), (14) and (15) have the form depicted in Figure 1. It can be seen from (8), (14) and (15) that
y 2 y 1 = α y 2 M sign ( y 1 ) + ξ ( t ) y 2 , s 2 s 1 = α s 2 α | s 2 | β sign ( s 2 ) M sign ( s 1 ) + ξ ( t ) s 2 .
For example, if the third quadrant is investigated, for any points of the phase portrait s 2 = y 2 < 0 , and the time instant t in the third quadrant is according to (14), (15) and (17)
y 2 y 1 = α | s 2 | + M Ξ s 2 < 0 , s 2 s 1 = α ( | s 2 | + | s 2 | β ) + M + ξ ( t ) s 2 < 0 ; y 2 y 1 s 2 s 1 = α | s 2 | + M Ξ α ( | s 2 | + | s 2 | β ) + M + ξ ( t ) < 1 .
This means that curve b corresponding to the phase portrait of system (15) covers the phase portrait a of (8) and (14).
By analogy, in the second quadrant, curve b corresponding to the phase portrait of (15), covers the phase portrait a of (8) and (14), because from (16) and (18) the variable growth rate s 2 ( t ) for any point of the phase portrait s 2 + = y 2 > 0 is less than the growth rate of the variable y 2 ( t ) (the following formula was added to the paper’s text)
y 2 y 1 = α | s 2 + | + M + Ξ s 2 + > 0 , s 2 s 1 = α ( | s 2 + | + | s 2 + | β ) + M + ξ ( t ) s 2 + > 0 ; y 2 y 1 s 2 s 1 = α | s 2 + | + M + Ξ α ( | s 2 + | + | s 2 + | β ) + M + ξ ( t ) > 1 .
Of course, these arguments only are valid in space and not in time, but the phase portrait of (15) is majorant for the phase curve of (8) and (14) in the area (16). From the asymptotic stability of (15) it follows that the variables of (8) and (14) converge to zero asymptotically also
lim t + | s 1 ( t ) | = 0 , lim t + | s 2 ( t ) | = 0 .
Convergence to the zone (16) must be considered more carefully due to different images of the phase portrait depending on the initial conditions. For further analysis, the full transient process for (8) and (14) is separated into three main stages:
(1)
hitting the area
| s 2 ( t ) | ε 1 = M + Ξ α ;
(2)
convergence to the zone
ε 2 | s 2 ( t ) | M + Ξ α ,
where ε 2 is some positive constant, which will be introduced below;
(3)
movement in the vicinity of the origin
| s 2 ( t ) | ε 2
to zero in finite time.
During the proof, the following notations are used, which correspond to different stages of the convergence process:
(1)
t 0 is the initial moment of time;
(2)
t 1 is the time instant at which s 1 ( t 1 ) = 0 , | s 2 ( t 1 ) | + | s 2 ( t 1 ) | β > M + Ξ α ;
(3)
t 1 is the time instant at which s 2 ( t 1 ) = 0 ;
(4)
t 2 is the time instant at which s 1 ( t 2 ) = 0 , | s 2 ( t 2 ) | ε 1 ;
(5)
t 3 is the time instant at which s 1 ( t 3 ) = 0 , | s 2 ( t 3 ) | ε 2 ;
(6)
t 3 is the time instant at which | s 2 ( t 3 ) | ε 2 , s 1 ( t 3 ) = 0 ;
(7)
t r is the time instant of second-order sliding mode arising.
Note that depending on the initial conditions, not all of the listed stages occur in reality. Further, all possible scenarios for the events evolution will be considered in detail.

4.3. Estimation of the Time to Hit ε 1 -Area

Situation 1.
Consider the case with the following initial conditions (see Figure 2)
α ( | s 2 ( t 0 ) | + | s 2 ( t 0 ) | β ) > M + Ξ , s 1 ( t 0 ) s 2 ( t 0 ) < 0 .
This situation corresponds to the case when the initial point of the phase portrait is in the second and the fourth quadrants of the phase plane. Let us show that the greater the decreasing rate of the variable s 2 ( t ) , then the larger the estimation of the time interval t 1 t 0 (stages 1–2). For this, we consider the system
s ˙ 1 * = s 2 * , s ˙ 2 * = v sign ( s 1 * ) , s 1 * ( t 0 ) = s 1 ( t 0 ) , s 2 * ( t 0 ) = s 2 ( t 0 ) , v = const > 0
and introduce some value s 1 = const > 0 , 0 < s 1 < | s 1 ( t 0 ) | .
After integration, the solution of this system is
| s 2 * ( t ) | = | s 2 * ( t 0 ) | v ( t t 0 ) , | s 1 * ( t ) | = | s 1 * ( t 0 ) | | s 2 * ( t 0 ) | ( t t 0 ) sign ( s 1 * ) + ( t t 0 ) 2 2 v sign ( s 1 * ) , t t 0
and the estimation of the time interval t 0 t 0 ( t 0 corresponds | s 1 * ( t 0 ) | = s 1 ) can be computed from the second equality of this system by solving quadratic equation:
t 0 t 0 2 ( | s 1 ( t 0 ) | s 1 ) | s 2 ( t 0 ) | + s 2 2 ( t 0 ) 2 v ( | s 1 ( t 0 ) | s 1 ) .
It can be seen from the last estimation that the larger value of v leads to a longer transient time. This expression has sense if the radical expression is positive. Two variants must be considered.
The first one corresponds to the phase portrait a in Figure 2, and for the maximum transient time we choose s 1 = 0 t 0 = t 1 . In this case, the initial conditions are
s 2 2 ( t 0 ) 2 v max | s 1 ( t 0 ) | 0 , v max = α ( | s 2 ( t 0 ) | + | s 2 ( t 0 ) | β ) M + Ξ ,
and for (8) and (14) with the help of (20) the following inequality is valid
Δ 1 = t 1 t 0 2 | s 1 ( t 0 ) | | s 2 ( t 0 ) | + s 2 2 ( t 0 ) 2 v max | s 1 ( t 0 ) | ,
the value v max is chosen to get the maximum possible bound for the time interval estimation, because under condition (19) according to (8) and (14)
| s ˙ 2 | v max .
For the second variant (the phase portrait b in Figure 2), the initial conditions correspond to
s 2 2 ( t 0 ) 2 v max | s 1 ( t 0 ) | < 0 ,
and the estimation of the time interval t 1 t 0 with the help of (22) is not possible.
The part 00 1 of the curve b (see Figure 2) corresponds to the majorant of the phase portrait of (8) and (14) (it lies below the real curve), and s 2 min is computed according to
α ( | s 2 min | + | s 2 min | β ) = M Ξ .
The value of s min can be found by using numerical methods. s min is the minimal possible speed of the variable s 1 ( t ) growth under conditions (19) and (23), and the interval t 1 t 0 estimation under (23) is
Δ 1 = t 1 t 0 | s 1 ( t 0 ) | s 2 min , s 2 2 ( t 0 ) 2 v max | s 1 ( t 0 ) | < 0 .
Further, the time interval t 2 t 1 is investigated (stages 2–4).
It was mentioned earlier that the time of motion in the first and third quadrants for (8) and (14) is less than for (15) (for the parts 11 of the curves a , b see Figure 2). Taking into account that | s 2 ( t 1 ) | | s 2 ( t 0 ) | , one can write the interval estimation t 1 t 1 from (15) (see also [11])
t 1 t 1 1 α ln α | s 2 ( t 0 ) | + M Ξ M Ξ , | s 1 ( t 1 ) | M Ξ α 2 ln α | s 2 ( t 0 ) | + M Ξ M Ξ + | s 2 ( t 0 ) | α .
In order to formalize the growth rate of | s 2 ( t ) | in the interval t 2 t 1 (stages 3–4, see Figure 2), the following comparison system is considered ( s ˜ 2 ( t 1 ) = s 2 ( t 1 ) = 0 )
s ˜ ˙ 2 = α s ˜ 2 + α | s 2 min | β ( M Ξ ) sign ( s 1 ) , | s 2 ( t ) | | s ˜ 2 ( t ) | = M Ξ α | s 2 min | β 1 e α ( t t 1 ) , t t 1 ,
where s 2 min is from (24).
The interval t 2 t 1 can be separated by two subintervals [ t 1 * t 1 ] , [ t 2 t 1 * ] . In the first subinterval [ t 1 * t 1 ] | s 2 ( t ) | is bounded from below according to (27), and the the minimum transient time for the worst case is computed with the help of (8) and (14)
| s ˙ 2 ( t ) | M Ξ , t 2 t 1 2 | s 1 ( t 1 ) | M Ξ .
Therefore, one can chose the estimation of the first subinterval and the value of | s 2 ( t 1 * ) | concerned with it
t 1 * t 1 = 2 | s 1 ( t 1 ) | M Ξ , | s 2 ( t 1 * ) | M Ξ α | s 2 min | β 1 e α 2 | s 1 ( t 1 ) | M Ξ .
In the second subinterval [ t 2 t 1 * ] (see Figure 2)
| s ˙ 1 ( t ) | | s 2 ( t 1 * ) | , t 2 t 1 * | s 1 ( t 1 ) | | s 2 ( t 1 * ) | .
Combining (28) and (29), the following estimation can be written
t 2 t 1 2 | s 1 ( t 1 ) | M Ξ + | s 1 ( t 1 ) | M Ξ α | s 2 min | β 1 e α 2 | s 1 ( t 1 ) | M Ξ .
For the second time interval, one can write the inequality taking into account (26) and (30)
Δ 2 = t 2 t 1 1 α ln α | s 2 ( t 0 ) | + M Ξ M Ξ + 2 | s 1 ( t 1 ) | M Ξ + + | s 1 ( t 1 ) | M Ξ α | s 2 min | β 1 e α 2 | s 1 ( t 1 ) | M Ξ ; | s 1 ( t 1 ) | M Ξ α 2 ln α | s 2 ( t 0 ) | + M Ξ M Ξ + | s 2 ( t 0 ) | α .
Situation 2.
Similar reasoning can be given for the case s 1 ( t 0 ) s 2 ( t 0 ) > 0 (see Figure 3). In this scenario, according to (26), the estimate of the time interval t 1 t 0 is
t 1 t 0 1 α ln α | s 2 ( t 0 ) | + M Ξ M Ξ , | s 1 ( t 1 ) | | s 1 ( t 0 ) | + M Ξ α 2 ln α | s 2 ( t 0 ) | + M Ξ M Ξ + | s 2 ( t 0 ) | α .
and the full time interval t 2 t 0 can be written from inequalities (30) and (32)
Δ 2 = t 2 t 0 1 α ln α | s 2 ( t 0 ) | + M Ξ M Ξ + 2 | s 1 ( t 1 ) | M Ξ + + | s 1 ( t 1 ) | M Ξ α | s 2 min | β 1 e α 2 | s 1 ( t 1 ) | M Ξ ; | s 1 ( t 1 ) | | s 1 ( t 0 ) | + M Ξ α 2 ln α | s 2 ( t 0 ) | + M Ξ M Ξ + | s 2 ( t 0 ) | α .

4.4. Special Case of Motion in ε 1 -Area

Situation 3.
The initial conditions are (see Figure 4)
α ( | s 2 ( t 0 ) + | s 2 ( t 0 ) | β ) < M + Ξ , s 1 ( t 0 ) s 2 ( t 0 ) < 0 .
Two scenarios are considered for this situation.
The first one corresponds to the following initial conditions (phase portraits a and b in Figure 4, stage 2–3 is absent)
α ( | s 2 ( t 0 ) + | s 2 ( t 0 ) | β ) > M Ξ , Δ 2 = t 2 t 0 2 | s 1 ( t 0 ) | | s 2 ( t 0 ) | + s 2 2 ( t 0 ) 2 v max | s 1 ( t 0 ) | ) , s 2 2 ( t 0 ) 2 v max | s 1 ( t 0 ) | 0 ; Δ 2 = t 2 t 0 | s 1 ( t 0 ) | s 2 min , s 2 2 ( t 0 ) 2 v max | s 1 ( t 0 ) | < 0 .
Let us consider in more detail the case when the initial conditions for s 2 ( t ) are α ( | s 2 ( t 0 ) + | s 2 ( t 0 ) | β ) < M Ξ (see the c phase portrait in Figure 4). Like it was previously done in (27), the value of | s 2 ( t ) | is bounded from below by function s ˜ 2 ( t )
s ˜ ˙ 2 = α s ˜ 2 + α | s 2 min | β ( M Ξ ) sign ( s 1 ) , | s ˜ 2 ( t 0 ) | = | s 2 ( t 0 ) | , | s 2 ( t ) | | s ˜ 2 ( t ) | = | s 2 ( t 0 ) | e α ( t t 0 ) + M Ξ α | s 2 min | β 1 e α ( t t 0 ) , t 0 t t 2 .
For the minimal transient time
t 1 * t 0 = 2 | s 1 ( t 0 ) | M Ξ ,
the value | s 2 ( t 1 * ) | is
| s 2 ( t 1 * ) | | s 2 ( t 0 ) | e α 2 | s 1 ( t 0 ) | M Ξ + M Ξ α | s 2 min | β 1 e α 2 | s 1 ( t 0 ) | M Ξ .
Therefore, the time interval t 2 t 0 is bounded by
Δ 2 = t 2 t 0 | s 1 ( t 0 ) | | s 2 ( t 0 ) | e α 2 | s 1 ( t 0 ) | M Ξ + M Ξ α | s 2 min | β 1 e α 2 | s 1 ( t 0 ) | M Ξ + + 2 | s 1 ( t 0 ) | M Ξ .

4.5. Estimated Time to Hit ε 2 -Area

It was shown in [10] that for y 2 ( t ) from (15) in the ε 1 -domain ( t t 2 ) there is an exponential majorant
| y 2 ( t ) | M + Ξ α e γ 0 2 ( t t 2 ) , t t 2 ,
where
γ 0 = α ( M Ξ ) 2 ( M + Ξ ) ln 1 1 0.533 c , c = M Ξ Ξ ¯ α M + Ξ .
Using this inequality, the majorant for s 2 ( t ) can be written, and the estimation of the time reaching from ε 1 -area into some ε 2 -domain can be computed. To do this, the time instants are introduced t 2 s > t 2 , t 2 y > t 2
s 1 ( t 2 s ) = 0 , y 1 ( t 2 y ) = 0 .
It was discussed above that | s 2 ( t 2 s ) | | y 2 ( t 2 y ) | . Inequality (37) was obtained for the following time interval estimates [11]:
t 2 y t 2 2 ε 1 M Ξ .
Let us find an estimate of the time interval t 2 s t 2 for (8) and (14) and, by entering a correction factor, write the resulting majorant for s 2 ( t ) . Denote t 2 ( t 2 > t 2 ) as the nearest point in time at which s 2 ( t 2 ) = 0 . Then, the estimation of the time interval t 2 t 2 and value | s 1 ( t 2 ) | computed from (8) and (14) are
| s ˙ 2 ( t ) | M Ξ , t 2 t 2 = ε 1 M Ξ , | s 1 ( t 2 ) | ε 1 2 2 ( M Ξ ) .
The bound for the interval t 2 s t 2 can be calculated from (30) by substitution estimation | s 1 ( t 2 ) | instead of | s 1 ( t 1 ) |
t 2 s t 2 ε 1 M Ξ + ε 1 2 2 ( M Ξ ) M Ξ α | s 2 min | β 1 e α ε 1 M Ξ .
Combining (38) and (39), one can get
t 2 s t 2 c ( ε 1 ) ε 1 M Ξ ,
where c ( ε 1 ) is
c ( ε 1 ) = 2 + ε 1 2 M Ξ α | s 2 min | β 1 e α ε 1 M Ξ .
According to (37) and (40) and inequality | s 2 ( t 2 s ) | | y 2 ( t 2 y ) | , the majorant for | s 2 ( t ) | , t t 2 is
| s 2 ( t ) | ε 1 e γ ( t t 2 ) , γ = α ( M Ξ ) 2 c ( ε 1 ) ( M + Ξ ) ln 1 1 0.533 c .
Then, the following estimation is valid for the time interval of reaching | s 2 ( t ) | from the ε 1 -region in some ε 2 -neighborhood
Δ 3 = t 3 t 2 1 γ ln ε 1 ε 2 .
The size of the ε 2 -area will be chosen in the next subsection.

4.6. Estimation of Motion Time in ε 2 -Domain

To estimate the time of motion at the last stage, consider the Lyapunov candidate function
V = | s 1 | ξ M s 1 + ( α s 1 + s 2 ) 2 2 M 1 β 2 ,
whose derivative along the trajectories of the system (8) and (14) has the form
V ˙ α ¯ | s 1 | α 2 M | s 2 | β s 1 sign ( s 2 ) α M | s 2 | 1 + β | s 1 | ξ M s 1 + ( α s 1 + s 2 ) 2 2 M 1 + β 2 ,
where α ¯ = α 1 Ξ M Ξ ¯ M . The trajectories of (8) and (14) are investigated on a half-cycle of oscillation under the initial conditions
s 1 ( t 3 ) = 0 , s 2 ( t 3 ) = ε 2 .
The sign of the variable s 2 ( t ) is chosen for determinacy. In this case, on the phase plane, the system motions occur in the third and the second quadrants. Let us introduce time instant t 4 > t 3 such that
s 1 ( t 4 ) = 0 .
Let us show that for a certain choice of parameters of (14) and size of ε 2 -domains, the derivative of the Lyapunov function (44) is not positive. For this, the fraction numerator of (44) is considered
z = α ¯ | s 1 | α 2 M | s 2 | β s 1 sign ( s 2 ) α M | s 2 | 1 + β .
Its partial derivatives with respect to s 1 and s 2 are
z s 1 = α ¯ sign ( s 1 ) α 2 M | s 2 | β sign ( s 2 ) , z s 2 = α 2 β s 1 | s 2 | β 1 M α ( 1 + β ) M | s 2 | β .
Let us study function z in the domain bounded by the straight lines
s 1 = c s = const < 0 , s 1 = 0 , s 2 = 0 , s 2 = ε 2 .
It is well known [19] that the smallest and the largest value of a function of two variables can be found from its local extremum points and from the study of the function at the boundaries of the region and in the “corner points”.
It is seen on the boundaries s 1 = 0 and s 2 = 0 and in the third quadrant ( s 1 < 0 s 2 < 0 ) the z is negative.
The behavior of z on the boundary s 1 = c s is studied using the second partial derivative from (47), and there is a maximum point on the level line s 1 = c s at
s 2 = α c s β β + 1 .
The substitution of the obtained extremum value into (46) leads to
z = c s α ¯ α 2 M | s 2 | β ( β + 1 ) .
Taking into account the exponential convergence in the ε 1 -region, we introduce the size of the ε 2 -region, in which z is negative on the level lines s 1 = c s
ε 2 = α ¯ M ( β + 1 ) α 2 1 β .
On the other hand, in the second quadrant on the bound s 2 = ε 2 , the function z is negative under condition
z | s 1 | ( α ¯ α 2 M ε 2 β ) 0 , ε 2 α ¯ M α 2 1 β .
Thereforee, comparing (48) and (49), the value of ε 2 is chosen according to (49).
Now z is investigated for the local extrema. By equaling the partial derivatives (47) to zero, the suspicious points for extremums can be found
s 1 = 1 + β α β α ¯ M α 2 1 β , s 2 = α ¯ M α 2 1 β .
The test of sufficient conditions
2 z s 1 2 = 0 , 2 z s 1 s 2 = α 2 β | s 2 | β 1 M ; 2 z s 2 2 = ( β 1 ) α 2 β s 1 | s 2 | β 2 M α β ( 1 + β ) M | s 2 | β 1 ; 2 z s 1 2 2 z s 1 s 2 2 z s 1 s 2 2 z s 1 s 2 = 2 z s 1 s 2 2 < 0 ,
shows that this is the saddle point.
Finally, the choice of the ε 2 -area size according to (49) guarantees that the derivative of the Lyapunov function (44) is negative in the second and third quadrants.
The asymptotic convergence of the variables of the system (8) and (14) to zero implies the inequality
| s 2 ( t 4 ) | < | s 2 ( t 3 ) | = ε 2 ,
using which the upper bound for (44) can be rewritten in the third quadrant ( s 1 < 0 , s 2 < 0 ):
V ˙ ( 2 M ) 1 + β 2 α ¯ | s 1 | + α 2 M | s 2 | β s 1 sign ( s 2 ) + α M | s 2 | 1 + β ε 2 1 + β 2 β 2 2 α M β 1 2 | s 2 | 1 + β ε 2 1 + β .
The time interval t 4 t 3 is estimated like in (40)
t 4 t 3 2 + ε 2 2 M Ξ α | s 2 min | β 1 e α ε 2 M Ξ ε 2 M Ξ .
The average value of (50) is in the time interval t t 3 , t 4 , taking into account that for the second quadrant V ˙ 0 ( t 3 t t 4 )
V ˙ a v = 1 t 4 t 3 t 3 t 4 V ˙ 2 β 2 2 α M β 1 2 ε 2 1 + β ( t 4 t 3 ) t 3 t 3 | s 2 ( τ ) | 1 + β d τ .
In the third quadrant, the inequalities are valid
s ˙ 2 v , s 2 ( t ) ε 2 + v ( t t 3 ) , t 3 t t 3 r ; v = α ( ε 2 + ε 2 β ) + M + Ξ 2 ( M + Ξ ) , t 3 r t 3 = ε 2 v .
This majorant is chosen to get the minimal value of the integral from the right-hand side of (52)
t 3 t 3 | s 2 ( τ ) | 1 + β d τ t 3 t 3 r | ε 2 + v ( τ t 3 ) | 1 + β d τ ε 2 2 + β 2 ( 2 + β ) ( M + Ξ ) .
The substitution of (51) and (53) into (52) leads to
V ˙ a v 2 β 2 α M β 1 2 ( M Ξ ) 2 ( 2 + β ) ( M + Ξ ) 2 + ε 2 2 M Ξ α | s 2 min | β 1 e α ε 2 M Ξ .
The upper bound of the convergence time to zero inside the ε 2 -zone is computed according to
Δ 4 = t r t 3 V ( t 3 ) | V ˙ a v | = ( 2 + β ) ( M + Ξ ) 2 + ε 2 2 M Ξ α | s 2 min | β 1 e α ε 2 M Ξ ε 2 1 β α ( M Ξ ) .
The upper bound for the full convergence time t r t 0 is calculated with the help of (22), (25), (31), (33), (34), (36), (42) and (55), and it is equal to i = 1 4 Δ i for Situation 1 and i = 2 4 Δ i for the other situations.

5. Numerical Example

For the numerical example, a one-link robot manipulator with a dynamical actuator is considered (see Figure 5).
φ ˙ = ω , ω ˙ = 1 J τ m g l cos φ , τ ˙ = k τ + u + ξ ( t ) ,
where φ is the angular position of the robot arm, [ rad ] ; ω is the angular velocity, [ rad / s ] ; τ is the actuator torque, [ N · m ] ; u is the control input, [ ( Ω · N · m ) / H ] ; J is the generalized inertia, [ kg · m 2 ] ; m is the mass of the arm of the robot, [ kg ] ; l is the position of the center of the mass of the robot [ m ] ; the external perturbation is
ξ ( t ) = 10 sin ( 5 t ) 4 2 cos ( 9 t ) [ ( Ω · N · m ) / H ] .
It is assumed that φ , ω , ω ˙ , τ are available for the measurement; the parameters l , k , J , m are known.
The regulation problem is considered in the simulation
lim t | φ ¯ | = 0 , φ ¯ = φ φ z , φ z = const >   0 .
The goal of the numerical example is to show the steady-state error for the designed control law (14) and “twisting” algorithm [12,16]. Therefore, the difference between the two algorithms is introduced during the last design step.
The following coordinate transformation is introduced as
ω ¯ = ω + l 1 ( φ φ z ) , τ ¯ = 1 J τ m g l cos φ l 1 2 φ ¯ + l 1 ω ¯ , l 1 = const > 0 .
The substitution of (58) into (56) leads to
φ ¯ ˙ = l 1 φ ¯ + ω ¯ , ω ¯ ˙ = τ ¯ , τ ¯ ˙ = k J τ + m g l J sin φ ( l 1 φ + ω ¯ ) + l 1 3 φ ¯ l 1 2 ω ¯ + l 1 τ ¯ + u J + ξ ( t ) J ,
According to (57), for the perturbation, the following inequalities can be written
| ξ ( t ) | Ξ = 16 [ ( Ω · N · m ) / H ] , | ξ ˙ ( t ) | Ξ ¯ = 68 [ ( Ω · N · m ) / ( H · s ) ] .
For the numerical simulation of (14), developed in this paper, the following algorithm is chosen using parameters from Table 1
u c = k τ m g l sin φ ( l 1 φ + ω ¯ ) l 1 3 J φ ¯ + l 1 2 J ω ¯ l 1 J τ ¯ .
u p r = u c α τ ¯ α | τ ¯ | β sign ( τ ¯ ) M sign ( ω ¯ ) ,
where parameter α is chosen according to (14)
α J M J Ξ J > Ξ ¯ J α > 1.7714 .
It was shown during the convergence proof that the convergence time depends on the value of α . The faster motion in the ε 1 -area is for smaller α . Therefore, the first experiment is provided with α = 5 , and for further simulation, α = 50 is used (see Table 1). The results of the behavior of the closed-loop system with the proposed algorithm are depicted in Figure 6 with
V = | ω ¯ | ξ 18 ω ¯ + ( 5 ω ¯ + τ ¯ ) 2 36 0.4 .
The “twisting” control law (11) with parameters from Table 1 is used
u t w i s t = u c M 2 sign ( τ ¯ ) M 1 sign ( ω ¯ ) ,
and the relay amplitudes are chosen according to (12)
M 1 > Ξ + M 2 M 1 > M 2 + 16 ; M 2 > Ξ M 2 > 16 .
The simulation result of the “twisting ” algorithm is shown in Figure 7.
There are zoomed areas depicted in Figure 6b and Figure 7b. It is seen that there are real second-order sliding modes that exist in the sense of Definitions 6 and 7 and Proposition 1. This corresponds to the well-known “chattering” problem, and its reduction is one of the challenges concerned with sliding mode theory [1]. For further experiments, the ideal relay element is changed for some static or dynamic non-ideality. Let us denote the maximum errors of the variable ω ¯ in the steady-state for (11) and (14) as e t w i s t and e p r .
  • Experiment 2. The sign function sign ( ω ¯ ) in (62) and (63) is replaced with the relay with hysteresis Δ = const > 0 . For numerical simulation, the Euler method is used with the integration step t s = 10 5 s. The errors in the steady-state are reported in Table 2.
  • Experiment 3. The sign function sign ( ω ¯ ) in (62) and (63) is changed with the delay relay sign [ ω ¯ ( t τ d ) ] , τ d = const > 0 . For the numerical simulation, the Euler method is used with the integration step t s = 10 5 s. The simulation results are shown in Table 3.
  • Experiment 4. To demonstrate the dependence of the steady-state control error on the switching frequency of the relay, the simulation is provided for closed-loop systems (8), (61) and (62) and (8), (61) and (63) using the Euler method with different integration steps t s . The simulation results are shown in Table 4.
It follows from the numerical experiments (see Table 2, Table 3 and Table 4) that reducing the amplitude of the relay M in (62) in comparison to other modern algorithms [12,16] provides smaller steady-state errors (in some cases, the error ratio can be several orders of magnitude smaller).
From the transient process analysis, it follows that using a higher gain coefficient α in (62) leads to less regulation error, but the long lag (see Figure 6c) is the price for such a result. Therefore, the compromise must be made between the sufficiently large α and transient time duration.

6. Conclusions

In this paper, a new class of controllers based on second-order sliding modes was proposed. The proof of the finite time convergence to the second-order sliding mode set was made based on the method of averaging the Lyapunov function and phase portrait analysis. With the designed control law, stability is ensured at lower relay amplitudes in comparison to the existing second-order sliding mode algorithms. Essentially, during the proof, the requirement of homogeneity of differential equations describing a closed control loop system was not imposed. This significantly expands the class of functions that can be used in the feedback. The further search for new Lyapunov functions for better transient process analysis is an open problem. Moreover, the adaptation of the designed algorithm for bounded control inputs needs to be considered more carefully. Moreover, due to the results, the case for discontinuous disturbances must be considered carefully because according to the simulation results of the real second-order sliding mode, the full invariance is not achieved, and the prescribed accuracy can be provided with the designed control law with less control input bounds.

Author Contributions

Conceptualization, methodology, S.K. and V.A.U.; validation, investigation, formal analysis S.K., S.A.K. and V.A.U.; writing—original draft preparation, S.K. and S.A.K.; writing—review and editing, S.A.K. and V.A.U. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Utkin, V.I.; Guldner, J.; Shi, J. Sliding Mode Control in Electromechanical Systems; Tailor and Francis: London, UK, 2009. [Google Scholar]
  2. Edwards, C.; Spurgeon, S. Sliding Mode Control: Theory and Applications; Taylor and Francis: London, UK, 1998. [Google Scholar]
  3. Emelyanov, S.V.; Korovin, S.K.; Levant, L. The new class of second order sliding mode. Math. Model. Comput. Simul. 1990, 2, 89–100. [Google Scholar]
  4. Emelyanov, S.V.; Korovin, S.K.; Levant, A. High-order sliding modes in control systems. Comput. Math. Model. 1996, 7, 294–318. [Google Scholar] [CrossRef]
  5. Levant, A. Sliding order and sliding accuracy in sliding mode control. Int. J. Control 1993, 58, 1247–1263. [Google Scholar] [CrossRef]
  6. Levant, A. Higher order sliding modes, differentiation and output feedback control. Int. J. Control 2003, 76, 924–941. [Google Scholar] [CrossRef]
  7. Bartolini, G.; Ferrara, A.; Usai, E. Chattering avoidance by second-order sliding mode control. IEEE Trans. Autom. Control 1998, 43, 241–246. [Google Scholar] [CrossRef]
  8. Bartolini, G.; Ferrara, A.; Levant, A.; Usai, E. On second order sliding mode controllers. In Variable Structure Systems, Sliding Mode and Nonlinear Control; Lecture Notes in Control and Information Science; Young, K.D., Ozguner, U., Eds.; Springer: London, UK, 1999; Volume 247, pp. 329–350. [Google Scholar]
  9. Levant, A. Principles of 2-sliding mode design. Automatica 2007, 43, 576–586. [Google Scholar] [CrossRef] [Green Version]
  10. Kochetkov, S.A.; Utkin, V.A. Providing the invariance property on the basis on oscillation modes. Dokl. Math. 2013, 88, 618–623. [Google Scholar] [CrossRef]
  11. Kochetkov, S.A.; Utkin, V.A. Invariance in systems with unmatched perturbations. Autom. Remote Control 2013, 74, 1097–1127. [Google Scholar] [CrossRef]
  12. Shtessel, Y.B.; Moreno, J.A.; Fridman, L.M. Twisting sliding mode control with adaptation: Lyapunov design, methodology and application. Automatica 2017, 75, 229–235. [Google Scholar] [CrossRef]
  13. Chen, B.; Geng, Y. Super twisting controller for on-orbit servicing to non-cooperative target. Chin. J. Aeronaut. 2015, 28, 285–293. [Google Scholar] [CrossRef] [Green Version]
  14. Chen, B.; Geng, Y. Modified super twisting controller for servicing to uncontrolled spacecraft. J. Syst. Eng. Electron. 2015, 26, 334–345. [Google Scholar] [CrossRef]
  15. González-Hernández, I.; Salazar, S.; Lozano, R.; Ramírez-Ayala, O. Real-Time Improvement of a Trajectory-Tracking Control Based on Super-Twisting Algorithm for a Quadrotor Aircraft. Drones 2022, 6, 36. [Google Scholar] [CrossRef]
  16. Edwards, C.; Shtessel, Y. Adaptive continuous higher order sliding mode control. Automatica 2016, 65, 183–190. [Google Scholar] [CrossRef] [Green Version]
  17. Mendoza-Avila, J.; Moreno, J.A.; Fridman, L.M. Continuous Twisting Algorithm for Third Order Systems. IEEE Trans. Autom. Control 2020, 65, 2812–2825. [Google Scholar] [CrossRef]
  18. Mofid, O.; Mobayen, S.; Zhang, C.; Esakki, B. Desired tracking of delayed quadrotor UAV under model uncertainty and wind disturbance using adaptive super-twisting terminal sliding mode control. ISA Trans. 2022, 123, 455–471. [Google Scholar] [CrossRef] [PubMed]
  19. Fikhtengol’ts, G.M. The Fundamentals of Mathematical Analysis: International Series of Monographs in Pure and Applied Mathematics; Pergamon Press: Oxford, UK, 2016; Volume 72. [Google Scholar]
  20. Filippov, A.F. Differential Equations with Discontinuous Right-Hand Sides; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1988. [Google Scholar]
  21. Orlov, Y. Finite time stability and robust control synthesis of uncertain switched systems. SIAM J. Control Optim. 2005, 43, 1253–1271. [Google Scholar] [CrossRef]
  22. Bhat, S.P.; Bernstein, D.S. Continuous finite-time stabilization of the translational and rotational double integrators. IEEE Trans. Autom. Control 1998, 43, 678–682. [Google Scholar] [CrossRef] [Green Version]
  23. Hahn, W. Theory and Application of Liapunov’s Direct Method; Prentice-Hall: Englewood Cliffs, NJ, USA, 1963. [Google Scholar]
  24. Ryan, E.P. An integral invariance principle for differential inclusions with applications in adaptive control. SIAM J. Control. Optim. 1998, 36, 960–980. [Google Scholar] [CrossRef]
  25. Orlov, Y. Extended invariance principle and other analysis tools for variable structure systems. In Advances in Variable Structure and Sliding Mode Control; Edwards, C., Colet, E.F., Fridman, L., Eds.; Springer: New York, NY, USA, 2006; pp. 3–22. [Google Scholar]
  26. Moreno, J.; Osorio, M. Strict Lyapunov functions for the super-twisting algorithm. IEEE Trans. Autom. Control 2012, 57, 1035–1040. [Google Scholar] [CrossRef]
  27. Zubov, V.I. Methods of A.M. Lyapunov and Their Application; Noordhoff Ltd.: Groningen, The Netherlands, 1964. [Google Scholar]
  28. Zubov, V.I. Analytic construction of Lyapunov functions. Dokl. Math. 1994, 49, 414–417. [Google Scholar]
  29. Dubljević, S.; Kazantzis, N. A new Lyapunov design approach for nonlinear systems based on Zubov’s method. Automatica 2002, 38, 1999–2007. [Google Scholar] [CrossRef]
  30. Polyakov, A.E.; Poznyak, A.S. Method of Lyapunov functions for systems with higher-order sliding modes. Autom. Remote Control 2011, 72, 944–963. [Google Scholar] [CrossRef]
  31. Polyakov, A.; Poznyak, A. Lyapunov function design for finite-time convergence analysis: “twisting” controller for second order sliding mode realization. Automatica 2009, 45, 444–448. [Google Scholar] [CrossRef]
  32. Polyakov, A.; Poznyak, A. Reaching Time Estimation for “super-twisting” second order sliding mode controller via Lyapunov function designing. IEEE Trans. Autom. Control 2009, 54, 1951–1955. [Google Scholar] [CrossRef]
  33. Utkin, V. On convergence time and disturbance rejection of super-twisting control. IEEE Trans. Autom. Control 2013, 58, 2013–2017. [Google Scholar] [CrossRef]
  34. Sanders, J.A.; Verhulst, F.; Murdock, J. Averaging Methods in Nonlinear Dynamical Systems; Applied Mathematical Sciences; Springer Science+Business Media: Ney York, NY, USA, 2007; Volume 59. [Google Scholar]
  35. Zwillinger, D. Handbook of Differential Equations; Academic Press: San Diego, CA, USA, 1997. [Google Scholar]
  36. Coddington, E.A.; Levinson, N. Theory of Ordinary Differential Equations; McGraw-Hill: New York, NY, USA, 1955. [Google Scholar]
  37. Teschl, G. Ordinary Differential Equations and Dynamical Systems; American Mathematical Society: Providence, RI, USA, 2012. [Google Scholar]
Figure 1. Phase portraits of systems (8), (14) and (15).
Figure 1. Phase portraits of systems (8), (14) and (15).
Mathematics 10 02214 g001
Figure 2. Phase portraits under initial conditions from the second and fourth quadrants (Situation 1).
Figure 2. Phase portraits under initial conditions from the second and fourth quadrants (Situation 1).
Mathematics 10 02214 g002
Figure 3. Phase portraits under initial conditions from the first and third quadrants (Situation 2).
Figure 3. Phase portraits under initial conditions from the first and third quadrants (Situation 2).
Mathematics 10 02214 g003
Figure 4. Phase portraits under initial conditions from the second and fourth quadrants (Situation 3).
Figure 4. Phase portraits under initial conditions from the second and fourth quadrants (Situation 3).
Mathematics 10 02214 g004
Figure 5. Robot manipulator diagram.
Figure 5. Robot manipulator diagram.
Mathematics 10 02214 g005
Figure 6. The simulation results of the closed-loop systems (59), (61) and (62). (a) Plots of φ ( t ) and φ z ; (b) Plot of ω ¯ ( t ) ; (c) Phase portrait of ω ¯ and τ ¯ ; (d) Plot of V ( t ) .
Figure 6. The simulation results of the closed-loop systems (59), (61) and (62). (a) Plots of φ ( t ) and φ z ; (b) Plot of ω ¯ ( t ) ; (c) Phase portrait of ω ¯ and τ ¯ ; (d) Plot of V ( t ) .
Mathematics 10 02214 g006
Figure 7. The simulation results of the closed-loop systems (59), (61) and (63). (a) Plots of φ ( t ) and φ z ; (b) Plot of ω ¯ ( t ) ; (c) Phase portrait of ω ¯ and τ ¯ ; (d) Plot of τ ¯ ( t ) .
Figure 7. The simulation results of the closed-loop systems (59), (61) and (63). (a) Plots of φ ( t ) and φ z ; (b) Plot of ω ¯ ( t ) ; (c) Phase portrait of ω ¯ and τ ¯ ; (d) Plot of τ ¯ ( t ) .
Mathematics 10 02214 g007
Table 1. The simulation parameters.
Table 1. The simulation parameters.
k , ( Ω / H ) J , ( kg · m 2 ) m , ( kg ) l , ( m ) β
10 0.0521 0.338 0.34 0.2
l 1 , ( rad / s ) M 1 , ( ( Ω · N · m ) / H ) M 2 , ( ( Ω · N · m ) / H ) M , ( ( Ω · N · m ) / H ) α , ( ( Ω · m 2 · kg ) / H )
0.5 3618185/50
Table 2. The simulation results for non-ideal relay type with hysteresis.
Table 2. The simulation results for non-ideal relay type with hysteresis.
Δ 0.1 1 × 10 2 10 3 10 4
e t w i s t 0.294 2.95 × 10 2 2.91 × 10 3 2.936 × 10 4
e p r 0.1 1 × 10 2 1 × 10 3 1 × 10 4
e t w i s t e p r 2.94 2.95 2.91 2.936
Table 3. The results of simulation of control laws with delay.
Table 3. The results of simulation of control laws with delay.
τ d 0.01 10 3 10 5 10 5
e t w i s t 0.47 4.02 × 10 3 5.05 × 10 5 2.44 × 10 6
e p r 7.3 × 10 4 6.3 × 10 5 3.025 × 10 6 4.1 × 10 7
e t w i s t e p r 643.83 63.81 16.69 5.95
Table 4. The simulation results with different integration steps.
Table 4. The simulation results with different integration steps.
t s 10 3 10 4 10 5
e t w i s t 8.22 × 10 3 7.52 × 10 5 8.07 × 10 7
e p r 1.28 × 10 3 1.55 × 10 5 2.31 × 10 7
e t w i s t e p r 6.422 4.851 3.494
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Kochetkov, S.; Krasnova, S.A.; Utkin, V.A. The New Second-Order Sliding Mode Control Algorithm. Mathematics 2022, 10, 2214. https://doi.org/10.3390/math10132214

AMA Style

Kochetkov S, Krasnova SA, Utkin VA. The New Second-Order Sliding Mode Control Algorithm. Mathematics. 2022; 10(13):2214. https://doi.org/10.3390/math10132214

Chicago/Turabian Style

Kochetkov, Sergey, Svetlana A. Krasnova, and Victor A. Utkin. 2022. "The New Second-Order Sliding Mode Control Algorithm" Mathematics 10, no. 13: 2214. https://doi.org/10.3390/math10132214

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