MétaCan
Menu
Back to cohort
Record W1853287980 · doi:10.1109/robot.1999.772461

Task verification facility for the Canadian special purpose dextrous manipulator

2003· article· en· W1853287980 on OpenAlexaffabout
J. de Carufel, Farhad Aghili, Érick Dupuis

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobot Manipulation and Learning
Canadian institutionsCanadian Space Agency
Fundersnot available
KeywordsTask (project management)Process (computing)Computer scienceSimulationComputer architecture simulatorParametric statisticsSoftwareHardware-in-the-loop simulationControl engineeringEmbedded systemEngineeringSystems engineeringOperating system

Abstract

fetched live from OpenAlex

As a partner in the International Space Station, Canada is responsible for the verification of all tasks involving the special purpose dextrous manipulator (SPDM). In this paper, the concept of an SPDM task verification facility (STVF) is described. The verification process involves three complementary stages. First, a real-time software simulator is used to verify the complete nominal and malfunction procedures. Next, the feasibility of a task involving contact is verified with the help of a hardware-in-the-loop simulator. Finally, a non real-time simulator is used to perform detailed parametric studies given the known tolerances on the components. The paper describes all three stages but emphasizes on the hardware-in-the-loop simulator, the only new facility within the STVF.

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.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.541
Threshold uncertainty score0.912

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0020.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0160.002

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.030
GPT teacher head0.218
Teacher spread0.189 · 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 designBench or experimental
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

Citations74
Published2003
Admission routes2
Has abstractyes

Explore more

Same topicRobot Manipulation and LearningFrench-language works237,207