# PI Controller of Speed Regulation of Brushless DC Motor Based on Particle Swarm Optimization Algorithm with Improved Inertia Weights

Authors: Wei Xie; Jie-Sheng Wang; Hai-Bo Wang
Journal: Mathematical Problems in Engineering
 (2019)

---

## Abstract

The brushless director current (DC) motor is a new type of mechatronic motor that has been developed rapidly with the development of power electronics technology and the emergence of new permanent magnet materials. Based on the speed regulation characteristics, speed regulation strategy, and mathematical model of brushless DC motor, a parameter optimization method of proportional-integral (PI) controller on speed regulation for the brushless DC motor based on particle swarm optimization (PSO) algorithm with variable inertia weights is proposed. The parameters of PI controller are optimized by PSO algorithm with five inertia weight adjustment strategies (linear descending inertia weight, linear differential descending inertia weight, incremental-decremented inertia weight, nonlinear descending inertia weight with threshold, and nonlinear descending inertia weight with control factor). The effectiveness of the proposed method is verified by the simulation experiments and the related simulation results.


---

## Body

## 1. Introduction

The design of brushless DC motor comes from the idea that electronic switch circuit is used to replace the mechanical commutator of brush DC motor. In order to achieve the effective control performance on the motor speed and the direction of motor rotation, the brushless DC motor must have a rotor position sensor and a commutation device consisting of a control circuit and a power inverter bridge [1]. Therefore, the brushless DC motor is a typical mechanical product, whose basic structure consists of three parts (the ontology of motor, power drive circuit, and position sensor). Compared with other types of motors, the brushless DC motor adopts the form of square wave excitation, which improves the utilization rate of the permanent magnet material, reduces the volume of the motor, increases the output power of the motor, and has the characteristics of high efficiency and high reliability.A brushless DC motor is a self-synchronous rotating motor, which has a rotor with the permanent magnet, a rotor position signal and a controller of the electronic commutation. Its commutation circuit can be independent or integrated on the ontology of motor. With the rapid development of computer technology and control theory, many microprocessors, such as single-chip microcomputers, digital signal processors (DSPs), field programmable gate arrays (FPGAs), and complex programmable logic devices (CPLDs), have achieved unprecedented development, which leads to a qualitative leap on the instruction speed and storage space and further promotes the development of the brushless DC motor. The brushless DC motor has been widely used in various fields, such as industrial equipment, instrumentation, household electric appliances, robots, and medical equipment. In addition, some advanced control strategies and methods are constantly applied to the control of brushless DC motor. These methods improve the control performance on the brushless DC motor, such as torque ripple suppression, rotational speed dynamics and steady-state response and system anti-interference to a certain extent, and expand the application range of the brushless DC motor [2–4].The proportional-integral-derivative (PID) controller has been widely used in many industrial processes because it has simple structure, good robustness, and high reliability. The parameter self-tuning of PID controller is important in the industrial applications so as to obtain the high control quality. But the appropriate selection of PID controller parameters needs the expert knowledge about the given complex industrial processes and control theory [5]. Now many intelligent PID controllers have been proposed to solve the shortcomings of the typical PID controllers, such as the expert PID controller, the PID controller based rules, the PID controller based on the neural network, and the fuzzy PID controller [6]. But the nondifferentiated or nonlinear parameter searching space of the adopted PID controller will make the global optimum unacquirable. With the rapid development of swarm intelligent theory, many PID controller parameters self-tuning methods based on the swarm intelligent theory appeared, such as genetic algorithm (GA), extreme optimization (EO) algorithm, particle swarm optimization (PSO) algorithm, big bang–big crunch optimization (BB–BC) algorithm, artificial bee colony (ABC) algorithm, imperialist competitive algorithm (ICA), differential evolution (DE) algorithm, and harmony search (HS) algorithm, which have been applied in the parameters optimization of PID controller [7–14].Particle swarm optimization (PSO) algorithm is a new evolutionary algorithm developed by the J. Kennedy and R. C. Eberhart [15]. Based on the observation of the activity behavior of animal swarms, the individual information sharing in the population is used to make the whole population's motion produce an evolution process from the disorder to the order in the problem solving space so as to obtain the optimal solution. The PSO algorithm has been widely used in many fields, such as the parameter estimation for time-delay chaotic system [16], the prediction of seismic slope stability [17], the carton heterogeneous vehicle routing problem [18], the optimal power flow problem [19], the optimal power management of plug-in hybrid electric vehicles [20], the structural failure prediction of multistoried RC buildings [21], the energy-efficient dynamic scheduling for a flexible flow shop [22], the multiattribute decision making [23], the electrochemical model parameter identification of a lithium-ion battery [24], the medical image segmentation [25], and the parameters optimization of PID controller [26, 27]. In this paper, based on the speed regulation characteristics, speed regulation strategy, and mathematical model of brushless DC motor, a parameter optimization method of the adopted PI controller on speed regulation for the brushless DC motor based on PSO algorithm with five inertia weights is proposed. The effectiveness of the proposed method is verified by simulation experiments. The paper is organized as follows. In Section 2, the mathematical model of brushless DC motor is introduced. In Section 3, the particle swarm optimization (PSO) algorithm with different inertia weights is discussed. The parameter tuning method of PID controller based on PSO algorithm is illustrated in Section 4. The simulation experiment and result analysis are carried out in Section 5. Finally, the conclusion is illustrated in the last part.


## 2. Mathematical Model of Brushless DC Motor

