最佳PMU放置,以实现爱达荷电力公司系统的完全可观察性

O. Ciniglio, M. Papic, M. Vaiman, M. Vaiman
{"title":"最佳PMU放置,以实现爱达荷电力公司系统的完全可观察性","authors":"O. Ciniglio, M. Papic, M. Vaiman, M. Vaiman","doi":"10.1109/ISGT.2017.8085995","DOIUrl":null,"url":null,"abstract":"This paper presents an effective practical approach for identifying optimal locations of Phasor Measurement Units (PMUs) to achieve complete system observability. The approach, implemented in Physical and Operational Margins/Region Of Stability Existence (POM/ROSE) software, is based on automated iterative process of forming variables and constraints of a binary integer programming problem. The problem is then solved with standard linear programming solvers. The proposed approach was tested using Idaho Power Co. (IPC) system. It allows us to reduce the number of PMUs as compared to conventional techniques while maintaining complete system observability. A fast topological approach was also demonstrated and tested using IPC data in order to analyze the observability of the IPC network. The algorithm is fast and can be used in real-time as a part of bad data detection framework.","PeriodicalId":296398,"journal":{"name":"2017 IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimal PMU placement to achieve complete observability of Idaho Power Co. System\",\"authors\":\"O. Ciniglio, M. Papic, M. Vaiman, M. Vaiman\",\"doi\":\"10.1109/ISGT.2017.8085995\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an effective practical approach for identifying optimal locations of Phasor Measurement Units (PMUs) to achieve complete system observability. The approach, implemented in Physical and Operational Margins/Region Of Stability Existence (POM/ROSE) software, is based on automated iterative process of forming variables and constraints of a binary integer programming problem. The problem is then solved with standard linear programming solvers. The proposed approach was tested using Idaho Power Co. (IPC) system. It allows us to reduce the number of PMUs as compared to conventional techniques while maintaining complete system observability. A fast topological approach was also demonstrated and tested using IPC data in order to analyze the observability of the IPC network. The algorithm is fast and can be used in real-time as a part of bad data detection framework.\",\"PeriodicalId\":296398,\"journal\":{\"name\":\"2017 IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT)\",\"volume\":\"2015 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISGT.2017.8085995\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Power & Energy Society Innovative Smart Grid Technologies Conference (ISGT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISGT.2017.8085995","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

提出了一种确定相量测量单元(pmu)最佳位置以实现系统完全可观测性的有效实用方法。该方法在物理和操作边际/稳定存在区域(POM/ROSE)软件中实现,基于形成二元整数规划问题的变量和约束的自动迭代过程。然后用标准线性规划求解器求解问题。该方法在爱达荷州电力公司(IPC)系统上进行了测试。与传统技术相比,它允许我们减少pmu的数量,同时保持完整的系统可观察性。为了分析IPC网络的可观测性,本文还演示并测试了一种基于IPC数据的快速拓扑方法。该算法速度快,可以作为不良数据检测框架的一部分实时使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal PMU placement to achieve complete observability of Idaho Power Co. System
This paper presents an effective practical approach for identifying optimal locations of Phasor Measurement Units (PMUs) to achieve complete system observability. The approach, implemented in Physical and Operational Margins/Region Of Stability Existence (POM/ROSE) software, is based on automated iterative process of forming variables and constraints of a binary integer programming problem. The problem is then solved with standard linear programming solvers. The proposed approach was tested using Idaho Power Co. (IPC) system. It allows us to reduce the number of PMUs as compared to conventional techniques while maintaining complete system observability. A fast topological approach was also demonstrated and tested using IPC data in order to analyze the observability of the IPC network. The algorithm is fast and can be used in real-time as a part of bad data detection framework.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A cyber-physical resilience metric for smart grids Optimal allocation of photovoltaic systems and energy storage systems considering constraints of both transmission and distribution systems Stochastic dynamic power flow analysis based on stochastic response surfarce method and ARMA-GARCH model Towards the improvement of multi-objective evolutionary algorithms for service restoration Multi-level control framework for enhanced flexibility of active distribution network
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1