MétaCan
Menu
Back to cohort
Record W2045119871 · doi:10.1115/detc2002/mech-34356

Vibration Reduction in Robots Using Gain Optimization

2002· article· en· W2045119871 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicControl Systems in Engineering
Canadian institutionsUniversity of Waterloo
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsControl theory (sociology)Feed forwardReduction (mathematics)PID controllerRobotComputer scienceBand-stop filterController (irrigation)VibrationControl engineeringServoFilter (signal processing)EngineeringControl (management)Low-pass filterMathematicsArtificial intelligenceTemperature control

Abstract

fetched live from OpenAlex

This paper focuses on vibration reduction in robots by optimizing their control gains. Conventional methods for gain tuning are mostly based on trial and error, which are very time consuming, and require experienced personnel to tune the gains correctly. In this work we use optimization to tune the gains of an industrial motion controller. Although the optimization tuning method is described and examined on a specific robot, the method is general and can be applied to any servo system. The gains of a PID and second order feedforward controller, along with the gains of an anti-resonance notch filter are considered in the optimization procedure.

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.952
Threshold uncertainty score0.359

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.016
GPT teacher head0.189
Teacher spread0.174 · 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

Citations0
Published2002
Admission routes2
Has abstractyes

Explore more

Same topicControl Systems in EngineeringFrench-language works237,207