The brushless DC motor is similar in structure to the permanent magnet synchronous motor, which is mainly composed of the stator with armature winding and rotor with permanent magnet pole. The position sensor in the brushless DC motor plays the role of detecting the rotor magnetic pole position and providing correct commutation information for the logic switching circuit; that is to say it converts the position signal of the rotor magnetic pole into an electrical signal and then controls the stator winding commutation so as to make the current of the motor armature winding commutated in a certain order with the change of the position of the rotor and form the stepping rotating magnetic field through the air gap to drive the permanent magnet rotor to continuously rotate. Taking a two-pole and three-phase brushless DC motor as an example, the stator winding of the motor is concentrated full pitch winding connected withY, the rotor is constructed with the hidden inner rotor structure, and the three hall elements are placed symmetrically in space 120° apart. Based on this structure, the following assumptions are made to simplify the analysis process.(
1
) Ignore the saturation of motor core and exclude eddy current loss and hysteresis loss.(
2
) Exclude the armature reaction. The air gap magnetic field distribution is approximately considered as the trapezoidal wave such that the flat top width is 120° electrical angle.(
3
) Ignore the cogging effect. The armature conductor is continuously and evenly distributed on the armature surface.(
4
) The power transistor and diode of the drive system inverter circuits have ideal switching characteristics.The phase voltage of each phase winding in the brushless DC motor is composed of the resistance voltage drop and the winding induced potential. Any phase voltage of the winding can be expressed as(1)
u
x
=
R
x
i
x
+
e
Ψ
xwhere u
x is the phase voltage, i
x is the phase current, and e
Ψ
x is the phase induced electromotive force. The subscript x represents the three-phase windingA,B, andC. R
x is the phase winding and R
A
=
R
B
=
R
C
=
R in the three-phase symmetrical winding.The induced electromotive force of the winding is numerically equal to the change rate of the flux with time through the winding closed loop, so the induced electromotive force here is equal to the positive value of change rate of flux, that is to say:(2)
e
Ψ
x
=
d
Ψ
x
d
tIn addition to being hinged with the magnetic flux generated by its own current, each phase winding is also respectively hinged with the permanent magnet rotor and the magnetic flux generated by other winding currents. Taking theA-phase winding as an example, the flux linkage can be expressed as(3)
Ψ
A
=
L
A
i
A
+
M
A
C
i
C
+
Ψ
p
m
θwhere Ψ
p
m
θ is the permanent magnet flux of theA-phase winding chain, θ is the rotor position angle, L
A is the self-inductance ofA-phase winding, and M
A
B and M
A
C are the self-inductance ofB-phase winding and theC-phase winding to theA-phase winding, respectively.When the rotor position angle isɑ, the permanent magnet flux of theA-phase winding chain is described as(4)
Ψ
p
m
α
=
N
ϕ
p
m
α
(5)
ϕ
p
m
α
=
∫
-
π
/
2
+
ϕ
π
/
2
+
α
B
θ
S
d
θwhere ϕ
p
m
α is the permanent magnet flux of theA-phase winding chain when the rotor position angle is α, B
θ is the magnetic density distribution of radial air gap of the rotor permanent magnet, which is trapezoidal along theθ angle, N is the number of winding, and S is the area enclosed by the winding on the inner diameter surface of the stator.Substitute (2)-(5) into (1) to obtain(6)
u
A
=
R
i
A
+
d
d
t
L
A
i
A
+
M
A
B
i
B
+
M
A
C
i
C
+
ψ
p
m
u
A
=
u
A
=
R
i
A
+
d
d
t
L
A
i
A
+
M
A
B
i
B
+
M
A
C
i
C
+
d
d
t
N
S
∫
-
π
/
2
+
θ
π
/
2
+
θ
B
x
d
x
u
A
=
R
i
A
+
d
d
t
L
A
i
A
+
M
A
B
i
B
+
M
A
C
i
C
+
e
Awhere e
A is the opposite electromotive force ofA-phase winding.The rotor of a brushless DC motor is generally constructed with the surface-adhesive hidden pole structure, whose winding inductance is a constant that does not change with time. Since the structure of the stator three-phase winding is symmetrical, the self-inductance of each phase winding is equal, and the mutual inductance among all phase windings is also equal; that is to sayL
A
=
L
B
=
L
C
=
L and M
A
B
=
M
B
A
=
M
B
C
=
M
C
B
=
M
A
C
=
M
C
A
=
M. So substitute them into (6) to obtain(7)
u
A
=
R
i
A
=
L
d
i
A
d
t
+
M
d
i
A
d
t
+
M
d
i
B
d
t
+
M
d
i
C
d
t
+
e
A
(8)
e
A
=
d
d
t
N
S
∫
-
π
/
2
+
θ
π
/
2
+
θ
B
x
d
x
=
N
S
B
π
2
+
θ
-
B
-
π
2
+
θ
d
θ
d
t
e
A
=
N
S
ϖ
B
π
2
+
θ
-
B
-
π
2
+
θwhere ϖ is the angular velocity of the electric motor.According to the distribution of the air gap magnetic density,B
θ has a period of 2π, and B
θ
+
π
=
-
B
θ, so obtain(9)
e
A
=
N
S
ϖ
B
π
2
+
θ
-
B
-
π
2
+
θ
=
2
N
S
ϖ
B
π
2
+
θIt can be seen that the changing waveform of the opposite electromotive force ofA-phase along the angle θ is ahead of electrical angle π
/
2 than the air gap magnetic density distribution B
θ. So e
A can be written as(10)
e
A
=
2
N
S
ϖ
B
m
∫
θ
A
=
ϖ
ψ
m
∫
θ
Awhere B
m is the maximum of the magnetic density distribution of air gap of the rotor permanent magnet, ψ
m is the maximum of the permanent magnet flux of the chain in each phase winding, and ∫
θ
A is the waveform function of the opposite electromotive force ofA-phase.The three-phase currents meet the following condition.(11)
i
A
=
i
B
=
i
C
=
0So, (9) can be further simplified as(12)
u
A
=
R
i
A
+
L
-
M
d
i
A
d
t
+
e
AAfter derivation, the similar results can be obtained for theB-phase andC-phase, so the matrix equation of the phase voltage equation of the brushless DC motor can be expressed as(13)
u
A
u
B
u
C
=
R
0
0
0
R
0
0
0
R
i
A
i
B
i
C
+
L
-
M
0
0
0
L
-
M
0
0
0
L
-
M
d
d
t
i
A
i
B
i
C
+
e
A
e
B
e
CSimilar to other motors, the power and torque of a brushless DC motor can be analyzed from energy transfer angle. When the motor is running, it can absorb the electric power from the power supply. A small part of the electric power is converted into the copper consumption and iron consumption in these electric power and most of the power is transmitted into the torque action of the rotor permanent magnet passed to the rotor through the air gap magnetic field, which is equal to the sum of the product of the opposite electromotive force and the current of the three-phase winding, that is to say(14)
P
e
=
e
A
i
A
+
e
B
i
B
+
e
C
i
CExcluding the mechanical losses and stray losses of the rotor, this power can be absolutely converted into the rotor kinetic energy.(15)
P
e
=
T
e
Ωwhere T
e is the electromagnetic torque and Ω is the mechanical angular velocity of the motor.Equation (16) can be deduced by (14) and (15).(16)
T
e
=
e
A
i
A
+
e
B
i
B
+
e
C
i
C
ΩThe above voltage equation and torque equation form a complete mathematical model of an electromechanical system by introducing the motion equation of the motor, which is described as follows:(17)
T
e
-
T
L
=
J
d
Ω
d
t
+
B
ν
Ωwhere T
L is the load torque, J is moment of inertia of rotor, and B
ν
Ω is the viscous friction coefficient.Equations (13), (16), and (17) together constitute the mathematical model of the brushless DC motor.


