MétaCan
Menu
Back to cohort
Record W1591922020 · doi:10.1109/acc.1994.751811

Sampled-data robot adaptive control with stabilizing compensation

2005· article· en· W1591922020 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
TopicAdaptive Control of Nonlinear Systems
Canadian institutionsCarleton University
Fundersnot available
KeywordsControl theory (sociology)DiscretizationAdaptive controlCompensation (psychology)Stability (learning theory)Nonlinear systemLyapunov functionComputer scienceNorm (philosophy)Lyapunov stabilityMathematicsControl (management)Artificial intelligence

Abstract

fetched live from OpenAlex

This paper addresses the stability and performance of discretized adaptive control algorithms for robotic manipulator control, and the compensation of these algorithms for improved stability and tracking performance. The discretization of Slotine and Li's direct adaptive control algorithm results in a sampled-data system for which stability has not been guaranteed. By formulating the entire sampled-data system in continuous-time, Lyapunov's direct method is used to determine the stability and to derive a nonlinear discrete time compensating term. This compensator is added to a multi-rate discretization of Slotine and Li's adaptive algorithm, to stabilize the sampled-data system. For sufficiently high gain, globally stable performance and a known bound on the norm of the filtered error is proven. The effect of the compensator and validity of the error bound predictions are demonstrated through simulation and implementation of 2 degree-of-freedom manipulator control.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.949
Threshold uncertainty score0.609

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.042
GPT teacher head0.237
Teacher spread0.195 · 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

Citations4
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicAdaptive Control of Nonlinear SystemsFrench-language works237,207