Open access peer-reviewed chapter

Discrete‐Time Sliding Mode Control with Outputs of Relative Degree More than One

Written By

Sohom Chakrabarty, Bijnan Bandyopadhyay and Andrzej Bartoszewicz

Submitted: 29 September 2016 Reviewed: 03 April 2017 Published: 28 June 2017

DOI: 10.5772/intechopen.68931

From the Edited Volume

Recent Developments in Sliding Mode Control Theory and Applications

Edited by Andrzej Bartoszewicz

Chapter metrics overview

1,455 Chapter Downloads

View Full Metrics

Abstract

This work deals with sliding mode control of discrete‐time systems where the outputs are defined or chosen to be of relative degrees more than one. The analysis brings forward important advancements in the direction of discrete‐time sliding mode control, such as improved robustness and performance of the system. It is proved that the ultimate band about the sliding surface could be greatly reduced by the choice of higher relative degree outputs, thus increasing the robustness of the system. Moreover, finite‐time stability in absence of uncertainties is proved for such a choice of higher relative degree output. In presence of uncertainties, the system states become finite time ultimately bounded in nature. The work presents in some detail the case with relative degree two outputs, deducing switching and non‐switching reaching laws for the same, while for arbitrary relative degree outputs, it shows a general formalisation of a control structure specific for a certain type of linear systems.

Keywords

  • discrete time
  • sliding mode control
  • finite-time stability
  • robust control
  • ultimate band

1. Introduction

Sliding mode control is a robust control technique, which is able to make the system insensitive towards a particular class of uncertainties in finite time. Such uncertainties, known as matched uncertainties, are those that appear along the input channel of the system and can be nullified by a simple switching control structure when the disturbance is bounded in nature. The switch happens about a surface in the space of the state variables and is called a sliding or a switching surface. The sliding variable s = s ( x ) denotes how far the system states are from the sliding surface S = { x : s ( x ) = 0 } . The control brings the system monotonically towards the sliding surface, thus | s ( t ) | reducing until it becomes zero at a finite time. This is called the reaching phase. Once the system hits the surface, it stays there for all future times, thus making the system dynamics independent of the matched uncertainties and dependent only on the sliding surface parameters. Chosen appropriately, one can ensure that the system states become at least asymptotically stable during this phase called sliding motion of the system [15].

However, in practice, this beautiful property of sliding mode control could not be realized because of physical limitations of an actuator. Theoretically, the control needs to switch about the sliding surface with infinite frequency in order to be insensitive towards bounded matched uncertainties, but no real actuators can offer switching with infinite frequency. This causes chattering, which are high frequency actuator action giving rise to unmodelled dynamics excitation in the system as well as rapid degradation of the physical system. Moreover, measurements by sensors and control computation in a digital computer take place in finite‐time intervals in modern times, thus ripping off the properties of continuous sliding mode control which made it theoretically so appealing.

To remove this gap between theory and practice, researchers developed the theory of discrete‐time sliding mode control (DSMC) in [13, 16, 17, 19, 20, 22, 23]. Moreover, there are many inherently discrete‐time systems that appear in nature as well as in engineering. For such discrete representation of a system, it was shown that the states of these systems can no longer hit the sliding surface and stay there in presence of disturbances. The best that can be achieved is ultimate boundedness of the system about the sliding surface in finite time. Hence, robustness of the system gets defined by the width of this ultimate band for discrete‐time systems. It then becomes imperative that research takes place in the direction to reduce the width of the ultimate band, ensuring better robustness of the system. The work in this chapter is motivated by this objective and in the sequel it is shown how the choice of the relative degree of the output (or the sliding variable) to be greater than one, positively influences the robustness as well as the performance of the system as defined above. From this point and further in the chapter, the terms ‘output’ and ‘sliding variable’ will be used interchangeably, as sliding variable can be viewed as a constructed output of the system.

Traditionally, DSMC has been developed by taking outputs of relative degree one, i.e. there is only unit delay between the output and the input of the system. This has given rise to proposals of various reaching laws of the form s ( k + 1 ) = f ( s ( k ) ) , where s ( k ) is the sliding variable at the k th time step. These reaching laws make | s ( k ) | approach an ultimate band about the sliding surface in finite time. One can readily calculate the control that does so from the reaching law, since s ( k + 1 ) contains the control u ( k ) , when calculated from the system model. The most well‐known reaching laws are laid down in Refs. [2, 3, 17]. Of the above, the first two papers deal with non‐switching reaching laws, whereas the third one had proposed a switching reaching law. Even to this day, reaching law propositions form an important area of work in discrete‐time sliding mode control, with different reaching laws favouring the design of control for a particular type of system. Some of these reaching laws are found in Refs. [511, 21, 24, 25].

The unity relative degree assumed in all the above works is also their major limitation. While it is the normal case to consider, there is no real restriction on the choice of this relative degree. In some system structures, the output can be naturally of relative degree more than one. In others, one can easily construct an output with higher relative degree and consider it to the sliding variable to go about the analysis. In the recent studies [13, 14] which constitute the content in this chapter, it is shown that when this apparent limitation is lifted, we get reduced width of ultimate band, thus increasing robustness, as well as finite‐time stability during sliding in absence of uncertainties. The latter is an important achievement, as previously finite‐time stability during sliding for discrete‐time systems had not been achieved. Only in Ref. [18], such finite‐time stability of states had been achieved during sliding, but with specific design of surface parameters. With relative degree more than one, this finite‐time stability of the system states during sliding is always guaranteed for a wide range of choices of the surface parameters.

