DocumentCode
2529112
Title
A Reinforcement Learning algorithm to economic dispatch considering transmission losses
Author
Jasmin, E.A. ; Ahamed, T. P Imthias ; Jagathiraj, V.P.
Author_Institution
Dept. of Electr. & Electron., Govt Eng. Coll., Thrissur
fYear
2008
fDate
19-21 Nov. 2008
Firstpage
1
Lastpage
6
Abstract
Reinforcement learning (RL) refers to a class of learning algorithms in which learning system learns which action to take in different situations by using a scalar evaluation received from the environment on performing an action. RL has been successfully applied to many multi stage decision making problem (MDP) where in each stage the learning systems decides which action has to be taken. Economic dispatch (ED) problem is an important scheduling problem in power systems, which decides the amount of generation to be allocated to each generating unit so that the total cost of generation is minimized without violating system constraints. In this paper we formulate economic dispatch problem as a multi stage decision making problem. In this paper, we also develop RL based algorithm to solve the ED problem. The performance of our algorithm is compared with other recent methods. The main advantage of our method is it can learn the schedule for all possible demands simultaneously.
Keywords
decision making; learning (artificial intelligence); losses; power engineering computing; power generation dispatch; power generation scheduling; economic dispatch; generating unit allocation; multi stage decision making problem; power system scheduling; reinforcement learning algorithm; transmission loss; Costs; Decision making; Environmental economics; Learning systems; Performance evaluation; Power generation; Power generation economics; Power system economics; Power systems; Propagation losses; Economic Dispatch; Multi-stage Decision Making Problem; Q learning; Reinforcement Learning;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON 2008 - 2008 IEEE Region 10 Conference
Conference_Location
Hyderabad
Print_ISBN
978-1-4244-2408-5
Electronic_ISBN
978-1-4244-2409-2
Type
conf
DOI
10.1109/TENCON.2008.4766652
Filename
4766652
Link To Document