H<sub>∞</sub>model predictive control for constrained discrete‐time piecewise affine systems
Bibliographic record
Abstract
Summary This paper investigates stability analysis for piecewise affine (PWA) systems and specifically contributes a new robust model predictive control strategy for PWA systems in the presence of constraints on the states and inputs and withl2or norm‐bounded disturbances. The proposed controller is based on piecewise quadratic Lyapunov functions. The problem of minimization of the cost function for model predictive control design is changed to minimization of the worst case of the cost function. Then, this objective is reduced to minimization of a supremum of the cost function subject to a terminal inequality by considering the inducedl2‐norm. Finally, the predictive controller design problem is turned into a linear matrix inequality feasibility exercise with constraints on the input signal and state variables. It is shown that the closed‐loop system is asymptotically stable with guaranteed robust performance. The validity of the proposed method is verified through 3 well‐known examples of PWA systems. Simulation results are provided to show good convergence properties along with capability of the proposed controller to reject disturbances.
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.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.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".