MétaCan
Menu
Back to cohort
Record W1996684872 · doi:10.1017/s026357471100066x

Backlash elimination in parallel manipulators using actuation redundancy

2011· article· en· W1996684872 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

VenueRobotica · 2011
Typearticle
Languageen
FieldEngineering
TopicRobotic Mechanisms and Dynamics
Canadian institutionsUniversity of VictoriaUniversité de Moncton
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsBacklashTorqueControl theory (sociology)Redundancy (engineering)WrenchActuatorParallel manipulatorComputer scienceNonlinear systemWork (physics)Control engineeringEngineeringRobotArtificial intelligenceMechanical engineeringControl (management)Physics

Abstract

fetched live from OpenAlex

SUMMARY In this work, accuracy enhancement through backlash elimination is considered. When a nonredundantly actuated parallel manipulator is subjected to a wrench while following a trajectory, required actuator torque switching (going from positive to negative or vice versa) may occur. If backlash is present in the actuation hardware for a manipulator, torque switching compromises accuracy. When in-branch redundant actuation is added, a pseudoinverse torque solution requires smaller joint torques, but torque switching may still occur. A method is presented where concepts of exploiting a nullspace basis of the joint torques are used to ensure that single sense joint torques can be achieved for the actuated joints. The same sense torque solutions are obtained using nonlinear optimization. The methodology is applied to several examples simulating parallel manipulators in machining applications.

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.685
Threshold uncertainty score0.492

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.058
GPT teacher head0.218
Teacher spread0.160 · 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