Reinforcement learning aided smart-home decision-making in an interactive smart grid

Ding Li, S. Jayaweera
{"title":"Reinforcement learning aided smart-home decision-making in an interactive smart grid","authors":"Ding Li, S. Jayaweera","doi":"10.1109/IGESC.2014.7018632","DOIUrl":null,"url":null,"abstract":"In this paper, a complete hierarchical architecture is presented for the Utility-customer interaction, which tightly connect several important research topics, such as customer load prediction, renewable generation integration, power-load balancing and demand response. The complete interaction cycle consists of two stages: (1) Initial interaction (long-term planning) and (2) Real-time interaction (short-term planning). A hidden mode Markov decision process (HM-MDP) model is developed for customer real-time decision making, which outperforms the conventional Markov decision process (MDP) model in handling the non-stationary environment. To obtain a low-complexity, real-time algorithm, that allows to adaptively incorporate new observations as the environment changes, we resort to Q-learning based approximate dynamic programming (ADP). Without requiring specific starting and ending points of the scheduling period, the Q-learning algorithm offers more flexibility in practice. Performance analysis of both exact and approximate algorithms are presented with simulation results, in comparison with other decision making strategies.","PeriodicalId":372982,"journal":{"name":"2014 IEEE Green Energy and Systems Conference (IGESC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Green Energy and Systems Conference (IGESC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IGESC.2014.7018632","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

In this paper, a complete hierarchical architecture is presented for the Utility-customer interaction, which tightly connect several important research topics, such as customer load prediction, renewable generation integration, power-load balancing and demand response. The complete interaction cycle consists of two stages: (1) Initial interaction (long-term planning) and (2) Real-time interaction (short-term planning). A hidden mode Markov decision process (HM-MDP) model is developed for customer real-time decision making, which outperforms the conventional Markov decision process (MDP) model in handling the non-stationary environment. To obtain a low-complexity, real-time algorithm, that allows to adaptively incorporate new observations as the environment changes, we resort to Q-learning based approximate dynamic programming (ADP). Without requiring specific starting and ending points of the scheduling period, the Q-learning algorithm offers more flexibility in practice. Performance analysis of both exact and approximate algorithms are presented with simulation results, in comparison with other decision making strategies.
交互式智能电网中强化学习辅助智能家居决策
本文提出了一种完整的电力客户交互层次结构,将电力客户负荷预测、可再生能源发电集成、电力负载均衡和需求响应等重要研究课题紧密联系起来。完整的交互周期包括两个阶段:(1)初始交互(长期规划)和(2)实时交互(短期规划)。提出了一种用于客户实时决策的隐模马尔可夫决策过程模型,该模型在处理非平稳环境方面优于传统的马尔可夫决策过程模型。为了获得一种低复杂度的实时算法,该算法允许随着环境变化而自适应地合并新的观测结果,我们采用了基于q学习的近似动态规划(ADP)。在不要求调度周期的起始点和结束点的情况下,Q-learning算法在实践中提供了更大的灵活性。给出了精确算法和近似算法的性能分析以及仿真结果,并与其他决策策略进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信