The chapter is written as follows: in Section 2, an idea on the relative degree of outputs for discrete‐time systems is given, which is used in the theoretical developments in the remainder of the chapter. In Section 3, a detailed work with reaching law propositions is done for relative degree two outputs for general linear time‐invariant (LTI) systems of order n . For arbitrary relative degree outputs, a generalized control structure is proposed for a specific form of LTI systems in Section 4, in which the relative degree r is equal to the order n of the system. Improved robustness and finite‐time stability are proved for all cases in both the sections. Simulation examples are also shown in each section, which corroborate the theoretical developments. The chapter ends with discussing the main results and implications thereof.

Advertisement

2. Relative degree for discrete‐time systems

The concept of relative degree is well understood for continuous‐time systems. The definition can be written as follows:

Definition 1: For a continuous‐time system

x ˙ = f c ( t , x , u ) E1

the output y ( t ) is said to be of relative degree r if y r = g r ( t , x , u ) and y i = g i ( t , x )     0 i < r , where u ( t ) is the control input and y p denotes the p th time derivative of y .

The above definition means that the control first appears physically in the r th derivative of the output y ( t ) and not before that.

The concept of relative degree for discrete‐time systems can be easily understood by making a parallel of the above definition in the discrete‐time domain. The derivative operator in continuous time becomes the difference operator in discrete time. Each difference introduces a delay between the output and the input of the system. With this in mind, one can propose the definition of relative degree for discrete‐time systems as follows:

Definition 2: For a discrete‐time system

x ( k + 1 ) = f d ( k ,   x ( k ) ,   u ( k ) ) E2

the output y ( k ) is said to be of relative degree r if y ( k + r ) = h r ( k ,   x ( k ) ,   u ( k ) ) and y ( k + i ) = h i ( k ,   x ( k ) )     0 i < r , where u ( k ) is the control input and y ( k + p ) denotes the p unit delays of y .

Physically, the above definition means that the control first appears in the r th delay of the output y ( k ) and not before that. For a simple LTI system ( A , B , C ) , this will mean that C A i 1 B = 0     i = 1   t o   ( r 1 ) and C A r B 0 .

Advertisement

3. Systems with relative degree two output

Let us consider a discrete‐time LTI system in the regular form as

x 1 ( k + 1 ) = A 11 x 1 ( k ) + A 12 x 2 ( k ) x 2 ( k + 1 ) = A 21 x 1 ( k ) + A 22 x 2 ( k ) + B 2 u ( k ) + B 2 f ( k ) E3

where x 1 ( k ) R n m and x 2 ( k ) R m are the n states and u ( k ) R m is the control input. The disturbance f ( k ) R m is assumed to be bounded as | | f ( k ) | | f m .

Obviously A 11 R ( n m ) × ( n m ) , A 12 R ( n m ) × m , A 21 R m × ( n m ) , A 22 R m × m and B 2 R m × m . Let us assume det ( B 2 ) 0 . Written in the standard form x ( k + 1 ) = A x ( k ) + B ( u ( k ) + f ( k ) ) for LTI systems, we shall have A = [ A 11 A 12 A 21 A 22 ] and B = [ 0 B 2 ] .

3.1. Asymptotic stability with relative degree one output

A relative degree one output for the discrete‐time system as in Eq. (3) can be proposed as

s 1 ( k ) = C 1 T x ( k ) = C x 1 ( k ) + I m x 2 ( k ) E4

where C R m × ( n m ) and the suffix 1 denotes relative degree one. Then

C 1 T B = [ C I m ] [ 0 B 2 ] = B 2     E5

and we can calculate the control u ( k ) from

s 1 ( k + 1 ) = C 1 T A x ( k ) + C 1 T B u 1 ( k ) + C 1 T B f ( k ) E6

using some relative degree one reaching law for s ( k ) , since B 2 is non‐singular.

Design of C is done considering closed‐loop performance during sliding motion of the nominal system, i.e. system with f ( k ) = 0 . When the system is sliding, output s 1 ( k ) is zero, which makes x 2 ( k ) = C x 1 ( k ) . Hence, the closed loop during sliding becomes

x 1 ( k + 1 ) = ( A 11 A 12 C ) x 1 ( k ) E7

which is traditionally made asymptotically stable by choosing λ max ( A 11 A 12 C ) < 1 . Since x 2 ( k ) is algebraically related to x 1 ( k ) , it also settles down to zero asymptotically.

3.2. Finite‐time stability with relative degree two output

For the system in Eq. (3), a relative degree two output can be

s 2 ( k ) = C 2 T x ( k ) = C x 1 ( k ) E8

where C R m × ( n m ) can be chosen same as in Eq. (4) or different, but satisfying the conditions in Theorem 1 below. The suffix 2 is used to denote relative degree two.

Now C 2 T B = [ C 0 ] [ 0 B 2 ] = 0 clearly shows that

s 2 ( k + 1 ) = C 2 T A x ( k ) E9

as calculated from the system dynamics in Eq. (3) does not contain the control input u ( k ) . Then we need to further assume C 2 T B = [ C 0 ] [ A 11 A 12 A 21 A 22 ] [ 0 B 2 ] = C A 12 B 2 to be non‐singular so that the output s 2 ( k ) is of relative degree two. Then we obtain

s 2 ( k + 2 ) = C 2 T A 2 x ( k ) + C 2 T A B ( u 2 ( k ) + f ( k ) ) E10

by adding one more delay to Eq. (9). The control input u ( k ) can now be obtained using Eq. (10).

Theorem 1. If K e r ( C ) = 0 and det ( C A 12 ) 0 , then the output s 2 ( k ) with relative degree two as designed in Eq. (8) ensures finite‐time stability of the states of the system in Eq. (3) during sliding, in absence of the disturbance f ( k ) .

