A Control Technique Based on Distributed Virtual Inertia for High Penetration of Renewable Energies Under Weak Grid Conditions
Bibliographic record
Abstract
Distributed virtual inertia is an approach of providing synthetic inertia in small-scale modern grids dominated by converter-based generators. In this method, the inertial response of synchronous machines is emulated by the energy stored in the dc-link capacitors of grid-tied converters. Nonetheless, it results in instability of the interfaced converter in weak grids. To overcome this problem and get the most benefit out of the acceptable dc-link capacitor voltage deviations, a new compensation technique is proposed in this article. The grid-interactive converter in the presented framework is controlled in the current control mode, compositing of two conventional inner and outer control loops, distributed virtual inertia controller, and a novel compensator. The detailed small-signal representation of the whole control scheme in state-space form is derived. Then, it is revealed that the coupling between d- and q-axis controllers introduced by the distributed virtual inertia gain and its differential operator gives rise to the system instability in weak grids, which can be eliminated through the ancillary compensator. The time-domain simulation model is built to confirm the efficacy of the proposed control technique. The results depict that the ancillary active power provided by the proposed approach during frequency disturbance is 14% of the converter power rating of 20 kW, which yields the improvement of frequency rate of change by 18.82%.
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.000 | 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".