A Novel Neural Network-Based Droop Control Strategy for Single-Phase Power Converters
Bibliographic record
Abstract
Managing parallel−connected single−phase distributed generators in low−voltage microgrids is challenging due to the volatility of renewable energy sources and fluctuating load demands. Traditional droop control struggles to maintain precise power sharing under dynamic conditions and varying line impedances, leading to inefficiency. This paper presents a novel adaptive droop control strategy integrating artificial neural networks and particle swarm optimization to enhance microgrid performance. Unlike prior methods that optimize artificial neural network parameters, the proposed approach uses particle swarm optimization offline to generate optimal dq−axis voltage references that compensate for line effects and load variations. These serve as training data for the artificial neural network, which adjusts voltage in real time based on line impedance and load variations without online optimization. This decoupling ensures computational efficiency and responsiveness, maintaining voltage and frequency stability during rapid load changes. Addressing dynamic load fluctuations and line impedance mismatches without inter−generator communication enhances reliability and reduces complexity. Simulations demonstrate that the proposed strategy maintains stability, achieves accurate power sharing with errors below 0.5%, and reduces total harmonic distortion, outperforming conventional droop control methods. These findings advance adaptive control in microgrids, supporting seamless renewable energy integration and enhancing the reliability and stability of distributed generation systems.
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.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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".