Академический Документы
Профессиональный Документы
Культура Документы
ISSN: 2278-0181
Vol. 2 Issue 6, June - 2013
PSO was inspired from natural behavior of the bird friction coefficient (Nms/rad), Kt = torque constant
flock on how they find the optimal path and bring (Nm/A), Kb = Back emf constant (Vs/rad).
back to their nest by building the unique trail
formation. The first algorithm which can be classified Figure 2 showing the basic block diagram of DC
within this framework was presented in 1994 and, motor model including their transfer functions. V a is
since then, many diverse variants of the basic the input supply, TL is load torque and ω is angular
principle have been reported in the literature. The speed.
objective of this algorithm is to optimize the gains of
the PID controller for the given plant. In proposed
PSO-PID controller, PSO algorithm is used to
optimize the gains and the values are applied into the
controller of the plant. The objective of this algorithm
is to optimize the gains of the PID controller for the
given plant. The proportional gain makes the
controller respond to the error while the integral
derivative gain help to eliminate steady state error
and prevent overshoot respectively.
Kt I a s s J m s Bm s …(8)
When TL = 0
dia(t )
Va(t ) Raia(t ) La Eb(t ) …(1)
dt
Eb(t ) Kb(t ) …(2)
Fig.3 Block diagram D.C. motor model when TL = 0
Tm(t ) Ktia(t ) …(3) Figure 3 shows that the DC motor is running under
Tm t TL t J m Bm t …(4) no-load condition (ideal) i.e. TL = 0. Now find the
transfer function of 𝜔(s) with respect to Va(s).
where Va = armature voltage (V), Ra = armature
resistance (Ω), La = armature inductance (H), Ia = So, the relation between motor speed and applied
armature current (A), Eb = Back emf (V), ω = voltage is given by the transfer function,
angular speed (rad/sec), Tm = motor torque (Nm), T L
= load torque (Nm), θ = angular position of rotor (s) Kt
shaft (rad), Jm = rotor inertia (kgm2), Bm = viscous
Va (s) La J m s ( Ra J m La Bm )s ( Ra Bm Kb Kt )
2
T = 0.67(t2-t1) … (15)
is based on the swarm behavior such as birds finding Algorithmic Approach for the Specified
food by flocking. A basic variant of the PSO Design:-
algorithm works by having population (called a In our case, we cast the PID controller design
swarm) of candidate solution (called particles). These problem in PSO framework as given. We consider
particles are moved around in the search-space the three dimensional search space. KP , KI and KD
according to a few simple formulae. The movements are the three dimensions. We consider the fitness
of the particles are guided by their own best known function based on time domain Characteristics for
position in the search-space as well as the entire adaptation. We set the number of adaptation
swarm's best known position. When improved iterations based on expected parameters and time of
positions are being discovered these will then come computation.
to guide the movements of the swarm. The process is Objective Function for Particle swarm
repeated and by doing so it is hoped, but not optimization
guaranteed, that a satisfactory solution will function F= tightnes (kd, kp, ki)
eventually be discovered. Here in this technique a set T=tf([.023*kd .023*kp .023*ki],[.005 (.010015+.023*kd)
of particles are put in d-dimensional search space (.000559+.023*kp).023*ki]);
with randomly choosing velocity and position. The S=stepinfo (T1);
tr=S.RiseTime;
initial position of the particle is taken as the best
ts=S.SettlingTime;
position for the start and then the velocity of the Mp=S.Overshoot;
particle is updated based on the experience of other Ess=1/(1+dcgain(T1));
particles of the swarming population. F= (1-exp (-0.5))*(Mp+Ess) +exp(-0.5)*(ts-tr);
The index of the best particle among the group is No. of Iterations 50
Gbestd.
Velocity of the ith particle is represented as
Vi Vi ,1 Vi ,2 Vi ,3.......... Vi , d
The updated velocity and the distance from Pbestid to
Gbesti,d is given as ;
t 1 t
Vi , m W * Vi , m C1* rand () * Pbesti ,m – Xi ,mt C 2 * rand () * Gbest m – Xi ,mt
Xi,d(t+1) = Xim(t) +Vi,m(t+1)
For i=1, 2, 3.......n.
m = 1, 2, 3.....d.
where,
n:- Number of particles in the group.
d: - dimension index.
t: - Pointer of iteration.
Vi,m(t):- Velocity of particle at iteration i.
W: - Inertia weight factor.
C1, C2:- Acceleration Constant.
rand ():- Random number between 0 and 1.
Xi,d(t):- Current position of the particle ‗i‘ at iteration. Fig. 7 Flowchart of Particle Swarm Optimization
Pbest: - Best previous position of the ith particle.
Gbest:- Best particle among all the particle in the
swarming population.
7. REFERENCES
[1] Gopal K. Dubey, ―Fundamentals of Electrical Drives‖,
Fig. 12 Speed versus Time plot with reference speed Narosa Publishing House Pvt. Ltd., 2001, chap. 6.
for PID tuned with ZN, CC, and PSO [2] J.G. Ziegler, N.B. Nichols, ―Optimization Setting
for Automatic Controller‖, Trans. ASME, Vol. 64,pp.
756-769, 1942.
Table 4 Comparative analysis of various tuning
methods [3] J. Kennedy, ―The Particle Swarm: Social
Adaptation of Knowledge‖, Proceeding of the IEEE
International Conference on Evolutionary
Computation, ICEC1997, Indianapolis, pp. 303-308,
1997.
[4] Nasri M. I, pour H. N, and Maghfoori M., 2007
RT
"A PSO-Based Optimum Design of PID Controller
for a Linear Brushless DC Motor" Proceedings Of
World Academy Of Science, Engineering And
IJE