MétaCan
Menu
Back to cohort
Record W2128788708 · doi:10.1002/cjce.5450790512

On solving optimal control problems with free initial condition using iterative dynamic programming

2001· article· en· W2128788708 on OpenAlex

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.
fundA Canadian funder is recorded on the work.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueThe Canadian Journal of Chemical Engineering · 2001
Typearticle
Languageen
FieldEngineering
TopicAdvanced Control Systems Optimization
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDynamic programmingOptimal controlMathematical optimizationControl (management)State (computer science)Control theory (sociology)Computer scienceNonlinear programmingIterative methodControl variableNonlinear systemMathematicsAlgorithmStatistics

Abstract

fetched live from OpenAlex

Abstract For solving optimal control problems where the initial conditions of some of the state variables are not specified, a procedure based on iterative dynamic programming (IDP) is presented. In this procedure, the free initial conditions are taken to be additional control variables for the first time stage only; then the search for the optimal initial conditions and also the optimal control policy is carried out simultaneously using IDP. The procedure is straightforward, and as illustrated with two nonlinear optimal control problems, for each case the optimum performance index is readily obtained.

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.544
Threshold uncertainty score0.639

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.005
GPT teacher head0.196
Teacher spread0.191 · 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