Proof. During sliding, s 2 ( k ) = C x 1 ( k ) = 0 . If K e r ( C ) = 0 , it follows that x 1 ( k ) = 0 during sliding. Also, we have s 2 ( k + 1 ) = C A 11 x 1 ( k ) + C A 12 x 2 ( k ) = 0 during sliding which implies x 2 ( k ) = ( C A 12 ) 1 C A 11 x 1 ( k ) . As x 1 ( k ) = 0 , it follows that x 2 ( k ) = 0 as well, since C A 12 is assumed to be non‐singular. Hence, all the states become zero at the same instant as the output hits zero. This happens in finite time for any appropriately designed reaching law, which can bring the nominal system to the sliding surface in finite time. Thus, one can conclude that the system states become finite‐time stable with the choice of relative degree two output.

Note that, K e r ( C ) = 0 is only a sufficient condition and not a necessary one in order to achieve finite‐time stability of system states. The above theorem points out an important achievement in the closed‐loop reduced order dynamics compared to the choice of the relative degree one output. Of course, if there is a disturbance, then the finite‐time stability would be changed to finite time‐bounded stability, i.e. the system states will only enter an ultimate band in a finite time and stay there.

Remark 1. In simulations, the parameter C is chosen the same for both relative degree one and two outputs for comparison purposes. However, selection of the parameter C for relative degree two output does not in any way require apriori design of the same parameter for a relative degree one output. The property of finite‐time stability is inherent to the relative degree two output systems provided   C is selected as per the conditions in Theorem 1, which are easy to satisfy.

3.3. Non‐switching reaching law

In Ref. [3], a reaching law for discrete‐time systems is introduced as

