Anticipative Sorting Control of Modular Multilevel Converters
Bibliographic record
Abstract
This paper describes a new sorting and modulation strategy for Modular Multilevel Converters (MMC), which has the ability to control the switching frequency of the power devices. In order to control the capacitor voltages of individual submodule (SM), the new scheme uses anticipative inserting and bypassing of the MMC submodules based on the arm or load current levels. The MMC arm currents provide an accurate early indication about the capacitor voltage changes, and allow anticipative control action of voltage gradients. In this way, SMs with large voltages may be switched off in anticipation when subjected to fast voltage transients, avoiding protection trips. To this end, the arm or load current is quantized into several levels and the actual current level defines the number of switching events in real time. Next, the list of SMs is voltage-based sorted and several SMs are switched on or off in anticipation, before their voltage reaches the global limit. In this way, more SMs are switched when the arm current is large, i.e. when voltages change fast. This algorithm tends to group together the SM voltages when the voltage increases, while still maintaining an overall low switching frequency. The paper presents a detailed description of this current level anticipative sorting (CLAS) and analyses its performance with respect to the conventional sort-and-switch algorithm. Experimental results on a low power MMC setup with 24 SMs per phase validate the proposed CLAS algorithm.
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".