Virtual Impedances Optimization to Enhance Microgrid Small-Signal Stability and Reactive Power Sharing
Bibliographic record
Abstract
Microgrid instability poses critical issues to the power delivery following a load change or a tripping event. In island operating mode lack of grid intensifies this challenge. This study aims at controlling several converter-based distributed generations (DG) sharing the power in an island microgrid (MG). At first, the microgrid model including virtual impedances and phase-locked loop (PLL) is introduced. Afterwards a novel small-signal stability analysis for island microgrids is proposed. Finally, an optimization algorithm based on particle swarm optimization (PSO) is proposed to design the virtual impedances. The optimization algorithm analyzes all possible operating points and aims at maximizing the microgrid stability index while keeping the reactive power mismatches at minimum level. The fractional objective function facilitates reaching at these objectives simultaneously. The proposed optimization algorithm is implemented in two separate case-studies and the corresponding virtual impedances are drawn in any microgrid. On the other hand, The voltage drops are checked as a condition in the optimization process. The results drawn from two separate case-studies verify that the proposed algorithm effectively maximizes the microgrid stability index and minimizes the reactive power mismatches.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 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.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".