# Fuzzy Controller Design Using Evolutionary Techniques for Twin Rotor MIMO System: A Comparative Study

Authors: H. A. Hashim; M. A. Abido
Journal: Computational Intelligence and Neuroscience
 (2015)

---

## Abstract

This paper presents a comparative study of fuzzy controller design for the twin rotor multi-input multioutput (MIMO) system (TRMS) considering most promising evolutionary techniques. These are gravitational search algorithm (GSA), particle swarm optimization (PSO), artificial bee colony (ABC), and differential evolution (DE). In this study, the gains of four fuzzy proportional derivative (PD) controllers for TRMS have been optimized using the considered techniques. The optimization techniques are developed to identify the optimal control parameters for system stability enhancement, to cancel high nonlinearities in the model, to reduce the coupling effect, and to drive TRMS pitch and yaw angles into the desired tracking trajectory efficiently and accurately. The most effective technique in terms of system response due to different disturbances has been investigated. In this work, it is observed that GSA is the most effective technique in terms of solution quality and convergence speed.


---

## Body

## 1. Introduction

In the recent few years, unmanned autonomous vehicles are needed for various applications including Twin Rotor MIMO system (TRMS) which has been studied under many engineering applications including control, modeling, and optimizations. TRMS is emulating the behavior of helicopter dynamics [1] and its main problem can be summarized in solving high nonlinearities in the system in order to provide the desired tracking performance with suitable control signal.Real coded genetic algorithm, particle swarm, and radial basis neural network are used for TRMS parameter identification without any former knowledge [2–4]. TRMS has been examined with different controllers such as four PID controllers with genetic algorithm to tune PID gains [5], decoupling control using robust dead beat [6], model predictive control [7], and H
∞ control for disturbance rejection [8]. All aforementioned controllers are examined under hovering positions and switching LQ controller is used to switch the controller between different operating points [9]. Hybrid fuzzy PID controller shows good tracking performance in comparison to PID controller [10, 11]. Sliding mode control has been proposed in [12, 13] where fuzzy control and adaptive rule techniques are used to cancel the system nonlinearities. Both techniques apply integral sliding mode for the vertical part with robust behavior against parameters variations and they showed good results. However, their limitations reflected lie in the control signal and design complexity. Generally, fuzzy logic control (FLC) has been developed as an intelligent control approach for various applications in the presence of uncertainties. Fuzzy has been implemented with fuzzy control for nonlinear systems with unknown dead zone [14, 15], for output feedback of nonlinear MIMO systems [15, 16], for uncertain systems [17], and for systems with random time delays [18]. Also, observer based on adaptive fuzzy has been implemented successfully in [19–21]. Decoupling FLC will be used in this work to control TRMS by removing the coupling effect in addition to providing the desired tracking performance.Evolutionary algorithms are important optimization tools in engineering applications and they are gaining popularity among the researchers. Particle swarm optimization (PSO) has been proposed as efficient optimization algorithm [22]. PSO has been successfully implemented in different engineering applications including identifying the path following footstep of humanoid robot [23], setting the control parameters for automatic voltage regulator [24, 25], and designing fuzzy PSO controller for navigating unknown environments [26]. Differential evolution (DE) was formulated as impressive evolutionary algorithm in [27, 28]. DE was successfully tested for various applications involving tuning multivariable PI and PID controllers of the binary Wood-Berry distillation column [29], optimizing delayed states of Kalman filter for induction motor [30] and optimizing the controller parameters of adaptive neural fuzzy network for nonlinear system [31]. A new optimization technique based on bees swarming was developed [32] and later artificial bee colony (ABC) emerged in [33]. ABC shows great results for many applications, for instance, employing ABC to find the optimal distributed generation factors for minimizing power losses in an electric network [34], defining the path planning and minimizing the consumption energy for wireless sensor networks [35]. Finally gravitational search algorithm (GSA) was proposed recently as promising evolutionary algorithm and shows impressive results [36]. GSA has been successfully implemented in many areas including fuzzy controller design [37, 38] and solving multiobjective power system optimization problems [39, 40].In this work, the main contribution is proposing a decoupling PD fuzzy control scheme for the nonlinear TRMS. Controller parameters will be defined based on an optimization technique. GSA, PSO, ABC, and DE have been implemented for a comparative study in order to optimize the gains of a proposed controller for the nonlinear TRMS. Another contribution of this work is defining the minimum objective function in addition to finding the most robust technique with different initial populations. These optimization techniques will be used to tune PD gains and coupling coefficients. The proposed approach is investigated for TRMS at different operating conditions taking into account the need for cancelling strong coupling between two rotors and the specific range of control signals, and finally providing the desired tracking response. Generally, the results show the effectiveness of the considered techniques. The best performance was observed with GSA in terms of convergence rate and solution optimality. The paper is organized as follows. Section2 includes the problem formulation. The proposed control strategy is presented in Section 3. Optimization techniques will be discussed in Section 4. In Section 5, simulation results are presented and discussed and the effectiveness of the proposed approach is demonstrated. Finally, Section 6 concludes the main findings and observations with recommended future work.


