Protection of Multi-Terminal HVDC Grids: A Comprehensive Review
Bibliographic record
Abstract
Multi-terminal HVDC grids facilitate the integration of various renewable resources from distant locations; in addition, they enhance the reliability and stability of the grid. Protection is one of the major obstacles in realizing reliable and secure multi-terminal HVDC grids. This paper presents a comprehensive review of the existing protection schemes for multi-terminal HVDC grids. First, DC fault current stages are demonstrated; in addition, fault analysis studies and the existing fault current calculation methods are reviewed. Then, HVDC grid protection requirements including multi-vendor interoperability conditions are extensively discussed. Furthermore, primary protection algorithms are classified into single- and double-ended schemes, and a detailed comparison between each category is presented such that the distinctive algorithms from each group are highlighted. Moreover, the recent DC reclosing schemes are reviewed highlighting their role in enhancing grid stability and ensuring supply continuity. Finally, available standards for HVDC protection systems alongside their design considerations and procedures are thoroughly outlined. This paper focuses on the recently proposed methods to design reliable protection schemes for multi-terminal HVDC grids and highlights the main advantages and disadvantages associated with them; thus, it offers a beneficial guide for researchers in the HVDC protection field.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| 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.004 | 0.002 |
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".