Nonlinear Model Predictive Control of Steam-Assisted-Gravity-Drainage Well Operations for Real-Time Production Optimization
Bibliographic record
Abstract
Summary In deep oil-sands deposits using the steam-assisted-gravity-drainage (SAGD) recovery process, real-time optimization (RTO) involves controlling optimum subcool to ensure steam conformance. Contemporary workflows use linear model predictive control (MPC) with oversimplified models that are inadequate to represent highly complex, spatially distributed, and nonlinear reservoir dynamics. In this research, two novel workflows using nonlinear MPC (NMPC) are proposed. The first workflow reduces an NMPC problem to linear MPC by estimating an equivalent linear model of a nonlinear black-box model in a mean-square-error sense. Another approach is to use nonlinear dynamic models explicitly for accurate prediction of the plant states and/or outputs. The resulting nonconvex, nonlinear cost optimization problem is solved using an interior-point algorithm at each control interval. Proposed workflows are tested using the history-matched, field-scale model of a SAGD reservoir located in northern Alberta, Canada. Qualitative and quantitative analysis of the results reveals that nonlinear black-box models based on system identification theory can successfully capture the nonlinearity of the SAGD process. Also, both workflows can control the subcool above the desired set-point while ensuring stable well operations. More than a 24% increment is achieved in net present value (NPV) using proposed NMPC workflows compared with the field operations with no closed-loop control. Overall, NMPC can successfully be used for improved RTO, energy efficiency, and greenhouse gas emissions while considering available surface facilities and well configurations.
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.002 | 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".