An Improved Mixed AC/DC Power Flow Algorithm in Hybrid AC/DC Grids with MT-HVDC Systems
Bibliographic record
Abstract
One of the major challenges on large-scale Multi-Terminal High Voltage Direct Current (MT-HVDC) systems is the steady-state interaction of the hybrid AC/DC grids to achieve an accurate Power Flow (PF) solution. In PF control of MT-HVDC systems, different operational constraints, such as the voltage range, voltage operating region, Total Transfer Capability (TTC), transmission reliability margin, converter station power rating, etc. should be considered. Moreover, due to the nonlinear behavior of MT-HVDC systems, any changes (contingencies and/or faults) in the operating conditions lead to a significant change in the stability margin of the entire or several areas of the hybrid AC/DC grids. As a result, the system should continue operating within the acceptable limits and deliver power to the non-faulted sections. In order to analyze the steady-state interaction of the large-scale MT-HVDC systems, an improved mixed AC/DC PF algorithm for hybrid AC/DC grids with MT-HVDC systems considering the operational constraints is developed in this paper. To demonstrate the performance of the mixed AC/DC PF algorithm, a five-bus AC grid with a three-bus MT-HVDC system and the modified IEEE 39-bus test system with two four-bus MT-HVDC systems (in two different areas) are simulated in MATLAB software and different cases are investigated. The obtained results show the accuracy, robustness, and effectiveness of the improved mixed AC/DC PF algorithm for operation and planning studies of the hybrid A/DC grids.
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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.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".