## 3. Particle Swarm Optimization (PSO) Algorithm

### 3.1. Principle of PSO Algorithm

The PSO algorithm proposed by Eberhart and Kennedy in 1995 originates and imitates the predation behavior of cooperation and competition of the bird flocks. The PSO algorithm searches for the optimal solution by random and iteration, whose positions are tracked by two extreme values in each iteration. The first is the optimal solution pBest found by the particle itself and the other is the optimal solution gBest found in the entire population, also known as the global extreme. Suppose a population consisting ofM particles fly at a certain speed in a D-dimensional space. The properties of particle i at time t are described as follows.(
1
) Position: x
i
t
=
x
i
1
t
,
x
i
2
t
,
⋯
,
x
i
d
t
T
,
x
i
d
t
∈
L
d
,
U
d
,
L
d is the lower limit of searching space and U
d is the upper limit of searching space.(
2
) Velocity: v
i
t
=
v
i
1
,
v
i
2
,
⋯
,
v
i
d
T
,
v
i
d
t
∈
v
m
i
n
,
d
,
v
m
a
x
,
d
,
v
m
i
n and v
m
a
x are the minimum and maximum velocities respectively.(
3
) The individual optimal position: p
i
t
=
p
i
1
t
,
p
i
2
t
,
⋯
,
p
i
D
t
T. The global optimal position: p
g
t
=
p
g
1
t
,
p
g
2
t
,
⋯
,
p
g
D
t
T. 1
≤
d
≤
D, 1
≤
i
≤
M.Then the position of the particle at timet
+
1 can be obtained by the following equations:(18)
v
i
d
t
+
1
=
w
v
i
d
t
+
c
1
r
1
p
i
d
t
-
x
i
d
t
+
c
2
r
2
p
g
d
t
-
x
i
d
t
(19)
x
i
d
t
+
1
=
x
i
d
t
+
v
i
d
t
+
1where r
1 and r
2 are random numbers uniformly distributed in the interval (
0,1
) and c
1 and c
2 are learning factors, generally c
1
=
c
2
=
2.Equation (18) is mainly composed of three parts. The first part is v
i
d
t to indicate the previous movement velocity and direction of the particle. The second part is c
1
r
1
p
i
d
t
-
x
i
d
t. The current position and the optimal individual position of the particles are compared and the related difference is used to determine the next direction of movement. The third part is c
2
r
2
p
g
d
t
-
x
i
d
t, which means that the movement of other particles is realized through information sharing among particles, so the consistency with other particles is sought.The basic flowchart of the standard PSO algorithm is shown in Figure1. The basic algorithm steps are described as follows.Figure 1
Flowchart of PSO algorithm.Step 1.
Initialize particles in the related population.Step 2.
Calculate the individual extreme pBest and the global extreme gBest.Step 3.
Evaluate each particle that is to calculate the fitness value of each particle. If the current position of the particle is better than the individual extreme, the position is updated to the individual extreme. If the current position of the particle is better than the global extreme, the position is updated to the global extreme.Step 4.
Calculate the updated function fitness values.Step 5.
Update the positions and velocities of the particles according to (18) and (19).Step 6.
Judge whether the termination condition is met. If the adopted termination condition is met, output the found optimal solution, otherwise return to Step3.


### 3.2. Inertia Weight Adjustment Strategy