s ( k + 1 ) = s d ( k + 1 ) + d ( k ) s d ( k ) = { k * k k * s ( 0 )   for   k < k * 0   for   k k * E11

and d ( k ) is an uncertainty derived from the system uncertainty f ( k ) . It is evident that this reaching law makes the sliding variable | s ( k ) | d m     k k * , i.e. d m is the ultimate band for the sliding variable s ( k ) , where the uncertainty d ( k ) is bounded as | d ( k ) | d m .

3.3.1. Ultimate band for relative degree one output

It is evident that

s 1 ( k + 1 ) = C 1 T x ( k + 1 ) = C 1 T A x ( k ) + C 1 T B ( u 1 ( k ) + f ( k ) ) E12

which requires d ( k ) = d 1 ( k ) = C 1 T B f ( k ) in Eq. (11) so that the control

u 1 ( k ) = ( C 1 T B ) 1 [ ( C 1 T A ) x ( k ) s d ( k + 1 ) ] E13

does not contain any uncertain terms. This makes the bound of d 1 ( k ) for relative degree one outputs as

d 1 m = | | C 1 T B | | f m = | | B 2 | | f m E14

which is the ultimate band δ 1 as well.

3.3.2. Ultimate band for relative degree two output

It is already shown that s 2 ( k + 1 ) does not contain the control input as well as the matched disturbance, being a relative degree two output. Hence, we obtain

s 2 ( k + 2 ) = C 2 T x ( k + 2 ) = C 2 T A 2 x ( k ) + C 2 T A B ( u ( k ) + f ( k ) ) E15

containing the control input and this requires to extend the reaching law in Eq. (11) to find s 2 ( k + 2 ) . It is done by taking the nominal part of the reaching law (without d ( k ) ) and adding an unit delay to find s 2 ( k + 2 ) . Then we include d 2 ( k ) to take care of the matched disturbance. This gives the extended reaching law for relative degree two outputs as

s 2 ( k + 2 ) = s d ( k + 2 ) + d 2 ( k ) s d ( k ) = { k * k k * s ( 0 )   for   k < k * 0   for   k k ^ * E16

With d 2 ( k ) = C 2 T A B f ( k ) in Eq. (16), the control input

u 2 ( k ) =   ( C 2 T A B ) 1 [ ( C 2 T A 2 x ( k ) s d ( k + 2 ) ] E17

does not contain any uncertain terms. The bound of d 2 ( k ) in this case is

d 2 m = | | C 2 T A B | | f m | | C A 12 | | | | B 2 | | f m = | | C A 12 | | d 1 m E18

which is the ultimate band δ 2 as well.

Theorem 2. If in addition to the conditions in Theorem 1, C also satisfies λ max ( C A 12 ) < 1 , then the ultimate band δ 2 for the relative degree two output with reaching law in Eq. (16) is lesser than the ultimate band δ 1 for the relative degree one output with reaching law in Eq. (11), irrespective of whether the parameter C is chosen same for both relative degree cases.

Proof. The property is straightforward to see from Eq. (18).

3.4. Switching reaching law

In Ref. [17], Gao et al. proposed a switching reaching law for discrete time SMC systems, which has the form

s 1 ( k + 1 ) = α s 1 ( k ) β 1 sign ( s 1 ( k ) ) + d 1 ( k ) E19

where α ( 0 , 1 ) and β 1 > d 1 m are real constants, d 1 ( k ) is the uncertainty derived from the system uncertainty f ( k ) and bounded as | d 1 ( k ) | < d 1 m . At present there are two ways to analyse Gao's reaching law, one provided in Ref. [4] and the other in Ref. [12]. In this work, the well‐known analysis established in Ref. [4] is followed.

3.4.1. Ultimate band for relative degree one output

It is already shown that

s 1 ( k + 1 ) = C 1 T x ( k + 1 ) = C 1 T A x ( k ) + C 1 T B ( u 1 ( k ) + f ( k ) ) E20

which requires d 1 ( k ) = C 1 T B f ( k )   in Eq. (19) so that the control input

u 1 ( k ) =   ( C 1 T B ) 1 [ C 1 T A x ( k ) α C 1 T x ( k ) + β 1 sign ( C 1 T x ( k ) ) ] E21

does not contain uncertain terms. This makes the bound of d 1 ( k ) for relative degree one outputs as

d 1 m = | | C 1 T B | | f m = | | B 2 | | f m E22

which is the same as Eq. (14) in Section 3.3.1.

As per the analysis in Ref. [4] of the reaching law in Eq. (19), we need β 1 > ( 1 + α ) ( 1 α ) d 1 m for crossing‐recrossing s 1 ( k ) = 0 at each successive step after crossing it for the first time. The ultimate band is then calculated as

δ 1 = β 1 + d 1 m > 2 d 1 m 1 α E23

3.4.2. Ultimate band for relative degree two output

It is already shown that s 2 ( k + 1 ) does not contain the input. Hence, we calculate

s 2 ( k + 2 ) = C 2 T x ( k + 2 ) = C 2 T A 2 x ( k ) + C 2 T A B ( u 2 ( k ) + f ( k ) ) E24

where the control input appears. This requires one to also extend the reaching law in Eq. (11) to find s 2 ( k + 2 ) . This is done by taking the nominal part of the reaching law (i.e. with d ( k ) = 0 ) and adding another unit delay to find s 2 ( k + 2 ) . Then we include d 2 ( k ) to take care of the matched disturbance. This gives the extended reaching law as

s 2 ( k + 2 ) = α 2 s 2 ( k ) α β 2 sign ( s 2 ( k ) ) β 2 sign ( s 2 ( k + 1 ) ) + d 2 ( k ) E25

With d 2 ( k ) = C 2 T A B f ( k ) in Eq. (25), the control

u 2 ( k ) = ( C 2 T A B ) 1 [ ( C 2 T A 2 α 2 C 2 T ) x ( k ) + α β 2 sign ( C 2 T x ( k ) ) + β 2 sign ( C 2 T A x ( k ) ) ] E26

becomes devoid of any uncertain terms. The bound of d 2 ( k ) in this case is

d 2 m = | | C 2 T A B | | f m | | C A 12 | | | | B 2 | | f m = | | C A 12 | | d 1 m E27

which is same as Eq. (18) in Section 3.3.2. The task now is to determine the ultimate band δ 2 and the conditions on β 2 that needs to be satisfied. These are evaluated keeping in mind the property of crossing‐recrossing about s 2 ( k ) = 0 as imposed in the original work in Ref. [17] for relative degree one output. For simplicity, we perform the analysis assuming s 2 ( k ) R . For a higher‐dimensional output s 2 ( k ) , the same analysis shall hold for each element of the vector.

Let us consider the sliding variable s 2 ( k ) at two consecutive time instants. In other words, we take into account the values of both s 2 ( k ) and s 2 ( k + 1 ) , where k is any non‐negative integer. Then, one can either have sign ( s 2 ( k + 1 ) ) = sign ( s 2 ( k ) ) or sign ( s 2 ( k + 1 ) ) =     sign ( s 2 ( k ) ) .

Lemma 1. If β 2 > d 2 m 1 + α and sign ( s 2 ( k + 1 ) ) = sign ( s 2 ( k ) ) , then | s 2 ( k + 2 ) | is strictly smaller than | s 2 ( k ) | or crosses the hyperplane s 2 ( k ) = 0 .

Proof. For sign ( s 2 ( k + 1 ) ) = sign ( s 2 ( k ) ) = 1 , from Eq. (25) we get

s 2 ( k + 2 ) α 2 s 2 ( k ) ( 1 + α ) β 2 + d 2 m < s 2 ( k ) E28

since β 2 > d 2 m 1 + α .

For sign ( s 2 ( k + 1 ) ) = sign ( s 2 ( k ) ) = 1 , from Eq. (25) we get

s 2 ( k + 2 ) α 2 s 2 ( k ) + ( 1 + α ) β 2 d 2 m > s 2 ( k ) E29

It is straightforward to conclude from the above two inequalities that | s 2 ( k + 2 ) | < | s 2 ( k ) | or sign ( s 2 ( k + 2 ) ) = sign ( s 2 ( k + 1 ) ) = sign ( s 2 ( k ) ) .

Lemma 1 can be geometrically interpreted as follows: if the states x ( k ) and x ( k + 1 ) are on the same side of the sliding hyperplane, then either x ( k + 2 ) is at the same side of the hyperplane and closer to it than x ( k ) or x ( k + 2 ) is on the other side of the hyperplane.

As k is an arbitrary non‐negative integer, the above lemma demonstrates that there exists such a finite k 0 > 0 that   i < k 0 , we have sign [ s 2 ( i ) ] = sign [ s 2 ( 0 ) ] and sign [ s 2 ( k 0 ) ] =   sign [ s 2 ( 0 ) ] . That is, there exists a finite time instant k 0 , at which the sliding variable s 2 ( k ) changes its sign. In other words, the system crosses the sliding surface in finite time.

Lemma 2. If β 2 > d 2 m 1 α and sign ( s 2 ( k + 1 ) ) =   sign ( s 2 ( k ) ) , then sign ( s 2 ( k + 2 ) ) = sign ( s 2 ( k ) ) .

Proof. With sign ( s 2 ( k + 1 ) ) =   sign ( s 2 ( k ) ) , from Eq. (25) we get

s 2 ( k + 2 ) = α 2 s 2 ( k ) α β 2 sign ( s 2 ( k ) ) β 2 sign ( s 2 ( k + 1 ) ) + d 2 ( k ) = α 2 s 2 ( k ) α β 2 sign   ( s 2 ( k ) ) + β 2 sign ( s 2 ( k ) ) + d 2 ( k ) = α 2 s 2 ( k ) + ( 1 α ) β 2 sign ( s 2 ( k ) ) + d 2 ( k ) E30

Since β 2 > d 2 m 1 α , then for any | d 2 ( k ) | < d 2 m , we get sign ( s 2 ( k + 2 ) ) = sign ( s 2 ( k ) ) .

As k is an arbitrary non‐negative integer, the above lemma implies that β 2 > d 2 m 1 α is both a necessary and sufficient condition for crossing‐recrossing the sliding hyperplane s 2 ( k ) = 0 at each successive step after crossing it for the first time. Furthermore, the condition on β 2 in Lemma 2 automatically guarantees that the condition on β 2 in Lemma 1 holds. This concludes that the former is a necessary and sufficient condition for generating the quasi‐sliding mode in the sense of Gao [17]. Indeed, when β 2 > d 2 m 1 α is satisfied, then the system crosses the sliding hyperplane in a finite time and then recrosses it again in every consecutive step. However, the sequence { | s ( k ) | } may not necessarily approach zero monotonically, but the sequence of every alternate sample of { | s ( k ) | } does. Ultimately, the quasi‐sliding mode is achieved when { | s ( k ) | } starts crossing‐recrossing about s ( k ) = 0 at each time step.

With the help of these ideas, the ultimate band δ 2 for the sliding variable s 2 ( k ) can be found out, which gives a measure of the robustness of the system concerned. The ultimate band must be equal to the largest steady‐state value of the sliding variable for the maximum disturbance | d 2 ( k ) | = d 2 m . This is obtained from Eq. (25) putting s 2 ( k ) = δ 2 , which also gives the value of s 2 ( k + 2 ) = δ 2 . Thus,

δ 2 = α 2 δ 2 α β 2 + β 2 + d 2 m E31

which gives

δ 2 = ( 1 α ) β 2 + d 2 m ( 1 α 2 ) > 2 d 2 m ( 1 α 2 ) E32

since β 2 > d 2 m ( 1 α ) .

Theorem 3. If in addition to the conditions as in Theorem 1, C also satisfies σ max ( C A 12 ) < 1 + α , then the ultimate band δ 2 for the relative degree two output with reaching law in Eq. (25) is lesser than the ultimate band δ 1 for the relative degree one output with reaching law in Eq. (19), irrespective of the parameter C chosen same for both relative degree cases.

Proof. Let us consider ρ > 1 . Then the inequalities in Eqs. (23) and (32) can be written as equalities multiplying the RHS with this ρ . This gives us

δ 1 = ρ 2 d 1 m ( 1 α ) δ 2 = ρ 2 d 2 m ( 1 α 2 ) E33

Taking into account the fact that d 2 m | | C A 12 | | d 1 m , we get

δ 2 δ 1 = 2 d 2 m 2 d 1 m ( 1 + α ) | | C A 12 | | ( 1 + α ) E34

Hence, δ 2 < δ 1 , if the condition λ max ( C A 12 ) < 1 + α is satisfied.

Here, ρ is selected the same for both the ultimate bands δ 1 and δ 2 . It can be considered as a selection parameter for δ 1 which is kept same for the selection of δ 2 for fair comparison between the two ultimate bands.

Remark 2. Compared to Theorem 2, the condition on C in Theorem 3 is more relaxed. Hence, with the switching reaching law in Eq. (25), we can decrease the ultimate band for relative degree two output with a less strict condition than required with the non‐switching reaching law in Eq. (11).

3.5. Simulation example

Simulation examples are shown for a second‐order discrete LTI system with outputs of both relative degree one and two to compare performance.

We consider an inherently unstable dynamical system

x ( k + 1 ) = [ 1 1.2 5 1 ] x ( k ) + [ 0 1 ] ( u ( k ) + f ( k ) ) E35

where f ( k ) is a disturbance assuming value +0.1 for the first half of the simulation cycle and −0.1 for the last half. The disturbance is chosen at these extremities to bring out the worst behaviour of the system. The comparison between choices of relative degree one and two outputs can be considered fair under such a scenario.

3.5.1. Non‐switching reaching law

The reaching law of [3] with k * = 5 is used for simulations. The surface parameter is selected as C = 0.5 , which satisfies the conditions required in Theorem 2. The ultimate bands for the relative degree one and two outputs are calculated to be δ 1 = 0.1 and δ 2 = 0.06 , respectively. Figure 1 shows the plots of the output s ( k ) along with a zoomed view to show the ultimate bands. The plots of the state variables and control input are given in Figure 2. The plots corresponding to relative degree one output are shown with a dotted line whereas those with relative degree two output are shown with a smooth line. It can be easily seen from Figure 2 that both the state errors as well as the control effort are also reduced for relative degree two output compared to relative degree one output.

Figure 1.

Sliding variable for non‐switching reaching law.

Figure 2.

State variables and control input for non‐switching reaching law.

3.5.2. Switching reaching law

The reaching law of Ref. [17] is used for simulations. The surface parameter is chosen as C = 0.9 which satisfies the conditions of Theorem 3 with α = 0.4 . For the purpose of simulations, ρ = 1.01 is selected which gives the ultimate bands as δ 1 = 0.3367 and δ 2 = 0.2597 . For these values of the ultimate bands, β 1 = 0.2367 and β 2 = 0.1836 are calculated. Figure 3 shows the plots of the output s ( k ) along with a zoomed view to show the ultimate bands. The plots of the state variables and control input are given in Figure 2. The plots corresponding to relative degree one output are shown with a dotted line whereas those with relative degree two output are shown with a smooth line. It can be easily seen from Figure 4 that both the state errors as well as the control effort are also reduced for relative degree two output compared to relative degree one output.

Figure 3.

Sliding variable for switching reaching law.

Figure 4.

State variables and control input for switching reaching law.

Advertisement

4. Systems with arbitrary relative degree outputs

In Section 3, the system order n was arbitrary but the relative degree of the output was fixed to two. In this section, the relative degree is extended to arbitrary r > 1 where r N + . For the purpose of the theoretical development presented in this chapter, r = n is considered, i.e. the relative degree of the output matches the system order. For such an assumption, the system structure can generally take a canonical form, called the lower Hessenberg form, whenever r > 2 .

Consider a chain of n unit delays with the system output defined as y ( k ) = c x 1 ( k ) , where x 1 ( k ) is the output of the last unit delay in the chain. Such a system structure is the popular controller canonical form for LTI systems, which can be obtained from any LTI system model by a simple linear transformation. However, with r = n , a model ( A n ,   B n ,   C n ) of increased complexity can be considered, which is the lower Hessenberg form. This can be described by the system matrices A n = [ a i j ] ,   i , j = 1   to  n , where a i j = 0     i = 1   to   ( n 2 ) ,   j = ( i + 2 )   to   n , B n = [ 0 n 1   b ] T and C n = [ c     0 n 1 ] . Below is the general structure of the system matrix A n :

A n = [ a 11 a 12 0 0 a 21 a 22 a 23 0 0 0 0 0 a ( n 2 ) 1 a ( n 2 ) 2 a ( n 2 ) 3 a ( n 2 ) 4 a ( n 1 ) 1 a n 1 a ( n 1 ) 2 a n 2 a ( n 1 ) 3 a n 3 a ( n 1 ) 4 a n 4 a ( n 2 ) ( n 1 ) 0 a ( n 1 ) ( n 1 ) a ( n 1 ) n a n ( n 1 ) a n n ] E101

Of course, y ( k ) , u ( k ) and f ( k ) are all scalar functions and the structure ensures that y ( k ) is of relative degree r = n as per the definition given in Section 2.

4.1. Finite‐time stability of all states

Let us consider the system

x ( k + 1 ) = A n x ( k ) + B n ( u ( k ) + f ( k ) ) y ( k + 1 ) = C n x ( k ) E36

with f ( k ) = 0 . Assuming this nominal system reaches sliding mode, the following proposition can be made.

Theorem 4. If the output of the system in Eq. (36) is of relative degree r = n , then x 1 ( k ) = x 2 ( k ) = = x n ( k ) = 0     k K , where K is the time step at which the output y ( k ) starts sliding, i.e. y ( k ) = 0     k K .

Proof. During sliding, y ( k ) = c x 1 ( k ) = 0     k K implying x 1 ( k ) = 0     k K since | c | ( 0 , ) . Now, obviously y ( k + 1 ) = 0     k K . This means

0 = c a 11 x 1 ( k ) + c a 12 x 2 ( k )     k K E37

implying x 2 ( k ) = 0     k K as x 1 ( k ) = 0     k K and | a 11 | ,   | a 12 | ( 0 , ) as per the system structure.

Similarly, y ( k + 2 ) = y ( k + 3 ) = = y ( k + n 1 ) = 0     k K and proceeding in the same line of argument, it can be shown that x 3 ( k ) = x 4 ( k ) = = x n ( k ) = 0     k K . This implies that every state hits zero in finite time, which is the same as the time instant when the output hits zero, and stays there for all future times.

It is obvious that in the presence of uncertainty f ( k ) , the states will not reach zero but remain inside some ultimate band   k K .

4.2. Improved robustness of the system

With relative degree of the output equal to the order of the system, better robustness can be obtained when compared to usual outputs of relative degree one, by satisfying certain sufficient conditions. The robustness is measured by the width of the ultimate band of the output or the sliding variable. For this, systems with outputs of relative degree two and three are first discussed and then the result is generalized for arbitrary relative degree outputs.

For a relative degree one output of an n ‐order system in Eq. (36), C n B n = b if the sliding surface is linear, i.e. C n = [ c   c 2 1 ] . Hence, the control can always be computed from Utkin's reaching law [6]

y ( k + 1 ) = d 1 ( k ) E38

with | d 1 ( k ) | d 1 m = C n B n f m = b f m . This gives the control as

u ( k ) = ( C n B n ) 1 C n A n x ( k ) E39

devoid of any uncertain terms, for any system dimension n .

4.2.1. Relative degree two outputs

With system order n = 2 , the LTI system becomes

x ( k + 1 ) = [ a 11 a 12 a 21 a 22 ] x ( k ) + [ 0 b ] ( u ( k ) + f ( k ) ) E40

The output

y ( k ) = c x 1 ( k ) = C 2 x ( k ) E41

is clearly of relative degree two, since C 2 B 2 = 0 and C 2 A 2 B 2 0 . Hence, one needs

y ( k + 2 ) = C 2 A 2 2 x ( k ) + C 2 A 2 B 2 ( u 2 ( k ) + f ( k ) ) E42

to obtain the equivalent control from the extended Utkin's reaching law for relative degree two outputs, which is easily obtained from Eq. (38) as

y ( k + 2 ) = d 2 ( k ) E43

with | d 2 ( k ) | d 2 m = C 2 A 2 B 2 f m = c a 12 b f m . This makes the control

u 2 ( k ) = ( C 2 A 2 B 2 ) 1 C 2 A 2 2 x ( k ) E44

devoid of any uncertain terms.

Obviously, the output y ( k ) will be bounded inside the ultimate band δ 2 = d 2 m     k 2 . For the output with relative degree one, the ultimate band is simply δ 1 = d 1 m = b f m . From the above, it is straightforward to put down the below theorem.

Theorem 5. For the same LTI system in Eq. (40), the equivalent control will lead to a decrease in the width of the ultimate band with an output of relative degree two compared to an output of relative degree one if c a 12 < 1 .

4.2.2. Relative degree three systems

With system order n = 3 , the LTI system becomes

x ( k + 1 ) = [ a 11 a 12 0 a 21 a 22 a 23 a 31 a 32 a 33 ] x ( k ) + [ 0 0 b ] ( u ( k ) + f ( k ) ) E45

The output

y ( k ) = c x 1 ( k ) = C 3 x ( k ) E46

is clearly of relative degree three, since C 3 B 3 = C 3 A 3 B 3 = 0 and C 3 A 3 2 B 3 0 . Hence, one needs

y ( k + 3 ) = C 3 A 3 3 x ( k ) + C 3 A 3 2 B 3 ( u 3 ( k ) + f ( k ) ) E47

to obtain the control from the extended Utkin's reaching law for relative degree three outputs. This is easily obtained from Eq. (38) as

y ( k + 3 ) = d 3 ( k ) E48

with | d 3 ( k ) | d 3 m = C 3 A 3 2 B 3 f m = c a 12 a 23 b f m . This makes the control

u 3 ( k ) = ( C 3 A 3 2 B 3 ) 1 C 3 A 3 3 x ( k ) E49

devoid of any uncertain terms.

Obviously, the output y ( k ) will be bounded inside the ultimate band δ 3 = d 3 m     k 3 . For the output with relative degree one, the ultimate band is simply δ 1 = d 1 m = b f m . From the above, it is straightforward to put down the below theorem.

Theorem 6. For the same LTI system in Eq. (40), the equivalent control will lead to a decrease in the width of the ultimate band with an output of relative degree three compared to an output of relative degree one if c a 12 a 23 < 1 .

4.2.3. Systems with outputs of arbitrary relative degree

With relative degree of the output equal to the order of the system for an arbitrary r = n , the system is as given in Eq. (36) and y ( k + r ) needs to be calculated from the output equation

y ( k ) = c x 1 ( k ) = C r x ( k )           E50

In the same way as in previous subsections, the control devoid of any uncertainty can be derived as

u r ( k ) = ( C r A r r 1 B r ) 1 C r A r r x ( k ) E51

from the extended Utkin's reaching law

y ( k + r ) = d r ( k ) E52

where | d r ( k ) | d rm = c i = 2 r a ( i 1 ) i b f m .

Obviously, the output will be bounded inside an ultimate band δ r = d rm     k r . From the above, it is straightforward to put down the following theorem.

Theorem 7. For the same LTI system in Eq. (36), the equivalent control will lead to a decrease in the width of the ultimate band with an output of relative degree r = n compared to an output of relative degree one if c i = 2 r a ( i 1 ) i < 1 .

Remark 3. In case of outputs with relative degree more than one, the scaling c can be dropped and simply y ( k ) = x 1 ( k ) . Hence, the robustness entirely depends on the system parameters. It is thus possible that for some systems for which the parameters do not satisfy the condition in Theorem 7, the robustness worsens with choice of relative degree r = n with Utkin's equivalent control law.

4.3. Simulation result

A third‐order discrete‐time LTI system is considered with output of relative degree three for simulation. For comparison, the results for the output designed to be of relative degree one are also shown. It can be readily observed that with design parameters kept same for both, the system with relative degree three output shows better robustness in presence of disturbance and also achieves finite‐time stability of all states in the absence of disturbance.

Let the system be

x ( k + 1 ) = [ 1 1.5 0 0.5 0.5 0.8 3 1 1 ] x ( k ) + [ 0 0 1 ] ( u ( k ) + f ( k ) ) E53

where f ( k ) is a random number bounded by ± 0.1 . The initial states are assumed to be [ 1   3 2 ] T .

An output of relative degree one is designed as

y 1 ( k ) = [ 0.2 0.625 1 ] x ( k ) E54

which makes the poles of the reduced‐order system in the sliding mode as 0.1 and −0.1, which are sufficiently nice pole placement to obtain asymptotic stability of the states fast enough.

The output of relative degree three is designed as

y 3 ( k ) = [ 0.2   0   0 ] x ( k ) E55

by keeping the first entry of the output matrix same as in Eq. (54). The ultimate bands calculated for the relative degree one and three outputs are δ 1 = 0.1 and δ 3 = 0.024 , respectively. The zoomed views of the outputs for the two cases are shown in Figure 5, with the ultimate band superimposed on each plot.

Figure 5.

Comparing robustness of outputs with relative degree one and relative degree three.

Figures 6 and 7 show the states and the control input for the two cases when the system is affected by the disturbance f ( k ) . Not much visible difference can be found between the simulations of the states in Figure 6 because of the presence of disturbance. However, in Figure 8, it is clear that the states of the system in absence of disturbance become finite‐time stable for relative degree three output, whereas for relative degree one output, only asymptotic stability is achieved.

Figure 6.

State dynamics for relative degree one and relative degree three with disturbance.

Figure 7.

Control input for relative degree one and relative degree three with disturbance.

Figure 8.

State dynamics for relative degree one and relative degree three without disturbance.

Advertisement

5. Conclusion

In this chapter, an important advancement in the direction of discrete‐time sliding mode control is presented. As opposed to the traditional consideration of outputs of relative degree one, it is shown that with higher relative degree outputs, improved robustness and performance of the system can be guaranteed under certain conditions. New reaching laws are proposed for these higher relative degree outputs, which are extensions of existing reaching laws proposed in Refs. [2, 3, 17] for relative degree one outputs. These reaching laws are analysed to find out conditions for increased robustness of the system. Along with such increased robustness attributed to a reduction in the ultimate band of the sliding variable or output, the system states are also proved to be finite‐time stable in absence of disturbance. In presence of disturbance, they are finite time ultimately bounded. Moreover, this finite time step is same as the time step at which the output hits the sliding surface.

References

  1. 1. Bandyopadhyay B, Janardhanan S. Discrete‐time Sliding Mode Control: A Multirate Output Feedback Approach, LNCIS. 323rd ed. Springer‐Verlag; Berlin Heidelberg, 2006.
  2. 2. Bartolini G, Ferrara A, Utkin V. Adaptive sliding mode control in discrete‐time systems. Automatica. 1995;31(5):769–773
  3. 3. Bartoszewicz A. Discrete‐time quasi‐sliding‐mode control strategies. IEEE Transactions on Industrial Electronics. 1998;45(4):633–637
  4. 4. Bartoszewicz A. Remarks on discrete‐time variable structure control systems. IEEE Transactions on Industrial Electronics. 1996;43(1):235–238
  5. 5. Bartoszewicz A, Latosinski P. Discrete time sliding mode control with reduced switching: A new reaching law approach. International Journal of Robust and Nonlinear Control. 2016;26(1):47–68
  6. 6. Bartoszewicz A, Lesniewski P. A new reaching law based sliding mode flow controller for connection‐oriented data transmission networks. In: 13th IEEE Workshop on Variable Structure Systems; Jun 22–Jul 2; Nantes. 2014. pp. 1–6. Curran Associates, Inc., NY, USA.
  7. 7. Bartoszewicz A, Lesniewski P. New switching and nonswitching type reaching laws for SMC of discrete time systems. IEEE Transactions on Control Systems Technology. 2016;24(2):670–677
  8. 8. Bartoszewicz A, Lesniewski P. Reaching law approach to the sliding mode control of periodic review inventory systems. IEEE Transactions on Automation Science and Engineering. 2014;11(3):810–817
  9. 9. Bartoszewicz A, Lesniewski P. Reaching law‐based sliding mode congestion control for communication networks. IET Control Theory & Applications. 2014;8(17):1914–1920
  10. 10. Chakrabarty S and Bandyopadhyay B. A generalized reaching law for discrete time sliding mode control. Automatica. 2015;52:83–86
  11. 11. Chakrabarty S, Bandyopadhyay B. A generalized reaching law with different convergence rates. Automatica. 2016;63:34–37
  12. 12. Chakrabarty S, Bandyopadhyay B. Minimum ultimate band design of discrete sliding mode control. Asian Journal of Control. 2015;17(5):1889–1897
  13. 13. Chakrabarty S, Bandyopadhyay B, Moreno JA, Fridman L. Discrete sliding mode control for systems with arbitrary relative degree output. In: 14th International Workshop on Variable Structure Systems; 1–4 June 2016; Nanjing, China. 2016. pp. 160–165. Curran Associates, Inc., NY, USA.
  14. 14. Chakrabarty S, Bartoszewicz A. Improved robustness and performance of discrete time sliding mode control systems. ISA Transactions. 2016;65:143–149
  15. 15. Edwards C, Spurgeon SK. Sliding Mode Control: Theory and Applications. London: Taylor and Francis; 1998.
  16. 16. Furuta K. Sliding mode control of a discrete system. Systems and Control Letters. 1990;14:145–152
  17. 17. Gao W, Wang Y, Homaifa A. Discrete‐time variable structure control systems. IEEE Transactions on Industrial Electronics. 1995;42(2):117–122
  18. 18. Ignaciuk P, Bartoszewicz A. Sliding mode dead‐beat control of perishable inventory systems with multiple suppliers. IEEE Transactions on Automation Science and Engineering. 2012;9(2):418–423
  19. 19. Janardhanan S, Bandyopadhyay B. Multirate output feedback based robust quasi‐sliding mode control of discrete‐time systems. IEEE Transactions on Automatic Control. 2007;52(3):499–503
  20. 20. Milosavljevic D. General conditions for the existence of a quasi‐sliding mode on the switching hyperplane in discrete variable structure systems. Automation and Remote Control. 1985;46:307–314
  21. 21. Niu Y, Ho DWC, Wang Z. Improved sliding mode control for discrete‐time systems via reaching law. IET Control Theory and Applications. 2010;4(11):2245–2251
  22. 22. Sarpturk SZ, Istefanopulos Y, Kaynak O. On the stability of discrete‐time sliding mode control systems. IEEE Transactions on Automatic Control. 1987;32(10):930–932
  23. 23. Utkin VI, Drakunov SV. On discrete‐time sliding mode control. In: Proceedings of IFAC Symposium on Nonlinear Control Systems (NOLCOS); 14–16 July 1989; Capri, Italy. 1989. pp. 484–489
  24. 24. Yuan L, Shen J, Xiao F, Wang H. A novel reaching law approach of quasi‐sliding mode control for uncertain discrete‐time systems. Journal of Central South University. 2012;19(9):2514–2519
  25. 25. Zhu Q, Wang T, Jiang M, Wang Y. A new design scheme for discrete‐time variable structure control systems. In: International Conference on Mechatronics and Automation; 9–12 August; 2009; Changchun, China, 2009. pp. 3475–3479. Curran Associates, Inc., NY, USA.

Written By

Sohom Chakrabarty, Bijnan Bandyopadhyay and Andrzej Bartoszewicz

Submitted: 29 September 2016 Reviewed: 03 April 2017 Published: 28 June 2017