MétaCan
Menu
Back to cohort
Record W2565809411 · doi:10.1109/tac.2003.815010

Performance limitations in the robust servomechanism problem for discrete-time lti systems

2003· article· en· W2565809411 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 · 2003
Typearticle
Languageen
FieldEngineering
TopicIterative Learning Control Systems
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsControl theory (sociology)Algebraic Riccati equationServomechanismRiccati equationDiscrete time and continuous timeDimension (graph theory)Robust controlMathematicsTracking errorControl systemComputer scienceEngineeringControl (management)Control engineeringDifferential equationMathematical analysis

Abstract

fetched live from OpenAlex

Fundamental limitations for error tracking/regulation are obtained for the robust servomechanism problem (RSP) for a sampled system. In studying this problem, the cheap control problem for a multi-input/multi-output discrete time system is considered, and explicit expressions are obtained for the limiting steady state solution of its associated algebraic Riccati equation (ARE), as the weight on the control energy tends to zero. Application of these results is then made to obtain explicit expressions for the limiting performance costs associated with error tracking/regulation in the RSP. These limitations can be characterized by the system order, the dimension of the outputs, the number of the system's transmission zeros and the location of the system's nonminimum phase transmission zeros.

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.001
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.971
Threshold uncertainty score0.823

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.019
GPT teacher head0.206
Teacher spread0.187 · 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