A Nonlinear Controller Based on a Discrete Energy Function for an AC/DC Boost PFC Converter
Bibliographic record
Abstract
AC/DC converter systems generally have two stages: an input power factor correction (PFC) boost ac/dc stage that converts input ac voltage to an intermediate dc voltage while reducing the input current harmonics injected to the grid, followed by a dc/dc converter that steps up or down the intermediate dc-bus voltage as required by the output load and provides high-frequency galvanic isolation. Since a low-frequency ripple (second harmonic of the input ac line frequency) exists in the output voltage of the PFC ac/dc boost converter due to the power ripple, the voltage loop in the conventional control system must have a very low bandwidth in order to avoid distortions in the input current waveform. This results in the conventional PFC controller having a slow dynamic response against load variations with adverse overshoots and undershoots. This paper presents a new control approach that is based on a novel discrete energy function minimization control law that allows the front-end ac/dc boost PFC converter to operate with faster dynamic response than the conventional controllers and simultaneously maintain near unity input power factor. Experimental results from a 3-kW ac/dc converter built for charging traction battery of a pure electric vehicle are presented in this paper to validate the proposed control method and its superiority over conventional controllers.
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.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.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".