MétaCan
Menu
Back to cohort
Record W2051054117 · doi:10.1177/02783640022067003

Discrete-Time Lyapunov Design for Neuroadaptive Control of Elastic-Joint Robots

2000· article· en· W2051054117 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

VenueThe International Journal of Robotics Research · 2000
Typearticle
Languageen
FieldEngineering
TopicAdaptive Control of Nonlinear Systems
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsControl theory (sociology)BacksteppingArtificial neural networkDiscrete time and continuous timeController (irrigation)RobotLyapunov functionComputer scienceAdaptive controlContent-addressable memoryLyapunov stabilityTrajectoryStability (learning theory)MathematicsArtificial intelligenceNonlinear systemControl (management)Machine learning

Abstract

fetched live from OpenAlex

A neural-network controller operating in discrete time is shown to result in stable trajectory tracking for rigid and elastic-joint robots. The technique assumes continuous-time state feedback. The proof of stability uses discrete-time Lyapunov functions. For the elastic-joint case, a discrete-time version of the adaptive backstepping technique is used. The result is that the neural network can be run at a very slow control rate, suitable for online calculations. The neural network used is referred to as the CMAC-RBF Associative Memory (CRAM), a modification of Albus’s Cerebellar Model Arithmetic Computer (CMAC) algorithm using radial basis functions (RBFs). Simulation results are provided for a two-link planar elastic-joint robot and show that performance can be improved by using a larger network at a slower control rate.

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.002
metaresearch head score (Gemma)0.001
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.979
Threshold uncertainty score0.410

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.001
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.0010.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.078
GPT teacher head0.330
Teacher spread0.252 · 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