It can be seen form (18) of PSO algorithm that inertia weight is the key factor affecting the local searching ability and the global searching ability of PSO algorithm. They can be balanced to some extent by adjusting the magnitude of the inertia weight. Most of the linear adjustment strategies of inertia weights may be divided into two kinds: linear descending strategy and linear differential descending strategies.(
1) Linear Descending Inertia Weight. The linear descending adjusting strategy of inertia weight was firstly proposed by Y. Shi and R. C. Eberhant [28], which can be described as follows:(20)
w
t
=
w
s
t
a
r
t
-
w
s
t
a
r
t
-
w
e
n
d
t
m
a
x
×
twhere w
s
t
a
r
t is the initial value of the inertia weight, w
e
n
d is the value of the inertia weight at the end of the iteration, t is the current number of iterations, and t
m
a
x is the maximum number of iterations.This method improves the ability of local search and global search and accelerates the convergence speed, but it easily makes the algorithm fall into the local optimum.(
2) Linear Differential Descending Inertia Weight. This method is proposed to overcome the limitations of typical linear descending strategy [29]. The linear differential descending strategy of inertia weight is described as(21)
d
w
t
d
t
=
2
w
s
t
a
r
t
-
w
e
n
d
t
m
a
x
2
×
t
(22)
w
t
=
w
s
t
a
r
t
-
w
s
t
a
r
t
-
w
e
n
d
t
m
a
x
2
×
t
2This method not only improves the global search ability and accelerates the convergence speed but also weakens the limitations of the typical descending strategy to some extent.The nonlinear inertia weighting adjusting strategy is an improvement of the linear strategy, which avoids the phenomenon such that the algorithm is difficult to jump out once it enters the local extreme points. The nonlinear inertia weighting adjusting strategy mainly includes many methods, such as the incremental-decremented inertia weight, the nonlinear descending inertia weight with threshold, and the nonlinear descending inertia weight with control factor.(
1) Incremental-Decremented Inertia Weight. In order to overcome the defects of the descending strategies, an incremental-decremented inertia weight adjusting strategy described in (23) was proposed [30].(23)
w
t
=
1
×
t
t
m
a
x
+
0.4
-
1
×
t
t
m
a
x
+
1.4After analysis, this algorithm has fast convergence speed in the early stage and strong local search ability in the late stage, and it also overcomes some shortcomings and improves the performance of the algorithm at the same time.(
2) Nonlinear Descending Inertia Weight with Threshold. A nonlinear descending inertia weight with threshold was proposed based on the typical descending strategy [31], which can be described as(24)
w
t
=
w
i
-
t
-
1
T
0
-
1
λ
w
i
-
w
jwhere λ, w
j, w
i, and T
0 are related parameters. This algorithm has a good effect on the accuracy, convergence speed, and stability of solutions for the low-dimensional problems.(
3) Nonlinear Descending Inertia Weight with Control Factor. The nonlinear descending inertia weight adjusting strategy with control factor [32] is described as follows:(25)
w
t
=
w
s
t
a
r
t
-
w
e
n
d
-
d
1
1
1
+
d
2
t
/
t
m
a
x


## 3.1. Principle of PSO Algorithm

The PSO algorithm proposed by Eberhart and Kennedy in 1995 originates and imitates the predation behavior of cooperation and competition of the bird flocks. The PSO algorithm searches for the optimal solution by random and iteration, whose positions are tracked by two extreme values in each iteration. The first is the optimal solution pBest found by the particle itself and the other is the optimal solution gBest found in the entire population, also known as the global extreme. Suppose a population consisting ofM particles fly at a certain speed in a D-dimensional space. The properties of particle i at time t are described as follows.(
1
) Position: x
i
t
=
x
i
1
t
,
x
i
2
t
,
⋯
,
x
i
d
t
T
,
x
i
d
t
∈
L
d
,
U
d
,
L
d is the lower limit of searching space and U
d is the upper limit of searching space.(
2
) Velocity: v
i
t
=
v
i
1
,
v
i
2
,
⋯
,
v
i
d
T
,
v
i
d
t
∈
v
m
i
n
,
d
,
v
m
a
x
,
d
,
v
m
i
n and v
m
a
x are the minimum and maximum velocities respectively.(
3
) The individual optimal position: p
i
t
=
p
i
1
t
,
p
i
2
t
,
⋯
,
p
i
D
t
T. The global optimal position: p
g
t
=
p
g
1
t
,
p
g
2
t
,
⋯
,
p
g
D
t
T. 1
≤
d
≤
D, 1
≤
i
≤
M.Then the position of the particle at timet
+
1 can be obtained by the following equations:(18)
v
i
d
t
+
1
=
w
v
i
d
t
+
c
1
r
1
p
i
d
t
-
x
i
d
t
+
c
2
r
2
p
g
d
t
-
x
i
d
t
(19)
x
i
d
t
+
1
=
x
i
d
t
+
v
i
d
t
+
1where r
1 and r
2 are random numbers uniformly distributed in the interval (
0,1
) and c
1 and c
2 are learning factors, generally c
1
=
c
2
=
2.Equation (18) is mainly composed of three parts. The first part is v
i
d
t to indicate the previous movement velocity and direction of the particle. The second part is c
1
r
1
p
i
d
t
-
x
i
d
t. The current position and the optimal individual position of the particles are compared and the related difference is used to determine the next direction of movement. The third part is c
2
r
2
p
g
d
t
-
x
i
d
t, which means that the movement of other particles is realized through information sharing among particles, so the consistency with other particles is sought.The basic flowchart of the standard PSO algorithm is shown in Figure1. The basic algorithm steps are described as follows.Figure 1
Flowchart of PSO algorithm.Step 1.
Initialize particles in the related population.Step 2.
Calculate the individual extreme pBest and the global extreme gBest.Step 3.
Evaluate each particle that is to calculate the fitness value of each particle. If the current position of the particle is better than the individual extreme, the position is updated to the individual extreme. If the current position of the particle is better than the global extreme, the position is updated to the global extreme.Step 4.
Calculate the updated function fitness values.Step 5.
Update the positions and velocities of the particles according to (18) and (19).Step 6.
Judge whether the termination condition is met. If the adopted termination condition is met, output the found optimal solution, otherwise return to Step3.


