Transition from Batch to Continuous Operation in Bio‐Reactors: A Model Predictive Control Approach and Application
Bibliographic record
Abstract
Abstract This work considers the problem of determining the transition of ethanol‐producing bio‐reactors from batch to continuous operation and subsequent control subject to constraints and performance considerations. To this end, a Lyapunov‐based non‐linear model predictive controller is utilized that stabilizes the bio‐reactor under continuous mode of operation. The key idea in the predictive controller is the formulation of appropriate stability constraints that allow an explicit characterization of the set of initial conditions from where feasibility of the optimization problem and hence closed‐loop stability is guaranteed. Additional constraints are incorporated in the predictive control design to expand on the set of initial conditions that can be stabilized by control designs that only require the value of the Lyapunov function to decay. Then, the explicit characterization of the set of stabilizable initial conditions is used in determining the appropriate time for which the reactor must be run in batch mode. Specifically, the predictive control approach is utilized in determining the appropriate batch length that achieves stabilizable values of the state variables at the end of the batch. Application of the proposed method to the ethanol production process using Zymomonas mobilis as the ethanol producing micro‐organism demonstrates the effectiveness of the proposed model predictive control strategy in stabilizing the bio‐reactor.
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.001 |
| Open science | 0.001 | 0.000 |
| 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".