基于Dijkstra算法的电网故障行波定位方法

为避免电网故障行波定位方法中环网的复杂解网运算,提出了一种基于Dijkstra算法的电网故障行波定位新方法。该方法在电网中某条输电线路故障后,在所有变电站检测记录初始行波到达时间。然后,利用Dijkstra算法计算最短路径,建立最短路径距离矩阵,并利用最短路径矩阵和初始行波到达时间计算故障距离,建立故障距离矩阵。最后,对故障距离矩阵中的元素进行有效性识别,并综合所有有效故障距离得到精确的故障点位置。仿真结果表明该方法无需复杂环网的解网运算,可有效提高网络定位的可靠性与准确度。

Method of Traveling Wave Fault Location Based on Dijkstra Algorithm in Power Grid

In order to avoid the complex network solution operation of the ring network in the method of traveling wave fault location, a new method of traveling wave fault location based on Dijkstra algorithm is proposed. After a certain transmission line fault in the power grid, the initial traveling wave arrival time is recorded at all substations. Dijkstra algorithm is used to calculate the shortest path, shortest path distance matrix is established, and the shortest path matrix and the initial traveling time are utilized to calculate the fault distance, then the fault distance matrix is established. Finally, the validity of the elements in the fault distance matrix is identified and the exact fault location is obtained by combining all the effective fault distances. The proposed method is proved to improve the reliability and accuracy of network location without complex network operation by the simulation results.