...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Electric Power Systems Research >A Computationally Efficient Topology Identifiability Analysis of Distribution Systems
【24h】

A Computationally Efficient Topology Identifiability Analysis of Distribution Systems

机译：A Computationally Efficient Topology Identifiability Analysis of Distribution Systems

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

? 2022 Elsevier B.V.Because of the lack of a proper real-time monitoring system at distribution power networks, topology identification can not be performed properly. While in traditional radial structures the topology is unique, in the presence of an open-ring structure, this issue constitutes a risk for the operation of the system, and the safety of the field staff in contact with the system components. Many studies in literature considers this problem in the scope of observability, however having a completely observable power system does not necessarily indicate having a uniquely identifiable topology. Therefore, the operator should know the branch statuses. One may utilize probabilistic approaches to determine the status of each branch, however those methods are vulnerable to the measurement errors and quality of the pseudo-measurements. This paper develops a numerical method that aims to find the identifiable branches, such that the branches whose status can be identified uniquely, based on the available measurement set, but not measurement readings. The proposed method employs a strategical ordering and Cholesky factorization to improve the computational performance. Moreover, the paper presents the optimum location of the measurement devices that is required to satisfy complete topology identifiability. The proposed method is assessed by means of a real-life system and the well-known IEEE test systems.

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号