首页> 外文会议>IEEE PES Innovative Smart Grid Technologies Conference Europe >Searching for plausible N-k contingencies endangering voltage stability
【24h】

Searching for plausible N-k contingencies endangering voltage stability

机译:寻找可能危及电压稳定性的N-k意外事件

获取原文

摘要

This paper presents a novel search algorithm using time-domain simulations to identify plausible N - k contingencies endangering voltage stability. Starting from an initial list of disturbances, progressively more severe contingencies are investigated. After simulation of a N - k contingency, the simulation results are assessed. If the system response is unstable, a plausible harmful contingency sequence has been found. Otherwise, components affected by the contingencies are considered as candidate next event leading to N - (k + 1) contingencies. This implicitly takes into account hidden failures of component protections. The performance of the proposed search algorithm is compared to a brute-force algorithm and demonstrated on the IEEE Nordic test system.
机译:本文提出了一种使用时域仿真的新颖搜索算法,以识别可能危及电压稳定性的N-k偶发事件。从最初的干扰列表开始,逐步研究更严重的突发事件。在模拟了N-k偶然性之后,评估了模拟结果。如果系统响应不稳定,则会发现可能的有害意外事件序列。否则,受突发事件影响的组件将被视为导致N-(k ​​+ 1)突发事件的候选下一事件。这隐含地考虑了组件保护的隐藏故障。将所提出的搜索算法的性能与蛮力算法进行比较,并在IEEE Nordic测试系统上进行了演示。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号