On the Impacts of Different Consistency Constraint Formulations for Distributed Optimal Power Flow

Rachel Harris, Mohannad Alkhraijah, David Huggins, D. Molzahn
{"title":"On the Impacts of Different Consistency Constraint Formulations for Distributed Optimal Power Flow","authors":"Rachel Harris, Mohannad Alkhraijah, David Huggins, D. Molzahn","doi":"10.1109/TPEC54980.2022.9750783","DOIUrl":null,"url":null,"abstract":"The optimal power flow (OPF) problem finds the least costly operating point which meets the power grid's operational limits and obeys physical power flow laws. Complementing today's centralized optimization paradigm, future power grids may rely on distributed optimization where multiple agents work together to determine an acceptable operating point. In distributed algorithms, local agents solve subproblems to optimize their region of the system and share data to achieve consistency with their neighboring agents' subproblems. This paper investigates how different methods of enforcing power flow consistency constraints between local areas in distributed optimal power flow impact convergence rate and a classifier's ability to detect malicious cyberattack. The distributed OPF problem is solved with the alternating direction method of multipliers (ADMM) algorithm. First, the ADMM algorithm's convergence rate is compared for three different consistency constraint formulations. Next, the paper considers a cyberattack in which the integrity of information shared between agents is compromised, causing the algorithm to exhibit unacceptable behavior. A support vector machine (SVM) classifier is trained to detect the presence of manipulated data from such cyberattacks. Results demonstrate that consistency constraint formulation impacts the classifier's detection performance; for certain formulations, detection is highly accurate.","PeriodicalId":185211,"journal":{"name":"2022 IEEE Texas Power and Energy Conference (TPEC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Texas Power and Energy Conference (TPEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TPEC54980.2022.9750783","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The optimal power flow (OPF) problem finds the least costly operating point which meets the power grid's operational limits and obeys physical power flow laws. Complementing today's centralized optimization paradigm, future power grids may rely on distributed optimization where multiple agents work together to determine an acceptable operating point. In distributed algorithms, local agents solve subproblems to optimize their region of the system and share data to achieve consistency with their neighboring agents' subproblems. This paper investigates how different methods of enforcing power flow consistency constraints between local areas in distributed optimal power flow impact convergence rate and a classifier's ability to detect malicious cyberattack. The distributed OPF problem is solved with the alternating direction method of multipliers (ADMM) algorithm. First, the ADMM algorithm's convergence rate is compared for three different consistency constraint formulations. Next, the paper considers a cyberattack in which the integrity of information shared between agents is compromised, causing the algorithm to exhibit unacceptable behavior. A support vector machine (SVM) classifier is trained to detect the presence of manipulated data from such cyberattacks. Results demonstrate that consistency constraint formulation impacts the classifier's detection performance; for certain formulations, detection is highly accurate.
不同一致性约束公式对分布式最优潮流的影响
最优潮流问题(OPF)是指在满足电网运行极限的情况下,寻找符合物理潮流规律的成本最低的运行点。作为今天集中式优化范例的补充,未来的电网可能依赖于分布式优化,其中多个代理一起工作以确定可接受的工作点。在分布式算法中,局部智能体通过求解子问题来优化其所在的系统区域,并通过共享数据来实现与相邻智能体子问题的一致性。本文研究了分布式最优潮流中不同的局部潮流一致性约束方法如何影响收敛速度和分类器检测恶意网络攻击的能力。采用乘法器交替方向法(ADMM)算法求解分布式OPF问题。首先,比较了三种不同一致性约束形式下ADMM算法的收敛速度。接下来,本文考虑了一种网络攻击,其中代理之间共享信息的完整性受到损害,导致算法表现出不可接受的行为。训练支持向量机(SVM)分类器来检测来自此类网络攻击的操纵数据的存在。结果表明,一致性约束公式影响分类器的检测性能;对于某些配方,检测是非常准确的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信