MTDC Grids: A Metaheuristic Solution for Nonlinear Control
Bibliographic record
Abstract
This scientific paper aims to increase the voltage source converter (VSC) control efficiency in a multi-terminal high voltage direct current (MTDC) network during dynamic operations. In the proposed study, the Mayfly algorithm (MA) is used to modify the control parameters of VSC stations. Traditional strategies that modify VSC control settings using approximate linear models fail to produce optimal results because VSCs are nonlinear characteristics of the MTDC system. Particle swarm optimization (PSO) may produce optimal outcomes, but it is prone to becoming stuck in a local optimum. To modify the proportional-integral (P.I.) control parameters of the VSC station, the Mayfly algorithm, a modified form of PSO, is used. The suggested algorithm’s objective function simultaneously optimizes both the outer and inner control layers. A four-terminal MTDC test system is developed in PSCAD/EMTDC to assess the benefits of the proposed algorithm. For VSCs, a comparison of classical, PSO, and proposed MA-based tuned parameters is carried out. The integral of time multiplied by absolute error (ITAE) criterion is used to compare the performance of classical, PSO, and a proposed algorithm for VSC controller parameters/gains. With an ITAE value of 6.8521 × 10−6, the MA-based proposed algorithm computes the optimal values and outperforms its predecessor to adjust the VSCs controller gains. For (i) wind farm power variation, (ii) AC grid load demand variation, and (iii) ultimate permanent VSC disconnection, steady-state and dynamic performances are evaluated. According to the results, the proposed algorithm based MTDC system performs well during transients.
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.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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.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".