## 2. Twin Rotor MIMO System Modeling

Twin rotor is a laboratory setup for stimulating helicopter in terms of high nonlinear dynamics with strong coupling between two rotors and training various control algorithms for angle orientations. The full description of TRMS has been detailed in [1], where the system has six states defined as x
=
[
x
1
,
x
2
,
x
3
,
x
4
,
x
5
,
x
6
]
T, two control signals u
1 and u
2, and finally the output represented by y
=
[
x
1
,
x
3
]
T. The main structure of TRMS studied in this work is shown in Figure 1.Figure 1
TRMS setup.The complete model of the system can be represented as follows:(1)
d
d
t
x
1
=
x
2
,
d
d
t
x
2
=
a
1
I
1
x
5
2
+
b
1
I
1
x
5
-
M
g
I
1
sin
x
1
-
B
1
ψ
I
1
x
2
+
0.0326
I
1
sin
2
x
1
x
4
2
-
K
g
y
I
1
·
a
1
x
5
2
+
b
1
x
5
x
4
cos
⁡
x
1
,
d
d
t
x
3
=
x
4
,
d
d
t
x
4
=
a
2
I
2
x
6
2
+
b
2
I
2
x
6
-
B
1
φ
I
2
x
4
-
1.75
k
c
I
2
a
1
x
5
2
+
b
1
x
5
,
d
d
t
x
5
=
-
T
10
T
11
x
5
+
k
1
T
11
u
1
,
d
d
t
x
6
=
-
T
20
T
22
x
6
+
k
2
T
22
u
2
.TRMS dynamics are defined by six states as vertical or main angle, yaw or horizontal angle, vertical velocity, yaw velocity, and two momentum torques, respectively. The parameters of TRMS can be defined as follows: a
1, b
1, a
2, and b
2 are constant parameters referring to the static behavior of the system, two moments of inertia for vertical and horizontal rotors are stated as I
1 and I
2, friction momentums are B
1
ψ, B
2
ψ, B
1
φ, and B
2
φ, gravity momentum is M
g, gyroscopic momentum is K
g
y, other parameters that have to be defined for vertical rotor are T
11, T
10 and for horizontal rotor T
22, T
20, and finally vertical and horizontal rotor gains are k
1 and k
2.The control signals are used to control angles orientations by two torque momentum equations. Strong coupling between two rotors in addition to high nonlinearities detailed in (1) ended to formulate the tracking control as an interesting problem to be investigated. The solution of the control problem will be developed using decoupling proportional derivative fuzzy logic controller (PDFLC).


## 3. Proposed Control Approach

Since last few decades, fuzzy logic control [41] has been used extensively as intelligent technique in many control applications. In this work, decoupling PDFLC is proposed to solve coupling effects and high nonlinearities in addition to providing soft and smooth tracking response. The proposed control should be able to maintain the control signal in the demand range.


### 3.1. Structure of the Proposed Controllers

