I. A. T. Parambath, E. A. Jasmin, F. Pazheri, E. Al-Ammar
{"title":"Reinforcement learning solution to economic dispatch using pursuit algorithm","authors":"I. A. T. Parambath, E. A. Jasmin, F. Pazheri, E. Al-Ammar","doi":"10.1109/IEEEGCC.2011.5752517","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":119104,"journal":{"name":"2011 IEEE GCC Conference and Exhibition (GCC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE GCC Conference and Exhibition (GCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEEGCC.2011.5752517","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
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.