直流最优潮流:唯一性与算法

C. Tan, Desmond W. H. Cai, Xin Lou
{"title":"直流最优潮流:唯一性与算法","authors":"C. Tan, Desmond W. H. Cai, Xin Lou","doi":"10.1109/SmartGridComm.2012.6486058","DOIUrl":null,"url":null,"abstract":"The optimal power flow (OPF) problem minimizes the power loss in an electrical network by optimizing the voltage and power delivered at the network nodes, and is generally hard to solve. We study the direct current special case by leveraging recent developments on the zero duality gap of OPF. We study the uniqueness of the OPF solution using differential topology especially the Poincare-Hopf Index Theorem, and characterize its global uniqueness for simple network topologies, e.g., line and mesh networks. This serves as a starting point to design local algorithms with global behavior that have low complexity and are computationally fast for practical smart power grids.","PeriodicalId":143915,"journal":{"name":"2012 IEEE Third International Conference on Smart Grid Communications (SmartGridComm)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"DC optimal power flow: Uniqueness and algorithms\",\"authors\":\"C. Tan, Desmond W. H. Cai, Xin Lou\",\"doi\":\"10.1109/SmartGridComm.2012.6486058\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The optimal power flow (OPF) problem minimizes the power loss in an electrical network by optimizing the voltage and power delivered at the network nodes, and is generally hard to solve. We study the direct current special case by leveraging recent developments on the zero duality gap of OPF. We study the uniqueness of the OPF solution using differential topology especially the Poincare-Hopf Index Theorem, and characterize its global uniqueness for simple network topologies, e.g., line and mesh networks. This serves as a starting point to design local algorithms with global behavior that have low complexity and are computationally fast for practical smart power grids.\",\"PeriodicalId\":143915,\"journal\":{\"name\":\"2012 IEEE Third International Conference on Smart Grid Communications (SmartGridComm)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Third International Conference on Smart Grid Communications (SmartGridComm)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SmartGridComm.2012.6486058\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Third International Conference on Smart Grid Communications (SmartGridComm)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SmartGridComm.2012.6486058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

最优潮流(OPF)问题通过优化网络节点的电压和输出功率,使网络中的功率损耗最小化,这是一个很难解决的问题。利用OPF零对偶间隙的最新研究进展,研究了直流特殊情况。我们利用微分拓扑特别是Poincare-Hopf指数定理研究了OPF解的唯一性,并刻画了简单网络拓扑(如线状网络和网状网络)的全局唯一性。这为设计具有全局行为的局部算法提供了一个起点,该算法具有较低的复杂性和计算速度,适用于实际的智能电网。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
DC optimal power flow: Uniqueness and algorithms
The optimal power flow (OPF) problem minimizes the power loss in an electrical network by optimizing the voltage and power delivered at the network nodes, and is generally hard to solve. We study the direct current special case by leveraging recent developments on the zero duality gap of OPF. We study the uniqueness of the OPF solution using differential topology especially the Poincare-Hopf Index Theorem, and characterize its global uniqueness for simple network topologies, e.g., line and mesh networks. This serves as a starting point to design local algorithms with global behavior that have low complexity and are computationally fast for practical smart power grids.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信