MétaCan
Menu
Back to cohort
Record W2316950857 · doi:10.1115/detc2010-28036

The Direct Kinematics of Objects Suspended From Cables

2010· article· en· W2316950857 on OpenAlexfundno aff
Qimi Jiang, Vijay Kumar

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsKinematicsPolygon (computer graphics)Linkage (software)Position (finance)PlanarNonlinear systemParallel manipulatorFour-bar linkageSymmetry (geometry)PolynomialKinematics equationsForward kinematicsComputer scienceMotion (physics)Kinematic chainAlgorithmMathematicsRobot kinematicsRobotGeometryInverse kinematicsComputer visionArtificial intelligenceMobile robotMathematical analysisPhysicsClassical mechanicsComputer graphics (images)Frame (networking)

Abstract

fetched live from OpenAlex

This work addresses the problem for determining the position and orientation of an object with regular polygon suspended from n cables with the same length when the n robots form a regular polygon on the horizontal plane. First, an analytic algorithm based on resultant elimination is presented to determine all possible equilibrium configurations of the planar 4-bar linkage. As the nonlinear system can be reduced to a polynomial equation in one unknown with a degree 8, this algorithm is more efficient than numerical search algorithms. Then, considering that the motion of the 3D cable system in its vertical planes of symmetry can be regarded as the motion of an equivalent planar 4-bar linkage, the proposed algorithm is used to solve the direct kinematic problem of objects suspended from multiple cables. Then, case studies with three to six cables are conducted for demonstration. Finally, experiments are conducted for validation.

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.000
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: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
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.007
GPT teacher head0.224
Teacher spread0.217 · 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
GenreMethods

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

Citations29
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207