MétaCan
Menu
Back to cohort
Record W2317849010 · doi:10.1115/detc2008-49867

Optimization of Redundant-Limb Layout in Cable-Driven Parallel Manipulators

2008· article· en· W2317849010 on OpenAlexaff
Mahir Hassan, Amir Khajepour

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobotic Mechanisms and Dynamics
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsInertiaTension (geology)Base (topology)Computer scienceParallel manipulatorConnection (principal bundle)PickupManipulator (device)EngineeringMechanical engineeringRobotUltimate tensile strengthRobotic armMaterials scienceMathematicsPhysics

Abstract

fetched live from OpenAlex

Cable-driven mechanisms can be used as fast pickup-and-place manipulators due to the low inertia of the cables. Maintaining cable tension can be achieved by cylinders applying forces on the mobile platform to generate tensile forces in the cables to prevent cable slack during the operation. This paper presents an optimization approach to determine the optimum layout of the cylinders in the manipulator, i.e., the optimum positions of the cylinders connection points on the mobile platform and the base. The goal of this optimization is to achieve the desired distribution of the generated tension across the cables. An example 6-degree-of-freedom spatial manipulator is presented where this approach is applied to optimize the layout of one, two and three cylinders.

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.001
Version: metacan-v3-hybrid-931329e0061cValidation 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.002
Threshold uncertainty score0.006

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0020.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.191
Teacher spread0.175 · 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 designSimulation or modeling
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

Citations1
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Mechanisms and DynamicsFrench-language works237,207