2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)最新文献

筛选
英文 中文
Multi-Level Optimal Power Flow Solver in Large Distribution Networks 大型配电网多级最优潮流求解器
Xinyang Zhou, Yue-Chun Chen, Zhiyuan Liu, Changhong Zhao, Lijun Chen
{"title":"Multi-Level Optimal Power Flow Solver in Large Distribution Networks","authors":"Xinyang Zhou, Yue-Chun Chen, Zhiyuan Liu, Changhong Zhao, Lijun Chen","doi":"10.1109/SmartGridComm47815.2020.9303000","DOIUrl":"https://doi.org/10.1109/SmartGridComm47815.2020.9303000","url":null,"abstract":"Solving optimal power flow (OPF) problems for large distribution networks incurs high computational complexity. We consider a large multi-phase distribution network of tree topology with a deep penetration of active devices. We divide the network into collaborating areas featuring subtree topology and subareas featuring subsubtree topology. We design a multilevel implementation of the primal-dual gradient algorithm to solve the voltage regulation OPF problems while preserving nodal voltage information and topological information within areas and subareas. Numerical results on a 4,521-node system verify that the proposed algorithm can significantly improve the computational speed without compromising any optimality.","PeriodicalId":428461,"journal":{"name":"2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)","volume":"95 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131771359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Matrix Completion Using Alternating Minimization for Distribution System State Estimation 基于交变最小矩阵补全的配电系统状态估计
Yajing Liu, April Sagan, A. Bernstein, Rui Yang, Xinyang Zhou, Y. Zhang
{"title":"Matrix Completion Using Alternating Minimization for Distribution System State Estimation","authors":"Yajing Liu, April Sagan, A. Bernstein, Rui Yang, Xinyang Zhou, Y. Zhang","doi":"10.1109/SmartGridComm47815.2020.9302962","DOIUrl":"https://doi.org/10.1109/SmartGridComm47815.2020.9302962","url":null,"abstract":"This paper examines the problem of state estimation in power distribution systems under low-observability conditions. The recently proposed constrained matrix completion method which combines the standard matrix completion method and power flow constraints has been shown to be effective in estimating voltage phasors under low-observability conditions using single-snapshot information. However, the method requires solving a semidefinite programming (SDP) problem, which becomes computationally infeasible for large systems and if multiple-snapshot (time-series) information is used. This paper proposes an efficient algorithm to solve the constrained matrix completion problem with time-series data. This algorithm is based on reformulating the matrix completion problem as a bilinear (non-convex) optimization problem, and applying the alternating minimization algorithm to solve this problem. This paper proves the summable convergence of the proposed algorithm, and demonstrates its efficacy and scalability via IEEE 123-bus system and a real utility feeder system. This paper also explores the value of adding more data from the history in terms of computation time and estimation accuracy.","PeriodicalId":428461,"journal":{"name":"2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131738565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow 学习极快交流最优潮流的最优解决方案
Ahmed S. Zamzam, K. Baker
{"title":"Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow","authors":"Ahmed S. Zamzam, K. Baker","doi":"10.1109/SmartGridComm47815.2020.9303008","DOIUrl":"https://doi.org/10.1109/SmartGridComm47815.2020.9303008","url":null,"abstract":"We develop, in this paper, a machine learning approach to optimize the real-time operation of electric power grids. In particular, we learn feasible solutions to the AC optimal power flow (OPF) problem with negligible optimality gaps. The AC OPF problem aims at identifying optimal operational conditions of the power grids that minimize power losses and/or generation costs. Due to the computational challenges with solving this nonconvex problem, many efforts have focused on linearizing or approximating the problem in order to solve the AC OPF on faster timescales. However, many of these approximations can be fairly poor representations of the actual system state and still require solving an optimization problem, which can be time consuming for large networks. In this work, we learn a mapping between the system loading and optimal generation values, enabling us to find near-optimal and feasible AC OPF solutions. This allows us to bypass solving the traditionally nonconvex AC OPF problem, resulting in a significant decrease in computational burden for grid operators.","PeriodicalId":428461,"journal":{"name":"2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130187544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 114
Vulnerability Assessment of Large-scale Power Systems to False Data Injection Attacks 大型电力系统对虚假数据注入攻击的脆弱性评估
Jiazi Zhang, Zhigang Chu, L. Sankar, O. Kosut
{"title":"Vulnerability Assessment of Large-scale Power Systems to False Data Injection Attacks","authors":"Jiazi Zhang, Zhigang Chu, L. Sankar, O. Kosut","doi":"10.1109/SmartGridComm47815.2020.9302956","DOIUrl":"https://doi.org/10.1109/SmartGridComm47815.2020.9302956","url":null,"abstract":"This paper studies the vulnerability of large-scale power systems to false data injection (FDI) attacks through their physical consequences. An attacker-defender bi-level linear program (ADBLP) can be used to determine the worst-case consequences of FDI attacks aiming to maximize the physical power flow on a target line. This ADBLP can be transformed into a single-level mixed-integer linear program (MILP), but it is numerically intractable for power systems with a large number of buses and branches. In this paper, a modified Benders’ decomposition algorithm is proposed to solve the ADBLP on large power systems without converting it to the MILP. Of more general interest, the proposed algorithm can be used to solve any ADBLP. Vulnerability of the IEEE 118-bus system and the Polish system with 2383 buses to FDI attacks is assessed using the proposed algorithm.","PeriodicalId":428461,"journal":{"name":"2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125648883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 43
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信