A Robust Damping Control for Virtual Synchronous Generators Based on Energy Reshaping
Bibliographic record
Abstract
Virtual synchronous generators (VSGs) have been proved to be important means to provide the inertia for future power systems. However, it suffers the issue of active power oscillation under various disturbances. In this paper, a robust damping control is proposed to mitigate the active power oscillation by reshaping the oscillation energy of VSGs. The paper first represents the power-angle dynamics of VSGs as an equivalent circuit and thus enables the understanding of oscillations from the circuit energy. It is revealed that the active power oscillation can be comprehended as an LC resonance and the damping provided by the traditional VSG is commonly insufficient. To tackle this issue, a robust damping method is proposed using interconnection and damping assignment passivity-based control (IDA-PBC). The theory of IDA-PBC is established based on the concept of energy reshaping, which guarantees the state tracking via its intrinsic energy dissipation characteristics. The IDA-PBC, when applied to VSGs, is a combination of the disturbance compensation via feedforward channels and the deviations regulation through feedback paths. Noticeably, the disturbance compensation is achieved with the support of an extended state observer (ESO), which can accurately estimate the lumped disturbance including the grid frequency variation and the model uncertainties. A guideline on the parameter selection is also provided through Bode-plot analysis. Finally, the effectiveness and merits of the proposed method is verified by hardware in the loop-based experiments with the comparison to the state of art work.
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.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".