A New MPC Formulation Based on Suboptimal Voltage Vectors for Multilevel Inverters
Bibliographic record
Abstract
Different new model predictive control (MPC) formulations have been recently proposed to reduce the real-time computation load, which makes the MPC algorithm promising for multilevel power converters. Unlike the conventional MPC formulation, which searches for the optimal switching state at each sampling time, the existing computationally efficient MPC formulations are to search for the optimal output voltage in the first stage. In the second stage, only the switching state redundancy under this optimal output voltage established in the first stage will be employed to achieve multiobjective. These computationally efficient MPC formulations based on searching an optimal voltage vector are usually validated on the power converter topologies with abundant switching redundancy or without floating capacitors. However, for the emerging topologies with less switching redundancy and floating capacitors, such as the five-level (5L) T-type nested neutral point clamped (T-NNPC) converters topology, the existing computationally efficient formulations based on optimal output voltage vector can lead to potential capacitor control failure due to the sacrificed multiobjective control performance. To address this issue, this article presents a novel MPC formulation based on suboptimal output voltage vectors considering both the system’s multiobjective control performance and computation burden reduction. With the determined suboptimal voltage vectors, a small group of the switching state candidate can be established to improve the system’s multiobjective control performance and efficiency. The proposed MPC formulation is finally validated on a 5L T-NNPC 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.001 |
| 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".