Академический Документы
Профессиональный Документы
Культура Документы
Research Article
ISSN 1751-8822
Free chattering hybrid sliding mode control for Received on 9th March 2016
Revised on 15th May 2016
a class of non-linear systems: electric vehicles Accepted on 16th June 2016
doi: 10.1049/iet-smt.2016.0091
as a case study www.ietdl.org
Abstract: In current study, in order to find the control of general uncertain nonlinear systems, a new optimal hybrid control
approach called Optimal General Type II Fuzzy Sliding Mode (OGT2FSM) is presented. In order to estimate unknown
nonlinear activities in monitoring dynamic uncertainties, the benefits of general type-2 fuzzy logic systems (GT2FLS) is
utilized by the suggested controller. The suggested controller not only warranties the constancy and hardiness against
uncertainties of the lumped resulted by external disturbances and un-modeled dynamics, but also considerably
decreases the control chattering inherent in traditional sliding mode control. Moreover, the Modified Backtracking
Search Algorithm (MBSA), which is a new heuristic algorithm, is used in the offered controller. A comparison is
performed between the results of current study and the results of some of the most recent studies on the same topic,
which are an Adaptive Interval Type-2 Fuzzy Logic Controller (AGT2FLC) and Conventional Sliding Mode Controller
(CSMC), to assess the efficiency of the suggested controller. The suggested control scheme is finally used to the
Electric Vehicles type as a case study. Results of simulation confirm the good performance the suggested controller.
[23]
This representation is so beneficial, since a/Ãa , can be observed as
X (t) = f (X (t), t) + g(X (t), t)u(t) + d(t)
(n) an IT2FS with the secondary grade of level α. Accordingly, a GT2FS
(1) can be divided into a number of IT2FSs with a particular level of α
y(t) = x(t) for each, where a = {0, 1/K, . . . , (K − 1)/K, 1}. In other words,
by applying this novel representation a GT2FLS can be observed
where X (t) = [x(t), ẋ(t), . . . , x(n) (t)]T indicates the nth order state as a too large collection of IT2FLSs, having one IT2FLS for each
vector of the system, y(t) [ R indicates the system output, value of α; however, Liu [10] proved that the accuracy needed for
f (X (t), t) and g(X (t), t) are not exactly identified, but smooth centroid computation can be achieved by utilising only 5–10
α-planes. Fig. 2 shows a novel architecture of a general type-2 fuzzy the jth rule with level of α, and * denotes the product t-norm. Since the
system based on the α-plane representation. inference engine output is a T2FS, before defuzzificating with a type
In general, a GT2FLS is a collection of fuzzifiers; a fuzzy inference reducer, it must be converted into a T1FS. Five different types of
engine; a fuzzy rule base; a defuzzifier and a type reducer. The fuzzifier reducers based on calculating the centroid of an IT2FSare explained
maps real values into fuzzy sets. In the present research, the singleton in [22]. Owing to its uniformly secondary grade, the output of
fuzzifier whose output is a single point of a unity membership grade is IT2FLS type reduction is measured by using its left-end point yl and
used to simplify the study. The fuzzy rule base includes fuzzy right-end point yr. In the study of Mendel and John [47], two
IF-THEN rules constructed based on the experts’ knowledge. The jth algorithms, which are now known as the KM iterative algorithms,
rule in the GT2FLS can be stated as follows were presented for computing these two end points.
Amongst different type reducers, centre of sets (COS) is
j j j j extensively applied because of its easy calculation through the KM
Rj : if x1 , x2 and xn are F̃ 1 , F̃ 2 , F̃ n then y is G̃
(7) iterative algorithm [24]. If singleton fuzzifier is used in this study,
j = 1, 2, . . . , M the product of the inference engine and COS type reducer, as well
as the left- and right-end points for each part of GT2FLS based on
where xi (i = 1, 2, . . . , n) and y refer to the input and output of the the α-representation theorem can be demonstrated as follows
j j
GT2FLS, respectively; F̃ i and G̃ are general type-2 antecedent and L M
j j j
j=1 f a ula + j=L+1 f−a ula
j
the resultant sets, respectively. The inference engine synthesises rules
and provides a mapping from input GT2FSs to output GT2FSs. yla = L j M j
= uTla jla (11)
Since, the α-plane representation is used for the fuzzy set in this j=1 f a + j=L+1 f−a
study, the firing set of each related IT2FS is as represented below
where ujla represents the left-end point of the jth consequent set with
= f j (X )]
Faj (X ) [f−j a (X ), jjla = [ f ja /Dla , f a /Dla ],
j
a (8) level of α, ula = [u1la , . . . , uM T
la ] ,
L j M
f−j a (X ) = mF̃ j ∗ mF̃ j ∗ . . . ∗ mF̃ j (9) Dla = j=1 f a + j=L+1 f−j a and jla = [j1la , . . . , jlM a
]T .
1a 2a na Moreover
f j (X ) = m
F̃ j ∗ m
F̃ j ∗ . . . ∗ m
F̃ j (10) R M
a j j
j=1 f a ura + j=R+1 f a ura
1a 2a 1a
j j
yra = R M = uTra jra (12)
f j (X )
j
+ j
where f−j a (X ) and are, respectively, the lower and upper MFs of j=1 f a j=R+1 f a
a
where K + 1 indicates the number of the α-planes; in other words, it where Xj,min and Xj,max represent the lower and upper limits of the jth
shows the number of individual IT2FLSs. member of dimension of the problem. The Ui,j (.) refers to the random
function generator in the range of [0, 1] from the uniform probability
distribution function for the jth member of the ith agent.
In [48], the development of a novel backtracking search algorithm 4.1.1 First modification: In this study, chaotic opposition-based
(BSA) as an evolutionary optimisation (EO) technique is reported learning is offered to speed up the convergence rate and improve the
based on the updating procedure of differential evolution (DE) and final solution quality of the algorithm. If the random initialisation is
genetic algorithm (GA). The application of basic principles of close to the optimum solution, a better improvement is then expected
BSA to mathematical optimisation starts with randomly generating for the convergence characteristics. In this learning scheme, in order
an initial population as well as other EOs. Each individual of the to generate the initial population, the chaotic systems and the
initial set is evaluated by using an objective function. It benefits opposition-based learning method are combined. The population is
from a random mutation method which uses only the one direction divided into two groups. Initialisation of the first one is performed
individual in place of multiple ones, as it is the case with the DE according the chaotic theory and the next one is provided based on
algorithm. Furthermore, a non-uniform crossover process is the opposition-based learning. Here, a chaotic number is generated
applied along with the BSA, which is more complex than the by using a sinusoidal-based chaotic operator as follows
GA’s crossover. In the crossover stage, the variables of the two
chosen individuals are combined and in the mutation stage, the Ci,j,k+1 = sin pCi,j,k , k = 1, . . . , kmax
novel solutions are produced randomly to diversify the search (16)
space of the solution and allow the BSA to ultimately escape from Ci,j,1 = Ui,j (.)
the locally ideal solutions. Moreover, two novel selection
approaches are well-defined and applied with BSA. Accordingly,
where k shows the iteration counter of sinusoidal iterator and kmax
the BSA can be divided into the subsequent three stages. It should
represents the maximum iteration number of chaotic mechanism.
be mentioned that the suggested modification approaches are
Consequently, the first group (N1 = N/2) is created as follows
described during the BSA procedure for the sake of explicitness.
Xi,jC = Xmin ,j + Ci,j,kmax (.) Xmax ,j − Xmin ,j i = 1, . . . , N1 (17)
4.1 Initialisation
where Xi,jC represents the jth variable for the ith individual which is
Primarily the N number of individuals is created randomly and primarily produced by the chaotic system. The initialisation of the
located at random positions on the search space. Here, the N is the rest of the population is performed as follows [49]
D factors involved in the fuzzy controller. The individual location
is characterised as an initial vector of length N and D as the Xi,jO = Xmin ,j + Xmax ,j − Xi,j (18)
dimension of the problem. The original position vector can be
where Xi,jO indicates the jth variable for the ith individual which is
primarily produced by the opposition-based learning method.
4.2 Selection I
The BSA utilises the X old vector for updating the historical
population at the beginning of each iteration. Initialisation of this
vector is performed in the same way as the X and its updating is
then achieved through the following ‘If-Then’ rule [48]
N
Xi,j,new
mej = (31)
i=1
N
n−1
xid (t) in the previous equations refers to the (i−1)th derivative of the
favourite path which should be followed by the input control. The n − 1 k (n−k)
û = x(n)
d − le (48)
following equations can be concluded from (37) and (39) k=0
k
ė1 (t) = e2 (t), ė2 (t) = e3 (t), . . . , ėn−1 (t) = en (t) (40) where fˆ , ĝ refer to approximating functions of f and g, respectively.
The limits are specified as the following
Now, the sliding surface is defined as follows
0 ≺ amin ≤ g ĝ−1 ≤ amax (49)
n−1
s(e, t) = le
k (n−k−1)
(41)
k=0 Selecting the gain G as
where l is a fixed positive parameter. Now, an appropriate design of G = (amin amax )1/2 (50)
control u is proposed so that the sliding surface tends to zero.
Consequently, the subsequent Lyapunov candidate function is It remains to provide k(x, t) so that the convergence condition (44)
presented is satisfied. Now by substituting (49) and (48) for (46), we have
(see (51))
1
V = s2 (42)
2 where there is an adequate condition for the control law to fulfil the
sliding surface s = 0 [21]
The Lyapunov candidate function derivative is
k(x, t) ≥a(D + R + 1) + (a − 1)U
1 ds2 1/2
V̇ = ≤ −1|s| (43) a (52)
2 dt a = max
amin
which results in the following convergence condition
n−1
g ˆ
(n) n − 1 k (n−k)
f (x(t), t) + G(û − k(x, t)sign(s)) − f + d(t) − xd + le sign(s) ≤ −1
ĝ k=0 k
(51)
(f − g ĝ−1 fˆ ) + gĝ −1 Gû − û − g ĝ−1 k(x, t)sign(s) + d sign(s) ≤ 1
Df + (gĝ−1 G − 1)û + d sign(s) − gĝ−1 Gk(x, t) ≤ 1
We adopt the Lyapunov function similar to (42) to analyse the Symbol and abbreviation Values
stability of the closed-loop system. With the convergence
Ra + Rf 0.2 Ω
condition (44), we obtain [21] (see (54)) La + Lf 6.008 mH
re 0.25 m
Equation (54) can be modified as follows J 0.05 kg m2
Laf 1.776 mH
j 0°
Df + (1 − a−1 )û − a−1 uFuzzy(s) + d sign(s) ≤ −1 (55) ωnom 2800 r/min
m 800kg
To reach asymptotic stability as when s > 0, we consider A 1.8 m2
ρ 1.25 kg/m3
Cd 0.3
a−1 uFuzzy (s) ≥ (Df + d + 1) + (1 − a−1 )û (56) μrr 0.015
G 11
which implies that B 0.0002 N ms
I 78 A
uFuzzy |max ≥ a(R + D + 1) + (a − 1)U (57) V 0–48 V
When s < 0
Fig. 5 General type-2 fuzzy MFs using the α-plane representation with α =
7 Advantages of the proposed method
0 (light area) and α = 1 (dark area)
In designing the proposed method, considerations have been made
that have a prominent role in its practical implementation: proposed fuzzy controller, the MBSA algorithm was used. It was
shown in the literature that in comparison to some algorithms,
(i) The proposed novel optimal robust control approach is easy to such as GA, ant colony and so on, the MBSA algorithm requires
implement and can be applied to a reasonably wide class of less computational effort to converge.
non-linear systems. (iii) The proposed method is free of undesirable chattering
(ii) In case the boundary limits of the uncertainty are not available, phenomena. Moreover, it can handle both structured and
the control designers have to increase the number of rules in fuzzy unstructured uncertainties.
type-1. Consequently, the amount of the computational burden of (iv) Another benefit of the proposed control approach is its light
the fuzzy type-1 controller will increase. As a direct result, high burden of computations which is an important feature in practical
computation effort will make delay in the control process and thus implementation and online control cases.
will cause instability in the closed-loop system. In the proposed (v) As indicated before, T1FLSs are unable to directly handle rule
controller, however, GT2FLS was employed to design the fuzzy uncertainties, since their MFs are T1FSs; however, the GT2FLSs
controller. In order to adjust the input and output MFs of the involved in this paper, have the capability to handle rule
n−1
−1 −1 ˆ −1 (n) n − 1 k (n−k)
f + g ĝ Gû − ĝ f − ĝ GuFuzzy (s) + d(t) − xd + le sign(s) ≤ −1 (54)
k=0
k
uncertainties. Moreover, in tuning the MF of the fuzzy logic, it is other systems. Non-linear control methods should be used for
very important to provide an optimal and accurate performance. designing an EV controller. The sensitivity of the model-based
There are several approaches toward the MF adjustment such as controller to the parameter uncertainties is too high. The changing
trial and error and the online regulating MF method, which use a operation conditions change several parameters and as a result
complementary optimisation algorithm. their accurate design is impossible. For example, the resistance of
a motor armature winding would change by changing the
8 Simulation results operation temperature. Therefore, the robustness of the controller
is an important factor to be considered in its design. A non-linear
Simulation of the suggested controller was performed by using robust and ideal controller [53, 54] will be investigated in the
MATLAB software. For this purpose, a personal computer Core 2 following section. For designing a nonlinear controller, the model
Due, 2.8 GHz, 4 Gbytes RAM, under Windows 7 was used. The in (60) should be modified
efficiency of the OGT2FSM controller was investigated by
applying the suggested method to the non-linear EVs as a case Ẋ = f (x) + g(x)u
study and the obtained results were compared with those obtained (61)
y = h(x)
from CSMC [25] and AGT2FLC, which are two controllers
recently presented in the literature in this respect [3]. It is worth
noting that both the identical values and computational effort were where (see equation at the bottom of the page)
employed to make the comparison quite fair.
Designing the electrical vehicles control should be performed Table 1 shows the of the case study parameters which have been
adaptively and robustly to improve the performance of the system applied in the current research [53, 55].
in both dynamic and steady states, as EV systems are essentially Now, OGT2FSMC is applied to the plant (61). The MFs for α = 0
time-variant (e.g. the operation factors of EV and the condition of and α = 1 are shown in Fig. 5. Consequently, nine rules are needed to
the road are always variable), thus making the control of an EV construct the controller [47].
essentially difficult [1, 52, 53]. At this stage, the Federal Test Procedure (FTP-75) is applied to
investigate the performance. The profile of FTP-75 is shown in
Fig. 6. Fig. 7a demonstrates the obtained results (the maximum
8.1 Non-linear model of the EVs speed is scaled to 90 km/h), the system speed deviation using
CSMC, AGT2FLC and OGT2FSMC.
The overall dynamic model for the EV system can be given as In order to show the performance of the suggested technique more
follows [1, 53] effectively, the control and error signals for each controller are given
in Figs. 7b and c, respectively. These figures demonstrate the
di 1
= + {V − (Ra + Rf ), i − Laf · i · v} superiority of the suggested controller, OGT2FSMC, in terms of
dt L + Lfield performance and accuracy compared with other controllers.
a
dv 1 r
= 2 × Laf · i − Bv −
2
dt J + m r/G G 9 Conclusion
× (mrr mg + (1/2)rACd v2 + mg sin w) (60) The present research proposed a novel OGT2FSM controller for a
class of non-linear systems in the presence of exterior
The EV operates from zero to full rate in contrast to the application of disturbances and uncertainties. A case study was conducted to
i x
X= = 1
v x2
⎡ ⎤
1
× −(Ra + Rf ) · x1 − Laf · x1 · x2
⎢ L + Lfield ⎥
⎢ " ⎥
f (x) = ⎢ ! a
⎥
⎣ 1 r r 2 2 ⎦
2 × Laf · x1 − Bx2 −
2
× mrr mg + (1/2)rACd x2 + mg sin w
J + m r/G G G
⎡ ⎤
1
g(x) = ⎣ La + Lfield ⎦
0
and y = h(x) = x2