The proposed decoupling PDFLC scheme is mainly composed of four fuzzy controllers stated as vertical, horizontal, vertical to horizontal, and horizontal to vertical controllers asV, H, V
H, and H
V, respectively. The vertical controller is designed for the main rotor and horizontal controller is designed for the tail rotor. H
V and V
H controllers are designed in order to cancel the coupling effect between two rotors represented by the bias in the tracking response.The design of the assigned decoupling PDFLC for strong coupling and high nonlinear TRMS is shown in Figures2, 3, and 4 as a triangular membership function. Inputs for PDFLC are expressed by error and rate of the error while the output is the control signals. The linguistic variables of the two input membership functions for the four PDFLC are described as PL, P, PS, Z, NS, N, and NL. The input of PDFLC ranged from −0.5 to 0.5 for the horizontal part and from −0.6 to 0.6 for the other three PDFLCs while output of the four membership functions is PVL, PL, P, PS, Z, NS, N, NL, and NVL within range −2.5 to 2.5. The linguistic variables are stated as PVL is positive very large, PL is positive large, P is positive, PS is positive small, Z is zero, NS is negative small, N is negative, NL is negative large, and NVL is negative very large.Figure 2
Membership fuctions of horizontal error and error rate.Figure 3
Membership fuctions of error and rate of vertical, vertical to horizontal, and horizontal to vertical fuzzy controllers.Figure 4
Membership functions of control signals of all fuzzy controllers.Table1 describes the rule base of the proposed PDFLC. Figure 5 shows the proposed controller of decoupling PDFLC. Ten gains will be tuned divided into eight gains for the proposed coupling PDFLC represented by four proportional gains and another four derivative gains in addition to two gains demonstrating the coupling effect from the output of HV and VH controllers.Table 1
Rule base of all fuzzy controllers.
Δ
e
∖
e
NL
NM
NS
Z
PS
PM
PL
NL
NVL
NVL
NL
NM
NS
NS
Z
N
NVL
NL
NM
NM
NS
Z
PS
NS
NL
NM
NS
NS
Z
PS
PM
Z
NM
NS
NS
Z
PS
PS
PM
PS
NM
NS
Z
PS
PS
PM
PL
P
NS
Z
PS
PM
PM
PL
PVL
PL
Z
PS
PS
PM
PL
PVL
PVLFigure 5
Proposed fuzzy controller for the nonlinear MIMO TRMS.


### 3.2. Problem Formulation

Ten gains to be optimized are defined asK
V
e, K
V
d
e, K
H
e, K
H
d
e, K
V
H
e, K
V
H
d
e, K
H
V
e, K
H
V
d
e, K
H
V, and K
V
H, where K refers to gain, V refers to vertical, H refers to horizontal, H
V refers horizontal to vertical, V
H refers vertical to horizontal, e refers to error, and d
e refers to rate of error. The gains assigned to be between maximum and minimum constraints as follows: (2)
0.001
≤
K
fuzzy
i
≤
40
for
i
=
1
,
…
,
8
.
-
2
≤
K
coupling
i
≤
2
for
i
=
1,2
,where(3)
K
fuzzy
=
K
V
e
,
K
V
d
e
,
K
H
e
,
K
H
d
e
,
K
V
H
e
,
h
h
h
K
V
H
d
e
,
K
H
V
e
,
K
H
V
d
e
T
,
K
coupling
=
K
V
H
,
K
H
V
T
.The objective function is chosen to satisfy well-tracked response as follows:(4)
fit
=
∑
t
=
0
t
sim
e
ψ
2
t
+
e
ϕ
2
t
λ
t
,where(5)
e
ψ
t
=
ψ
d
t
-
ψ
t
,
e
ϕ
t
=
ϕ
d
t
-
ϕ
t
,
ψ
(
t
) and ψ
d
(
t
), are actual and desired vertical angles, respectively, φ
(
t
) and φ
d
(
t
) are actual and desired horizontal angles, respectively, e
ψ
(
t
) and e
φ
(
t
) are errors between the desired and actual angles for vertical and horizontal parts respectively, and λ
(
t
) is a weight factor in order to penalize the error as time increases. Ten gains will be optimized using four optimization techniques as mentioned in the literature. The objective function of each optimization technique is a minimization function considering gains have to satisfy the constraints in (2). In this study, GSA, PSO, ABC, and DE will be developed as a comparison study in order to search for the optimal gains.


## 3.1. Structure of the Proposed Controllers

