A New Fast Formulation of Model Predictive Control For CHB STATCOM
Bibliographic record
Abstract
Recently, the finite control set model predictive control (FCS-MPC) has obtained a lot of attention for power converter control due to its advantages of high dynamic performance and multi-objective capability. However, it poses a challenge for the current processors directly applying this control to the multilevel inverter in real-time application. Especially for CHB-STATCOM multilevel inverter, there are a huge number of switching combinations and redundancies due to its topology structure. Real-time searching for the optimal switching state among the extremely large candidate pool through exhaustive search algorithm is almost impossible especially when the inverter output voltage levels increases. To end this problem, this paper has presented a new fast FCS-MPC formulation scheme based multilevel CHB-STATCOM. Instead of resorting to existing heuristic optimization algorithms, the FCS-MPC is reformulated mathematically to a matrix problem that can be easily solved on-line. The proposed single step FCS-MPC formulation is validated through simulation based on a seven levels CHB-STATCOM. It has been shown that the proposed single step MPC has the advantages of fast current tracking, minimum CMVphase-shiftedand good voltage balancing capability. Compared with the existing FCS-MPC schemes, the computational burden of the proposed MPC formulation is largely reduced which makes it more suitable for multilevel CHB-STATCOM. Moreover, the proposed FCS-MPC formulation can be easily developed and applied to other multilevel topologies with a large number of voltage levels and redundancy.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| 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.002 |
| Insufficient payload (model declined to judge) | 0.004 | 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".