基于图谱的交互电网临界点搜索算法

构建了符合当前交互电网实际的模型及连锁故障机制,并提出了一种基于图谱的算法来搜索对网络安全影响最大的临界点,对这些临界点加以重点保护可以有效地提高网络鲁棒性.该算法以代数连通性来评估故障后网络连通性,不需要搜索最大连通分量,仿真结果证明其在执行效率和速度方面有较为明显的优势.;The topology of interdependent power grid is modeled, with more real world characters taken into account, as well as the propagating mechanism of cascading failures. An efficient algorithm is also proposed based on Graph Spectrum Theory, for detecting the critical nodes of interdependent power grid, which is the first step of protection. In this approach, the robustness of leftover power grid after cascading failure is evaluated in the metric of algebraic connectivity, instead of giant connected component, whose searching procedure takes much running time. The experimental results highlight the advantage of this approach in speed