## 3.2. Inertia Weight Adjustment Strategy

It can be seen form (18) of PSO algorithm that inertia weight is the key factor affecting the local searching ability and the global searching ability of PSO algorithm. They can be balanced to some extent by adjusting the magnitude of the inertia weight. Most of the linear adjustment strategies of inertia weights may be divided into two kinds: linear descending strategy and linear differential descending strategies.(
1) Linear Descending Inertia Weight. The linear descending adjusting strategy of inertia weight was firstly proposed by Y. Shi and R. C. Eberhant [28], which can be described as follows:(20)
w
t
=
w
s
t
a
r
t
-
w
s
t
a
r
t
-
w
e
n
d
t
m
a
x
×
twhere w
s
t
a
r
t is the initial value of the inertia weight, w
e
n
d is the value of the inertia weight at the end of the iteration, t is the current number of iterations, and t
m
a
x is the maximum number of iterations.This method improves the ability of local search and global search and accelerates the convergence speed, but it easily makes the algorithm fall into the local optimum.(
2) Linear Differential Descending Inertia Weight. This method is proposed to overcome the limitations of typical linear descending strategy [29]. The linear differential descending strategy of inertia weight is described as(21)
d
w
t
d
t
=
2
w
s
t
a
r
t
-
w
e
n
d
t
m
a
x
2
×
t
(22)
w
t
=
w
s
t
a
r
t
-
w
s
t
a
r
t
-
w
e
n
d
t
m
a
x
2
×
t
2This method not only improves the global search ability and accelerates the convergence speed but also weakens the limitations of the typical descending strategy to some extent.The nonlinear inertia weighting adjusting strategy is an improvement of the linear strategy, which avoids the phenomenon such that the algorithm is difficult to jump out once it enters the local extreme points. The nonlinear inertia weighting adjusting strategy mainly includes many methods, such as the incremental-decremented inertia weight, the nonlinear descending inertia weight with threshold, and the nonlinear descending inertia weight with control factor.(
1) Incremental-Decremented Inertia Weight. In order to overcome the defects of the descending strategies, an incremental-decremented inertia weight adjusting strategy described in (23) was proposed [30].(23)
w
t
=
1
×
t
t
m
a
x
+
0.4
-
1
×
t
t
m
a
x
+
1.4After analysis, this algorithm has fast convergence speed in the early stage and strong local search ability in the late stage, and it also overcomes some shortcomings and improves the performance of the algorithm at the same time.(
2) Nonlinear Descending Inertia Weight with Threshold. A nonlinear descending inertia weight with threshold was proposed based on the typical descending strategy [31], which can be described as(24)
w
t
=
w
i
-
t
-
1
T
0
-
1
λ
w
i
-
w
jwhere λ, w
j, w
i, and T
0 are related parameters. This algorithm has a good effect on the accuracy, convergence speed, and stability of solutions for the low-dimensional problems.(
3) Nonlinear Descending Inertia Weight with Control Factor. The nonlinear descending inertia weight adjusting strategy with control factor [32] is described as follows:(25)
w
t
=
w
s
t
a
r
t
-
w
e
n
d
-
d
1
1
1
+
d
2
t
/
t
m
a
x


## 4. Parameter Tuning Method of PID Controller Based on PSO Algorithm

In the modern industrial field, the PID controller is widely used due to its advantages, such as simple structure, good robustness, and high reliability. The traditional PID parameter optimization methods include the experience trial and error method, the critical proportional method, the attenuation curve method, and the dynamic characteristic method. These traditional optimization methods are not only complicated in process but also prone to producing large overshoot. The PSO algorithm is widely used in the parameter design of PID controllers because of its simple idea, easy implementation, and fewer parameters to be adjusted [33].The basic principle of the standard PID controller is that the control quantityu
t is formed according to the linear combination of proportional-integral-derivative of the deviation e
t between the set value and the actual value. Then the control quantity u
t is used to control the control object. The law of the continuous PID controller is described as(26)
u
t
=
K
P
e
t
+
1
T
I
∫
0
t
e
t
d
t
+
T
D
d
e
t
d
twhere K
p is the proportional coefficient, T
I is the integral coefficient, and T
D is the differential coefficient.The digital PID controller is generally used to improve the reliability of modern motor control system. Therefore, the discrete PID controller, also named as the positional PID controller, can be described as(27)
u
k
=
K
P
e
k
+
T
T
I
∑
j
=
0
k
e
j
+
T
D
T
e
k
-
e
k
-
1where K
I is the integral coefficient, K
D is the differential coefficient, T is the sampling period, and e
k and e
k
-
1 are the deviation values at the kth and (k
-
1)th sampling time.The most common type of the brushless DC motor control system is the proportional-integral form, because the differential element can effectively reduce overshoot and reduce the maximum dynamic deviation, but it also easily makes the system affected by high frequency interference at the same time. The main study of this paper is the combination form of proportional-integral too. In some motor digital controller, the PID controller shown in (27) is easy to generate large errors, and the poor dynamic performance, the incremental PID controller can be used to overcome these shortcomings. According to the recursive principle, the incremental PID controller based on (27) can be expressed as(28)
Δ
u
k
=
K
P
e
k
-
e
k
-
1
+
K
I
e
k
+
K
D
e
k
-
2
e
k
-
1
+
e
k
-
2The PID controller achieves the specified performance of the system by adjusting three parametersK
p, K
i, and K
d. From the perspective of optimization, it is to find the optimal solution in the variable space of three parameters K
p, K
i, and K
d to make the system reach the optimal state. The structure of the proposed PSO-PID controller is shown in Figure 2.Figure 2
Structure of the proposed PSO-PID controller.The key problem of the PID parameter optimization tuning method based on PSO algorithm is how to solve the parameter coding and the selection of fitness function. Firstly, it is assumed that there is a populationP and there are a total of S particles in the population P; the position vector of each particle consists of three control parameters K
p, K
i, and K
d, and the dimension of the particle position vector is D=3. Then the population can be represented by a matrix of S
×
D in (29)
P
S
,
D
=
K
p
1
K
i
1
K
d
1
K
p
2
K
i
2
K
d
2
⋮
⋮
⋮
K
p
S
K
i
S
K
d
SDue to the diversity of the system, the range of each parameter is formulated according to the needs and actual conditions; the initial population is also randomly generated within the range of values. In order to obtain the dynamic characteristic of satisfactory transient process, the time integral performance index of the error absolute value is used as the minimum objective function of the parameter selection. To prevent the excessive control energy, the squared term of the control input is added to the objective function. The adopted objective function is described as follows:(30)
F
=
∫
0
∞
w
1
e
t
+
w
2
u
2
t
d
twhere e
t is the system error, u
t is the controller output, and w
1 and w
2 are the weight values.


