Optimization of Averaging Window Length and Alarming Hold Time in Volume Balance RTTM Leak Detection to Minimize False Alarms and Spill Volume
Notice bibliographique
Résumé
Reliability and sensitivity are two main performance metrics of leak detection systems as defined by API 1130 [1]. Proper thresholding scheme is one of the primary factors in having a sensitive and reliable leak detection system with timely detection. In RTTM leak detection, if not dealt with properly, severe pipeline pressure transients can degrade the performance of the leak detection system. One of the common basic methods of reducing the effect of pressure transients is using moving averaging windows; having looser thresholds on the shorter averaging windows, while maintaining tighter thresholds on the longer ones. The thresholds are typically set to meet the API 1149 [2] curve for the pipeline. While the post-processing of filtered data and alarm assessment has been explored via different methods such as sequential probability ratio test, to the authors’ knowledge, there is currently no systematic way of selecting the averaging windows to minimize false alarms prior to the post-processing of the average-filtered data. Moreover, to be able to maintain tight thresholds, especially in shorter averaging windows, one of the common methods is to apply dynamic thresholds, i.e. temporarily expanding thresholds when transients occur. While effective in some scenarios, the main disadvantage of this method is that the imbalance caused by a transient may not clear until the entire averaging window period is passed. This causes either extended periods of degraded performance, or more false positives. This paper utilizes an alarming hold time (also referred to as alarm persistence [3]) to remedy this problem where the averaging window length is reduced while maintaining detection time and sensitivity. To find the optimal set of threshold values, hold times, and averaging window lengths, a Particle Swarm Optimization (PSO) is performed. The ‘fitness function’ of the optimization algorithm is designed to minimize total spill volume for leak scenarios and have minimum false alarms for no-leak scenarios. The former is achieved via setting the objective function to the spill volume and the latter is enforced via applying constraints to the optimization algorithm. For no-leak scenarios, the historical operational data of a pipeline system is used. For leak scenarios, the historical data is modified by introducing a bias in the inlet volume of the section to simulate a leak. The result of the PSO provides a set of alarming parameters, threshold value, averaging window length, alarm hold time, and clearing threshold that provide the minimum false alarm rate and spill volume for different detectability ranges. The optimization method proposed in this paper can be applied to any mass or volume balance-based leak detection system that utilizes moving averaging windows. However, the leak detection parameters found with this method depend on the pipeline system.
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 distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,001 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
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 tête enseignante, 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 ».