Lyapunov‐based MPC with robust moving horizon estimation and its triggered implementation
Bibliographic record
Abstract
In this work, we consider moving horizon state estimation (MHE)‐based model predictive control (MPC) of nonlinear systems. Specifically, we consider the Lyapunov‐based MPC (LMPC) developed in (Mhaskar et al., IEEE Trans Autom Control. 2005;50:1670–1680; Syst Control Lett. 2006;55:650–659) and the robust MHE (RMHE) developed in (Liu J, Chem Eng Sci. 2013;93:376–386). First, we focus on the case that the RMHE and the LMPC are evaluated every sampling time. An estimate of the stability region of the output control system is first established; and then sufficient conditions under which the closed‐loop system is guaranteed to be stable are derived. Subsequently, we propose a triggered implementation strategy for the RMHE‐based LMPC to reduce its computational load. The triggering condition is designed based on measurements of the output and its time derivatives. To ensure the closed‐loop stability, the formulations of the RMHE and the LMPC are also modified accordingly to account for the potential open‐loop operation. A chemical process is used to illustrate the proposed approaches. © 2013 American Institute of Chemical Engineers AIChE J , 59: 4273–4286, 2013
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.000 |
| 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".