## 5. Simulation Experiment and Result Analysis

### 5.1. Parameter Settings

(
1) Motor Parameter Initialization. The calibration power P
n
=
4
e
3, standard voltage U
n
=
280, standard current I
n
=
17.5, angular velocity W
n
=
(
1980
×
P
i
)
/
30, armature resistance R
n
=
1.69, armature reactance L
n
=
6.6
e
-
3, rated torque T
n
=
19.3, and the frequency of converter switch is 4000. K
i, K
w and K
u are defined as(31)
K
i
=
1
I
n
(32)
K
w
=
1
W
n
(33)
K
u
=
1
U
n(
2) Initialization of PSO Algorithm. The parameters of PSO algorithm are listed in Table 1. In the simulation experiments, five different inertia weight adjusting strategies are adopted to verify the effect of the PSO algorithm for the PI controller of the brushless DC motor.Table 1
Parameters of PSO algorithm.
Parameter
Value
Learning factorc
1 and c
2
2.05
The number of particles
20
The size of the particlesd
i
m
2
The number of iterationss
t
e
p
s
120


### 5.2. Simulation Results

The simulation experiments are carried out to obtain the diagrams of current (I), voltage (U), and angular velocity (W). The parametersK
i and K
p of the brushless DC motor and the global optimal solution (Gbest) are obtained based on PSO algorithm. The simulation results under different inertia weights for PSO algorithm are compared. The input waveform is shown in Figure 3.Figure 3
Waveform of electric motor input.(
1) Linear Descending Inertia Weight. When the typical linear descending strategy is used on the inertia weight, the simulated output waveforms of the current, speed, and voltage of the motor are shown in Figures 4–6 through optimization of the PSO algorithm.Figure 4
Output current waveform of electric motor.Figure 5
Output speed waveform of electric motor.Figure 6
Output voltage waveform of electric motor.When the typical linear descending strategy of inertia weight and the input waveform shown in Figure3 are adopted, the optimized results of K
i and Kp are 152.865 and 21.521, and the optimal performance is 224.9267. With the increasing number of iterations, the changes of the parameters K
p, K
i and the optimal value are shown in Figures 7–9.Figure 7
Variation ofK
p with the number of iterations.Figure 8
Variation ofK
i with the number of iterations.Figure 9
Variation of the optimal value with the number of iterations.(
2) Linear Differential Descending Inertia Weight. When adopting the linear differential descending strategy inertia weight and the same input waveform, the simulated output waveforms of the current, speed, and voltage of the motor are shown in Figures 10–12. When the differential descending strategy of inertia weight and the input waveform shown in Figure 3 are adopted, the optimized results of K
i and Kp are 228.784 and 27.766, and the optimal performance is 234.9818. With the increasing number of iterations, the changes of the parameters K
p, K
i and the optimal value are shown in Figures 13–15.Figure 10
Output current waveform of electric motor.Figure 11
Output speed waveform of electric motor.Figure 12
Output voltage waveform of electric motor.Figure 13
Variation ofK
p with the number of iterations.Figure 14
Variation ofK
i with the number of iterations.Figure 15
Variation of the optimal value with the number of iterations.(
3) Incremental-Decremented Inertia Weight. When the incremental-decremented inertia weight is used, the simulated output waveforms of the current, speed, and voltage of the motor are shown in Figures 16–18 through optimization of the PSO algorithm.Figure 16
Output current waveform of electric motor.Figure 17
Output speed waveform of electric motor.Figure 18
Output voltage waveform of electric motor.When the incremental-decremented inertia weight and the input waveform shown in Figure3 are adopted, the optimized results of K
i and Kp are 395.768 and 45.034, and the optimal performance is 278.6788. With the increasing number of iterations, the changes of the parameters K
p, K
i and the optimal value are shown in Figures 19–21.Figure 19
Variation ofK
p with the number of iterations.Figure 20
Variation ofK
i with the number of iterations.Figure 21
Variation of the optimal value with the number of iterations.(
4) Nonlinear Descending Inertia Weight with Threshold. When the nonlinear descending inertia weight with threshold is used, the simulated output waveforms of the current, speed, and voltage of the motor are shown in Figures 22–24 through optimization of the PSO algorithm.Figure 22
Output current waveform of electric motor.Figure 23
Output speed waveform of electric motor.Figure 24
Output voltage waveform of electric motor.When the nonlinear descending inertia weight with threshold and the input waveform shown in Figure3 are adopted, the optimized results of K
i and Kp are 152.865 and 21.931, and the optimal performance is 224.8972. With the increasing number of iterations, the changes of the parameters K
p, K
i and the optimal value are shown in Figures 25–27.Figure 25
Variation ofK
p with the number of iterations.Figure 26
Variation ofK
i with the number of iterations.Figure 27
Variation of the optimal value with the number of iterations.(
5) Nonlinear Descending Inertia Weight with Control Factor. When the nonlinear descending inertia weight with control factor is used, the simulated output waveforms of the current, speed, and voltage of the motor are shown in Figures 28–30 through optimization of the PSO algorithm.Figure 28
Output current waveform of electric motor.Figure 29
Output speed waveform of electric motor.Figure 30
Output voltage waveform of electric motor.When the nonlinear descending inertia weight with control factor and the input waveform shown in Figure3 are adopted, the optimized results of K
i and Kp are 316.710 and 49.273, and the optimal performance is 199.6130. With the increasing number of iterations, the changes of the parameters K
p, K
i and the optimal value are shown in Figures 31–33.Figure 31
Variation ofK
p with the number of iterations.Figure 32
Variation ofK
i with the number of iterations.Figure 33
Variation of the optimal value with the number of iterations.Figure34 shows the optimal values obtained under different inertia weight adjustment strategies. In the case that different requirements are set, the adjustment strategy of the most suitable inertia weight can be compared to make the system optimal. When adopting the same input, the output current, speed, and voltage of the motor are obtained through optimization of the PSO algorithm. By using different adjusting strategy of inertia weights, different Ki, Kp and the optimal performance are listed in Table 2, which clearly shows the effectiveness of the adopted adjustment strategies of inertia weight on PSO algorithm.Table 2
Performance comparison under different inertia weights adjustment strategies.
Inertia weight adjustment strategies
K
i
Kp
Optimal performance
Linear descending inertia weight
152.865
21.521
224.9267
Linear differential descending inertia weight
151.533
21.544
234.9818
Incremental-decremented inertia weight
395.768
45.034
278.6788
Nonlinear descending inertia weight with threshold
151.562
21.931
224.8972
Nonlinear descending inertia weight with control factor
316.710
49.273
199.6130Figure 34
Optimal values under different inertia weight adjustment strategies.In the simulation experiments, a parameter optimization method of PI controller based on PSO algorithm with five inertia weight adjustment strategies is applied on the speed regulation of the established brushless DC motor model. It can be seen from the simulation results (Figures4–34 and Table 2) that the linear descending inertia weight has better optimization performance than linear differential descending inertia weight. The nonlinear descending inertia weight with control factor has best optimization performance in these five inertia weight adjustment strategies. On the other hand, the nonlinear inertia weights have better optimization performance than the linear inertia weights.


