Robust Nonlinear Model Predictive Control With Model Predictive Sliding Mode for Continuous-Time Systems
Bibliographic record
Abstract
Abstract This paper presents a robust, tube-based nonlinear model predictive controller for continuous-time systems with additive disturbances which cascades two sampled-data model predictive controllers: the first creates a desired path using nominal dynamics, and the second maintains the true state close to the nominal state by regulating a sliding variable designed on the error between the true and nominal states. The sampled-data model predictive approach permits easy incorporation of continuous-time sliding mode dynamics, allowing a dynamic boundary layer and tube design to be included. In this way, the control applied to the system capitalizes on the robustness properties of traditional sliding mode control (SMC) while incorporating system constraints. Stability analysis is presented in the context of input-to-state stability (ISS) for continuous-time systems. The proposed controller is implemented on two case studies, is compared to benchmark tube-based model predictive controllers, and is evaluated using average root-mean-square (RMS) values on the state and input variables, in addition to average integral square error (ISE) and integral absolute error (IAE) values on the position states. Results reveal that the proposed technique responds to higher levels of disturbance with significant increases in control effort, eliminates constraint violation by using of constrained SMC as the secondary controller, and maintains similar tracking performance to benchmark controllers at lower levels of control effort.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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.001 |
| 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".