MétaCan
Menu
Back to cohort
Record W4205250459 · doi:10.1109/lra.2021.3137535

Dynamic Modeling of Tendon-Driven Co-Manipulative Continuum Robots

2021· article· en· W4205250459 on OpenAlexafffund
Amir Jalali, Farrokh Janabi‐Sharifi

Bibliographic record

VenueIEEE Robotics and Automation Letters · 2021
Typearticle
Languageen
FieldEngineering
TopicSoft Robotics and Applications
Canadian institutionsToronto Metropolitan University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsFlexibility (engineering)RobotComputer scienceObject (grammar)Equations of motionDynamic equationMotion (physics)BendingSimulationClassical mechanicsControl theory (sociology)PhysicsStructural engineeringEngineeringArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

This study presents a general framework for the dynamic analysis of tendon-driven co-manipulative continuum robots with flexible objects. Hence, the actuations of the arms have been provided bybending. Furthermore, the object is modeled as a flexible rod to account for the flexibility of the object into the coupled dynamics of the robot. The equations of motion are summarized based on Cosserat-rod modeling of the arms and the object to account for large deflections. A numerical solution method is developed to solve the equations of motion and to obtain the dynamic response. The numerical results are verified through the experiments. The results show that the presented algorithm has a great potential for the dynamic modeling of cooperative continuum robots. Although integration of the object flexibility increases the complexity of the model, the coupled flexibility of the arms and object has unavoidable effects on the dynamic response of the robot and should be considered for analysis and identification purposes.

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.000
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.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.000
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.017
GPT teacher head0.243
Teacher spread0.226 · 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

Citations18
Published2021
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Robotics and Automation LettersSame topicSoft Robotics and ApplicationsFrench-language works237,207