Dynamic Transitional Droops for Seamless Line-Switching in Islanded Microgrids
Bibliographic record
Abstract
Line-switching operations introduce several concerns to microgrid operators since they trigger reliability and power quality issues in addition to increasing the wear and tear cost of switching devices. This paper proposes a novel methodology for achieving seamless line-switching in low-inertia islanded microgrids. The proposed methodology aims at mitigating the detrimental line-switching impacts by minimizing the power flow in the switched lines at the moments of executing the switching operations. The minimization of the power flow is realized by optimizing the droop control parameters of the DGs during the transition from one network topology to another. Besides, during executing a series of line-switching operations, the sequence of switching is also optimized to minimize the total switched power. While optimizing the line-switching execution sequence, the transitional droops are optimized for each line-switching operation within that sequence. A dynamic mixed-integer nonlinear programming problem is formulated to find both the optimized dynamic transitional droops and line-switching sequence simultaneously. Simulation results demonstrate the effectiveness of the proposed seamless line-switching methodology where the switched power can be reduced by more than 80% for a single line-switching operation and 54% considering a series of four switch exchanges in addition to achieving several instances of zero-current switching. As a result, a significant decrease in the peak of voltage transients has been recorded for some cases.
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.001 | 0.001 |
| Research integrity | 0.000 | 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".