Development of a Data-Driven Approach for Permanent Fault Location in Underground Power Cables
Notice bibliographique
Résumé
Industrial plants frequently encounter various contingencies in their electricity systems, which can be attributed to the loss or failure of specific components such as lines, cables, or individual equipment. In response to these faults, protective devices isolate the affected areas from the network. However, identifying the exact location of the fault can be a time-consuming process. Operators rely on their expertise and available tools, but when dealing with buried underground cables or hard-to-reach equipment, it can take several hours to trace the fault's origin. To address this challenge, this research project aims to develop an innovative solution capable of detecting fault locations based on field measurement data. The primary focus is on creating advanced algorithms that can effectively identify faults in both buried high-voltage (HV) feeder cables used in potash mines and medium-voltage (MV) cables in underground mining operations. The project's ultimate goal is to demonstrate the feasibility of a practical device capable of instantly reporting, displaying, or transmitting fault location information in response to contingencies. The main beneficiaries of this project are expected to be prominent mining companies in Saskatchewan and Canada. They can integrate these cutting-edge innovations into their industrial plants, enhancing their operational efficiency and minimizing downtime. Efforts to achieve efficient and cost-effective fault localization in electrical cables have led to increased interest in pinpointing cable faults through local measurements. This approach strikes a balance between precision and hardware costs, making it attractive for the industry. This research introduces a novel method for online fault localization in medium-voltage (MV) cables, utilizing measurements of local sheath current. The innovative technique leverages Artificial Neural Networks (ANNs), a subset of artificial intelligence (AI), to enhance fault detection and location accuracy. It builds upon the principles of reflectometry, analyzing how electrical signals propagate along the cable and reflect when encountering faults. Medium-voltage cables present unique challenges, but this method's cost-efficient approach uses a single sensor at the sheath grounding joint to measure the sum of three-phase local sheath currents. This method's strength lies in its ability to estimate wave travel delay, a crucial factor in determining fault location, especially when wave arrivals are obscured or attenuated. In the realm of high-voltage (HV) cable systems, swift and accurate fault localization is crucial for restoring power promptly. Achieving high accuracy in fault localization while managing measurement costs is a delicate balance. This thesis proposes an efficient framework for HV cable fault localization, analyzing sheath currents in modal mode and comparing them to traditional core conductor measurements. The discovery that collective sheath current across phases exhibits similar characteristics opens the door to using fewer, lower-rated sensors as a cost-effective alternative. However, working with sheath current measurements presents challenges, particularly in wavefront recognition within the sheath. To address this, the thesis introduces a Convolutional Neural Network (CNN) tailored for precise sheath current-based fault localization. These approaches excel in achieving high localization accuracy while mitigating measurement costs and maintaining consistent performance across various operational scenarios, even with limited training data. Empirical validation through a comprehensive case study on the PSCAD/EMTDC platform highlights the effectiveness and feasibility of these novel frameworks, shedding light on its key insights and implications.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,002 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,000 |
| Méta-épidémiologie (sens large) | 0,001 | 0,001 |
| Bibliométrie | 0,001 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,001 | 0,001 |
| Science ouverte | 0,002 | 0,001 |
| Intégrité de la recherche | 0,001 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,002 | 0,001 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».