Computationally efficient data‐driven model predictive control for modular multilevel converters
Bibliographic record
Abstract
Abstract The application of model predictive control (MPC) for the control of modular multilevel converters (MMCs) is widely explored because it offers flexibility in integrating multiobjective control and delivers superior dynamic response. Nonetheless, the increase in computational complexity due to the rise in the number of submodules (SMs) is one of the major drawbacks of this technique. This paper presents a finite control set model predictive control (FCS‐MPC) that significantly reduces the computational complexity by employing sparse identification of non‐linear systems (SINDy) to obtain a simplified linear model for the MMC. The SINDy model reduces the complexity of performing the prediction step by integrating input terms into the dynamics of load current and circulating current. This simplifies the implementation compared to the conventional FCS‐MPC approaches by eliminating the need to evaluate the voltage dynamics. The computational burden is further reduced while maintaining voltage levels at the output by restricting the number of combinations for the inserted SMs to only instead of . A detailed comparison between the proposed technique and the existing strategies demonstrates that the proposed technique offers a more computationally efficient solution for implementing FCS‐MPC on MMCs, while improving the circulating current suppression due to more accurate predictions. Simulation and experimental results are presented to validate the performance of the proposed approach.
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.001 | 0.000 |
| 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".