By Topic

Reinforcement learning solution to economic dispatch using pursuit algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Parambath, I.A.T. ; E.E. Dept., King Saud Univ., Riyadh, Saudi Arabia ; Jasmin, E.A. ; Pazheri, F.R. ; Al-Ammar, E.A.

Reinforcement learning (RL) algorithms are powerful tools that can be used to solve multi stage decision making problem. In this paper, we view Economic Dispatch (ED) problem as an n stage decision making problem and propose a novel RL algorithm which uses pursuit algorithm for making decisions at each stage during the learning process. Even though many soft computing techniques like simulated annealing, genetic algorithm and evolutionary programming have been applied to ED, they require searching for the optimal solution corresponding to each demand. In RL approach, once learning phase is over, we can find optimal dispatch for any load from a lookup table. One important issue in RL algorithm is striking a balance between exploration and exploitation during the learning phase. Here we propose to use an efficient algorithm called pursuit algorithm from theory of learning automata for balancing the exploration and exploitation during the learning phase.

Published in:

GCC Conference and Exhibition (GCC), 2011 IEEE

Date of Conference:

19-22 Feb. 2011