Multi-Agent Reinforcement Learning Control Strategy for a Neutral-Point Clamped Power Converter, Maintaining Reliable Wind Energy Conversion System
Bibliographic record
Abstract
This paper provides a comprehensive exploration of the cutting-edge wind energy power converter control method utilizing artificial intelligence. The aim is to evaluate the performance of the proposed reinforcement learning based approach for the most promising and practical wind energy conversion system (WECS) configuration, known as direct-drive permanent magnet synchronous generator (PMSG) WECS. The effort concentrates on both satisfying grid code requirements while reducing computation cost and sophistication. The full-scale back-to-back (BTB) neutral-point clamped (NPC) power converter is determined to be the case of control, employed in direct-drive PMSG-based WECS. Grid-side converter is controlled with high precision using proposed multi-agent reinforcement learning (MARL) algorithm, which necessitates no offline training, and system modeling, unlike machine learning and neural network-based techniques. Single-phase and double-phase voltage sag is considered to assess the functionality of the suggested MARL in unbalance scenarios. To empower the proposed strategy, meta-learning is employed within to optimize the discount factor (DF) value. Compared to fixed DF and conventional DF tuning methods, meta-learnt DF provide superior adaptability, and convergence rate. Comparative analysis and findings illustrate that the proposed method surpasses the counterparts and can be a reliable candidate for conventional and even most recently-studied control strategies.
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.001 | 0.001 |
| 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.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".