An extended impedance‐based fault location algorithm in power distribution system with distributed generation using synchrophasors
Bibliographic record
Abstract
Abstract Accurately locating power distribution faults reduces the total outage duration and provides better system reliability. Fault location using the traditional impedance‐based method may be very challenging in an active distribution system. However, taking into consideration the ease of implementation and cost effectiveness, a novel impedance‐based method is proposed to locate the fault by using the highly accurate time‐synchronized voltage and current phasors obtained from distribution phasor measurement units. The synchrophasor measurements obtained from the substation and various feeder segments are used in a two‐step algorithm based on the apparent impedance calculation to locate the exact source of the event. The algorithm uses phasor estimates to first identify the faulted feeder sub‐region and later uses measurements from a remote end device to eliminate pseudo‐faulted points to obtain the actual fault location. The effectiveness of the proposed method is realized using IEEE 34 bus system. Based on different fault types simulated at various parts of the system, the algorithm accurately estimates fault location in the range of ±1% of the line length. The proposed method is effective in locating faults for any type of network and topologies, with as many or as few (minimum 2) phasor measurement units in the system.
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.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".