A Novel High-Performance Predictive Control Formulation for Multilevel Inverters
Bibliographic record
Abstract
This article proposes a novel high-performance predictive control with long prediction horizons to improve the control performance of the multilevel inverters. The finite control set model predictive control (FCS-MPC) has obtained a lot of attention for power converters due to its advantages of high dynamic performance, multi objective capability, no need for PI regulators and PWM modulators. However, the MPC method requires a high number of computations especially for higher-level power converter topologies due to the existence of a huge amount of switching combinations and redundancies. Real-time searching for the optimal switching state among a large candidate pool at a high sampling rate is sometimes impossible with the standard commercial processors. This limitation also prevents real-time implementation of an MPC for multilevel converters with step prediction more than one. To solve the aforementioned issues, this paper presents a novel high-performance FCS-MPC scheme. The proposed FCS-MPC is reformulated mathematically MPC approach to an l2norm optimization problem, which can be solved on-line through matrix theory. Compared with the existing MPC optimization algorithms, the proposed MPC formulation has the advantage of a substantial reduction in computational burden, no need for the weighting factors or cost functions, and thus can operate at long horizon prediction length. The proposed method is verified experimentally on a seven-level CHB inverter prototype with a three-step prediction length to demonstrate the ability and performance of the proposed method for multilevel inverters.
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.000 |
| Meta-epidemiology (narrow) | 0.001 | 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.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".