MétaCan
Menu
Back to cohort
Record W2003043626 · doi:10.1115/detc2004-57131

Adaptive Nonlinear PD Learning Control for Robot Manipulators

2004· article· en· W2003043626 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 Saskatchewan
Fundersnot available
KeywordsConvergence (economics)Control theory (sociology)Nonlinear systemRobot manipulatorComputer scienceAdaptive controlIterative learning controlRobotControl engineeringTorqueTracking (education)Control (management)Artificial intelligenceEngineering

Abstract

fetched live from OpenAlex

A new control method, called adaptive nonlinear PD learning control (NPD-LC), is proposed for robot manipulator applications in this paper. The proposed control structure is a combination of a nonlinear PD control structure and a directly learning structure. Consequently, this new control method possesses both adaptive and on-line learning properties. One of the unique features of the NPD-LC algorithm is that the learning is based on the previous torque profile of the repetitive task. It is proved that the NPD-LC enjoys the asymptotic convergence for both tracking positions and tracking velocities. Simulation studies were conducted by comparing the proposed method with many other existing methods. As a result, it was demonstrated that the NPD-LC method can achieve a faster convergence speed. The proposed NPD-LC is robust and can be implemented for the control of robot manipulators.

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: Empirical · Consensus signal: none
Teacher disagreement score0.963
Threshold uncertainty score0.748

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.010
GPT teacher head0.211
Teacher spread0.200 · 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
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicIterative Learning Control SystemsFrench-language works237,207