Design of Energy Recovery Control for General Virtual Synchronous Machines Based on Various Forms of Energy Storage
Bibliographic record
Abstract
The reduced inertia in the power system due to renewable energy integration introduces operation challenges in frequency stability and control. The current options for virtual inertia and frequency support are limited by the energy resources and the power electronic interface. Considering the demand on response speed and energy capacity, a general virtual synchronous machine (VSM) control based on various forms of energy storage systems (ESS) is proposed. The steady-state energy variation of energy storage is found to be proportional to the virtual damping or governor gain, while inversely proportional to the integral gain of system frequency control. It is found that the size of energy storage can be at the second time scale (for example, 6.8 p.u.·s) for VSM implementation, which is significantly smaller than the conventional hour-scale energy storage in the power system. Based on energy dynamic analysis, stability requirement, and bandwidth separation rules, an energy recovery control is designed to maintain constant state of charge (for example, 50%) while avoiding conflicts with frequency regulation. The time scale of the designed energy recovery control loop (for example, hundreds of seconds) is longer than the secondary frequency control. The effectiveness of the proposed control is verified through comprehensive case studies.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 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".