Reinforcement Learning-Based Flexible Control in MTDC System for Offshore Wind Farm Integration
Bibliographic record
Abstract
Converter power sharing and DC voltage regulation are critical control objectives in voltage source converter-based multi-terminal high-voltage DC (VSC-MTDC) systems, particularly when incorporating massive offshore wind farms (OWFs). However, the inherent variability and intermittency of OWFs pose significant challenges to conventional model-based and optimization-based control methods, which often rely on accurate system modeling and extensive computation. Moreover, traditional heuristic optimization approaches are prone to local optima, limiting their ability to handle rapidly fluctuating wind power conditions effectively. Reinforcement Learning (RL), with its capability to adaptively optimize control policies through continuous interaction with dynamic environments, presents a promising alternative. This paper proposes a novel RL-based control strategy for DC voltage regulation and proportional power sharing, leveraging an adaptive droop control mechanism. The Proximal Policy Optimization (PPO) algorithm is employed to dynamically adjust local droop coefficients, benefiting from its robustness in continuous action spaces and its ability to mitigate the effects of OWF power fluctuations. To enhance optimization efficiency and accelerate convergence, a combined MTDC system pre-evaluation and PPO initialization method is introduced. The proposed RL-based control strategy is validated through dynamic simulations of a five-terminal MTDC grid in MATLAB/Simulink, demonstrating superior performance in handling various disturbances and contingencies associated with OWF integration.
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.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.001 | 0.001 |
| Research integrity | 0.000 | 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".