基于图优化的电网测量布局

K. C. Sou
{"title":"基于图优化的电网测量布局","authors":"K. C. Sou","doi":"10.1109/R10-HTC.2018.8629830","DOIUrl":null,"url":null,"abstract":"In this paper, the minimum cost measurement placement problem guaranteeing power system observability is considered. Contrary to the mainstream studies predominately focused on phasor measurement unit (PMU) placements, this paper considers the placement with traditional units including line power flows and bus power injections. The result in this work serves as a precursor for the placement problem with PMU and traditional measurements in full generality. The placement problem in this paper is formulated as a graph connectivity problem, which is either solved exactly as a mixed integer linear program or approximately via minimum spanning tree and weighted bipartite matching calculations. A numerical case study on IEEE power system benchmarks demonstrates the solution methodologies for the placement problem.","PeriodicalId":404432,"journal":{"name":"2018 IEEE Region 10 Humanitarian Technology Conference (R10-HTC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Power Network Measurement Placement Using Graph Optimization\",\"authors\":\"K. C. Sou\",\"doi\":\"10.1109/R10-HTC.2018.8629830\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the minimum cost measurement placement problem guaranteeing power system observability is considered. Contrary to the mainstream studies predominately focused on phasor measurement unit (PMU) placements, this paper considers the placement with traditional units including line power flows and bus power injections. The result in this work serves as a precursor for the placement problem with PMU and traditional measurements in full generality. The placement problem in this paper is formulated as a graph connectivity problem, which is either solved exactly as a mixed integer linear program or approximately via minimum spanning tree and weighted bipartite matching calculations. A numerical case study on IEEE power system benchmarks demonstrates the solution methodologies for the placement problem.\",\"PeriodicalId\":404432,\"journal\":{\"name\":\"2018 IEEE Region 10 Humanitarian Technology Conference (R10-HTC)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Region 10 Humanitarian Technology Conference (R10-HTC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/R10-HTC.2018.8629830\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Region 10 Humanitarian Technology Conference (R10-HTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/R10-HTC.2018.8629830","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文研究了保证电力系统可观测性的最小成本测量布置问题。与主流研究主要集中于相量测量单元(PMU)的放置相反,本文考虑了传统单元的放置,包括线路潮流和母线注入功率。这项工作的结果为PMU和传统测量的放置问题提供了一个先兆。本文的布局问题被表述为一个图连通性问题,该问题可以精确地求解为一个混合整数线性规划,也可以通过最小生成树和加权二部匹配计算近似地求解。通过对IEEE电力系统基准测试的数值案例研究,展示了安置问题的解决方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Power Network Measurement Placement Using Graph Optimization
In this paper, the minimum cost measurement placement problem guaranteeing power system observability is considered. Contrary to the mainstream studies predominately focused on phasor measurement unit (PMU) placements, this paper considers the placement with traditional units including line power flows and bus power injections. The result in this work serves as a precursor for the placement problem with PMU and traditional measurements in full generality. The placement problem in this paper is formulated as a graph connectivity problem, which is either solved exactly as a mixed integer linear program or approximately via minimum spanning tree and weighted bipartite matching calculations. A numerical case study on IEEE power system benchmarks demonstrates the solution methodologies for the placement problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信