Faulty Feeder Detection for Distribution Networks With IIDGs Based on Path Graph and Graph Fourier Transform

A novel method for the detection of faulty feeders for distribution networks with inverter-interfaced distributed generators (IIDGs) during single-phase-ground(SPG) fault has been introduced. This method leverages the frequency domain features of the graph Fourier transform (GFT) of the associated path graph. Firstly, the impact of IIDGs on the transient zero-sequence current (TZSC) at the fault point is analyzed through the sequence network connection. Secondly, the TZSC in the selected frequency bands are studied by using the GFT analysis of the path graph, revealing distinct differences between faulty and healthy feeders. The GFT frequency domain characteristics for the path graph are extracted by employing the Hausdorff distance (HD) and Pearson correlation coefficient (PCC). The combination of the HD and PCC indexes, utilizing the Laplace distribution density curve, enables the identification of the faulty feeder through a comparative analysis of the areas formed by the resulting density curve. The simulation results demonstrate the ease of implementation, reliability in faulty feeder detection, and adaptability and robustness for different IIDG capacities, fault locations, transition resistances, and fault initial conditions.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Power Delivery
Published
2025-03-24
DOI
https://doi.org/10.1109/tpwrd.2025.3554362
Primary Topic
Smart Grid Security and Resilience
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Faulty Feeder Detection for Distribution Networks With IIDGs Based on Path Graph and Graph Fourier Transform

Shilin Gao, Feipeng Lü, C. D. Qian, Sichen Lu et al.
IEEE Transactions on Power Delivery
Smart Grid Security and Resilience
article

Faulty Feeder Detection for Distribution Networks With IIDGs Based on Path Graph and Graph Fourier Transform

Shilin Gao, Feipeng Lü, C. D. Qian, Sichen Lu, Yuwen Qin, Bang‐Pin Hou, Shaoxiong Wang, Y. Zhu
article en

Abstract

A novel method for the detection of faulty feeders for distribution networks with inverter-interfaced distributed generators (IIDGs) during single-phase-ground(SPG) fault has been introduced. This method leverages the frequency domain features of the graph Fourier transform (GFT) of the associated path graph. Firstly, the impact of IIDGs on the transient zero-sequence current (TZSC) at the fault point is analyzed through the sequence network connection. Secondly, the TZSC in the selected frequency bands are studied by using the GFT analysis of the path graph, revealing distinct differences between faulty and healthy feeders. The GFT frequency domain characteristics for the path graph are extracted by employing the Hausdorff distance (HD) and Pearson correlation coefficient (PCC). The combination of the HD and PCC indexes, utilizing the Laplace distribution density curve, enables the identification of the faulty feeder through a comparative analysis of the areas formed by the resulting density curve. The simulation results demonstrate the ease of implementation, reliability in faulty feeder detection, and adaptability and robustness for different IIDG capacities, fault locations, transition resistances, and fault initial conditions.

IEEE Transactions on Power DeliveryVol. 40(3)
University of Alberta (CA), Sichuan University (CN), Shanghai Electric (China) (CN), Southwest Jiaotong University (CN)
Openalex Percentile: Top 94%
Smart Grid Security and Resilience
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.