A General Control Method for Multilevel Converters Based on Knapsack Problem
Bibliographic record
Abstract
Switching sequences of multilevel inverters have to be properly chosen based on the desired control criteria such as dc-link voltage regulation, common mode voltage reduction, and other application dependent criteria. Control of a converter to satisfy a desired criterion is challenging, especially in high voltage level converters. This paper proposes a simple control method for multilevel inverters with high modularity such as flying capacitor multilevel inverters, H-bridge multilevel inverters, and modular multilevel inverters. It is shown that the method considerably simplifies generation of the switching sequences and fulfills the desired criteria with a reasonable computational cost. The proposed method is computationally efficient in the sense that its implementation for high voltage level inverters requires the same effort as required for a multilevel inverter with a low number of cells. Other prominent advantages of the proposed control method, compared to earlier methods, include its applicability for multiphase multilevel converters and converters with asymmetrical structure and/or unevenly distributed dc voltages, independence from the level number and structure of the converter, and not requiring a lookup table. These advantages make the proposed scheme well suited for high cell-number converters, mainly utilized in FACTS, HVDC, and power quality applications. Simulation and experimental results are presented which verify the performance of the proposed method.
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".