Reinforcement learning solution to economic dispatch using pursuit algorithm

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.
基于追踪算法的经济调度强化学习解决方案
强化学习(RL)算法是解决多阶段决策问题的有力工具。本文将经济调度问题看作是一个n阶段的决策问题,提出了一种新的强化学习算法,该算法在学习过程的每个阶段都使用追踪算法进行决策。虽然模拟退火、遗传算法、进化规划等软计算技术已经应用到ED中,但它们都需要寻找对应于每种需求的最优解。在强化学习方法中,一旦学习阶段结束,我们就可以从查找表中找到任何负载的最优调度。强化学习算法的一个重要问题是在学习阶段如何在探索和利用之间取得平衡。本文提出了一种基于学习自动机理论的寻迹算法来平衡学习阶段的探索和利用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信