MétaCan
Menu
Back to cohort
Record W2146980256 · doi:10.1109/cca.2005.1507161

Robust iterative learning control design via μ-synthesis

2005· article· en· W2146980256 on OpenAlexaff
Abdelhamid Tayebi, S. Abdul, Marek B. Zaremba

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicIterative Learning Control Systems
Canadian institutionsToronto Metropolitan UniversityLakehead University
Fundersnot available
KeywordsIterative learning controlControl theory (sociology)WeightingRobust controlComputer scienceRobustness (evolution)Iterative methodRobot manipulatorLinear systemIterative designDesign methodsControl engineeringControl systemControl (management)Mathematical optimizationMathematicsEngineeringAlgorithmArtificial intelligence

Abstract

fetched live from OpenAlex

This paper deals with the robust iterative learning control (ILC) design for uncertain single input-single output (SISO) linear time invariant (LTI) systems. The design procedure is based upon solving the robust performance condition using the Youla parameterization and the mu-synthesis approach to obtain a feedback controller. Thereafter, a convergent iterative rule is obtained in a straightforward manner by using the performance weighting function involved in the robust performance condition. Experimental results on the first three links of a 6-degrees of freedom (6-DOF) robot manipulator are presented to illustrate the effectiveness of the proposed design method

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

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.022
GPT teacher head0.204
Teacher spread0.182 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations9
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicIterative Learning Control SystemsFrench-language works237,207