Robust and Adaptive Model Predictive Control of Non-linear Systems
Bibliographic record
Abstract
Most physical systems possess parametric uncertainties or unmeasurable parameters and, since parametric uncertainty may degrade the performance of model predictive control (MPC), mechanisms to update the unknown or uncertain parameters are desirable in application. One possibility is to apply adaptive extensions of MPC in which parameter estimation and control are performed online. This book proposes such an approach, with a design methodology for adaptive robust nonlinear MPC (NMPC) systems in the presence of disturbances and parametric uncertainties. One of the key concepts pursued is the concept of setbased adaptive parameter estimation, which provides a mechanism to estimate the unknown parameters as well as an estimate of the parameter uncertainty set. The knowledge of non-conservative uncertain set estimates is exploited in the design of robust adaptive NMPC algorithms that guarantee robustness of the NMPC system to parameter uncertainty. Topics covered include: a review of nonlinear MPC; extensions for performance improvement; introduction to adaptive robust MPC; computational aspects of robust adaptive MPC; finite-time parameter estimation in adaptive control; performance improvement in adaptive control; adaptive MPC for constrained nonlinear systems; adaptive MPC with disturbance attenuation; robust adaptive economic MPC; setbased estimation in discrete-time systems; and robust adaptive MPC for discrete-time systems.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.010 | 0.006 |
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".