Model Predictive Current Control of a Seven-Level Inverter With Reduced Computational Burden
Bibliographic record
Abstract
Multilevel topologies gained considerable attention in medium-voltage high-power applications due to their advantages over classic two-level inverters, such as lower loss, higher power quality, and eliminating interface transformers. Moreover, vast research has been done in order to improve the control of the power converters to achieve more efficient and simple controllers. Model predictive control (MPC) is one of the control techniques that has been widely used in power electronics recently due to its advantages, such as fast dynamic response, no need for PI regulators and pulsewidth modulation blocks, and capability of nonlinearity inclusion. On the other hand, the high number of calculations especially for higher level topologies is the disadvantage of this approach. This article presents a new finite control set MPC (FCS-MPC) approach for a seven-level topology. This approach reduces the number of calculations significantly compared to conventional FCS-MPC. Applying the computational efficient FCS-MPC to control the output current and flying capacitors voltages' of the seven-level topology reduces the number of calculations from 12 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> to 36, whereas the execution time is reduced six times. Moreover, simulation and experimental results have been shown to demonstrate the performance and feasibility of the developed control method applied to a seven-level topology.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".