MétaCan
Menu
Back to cohort
Record W2171486325 · doi:10.1109/robot.1998.677025

Stable, online learning using CMACs for neuroadaptive tracking control of flexible-joint manipulators

2002· article· en· W2171486325 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 institutionsUniversity of Toronto
FundersResearch Institute of Petroleum Industry
KeywordsBacksteppingComputer scienceArtificial neural networkRobotStability (learning theory)Control engineeringControl theory (sociology)Artificial intelligenceContent-addressable memoryAdaptive controlContent-addressable storageJoint (building)EngineeringControl (management)Machine learning

Abstract

fetched live from OpenAlex

An artificial neural network is proposed for the precision control of flexible-joint robots. The training method uses backstepping in an online, direct neuroadaptive scheme in order to guarantee stability. The online weight updates include a learning term that improves performance while maintaining stability. Albus's cerebellar model arithmetic computer algorithm is modified to work for flexible robots by utilizing radial basis functions to deal with the elasticity. The resulting hybrid network is referred to as CMAC-RBF associative memory or CRAM network. Many of the properties of the CMAC for rigid robot control are kept by using CRAM for flexible-joint robots.

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.580
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.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.060
GPT teacher head0.248
Teacher spread0.188 · 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

Citations11
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicIterative Learning Control SystemsFrench-language works237,207