MétaCan
Menu
Back to cohort
Record W4402307422 · doi:10.1016/j.ifacol.2024.08.427

Improved Gain Conditioning for Linear Model Predictive Control

2024· article· en· W4402307422 on OpenAlex
Mouna Y. Harb, Stephen D. Sanborn, Andrew J. Thake, Kimberley B. McAuley

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIFAC-PapersOnLine · 2024
Typearticle
Languageen
FieldEngineering
TopicAdvanced Control Systems Optimization
Canadian institutionsImperial Oil (Canada)Queen's University
Fundersnot available
KeywordsConditioningModel predictive controlControl theory (sociology)Control (management)Computer scienceMathematicsStatisticsArtificial intelligence

Abstract

fetched live from OpenAlex

One challenge when using linear model predictive control (MPC) is that model mismatch and ill-conditioned gain matrices can lead to undesirable aggressive controller behavior. To address this issue, we propose improvements to an existing offline method for gain-matrix conditioning. The proposed algorithm identifies problematic manipulated variables (MVs) with correlated effects on controlled variables (CVs) and solves a constrained linear least-squares optimization problem to adjust the problematic gains. Additionally, the proposed algorithm prevents the optimizer from switching the signs of some gains and allows control practitioners to specify trusted key gains that should be held constant. We also extend the method to condition gain submatrices in scenarios where some of the CVs may temporarily be eliminated from the control problem. To illustrate the effectiveness of the proposed algorithm, we present a case study involving industrial fluidized catalytic cracking.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.676
Threshold uncertainty score0.935

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.007
GPT teacher head0.236
Teacher spread0.229 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it