The proposed decoupling PDFLC scheme is mainly composed of four fuzzy controllers stated as vertical, horizontal, vertical to horizontal, and horizontal to vertical controllers asV, H, V
H, and H
V, respectively. The vertical controller is designed for the main rotor and horizontal controller is designed for the tail rotor. H
V and V
H controllers are designed in order to cancel the coupling effect between two rotors represented by the bias in the tracking response.The design of the assigned decoupling PDFLC for strong coupling and high nonlinear TRMS is shown in Figures2, 3, and 4 as a triangular membership function. Inputs for PDFLC are expressed by error and rate of the error while the output is the control signals. The linguistic variables of the two input membership functions for the four PDFLC are described as PL, P, PS, Z, NS, N, and NL. The input of PDFLC ranged from −0.5 to 0.5 for the horizontal part and from −0.6 to 0.6 for the other three PDFLCs while output of the four membership functions is PVL, PL, P, PS, Z, NS, N, NL, and NVL within range −2.5 to 2.5. The linguistic variables are stated as PVL is positive very large, PL is positive large, P is positive, PS is positive small, Z is zero, NS is negative small, N is negative, NL is negative large, and NVL is negative very large.Figure 2
Membership fuctions of horizontal error and error rate.Figure 3
Membership fuctions of error and rate of vertical, vertical to horizontal, and horizontal to vertical fuzzy controllers.Figure 4
Membership functions of control signals of all fuzzy controllers.Table1 describes the rule base of the proposed PDFLC. Figure 5 shows the proposed controller of decoupling PDFLC. Ten gains will be tuned divided into eight gains for the proposed coupling PDFLC represented by four proportional gains and another four derivative gains in addition to two gains demonstrating the coupling effect from the output of HV and VH controllers.Table 1
Rule base of all fuzzy controllers.
Δ
e
∖
e
NL
NM
NS
Z
PS
PM
PL
NL
NVL
NVL
NL
NM
NS
NS
Z
N
NVL
NL
NM
NM
NS
Z
PS
NS
NL
NM
NS
NS
Z
PS
PM
Z
NM
NS
NS
Z
PS
PS
PM
PS
NM
NS
Z
PS
PS
PM
PL
P
NS
Z
PS
PM
PM
PL
PVL
PL
Z
PS
PS
PM
PL
PVL
PVLFigure 5
Proposed fuzzy controller for the nonlinear MIMO TRMS.


## 3.2. Problem Formulation

Ten gains to be optimized are defined asK
V
e, K
V
d
e, K
H
e, K
H
d
e, K
V
H
e, K
V
H
d
e, K
H
V
e, K
H
V
d
e, K
H
V, and K
V
H, where K refers to gain, V refers to vertical, H refers to horizontal, H
V refers horizontal to vertical, V
H refers vertical to horizontal, e refers to error, and d
e refers to rate of error. The gains assigned to be between maximum and minimum constraints as follows: (2)
0.001
≤
K
fuzzy
i
≤
40
for
i
=
1
,
…
,
8
.
-
2
≤
K
coupling
i
≤
2
for
i
=
1,2
,where(3)
K
fuzzy
=
K
V
e
,
K
V
d
e
,
K
H
e
,
K
H
d
e
,
K
V
H
e
,
h
h
h
K
V
H
d
e
,
K
H
V
e
,
K
H
V
d
e
T
,
K
coupling
=
K
V
H
,
K
H
V
T
.The objective function is chosen to satisfy well-tracked response as follows:(4)
fit
=
∑
t
=
0
t
sim
e
ψ
2
t
+
e
ϕ
2
t
λ
t
,where(5)
e
ψ
t
=
ψ
d
t
-
ψ
t
,
e
ϕ
t
=
ϕ
d
t
-
ϕ
t
,
ψ
(
t
) and ψ
d
(
t
), are actual and desired vertical angles, respectively, φ
(
t
) and φ
d
(
t
) are actual and desired horizontal angles, respectively, e
ψ
(
t
) and e
φ
(
t
) are errors between the desired and actual angles for vertical and horizontal parts respectively, and λ
(
t
) is a weight factor in order to penalize the error as time increases. Ten gains will be optimized using four optimization techniques as mentioned in the literature. The objective function of each optimization technique is a minimization function considering gains have to satisfy the constraints in (2). In this study, GSA, PSO, ABC, and DE will be developed as a comparison study in order to search for the optimal gains.


## 4. Optimization Algorithms

This work presents a comparison study among four evolutionary optimization techniques. Each optimization algorithm aims to find the optimal gains for minimum possible objective function as defined in (4). The following subsections describe briefly optimization techniques implemented in this work.


### 4.1. Gravitational Search Algorithm

In the last few years, gravitational search algorithm (GSA) has been introduced as a new metaheuristic optimization algorithm developed by newton gravitational laws and was first proposed in 2009 by [36]. The algorithm stated that, for any two objects, every object is attracted to the other object by attraction force which is directly proportional to their mass and inversely proportional to their square distance. GSA has been explained in detail in [36].GSA can be summarized in the following flowchart as shown in Figure6.Figure 6
GSA computational flowchart.


