MétaCan
Menu
Back to cohort
Record W1974215977 · doi:10.1115/detc2008-49927

Impedance Control of Cable-Driven Mechanisms

2008· article· en· W1974215977 on OpenAlexaff
Siavash Rezazadeh, Saeed Behzadipour

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMedicine
TopicParkinson's Disease and Spinal Disorders
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsImpedance controlElectrical impedanceMechanical impedanceWork (physics)Control theory (sociology)Multibody systemComputer scienceImpedance parametersPosition (finance)EngineeringControl (management)Control engineeringMechanical engineeringPhysicsElectrical engineering

Abstract

fetched live from OpenAlex

In this work, an impedance control method is developed and applied to two cable-driven mechanisms. The first one is a classical problem of driving a rigid body in 3-D space by seven cables. Our approach is based on the impedance control of rigid link manipulators which is then extended to include the specific considerations of the cable-driven mechanisms such as maintaining the tensile force in the cables. The method is then extended to the serial multibody cable-driven mechanisms. The motivation for this problem is the possible application of cable-driven systems in the rehabilitative exercises such as physical and/or occupational therapies. In this case, the human body acts as a multibody system which is driven by cables attached. The impedance control in such application facilitates the comfort of the patient by providing the necessary compliance while moving the body parts. The formulation of the problem is developed using Lagrange’s equation and the control input (which is the cable forces) is calculated based on the position and/or force feedback from the multibody. Simulation results demonstrate the effectiveness of the presented method.

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

Distilled classifier scores by category (both heads)

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

Citations4
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicParkinson's Disease and Spinal DisordersFrench-language works237,207