MétaCan
Menu
Back to cohort
Record W2163116163 · doi:10.1109/iecon.1992.254423

An adaptive pole shifting algorithm for reference tracking

2003· article· en· W2163116163 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicIterative Learning Control Systems
Canadian institutionsÉcole de Technologie Supérieure
Fundersnot available
KeywordsRobustness (evolution)Computer scienceClosed loopControl theory (sociology)Tracking (education)Reference modelAlgorithmSIGNAL (programming language)Full state feedbackDomain (mathematical analysis)Control engineeringArtificial intelligenceMathematicsControl (management)Engineering

Abstract

fetched live from OpenAlex

A strategy for the design of a single-input and single-output self-tuning controller for reference signal tracking is described. An already existing algorithm for shifting the closed-loop poles radially toward the origin in the z-domain for regulation has been used for reference signal tracking by combining it with a well-known control law. The use of a self-searching pole-shifting technique increases the flexibility when applied to varying operating conditions encountered in various industrial applications. It also eliminates the necessity of choosing the closed-loop pole locations and still possesses the quality of robustness of pole assignment and ease of reference signal tracking. Digital simulation results are compared with those of two other algorithms.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.920
Threshold uncertainty score0.478

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.025
GPT teacher head0.255
Teacher spread0.230 · 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

Quick stats

Citations2
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicIterative Learning Control SystemsFrench-language works237,207