Dynamic Analysis and Model Order Reduction of Virtual Synchronous Machine Based Microgrid
Bibliographic record
Abstract
The concept of virtual synchronous machine (VSM) was proposed to deal with the shortcomings of low inertia and damping of traditional control strategies for power electronic converters. But what if all distributed energy resources and controllable loads in a microgrid adopt the VSM control strategy, and will it present better performance than conventional droop control-based microgrid (DMG)? In this paper, the VSM-based microgrid (VSMG) is analyzed. The small-signal modeling of the VSMG is studied at first. Then static stability and dynamic characteristics of the VSMG are analyzed and compared with the DMG in both frequency-domain and time-domain. With the growing scale of microgrids, their modeling and simulation are becoming significant computational burdens. Inspired by the participation factor analysis of the VSMG and the concept of coherency in power systems, the VSMG small-signal model is equivalent to a modified third-order synchronous generator (SG) model in this paper. The equivalencing involves gray-box system identification and is realized by estimating equivalent electrical parameters alternately and iteratively. The equivalent SG (EqSG) model is compared with three representative model order reduction methods to verify its effectiveness. Simulation results confirm the accuracy of the EqSG model substituting detailed VSMG model in time-domain simulations.
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.000 |
| 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.000 | 0.000 |
| 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".