MétaCan
Menu
Back to cohort
Record W2811473319 · doi:10.1109/tac.2013.2256691

Monotonic Reach Control on Polytopes

2013· article· en· W2811473319 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.

Bibliographic record

VenueIEEE Transactions on Automatic Control · 2013
Typearticle
Languageen
FieldEngineering
TopicControl and Dynamics of Mobile Robots
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsPolytopeMonotonic functionAffine transformationMathematicsFacet (psychology)Focus (optics)Polytope modelState spaceState (computer science)PiecewiseMathematical optimizationDiscrete mathematicsPure mathematicsAlgorithmMathematical analysis

Abstract

fetched live from OpenAlex

The technical note studies the problem of making the trajectories of an affine system defined on a polytopic state space reach a prescribed facet of the polytope in finite time without first leaving the polytope. The focus is on solvability by continuous piecewise affine feedback, and we formulate a variant of the problem in which trajectories exit in a monotonic sense. This allows to obtain necessary and sufficient conditions for solvability in certain geometric situations.

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 categoriesMeta-epidemiology (narrow), Insufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
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.933
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.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.0010.002

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.191
Teacher spread0.186 · 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