A Fault Section Location Method for Distribution Networks Based on Divide-and-Conquer

被引:0
|
作者
Zhao, Qiao [1 ]
Wang, Zengping [1 ]
Li, Guomin [2 ]
Liu, Xuanjun [1 ]
Wang, Yuxuan [1 ]
机构
[1] North China Elect Power Univ, State Key Lab Alternate Elect Power Syst Renewable, Beijing 102206, Peoples R China
[2] State Grid Beijing Elect Power Co, Beijing 100031, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2023年 / 13卷 / 10期
关键词
distribution network; fault location; divide-and-conquer; road vector;
D O I
10.3390/app13105974
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
In this paper, a fault location method based on divide-and-conquer (DAC) is proposed to solve the inadequacy problem that arises when using the traditional fault section location method based on the optimization model of logic operation. The problem is that it is difficult to balance speed and accuracy after the scale of the distribution network is expanded. First, the causal link between fault information and the faulty device was described using the road vector, the equivalent transformation of the logical operations in the traditional model was implemented with the properties of the road vector, and the numerical computational model of the fault location was constructed. Based on this, the optimization-seeking variable "approximation gain" was introduced to prove that the proposed model conforms to the recursive structure of DAC, and the method of applying DAC to locate faults is proposed. The method applies the "Divide-Conquer-Combine" recursive mode to locate faults, and each level of recursion contains only linear-time "approximation gain" operations and constant-time decomposition and combination operations. The efficiency analysis and simulation results show that the proposed method has linear-time complexity and can accurately locate faults in milliseconds, providing a reference for solving the fault location problem in large distribution networks.
引用
收藏
页数:39
相关论文
共 50 条
  • [1] PRUNING DIVIDE-AND-CONQUER NETWORKS
    ROMANIUK, SG
    [J]. NETWORK-COMPUTATION IN NEURAL SYSTEMS, 1993, 4 (04) : 481 - 494
  • [2] DIVIDE-AND-CONQUER NEURAL NETWORKS
    ROMANIUK, SG
    HALL, LO
    [J]. NEURAL NETWORKS, 1993, 6 (08) : 1105 - 1116
  • [3] Divide-and-conquer Tournament on Social Networks
    Jiasheng Wang
    Yichao Zhang
    Jihong Guan
    Shuigeng Zhou
    [J]. Scientific Reports, 7
  • [4] Divide-and-conquer Tournament on Social Networks
    Wang, Jiasheng
    Zhang, Yichao
    Guan, Jihong
    Zhou, Shuigeng
    [J]. SCIENTIFIC REPORTS, 2017, 7
  • [5] A DIVIDE-AND-CONQUER METHOD FOR POLYNOMIAL ZEROS
    FREEMAN, TL
    BRANKIN, RW
    [J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1990, 30 (01) : 71 - 79
  • [6] Migration of CUDA Program Based on a Divide-and-Conquer Method
    Li, Nan
    Pang, Jianmin
    Shan, Zheng
    [J]. 2014 IEEE 17TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE), 2014, : 1685 - 1691
  • [7] A divide-and-conquer method for the Takagi factorization
    Xu, Wei
    Qiao, Sanzheng
    [J]. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2008, 30 (01) : 142 - 153
  • [8] Multi - Warehouse Location of Logistics Based on Dijkstra and Divide-and-Conquer Algorithm
    Hou, Donggu
    Zhang, Wei
    [J]. 2017 10TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL. 1, 2017, : 442 - 447
  • [9] Divide-and-conquer learning and modular perceptron networks
    Fu, HC
    Lee, YP
    Chiang, CC
    Pao, HT
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 2001, 12 (02): : 250 - 263
  • [10] A divide-and-conquer algorithm for distributed optimization on networks
    Emirov, Nazar
    Song, Guohui
    Sun, Qiyu
    [J]. APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2024, 70