Reactive Power Matching Through Virtual Variable Impedance for Parallel Virtual Synchronous Generator Control Scheme
Bibliographic record
Abstract
Virtual synchronous generator (VSG) control has received much attention for interfacing renewable energy sources, thus creating a low-inertia microgrid. However, proportional reactive power-sharing and voltage accuracy is still a serious concern due to unequal feeder impedances between VSG controlled DGs and the point of power coupling. This article proposes a virtual variable impedance (VVI) based VSG control technique to mitigate the reactive power sharing error by improving the line-impedance ratio among multiple DGs. The proposed VVI control is designed to estimate the value of variable virtual impedance by establishing an exponential relationship with the inverter's output reactive power. The reactive power communication method is also introduced to identify the proportion of reactive power share being injected by the DG. The effectiveness of the proposed VVI control is further analyzed through the small-signal stability analysis and Lyapunov stability analysis of a multi-VSG system. Finally, the proposed controller is tested in MATLAB/Simulink software and on an experimental setup that includes inverter hardware and dSPACE simulator. Results have shown that the proposed method allow only 0.026% of reactive power sharing error as compared to the conventional droop control and state-of-the-art virtual capacitor-based droop control that experiences 2.86% and 2.8% error, respectively.
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.000 |
| Research integrity | 0.000 | 0.000 |
| 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".