### 4.2. Particle Swarm Optimization

Particle swarm optimization has emerged recently as combinational metaheuristic approach and was first inspired from a behavior combined between bird flocking and fish schooling in 1995 by [22]. PSO combines principles of human sociocognition in addition to evolutionary computation. Each particle in the swarm represents a potential or a solution which is required to be sought in the search space in order to find the optimal solution. A potential is formed by a set of agents. Two important equations are necessary to emulate socio and cognition behaviors are represented by position and velocity for each agent. The position of the agent can be defined by the following equation:(6)
x
i
,
j
t
=
v
i
,
j
t
+
x
i
,
j
t
-
1
.The velocity of each agent can be defined by(7)
v
i
,
j
t
=
α
t
v
i
,
j
t
-
1
+
c
1
r
1
x
i
,
j
∗
t
-
1
-
x
i
,
j
t
-
1
+
c
2
r
2
x
i
,
j
∗
∗
t
-
1
-
x
i
,
j
t
-
1
,where i
=
1
,
2
,
…
,
N and N is the population size, j
=
1
,
2
,
…
,
m and m are the size of agents in the potential, x
i
,
j
∗ is the local best solution, x
i
,
j
∗
∗ is the global best solution, α
(
t
) is a decreasing weight that can be defined by α
(
t
)
=
exp
⁡
-
α
(
t
-
1
)
t, c
1 and c
2 are positive constants, and r
1 and r
2 are uniformly distributed random numbers in [
0,1
]. PSO is described in detail in [22, 42].PSO can be summarized in the following flowchart as shown in Figure7.Figure 7
PSO computational flowchart.


### 4.3. Artificial Bees Colony

In the last few years, artificial bees colony has been introduced as a new metaheuristic optimization approach and was first inspired in 2005 by [32]. Colony of bees usually divided into three groups of bees as employed, onlooker, and scout bees. Life in bees’ colony can be briefly summarized as employed bees search randomly for food where the best position of food is considered as the optimal solution. Employed bees dance to share information with other bees about amount of nectar and food source. Onlookers wait in the hive to receive information from employed bees. Onlooker bees can differentiate between the good source and the bad source and decide on the food quality based on dance length, dance type, and speed of shaking. Onlooker bees choose scout bees before sending them for a new process of food searching. According to food quality, onlooker and scout bees may decide to be employed and vice versa. The relation between bees food searching and ABC has been discussed in detail in [32, 33]. In the ABC algorithm employed and onlooker bees are responsible for searching in the space about the optimal solution while scout bees control the search process as mentioned in [33]. In ABC, the solution of the optimization problem is the position of the food source while the amount of nectar with respect to the quality refers to the objective function of the solution.The position of the food source in the search space can be described as follows:(8)
x
i
j
new
=
x
i
j
old
+
u
x
i
j
old
-
x
k
j
.The probability of onlooker bees for choosing a food source is as follows:(9)
p
i
=
fitness
i
∑
i
=
1
E
b
fitness
iwith i
=
1
,
2
,
…
,
E
b and E
b is the half of the colony size, j
=
1
,
2
,
…
,
D, and j is the number of positions with D dimension, where D refers to number of parameters to be defined, fitnes
s
i is the fitness function, k is a random number, where k
∈
1
,
2
,
…
,
E
b, and u is random number between 0 and 1.ABC can be summarized in the following flowchart as shown in Figure8.Figure 8
ABC computational flowchart.


### 4.4. Differential Evolution

Differential evolution has been developed as an optimization technique and has been tested on “Chebyshev Polynomial fitting problem” before adding several improvements [27]. Finally, DE has been formulated as impressive optimization technique in [28]. DE has the same structure of Genetic algorithm represented by crossover and mutation in addition to retaining the better population and best solution by comparing the old population with the new one. Important relations will be used in the searching process represented by mutation and crossover. Performing mutation requires assigning mutation probability (MP) arbitrarily as a constant number between 0 and 1. Mutation relation will be calculated only if MP is greater than a random number between 0 and 1 as follows:(10)
V
i
G
+
1
=
X
i
G
+
F
X
best
G
-
X
i
G
+
F
X
r
1
G
-
X
r
2
G
.The crossover will be computed by simple relation where crossover probability (CP) will be set arbitrarily between 0 and 1 and then it will be compared to random number between 0 and 1. The crossover step will be executed only if CP is greater than the random number. Crossover equation can be calculated from the following relation:(11)
X
i
G
+
1
=
V
i
G
+
1
,where i
=
1,2
,
…
,
N
p and i is iterated number for every solution in the generation, X
i
(
G
) represents a solution at iteration i in the generation, V
i
(
G
+
1
) is a mutant vector generated from (10), X
r
1
(
G
)
,
X
r
2
(
G
) are solution vectors selected randomly from current generation,X
best
(
G
) is the best achieving solution, and F is a random number between 0 and 1. DE is described in detail in [43].DE can be summarized in the following flowchart as shown in Figure9.Figure 9
DE computational flowchart.


