MétaCan
Menu
Back to cohort
Record W1488050816 · doi:10.1109/icnn.1994.374663

Experiments in feedforward shaping control of direct-drive robot using RBF network

2002· article· en· W1488050816 on OpenAlexaff
Dirk Torfs, Dimitry Gorinevsky, A.A. Goldenberg

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicIterative Learning Control Systems
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsFeed forwardTrajectoryFeedforward neural networkControl theory (sociology)Computer scienceTask (project management)Tracking (education)Radial basis functionArtificial intelligenceRobotArtificial neural networkMotion controlRobotic armControl engineeringControl (management)Engineering

Abstract

fetched live from OpenAlex

This paper considers a new approach to manipulator trajectory tracking. Feedforward control shape is computed with a radial basis function (RBF) network as a result of approximation over task parameter domain. The task parameters comprise coordinates of the initial and final point of the trajectory with motion time being fixed. The RBF network is trained using the feedforward shapes obtained with a learning control algorithm. The paper demonstrates experimental implementation of all steps of the algorithm for trajectory tracking in fast (1.25 s) motions of a direct-drive industrial robot AdeptOne. High performance is achieved in experiment opening an avenue for practical applications of the approach.>

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.002
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
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.0010.000
Insufficient payload (model declined to judge)0.0010.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.035
GPT teacher head0.240
Teacher spread0.205 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations4
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicIterative Learning Control SystemsFrench-language works237,207