MétaCan
Menu
Back to cohort
Record W2991863200 · doi:10.1049/iet-cta.2019.0556

Fast model predictive control based on sensitivity analysis strategy

2019· article· en· W2991863200 on OpenAlex
Hamid Kalantari, Mohsen Mojiri, Stevan Dubljević, Najmeh Zamani

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

VenueIET Control Theory and Applications · 2019
Typearticle
Languageen
FieldEngineering
TopicAdvanced Control Systems Optimization
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsModel predictive controlSensitivity (control systems)Control theory (sociology)Computer scienceControl (management)Control engineeringEngineeringArtificial intelligenceElectronic engineering

Abstract

fetched live from OpenAlex

This study proposes a new method based on sensitivity analysis to solve a series of sequential parametric linear programmings (LPs) such as that those arise in model predictive control (MPC). The main idea is to find a relationship between each of the two successive parametric LPs by using sensitivity analysis strategy. Tolerance analysis‐based MPC (TA‐ MPC) and sensitivity analysis‐based MPC (SA‐ MPC) are introduced for reducing computational complexity and runtime. TA‐ MPC takes operations per step time, where N and n are the prediction horizon and the number of states, respectively. This approach is very faster than generic optimisation methods but it can be applied only for initial conditions that are near to steady‐state values. SA‐ MPC has not any limitation in usage and it reduces the runtime significantly compared with common solvers. Finally, numerical results indicate the potential of the proposed algorithms.

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: Empirical · Consensus signal: none
Teacher disagreement score0.995
Threshold uncertainty score0.767

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.003
GPT teacher head0.197
Teacher spread0.195 · 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