High-Speed Falling Conductor Protection in Distribution Systems using Synchrophasor Data
Bibliographic record
Abstract
An energized overhead power line might break and fall to the ground or other surrounding objects from reasons such as severe weather conditions, conductor aging, natural disasters, hardware failures, and/or pole knock-over. When the falling conductor touches the earth or other grounded objects, it might cause a high-impedance (Hi-Z) fault that cannot be detected reliably by conventional overcurrent protection schemes. While current-based algorithms using negative-sequence components (e.g., the ratio of |I2/I1|) can detect most broken-conductor faults in transmission systems, their efficiency is compromised in distribution systems. The performance of falling-conductor protection (FCP) schemes in distribution systems depends on several factors such as feeder topology, penetration level of distributed energy resources (DERs), broken-phase location, single-phase switching, and/or protection philosophy (e.g., type of protective devices).This paper proposes a reliable, synchrophasor-based algorithm to detect and de-energize broken overhead lines in distribution systems using PMU data inside the substation and along the feeders. The effectiveness of the proposed FCP algorithm has been validated with Hardware-in-the-Loop (HIL) testing of realistic distribution feeders using a Real-Time Digital Simulator (RTDS). A comprehensive set of cases were tested including internal/external broken conductors, internal/external faults, various DER penetration, different load levels, and transient/switching incidents. The test results show that the proposed algorithm can detect and trip broken conductors reliably. Therefore, the proposed High-Speed Falling Conductor Protection (HFCP) scheme de-energizes the affected circuit prior to the conductor hitting the ground, eliminating the risk of an arcing ground fault and energized circuits on the ground.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".