基于电气耦合路径分析的割支路和割节点辨识算法

Algorithm for Identification of Cut Edges and Cut Vertices Based on Analysis of Electric Interaction Paths

割支路和割节点的断开会导致网络产生分离子图,这种特殊的支路和节点往往代表了网络中的薄弱环节或某种优化的分割降维策略,因而在潮流、电压稳定、继电保护整定等电力系统网络计算领域具有重要的意义。以往的割支路和割节点辨识算法大多从几何拓扑的角度,将其转化为局部支路开断后的图的连通性判断。基于阻抗矩阵元素网络等值后的节点电气耦合路径分析,提出一种识别割节点和割支路的物理拓扑判断算法。该算法利用节点阻抗矩阵反映的物理特性,引入了2个简单的数学等式判据。相对传统的图论拓扑分析算法,文中提出的算法简单、直观,具有明确的物理意义,对于理解和研究电力系统网络拓扑结构具有一定借鉴意义。

The breaking of cut edges and cut vertices will lead disconnected sub-graphs in a connected power network. These edges and vertices may stand for the weak places or some optimization partition and dimensionality reduction strategies, which have vital significance for such network analysis as power flow, voltage stability and relay coordination, etc. Traditional identification of cut edges and cut vertices is always expressed into the observing the change of geometrical topology connectivity while removing some vertices or edges. Based on the analysis of equivalence network and electric interaction path, this paper presents a new physical topology analysis algorithm to identify cut edges and vertices, which introduces two simple equality criterions derived from the reduced Z-matrix elements. This novel algorithm adequately utilizes the physical topological properties concealed in the Z-matrix of power system. The improvement over existing graph-theoretical approaches is that this new algorithm has more direct-viewing, simplicity, specific and important physical significance, which can borrow ideas to insight and research the topology configuration in power network.