MétaCan
Menu
Back to cohort
Record W4391168181 · doi:10.1115/1.4064570

Maximizing the Throwing Distance of Robotic Manipulators: An Optimization Approach

2024· article· en· W4391168181 on OpenAlex
André Gallant, Clément Gosselin

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

VenueJournal of Mechanisms and Robotics · 2024
Typearticle
Languageen
FieldEngineering
TopicRobotic Mechanisms and Dynamics
Canadian institutionsUniversité LavalUniversité de Moncton
Fundersnot available
KeywordsThrowingRobot manipulatorComputer scienceKinematicsControl theory (sociology)RobotArtificial intelligenceEngineeringMechanical engineeringPhysicsControl (management)

Abstract

fetched live from OpenAlex

Abstract Manipulators are increasingly being called upon to perform a wide range of tasks. This paper explores the maximal distance throwing task for robotic manipulators and shows that this characteristic can be incorporated in the kinematic design process. Indeed, knowing the maximum distance that a manipulator can throw objects is useful in determining the viability of certain throwing tasks it might be called upon to execute. This paper studies three optimization problems: optimizing the release state to maximize the throwing distance, optimizing the kinematic trajectory subject to position, velocity, acceleration, and jerk constraints, and finally optimizing the kinematic design of manipulators to maximize the workspace as well as the throwing distance. Three manipulator architectures are used as case studies for these optimizations: a planar RR, a spatial RRR, and a wrist-partitioned 6R manipulator.

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: Methods
Teacher disagreement score0.173
Threshold uncertainty score0.437

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.013
GPT teacher head0.211
Teacher spread0.198 · 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