### 4.5. Optimization Algorithms Implementation

For fair comparison, the population size is set as 150 particles for all techniques. For each particle, 10 parameters are defined to be optimized controller gains as shown in Figure5. Initial settings for optimizations techniques are demonstrated in Tables 2, 3, and 4 for GSA, PSO, and DE, respectively, with setting maximum number of generations being 200.Table 2
Parameters setting for GSA.
Parameter
α
λ
ε
G
0
K
best
Setting
7
6
0.00001
1000
4Table 3
Parameters setting for PSO.
Parameter
λ
α
c
1
c
2
Setting
10
0.99
2
2Table 4
Parameters setting for DE.
Parameter
MP
CP
F
Setting
0.9
0.9
0.5


## 4.1. Gravitational Search Algorithm

In the last few years, gravitational search algorithm (GSA) has been introduced as a new metaheuristic optimization algorithm developed by newton gravitational laws and was first proposed in 2009 by [36]. The algorithm stated that, for any two objects, every object is attracted to the other object by attraction force which is directly proportional to their mass and inversely proportional to their square distance. GSA has been explained in detail in [36].GSA can be summarized in the following flowchart as shown in Figure6.Figure 6
GSA computational flowchart.


## 4.2. Particle Swarm Optimization

Particle swarm optimization has emerged recently as combinational metaheuristic approach and was first inspired from a behavior combined between bird flocking and fish schooling in 1995 by [22]. PSO combines principles of human sociocognition in addition to evolutionary computation. Each particle in the swarm represents a potential or a solution which is required to be sought in the search space in order to find the optimal solution. A potential is formed by a set of agents. Two important equations are necessary to emulate socio and cognition behaviors are represented by position and velocity for each agent. The position of the agent can be defined by the following equation:(6)
x
i
,
j
t
=
v
i
,
j
t
+
x
i
,
j
t
-
1
.The velocity of each agent can be defined by(7)
v
i
,
j
t
=
α
t
v
i
,
j
t
-
1
+
c
1
r
1
x
i
,
j
∗
t
-
1
-
x
i
,
j
t
-
1
+
c
2
r
2
x
i
,
j
∗
∗
t
-
1
-
x
i
,
j
t
-
1
,where i
=
1
,
2
,
…
,
N and N is the population size, j
=
1
,
2
,
…
,
m and m are the size of agents in the potential, x
i
,
j
∗ is the local best solution, x
i
,
j
∗
∗ is the global best solution, α
(
t
) is a decreasing weight that can be defined by α
(
t
)
=
exp
⁡
-
α
(
t
-
1
)
t, c
1 and c
2 are positive constants, and r
1 and r
2 are uniformly distributed random numbers in [
0,1
]. PSO is described in detail in [22, 42].PSO can be summarized in the following flowchart as shown in Figure7.Figure 7
PSO computational flowchart.


## 4.3. Artificial Bees Colony

In the last few years, artificial bees colony has been introduced as a new metaheuristic optimization approach and was first inspired in 2005 by [32]. Colony of bees usually divided into three groups of bees as employed, onlooker, and scout bees. Life in bees’ colony can be briefly summarized as employed bees search randomly for food where the best position of food is considered as the optimal solution. Employed bees dance to share information with other bees about amount of nectar and food source. Onlookers wait in the hive to receive information from employed bees. Onlooker bees can differentiate between the good source and the bad source and decide on the food quality based on dance length, dance type, and speed of shaking. Onlooker bees choose scout bees before sending them for a new process of food searching. According to food quality, onlooker and scout bees may decide to be employed and vice versa. The relation between bees food searching and ABC has been discussed in detail in [32, 33]. In the ABC algorithm employed and onlooker bees are responsible for searching in the space about the optimal solution while scout bees control the search process as mentioned in [33]. In ABC, the solution of the optimization problem is the position of the food source while the amount of nectar with respect to the quality refers to the objective function of the solution.The position of the food source in the search space can be described as follows:(8)
x
i
j
new
=
x
i
j
old
+
u
x
i
j
old
-
x
k
j
.The probability of onlooker bees for choosing a food source is as follows:(9)
p
i
=
fitness
i
∑
i
=
1
E
b
fitness
iwith i
=
1
,
2
,
…
,
E
b and E
b is the half of the colony size, j
=
1
,
2
,
…
,
D, and j is the number of positions with D dimension, where D refers to number of parameters to be defined, fitnes
s
i is the fitness function, k is a random number, where k
∈
1
,
2
,
…
,
E
b, and u is random number between 0 and 1.ABC can be summarized in the following flowchart as shown in Figure8.Figure 8
ABC computational flowchart.


