MétaCan
Menu
Back to cohort
Record W2132058110 · doi:10.1109/robot.1991.131589

Robust hybrid impedance control of robot manipulators

2002· article· en· W2132058110 on OpenAlexaff
G.J. Liu, A.A. Goldenberg

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobot Manipulation and Learning
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsImpedance controlControl theory (sociology)Subspace topologyInertiaElectrical impedanceComputer scienceLinear subspaceAccelerationRobotController (irrigation)PID controllerTrajectoryControl engineeringEngineeringArtificial intelligenceMathematicsControl (management)Physics

Abstract

fetched live from OpenAlex

The objective of hybrid impedance control is defined, and a robust hybrid impedance control method is proposed. The task space is split into force-controlled and position-controlled subspaces based on the concept of hybrid control. Desired inertia and damping are introduced in the force control subspace to improve the dynamic behavior, and impedance control is used in the position-controlled subspace. In the proposed control scheme, the hybrid impedance control is equivalent to tracking a desired acceleration trajectory, which is generated in real-time. The computed torque technique and a PI control law are used to reduce the influence of model uncertainties. Experimental results obtained with a two-degree-of-freedom direct drive robot have shown the effectiveness of the proposed hybrid impedance control 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.001
Threshold uncertainty score0.005

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.0000.000
Insufficient payload (model declined to judge)0.0010.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.036
GPT teacher head0.192
Teacher spread0.156 · 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

Citations108
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicRobot Manipulation and LearningFrench-language works237,207