An Optimized Solution for Fault Detection and Location in Underground Cables Based on Traveling Waves
Bibliographic record
Abstract
Faults in the power system affect the reliability, safety, and stability. Power-distribution systems are familiar with the different faults that can damage the overall performance of the entire system, from which they need to be effectively cleared. Underground power systems are more complex and require extra accuracy in fault detection and location for optimum fault management. Slow processing and the unavailability of a protection zone for relay coordination are concerns in fault detection and location, as these reduce the performance of power-protection systems. In this regard, this article proposes an optimized solution for a fault detection and location framework for underground cables based on a discrete wavelet transform (DWT). The proposed model supports area detection, the identification of faulty sections, and fault location. To overcome the abovementioned facts, we optimize the relay coordination for the overcurrent and timing relays. The proposed protection zone has two sequential stages for the current and time at which it optimizes the current and time settings of the connected relays through Newton–Raphson analysis (NRA). Moreover, the traveling times for the DWT are modeled, which relate to the protection zone provided by the relay coordination, and the faulty line that is identified as the relay protection is not overlapped. The model was tested for 132 kV/11 kV and 16-node networks for underground cables, and the obtained results show that the proposed model can detect and locate the cable’s faults speedily, as it detects the fault in 0.01 s, and at the accurate location. MATLAB/Simulink (DigSILENT Toolbox) is used to establish the underground network for fault location and detection.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".