## 4.4. Differential Evolution

Differential evolution has been developed as an optimization technique and has been tested on “Chebyshev Polynomial fitting problem” before adding several improvements [27]. Finally, DE has been formulated as impressive optimization technique in [28]. DE has the same structure of Genetic algorithm represented by crossover and mutation in addition to retaining the better population and best solution by comparing the old population with the new one. Important relations will be used in the searching process represented by mutation and crossover. Performing mutation requires assigning mutation probability (MP) arbitrarily as a constant number between 0 and 1. Mutation relation will be calculated only if MP is greater than a random number between 0 and 1 as follows:(10)
V
i
G
+
1
=
X
i
G
+
F
X
best
G
-
X
i
G
+
F
X
r
1
G
-
X
r
2
G
.The crossover will be computed by simple relation where crossover probability (CP) will be set arbitrarily between 0 and 1 and then it will be compared to random number between 0 and 1. The crossover step will be executed only if CP is greater than the random number. Crossover equation can be calculated from the following relation:(11)
X
i
G
+
1
=
V
i
G
+
1
,where i
=
1,2
,
…
,
N
p and i is iterated number for every solution in the generation, X
i
(
G
) represents a solution at iteration i in the generation, V
i
(
G
+
1
) is a mutant vector generated from (10), X
r
1
(
G
)
,
X
r
2
(
G
) are solution vectors selected randomly from current generation,X
best
(
G
) is the best achieving solution, and F is a random number between 0 and 1. DE is described in detail in [43].DE can be summarized in the following flowchart as shown in Figure9.Figure 9
DE computational flowchart.


## 4.5. Optimization Algorithms Implementation

For fair comparison, the population size is set as 150 particles for all techniques. For each particle, 10 parameters are defined to be optimized controller gains as shown in Figure5. Initial settings for optimizations techniques are demonstrated in Tables 2, 3, and 4 for GSA, PSO, and DE, respectively, with setting maximum number of generations being 200.Table 2
Parameters setting for GSA.
Parameter
α
λ
ε
G
0
K
best
Setting
7
6
0.00001
1000
4Table 3
Parameters setting for PSO.
Parameter
λ
α
c
1
c
2
Setting
10
0.99
2
2Table 4
Parameters setting for DE.
Parameter
MP
CP
F
Setting
0.9
0.9
0.5


## 5. Results and Discussions

