Analysis and Enhancement of the Artificial Bus Method for Successful Low-Voltage Ride-Through and Resynchronization
Bibliographic record
Abstract
Designing an optimal approach for effectively and efficiently connecting voltage-source converters (VSCs) to very weak grids has been gaining increased attention in the research. Recently, the artificial bus control method has been proposed as a successful solution to improve the stability of grid-connected VSCs and inject the maximum nominal power during very weak grid conditions. However, like other solutions available in the literature, its performance under grid faults has not yet been thoroughly investigated. This paper is devoted to analyzing and improving the performance of the artificial bus method under faults. Analyses are used not only to show that the loss of synchronization threatens the successful low-voltage ride-through of the converter but also to find a solution to improve the converter performance with a minimum change in the control structure and parameters while satisfying required standards. When a fault is sustained, disconnection is allowed, but a smooth reconnection is desired. This paper derives the internal admittance of a VSC with the artificial bus method to show how this control approach improves resynchronization in both weak and strong grids. Using a detailed model, participation factor analyses are employed to explain the impact of the artificial bus method in different situations, and time-domain simulations are used to verify the analytical results.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".