## 5.1. Parameter Settings

(
1) Motor Parameter Initialization. The calibration power P
n
=
4
e
3, standard voltage U
n
=
280, standard current I
n
=
17.5, angular velocity W
n
=
(
1980
×
P
i
)
/
30, armature resistance R
n
=
1.69, armature reactance L
n
=
6.6
e
-
3, rated torque T
n
=
19.3, and the frequency of converter switch is 4000. K
i, K
w and K
u are defined as(31)
K
i
=
1
I
n
(32)
K
w
=
1
W
n
(33)
K
u
=
1
U
n(
2) Initialization of PSO Algorithm. The parameters of PSO algorithm are listed in Table 1. In the simulation experiments, five different inertia weight adjusting strategies are adopted to verify the effect of the PSO algorithm for the PI controller of the brushless DC motor.Table 1
Parameters of PSO algorithm.
Parameter
Value
Learning factorc
1 and c
2
2.05
The number of particles
20
The size of the particlesd
i
m
2
The number of iterationss
t
e
p
s
120


## 5.2. Simulation Results

The simulation experiments are carried out to obtain the diagrams of current (I), voltage (U), and angular velocity (W). The parametersK
i and K
p of the brushless DC motor and the global optimal solution (Gbest) are obtained based on PSO algorithm. The simulation results under different inertia weights for PSO algorithm are compared. The input waveform is shown in Figure 3.Figure 3
Waveform of electric motor input.(
1) Linear Descending Inertia Weight. When the typical linear descending strategy is used on the inertia weight, the simulated output waveforms of the current, speed, and voltage of the motor are shown in Figures 4–6 through optimization of the PSO algorithm.Figure 4
Output current waveform of electric motor.Figure 5
Output speed waveform of electric motor.Figure 6
Output voltage waveform of electric motor.When the typical linear descending strategy of inertia weight and the input waveform shown in Figure3 are adopted, the optimized results of K
i and Kp are 152.865 and 21.521, and the optimal performance is 224.9267. With the increasing number of iterations, the changes of the parameters K
p, K
i and the optimal value are shown in Figures 7–9.Figure 7
Variation ofK
p with the number of iterations.Figure 8
Variation ofK
i with the number of iterations.Figure 9
Variation of the optimal value with the number of iterations.(
2) Linear Differential Descending Inertia Weight. When adopting the linear differential descending strategy inertia weight and the same input waveform, the simulated output waveforms of the current, speed, and voltage of the motor are shown in Figures 10–12. When the differential descending strategy of inertia weight and the input waveform shown in Figure 3 are adopted, the optimized results of K
i and Kp are 228.784 and 27.766, and the optimal performance is 234.9818. With the increasing number of iterations, the changes of the parameters K
p, K
i and the optimal value are shown in Figures 13–15.Figure 10
Output current waveform of electric motor.Figure 11
Output speed waveform of electric motor.Figure 12
Output voltage waveform of electric motor.Figure 13
Variation ofK
p with the number of iterations.Figure 14
Variation ofK
i with the number of iterations.Figure 15
Variation of the optimal value with the number of iterations.(
3) Incremental-Decremented Inertia Weight. When the incremental-decremented inertia weight is used, the simulated output waveforms of the current, speed, and voltage of the motor are shown in Figures 16–18 through optimization of the PSO algorithm.Figure 16
Output current waveform of electric motor.Figure 17
Output speed waveform of electric motor.Figure 18
Output voltage waveform of electric motor.When the incremental-decremented inertia weight and the input waveform shown in Figure3 are adopted, the optimized results of K
i and Kp are 395.768 and 45.034, and the optimal performance is 278.6788. With the increasing number of iterations, the changes of the parameters K
p, K
i and the optimal value are shown in Figures 19–21.Figure 19
Variation ofK
p with the number of iterations.Figure 20
Variation ofK
i with the number of iterations.Figure 21
Variation of the optimal value with the number of iterations.(
4) Nonlinear Descending Inertia Weight with Threshold. When the nonlinear descending inertia weight with threshold is used, the simulated output waveforms of the current, speed, and voltage of the motor are shown in Figures 22–24 through optimization of the PSO algorithm.Figure 22
Output current waveform of electric motor.Figure 23
Output speed waveform of electric motor.Figure 24
Output voltage waveform of electric motor.When the nonlinear descending inertia weight with threshold and the input waveform shown in Figure3 are adopted, the optimized results of K
i and Kp are 152.865 and 21.931, and the optimal performance is 224.8972. With the increasing number of iterations, the changes of the parameters K
p, K
i and the optimal value are shown in Figures 25–27.Figure 25
Variation ofK
p with the number of iterations.Figure 26
Variation ofK
i with the number of iterations.Figure 27
Variation of the optimal value with the number of iterations.(
5) Nonlinear Descending Inertia Weight with Control Factor. When the nonlinear descending inertia weight with control factor is used, the simulated output waveforms of the current, speed, and voltage of the motor are shown in Figures 28–30 through optimization of the PSO algorithm.Figure 28
Output current waveform of electric motor.Figure 29
Output speed waveform of electric motor.Figure 30
Output voltage waveform of electric motor.When the nonlinear descending inertia weight with control factor and the input waveform shown in Figure3 are adopted, the optimized results of K
i and Kp are 316.710 and 49.273, and the optimal performance is 199.6130. With the increasing number of iterations, the changes of the parameters K
p, K
i and the optimal value are shown in Figures 31–33.Figure 31
Variation ofK
p with the number of iterations.Figure 32
Variation ofK
i with the number of iterations.Figure 33
Variation of the optimal value with the number of iterations.Figure34 shows the optimal values obtained under different inertia weight adjustment strategies. In the case that different requirements are set, the adjustment strategy of the most suitable inertia weight can be compared to make the system optimal. When adopting the same input, the output current, speed, and voltage of the motor are obtained through optimization of the PSO algorithm. By using different adjusting strategy of inertia weights, different Ki, Kp and the optimal performance are listed in Table 2, which clearly shows the effectiveness of the adopted adjustment strategies of inertia weight on PSO algorithm.Table 2
Performance comparison under different inertia weights adjustment strategies.
Inertia weight adjustment strategies
K
i
Kp
Optimal performance
Linear descending inertia weight
152.865
21.521
224.9267
Linear differential descending inertia weight
151.533
21.544
234.9818
Incremental-decremented inertia weight
395.768
45.034
278.6788
Nonlinear descending inertia weight with threshold
151.562
21.931
224.8972
Nonlinear descending inertia weight with control factor
316.710
49.273
199.6130Figure 34
Optimal values under different inertia weight adjustment strategies.In the simulation experiments, a parameter optimization method of PI controller based on PSO algorithm with five inertia weight adjustment strategies is applied on the speed regulation of the established brushless DC motor model. It can be seen from the simulation results (Figures4–34 and Table 2) that the linear descending inertia weight has better optimization performance than linear differential descending inertia weight. The nonlinear descending inertia weight with control factor has best optimization performance in these five inertia weight adjustment strategies. On the other hand, the nonlinear inertia weights have better optimization performance than the linear inertia weights.


## 6. Conclusions

In this paper, an optimization method of PI controller parameters of speed regulation for brushless DC motor based on PSO algorithm with variable inertia weights is proposed. Inertia weight is a very important parameter affecting PSO algorithm's local development ability and global search ability. The local search and the global search of the PSO algorithm can be balanced by adjusting the magnitude of the inertia weight to some extent. By properly adjusting the inertia weight, the optimal performance of the PSO algorithm on the tuning of PI controller parameters can be improved, the convergence speed can be accelerated, and more accurate optimal solution is obtained. On the other hand, other metaheuristic techniques, such as ant colony optimization (ACO) algorithm, bat algorithm (BA), chicken swarm optimization (CSO) algorithm, and firefly algorithm (FA), will be explored in the optimization of PI controller parameters of brushless DC motor in our future work.



---

*Source: 2671792-2019-02-24.xml*