MétaCan
Menu
Back to cohort
Record W2145670645 · doi:10.1109/tro.2009.2030227

Connection Mechanism for Autonomous Self-Assembly in Mobile Robots

2009· article· en· W2145670645 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Robotics · 2009
Typearticle
Languageen
FieldEngineering
TopicModular Robots and Swarm Intelligence
Canadian institutionsWestern University
Fundersnot available
KeywordsMobile robotMechanism (biology)Connection (principal bundle)RobotRoboticsTerrainComputer scienceArtificial intelligenceControl engineeringDistributed computingEngineering

Abstract

fetched live from OpenAlex

This paper presents a connection mechanism for autonomous self-assembly in mobile robots. Using this connection mechanism, mobile robots can be autonomously connected and disconnected. The purpose of self-assembly in mobile robotics is to add a new capability to mobile robots, thus, improving their performance to best fit the terrain conditions. Construction of a reconnectable joint is of primary concern in such systems. In this paper, first the geometric conditions and force equations of a general docking mechanism are studied. Then, we discuss the design details of our connection mechanism and present some experimental results that show that the proposed mechanism overcomes significant alignment errors and is considerably power efficient.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: none
Teacher disagreement score0.958
Threshold uncertainty score0.901

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.014
GPT teacher head0.238
Teacher spread0.224 · 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