Switching linear parameter‐varying control with improved local performance and optimized switching surfaces
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Summary This paper presents a novel approach to designing switching linear parameter‐varying (SLPV) controllers with improved local performance and an algorithm for optimizing switching surfaces to further improve the performance of the SLPV controllers. The design approach utilizes the weighted average of the local L 2 ‐gain bounds (representing the local performance) as the cost function to be minimized, whereas the maximum of the local L 2 ‐gain bounds (representing the worst‐case performance over all subsets) is bounded with a tuning parameter. The tuning parameter is useful for taking the trade‐off between the local performance and the worst‐case performance. An algorithm based on the particle swarm optimization is introduced to optimize the switching surfaces of an SLPV controller. The efficacy of the proposed SLPV controller design approach and switching surface optimization algorithm is demonstrated on both a numerical example and a physical example of air‐fuel ratio control of an automotive engine.
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.
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.001 |
| 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 it