首页> 外文会议>ACM/EDAC/IEEE Design Automation Conference >ClusRed: Clustering and network reduction based probabilistic optimal power flow analysis for large-scale smart grids
【24h】

ClusRed: Clustering and network reduction based probabilistic optimal power flow analysis for large-scale smart grids

机译:CLUSRED:大型智能电网的集群和网络缩减概率最佳功率流分析

获取原文

摘要

The smart electric grid in the United States is one of the largest and most complex cyber-physical systems (CPS) in the world and contains considerable uncertainties. Probabilistic optimal power flow (OPF) analysis is required to accomplish the electrical and economic operational goals. In this paper, we propose a novel algorithm to accelerate the computation of probabilistic OPF for large-scale smart grids through network reduction (NR). Cumulant-based method and Gram-Charlier expansion theory are used to efficiently obtain the statistics of system states. We develop a more accurate linear mapping method to compute the unknown cumulants. Our method speeds up the computation by up to 4.57X and can improve around 30% accuracy when Hessian matrix is ill-conditioned compared to the previous approach.
机译:美国的智能电网是世界上最大,最复杂的网络物理系统之一,并包含相当大的不确定性。概率最佳功率流量(OPF)分析是实现电气和经济运营目标所必需的。在本文中,我们提出了一种新颖的算法,通过网络减少(NR)加速了大规模智能电网的概率验证OPF的计算。基于累积的方法和克 - 查理扩展理论用于有效地获得系统状态的统计数据。我们开发一种更准确的线性映射方法来计算未知累积剂。我们的方法将计算速度高达4.57倍,并且当与之前的方法相比,当Hessian矩阵没有条件时,可以提高约30%的准确性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号