Robust model predictive control and fault handling of batch processes
Bibliographic record
Abstract
Abstract This work considers the control of batch processes subject to input constraints and model uncertainty with the objective of achieving a desired product quality. First, a computationally efficient nonlinear robust Model Predictive Control (MPC) is designed. The robust MPC scheme uses robust reverse‐time reachability regions (RTRRs), which we define as the set of process states that can be driven to a desired neighborhood of the target end‐point subject to input constraints and model uncertainty. A multilevel optimization‐based algorithm to generate robust RTRRs for specified uncertainty bounds is presented. We then consider the problem of uncertain batch processes subject to finite duration faults in the control actuators. Using the robust RTRR‐based MPC as the main tool, a robust safe‐steering framework is developed to address the problem of how to operate the functioning inputs during the fault repair period to ensure that the desired end‐point neighborhood can be reached upon recovery of the full control effort. The applicability of the proposed robust RTRR‐based controller and safe‐steering framework subject to limited availability of measurements and sensor noise are illustrated using a fed‐batch reactor system. © 2010 American Institute of Chemical Engineers AIChE J, 2011
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.001 |
| 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.000 |
| 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".