MétaCan
Menu
Back to cohort
Record W2108330068 · doi:10.1109/aim.2010.5695935

Adaptive iterative learning control for robot manipulators without using velocity signals

2010· article· en· W2108330068 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 institutionsCarleton University
Fundersnot available
KeywordsIterative learning controlControl theory (sociology)Adaptive controlController (irrigation)Computer scienceConvergence (economics)Observer (physics)Lyapunov functionRobotTracking (education)Tracking errorIterative methodMonotonic functionScheme (mathematics)Control engineeringArtificial intelligenceMathematicsControl (management)AlgorithmEngineeringNonlinear system

Abstract

fetched live from OpenAlex

This paper proposes an output based adaptive iterative learning control (OBAILC) scheme for robotic systems. The idea of using OBAILC is to improve the tracking performance iteratively with relatively smaller values of observer-controller gains by assuming that the system tracks the same task iteratively. The design combines proportional-derivative controller with an adaptive term that iteratively updates uncertain parameters where unknown velocity signals are estimated by the output of the linear observer. The Lyapunov-based online switching mechanism is employed to ensure monotonic convergence of the tracking errors with respect to iteration number. The proposed scheme is evaluated on a 2-DOF robot manipulator to demonstrate the theoretical development of this paper.

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)
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.724
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.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.001
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.020
GPT teacher head0.252
Teacher spread0.232 · 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

Citations6
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicIterative Learning Control SystemsFrench-language works237,207