Nonlinear TRMS has been simulated considering TRMS parameters in The appendix. Briefly, the system has been simulated for 80 seconds with initial conditions for both pitch and yaw angles are 0.1 and 0.15 rad, respectively, with 0.01 seconds sampling time. The objective function is computed from (4) where λ
(
t
) is a penalty factor. To improve the settling time, the objective function will be multiplied by an increasing time weighting λ
(
t
) which starts initially as λ
(
t
)
=
1. In this experiment, the reference has been chosen for both yaw and pitch angles to be 0.3
sin
(
0.031
t
).GSA, PSO, ABC, and DE are functioned to search for minimum error for 80 iterations in a number of experiments with different initializations. Table5 demonstrates the minimum error after 80 iterations of each experiment and their average values with their consumption time per iteration and also the number of setting parameters is discussed. It is noticed from Table 5 that GSA has the smallest average followed by DE then PSO and the highest average is ABC although GSA has more setting parameters than other comparison techniques.Table 5
Minimum error after 80 iterations and time per iteration.
Exp1
Exp2
Exp3
Exp4
Exp5
Exp6
Exp7
Exp8
Average
Time per iteration (sec)
Setting parameters
GSA
3.2915
5.7112
5.8316
6.4720
5.4030
4.3753
5.7497
6.7643
5.4498
6383.15
5
PSO
6.3411
6.9329
7.2922
6.293
5.6631
—
—
—
6.5045
6382.10
4
ABC
9.4855
11.5355
10.7622
9.9329
10.7004
—
—
—
10.4833
6382.60
—
DE
4.6437
7.8255
6.3855
6.4262
5.4983
—
—
—
6.1558
6381.44
3Figures10–13 present the fitness reduction for GSA, PSO, ABC, and DE, respectively, in 80 iterations. With different initial populations, GSA has been simulated in eight experiments while PSO, ABC, and DE have been simulated in five experiments in order to validate the robustness of the four search techniques.Figure 10
Fitness minimization for GSA with different initializations.Figure 11
Fitness minimization for PSO with different initializations.Figure 12
Fitness minimization for ABC with different initializations.Figure 13
Fitness minimization for DE with different initializations.The robustness for each method has been validated as shown in Figures10–13 and Table 5 where the objective functions for each algorithm are very close by the end of 80 iterations. Figure 14 demonstrates the average fitness function for each algorithm.Figure 14
Average fitness for GSA, PSO, ABC, and DE.The optimal gains of each search technique with their minimum objective function after 200 iterations are expressed in Table6. After 200 iterations and among the four comparison techniques, GSA gives the minimum error. On contrary, ABC gives the highest error.Table 6
Optimal gains after 200 iterations with their objective function.
KVe
KVde
KHVe
KHVde
KVHe
KVHde
KHe
KHde
KHV
KVH
Obj
GSA
40
26.544
40
29.2786
1.7778
20.8239
7.3525
2.2567
−1.0862
−0.6442
3.0380
PSO
39.95
21.117
39.8855
17.201
1.3643
22.7434
7.3525
13.9838
−1.1284
−1.0432
3.9698
ABC
35.5195
19.1465
25.3081
3.0515
4.3111
24.4751
19.5009
16.1338
−1.2142
−1.0412
7.5166
DE
40
26.4236
40
32.5652
1.2728
20.0212
4.3722
3.5919
−1.0381
−0.8021
3.2915In order to validate the presented results in Table6, two different scenarios discuss the proposed technique where the first case is nonzero initial condition with sinusoidal input and the second case is zero initial condition with sinusoidal transient response.Case 1.
Figure15 shows the system response of the proposed fuzzy controller with initial conditions 0.1 and 0.15 for pitch and yaw angles, respectively. The reference input applied in this case is assigned to be 0.3
sin
(
0.031
t
) for both pitch and yaw angles. The output response shows that the error is almost zero which demonstrates the effectiveness of the proposed controllers. Focusing on the tracking response, GSA shows better tracking performance and closer to the reference signal followed by DE while ABC shows the farthest in addition to some ripples at the peak point.Figure 15
The proposed decoupling PDFLC controller response with GSA, PSO, ABC, and DE in Case1.Case 2.
In this case, Figure16 has square wave reference inputs with soft transients for both angles where the frequency is 0.023 Hz. The output response shows good tracking results. Similar to Case 1, GSA shows close and well-tracked performance to the reference signal followed by DE in contrast to presence of ripples in ABC and a bit far from the reference input.Figure 16
The proposed decoupling PDFLC controller response with GSA, PSO, ABC, and DE in Case2.These two cases conclude that GSA is more robust and faster evolutionary algorithm in the search space than other three algorithms. Although four search algorithms give good tracking results with the proposed controller PDFLC, GSA is the most impressive technique with minimum objective function.


## 6. Conclusion

In this work, a comprehensive comparative study of four optimization techniques with decoupling PDFLC for high nonlinear TRMS has been proposed in order to cancel high nonlinearities and to solve high coupling effects in addition to maintaining the control signal within a suitable range. GSA, PSO, ABC, and DE have been implemented to tune the controller parameters and they showed great results in terms of tracking and error minimization. Robustness has been validated successfully for each technique with different initializations, optimizing the control parameters attempted by the optimization algorithms with two different operating conditions to test the efficacy of each algorithm. Finally, GSA shows the most impressive results in contrast to other algorithms with respect to convergence speed and optimum objective function. Implementing gain-scheduling technique with the decoupling PD fuzzy controller can be considered as a recommended future work.



---

*Source: 704301-2015-04-19.xml*