MétaCan
Menu
Back to cohort
Record W2090987359 · doi:10.1109/rose.2007.4373976

Autonomous Stair Climbing with Reconfigurable Tracked Mobile Robot

2007· article· en· W2090987359 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobotic Locomotion and Control
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsClimbMobile robotStairsTraverseStair climbingRobotComputer scienceClimbingProcess (computing)TerrainArtificial intelligenceSimulationReal-time computingEmbedded systemEngineering

Abstract

fetched live from OpenAlex

Mobile robots have been developed for surveillance, reconnaissance and inspection as well as for operation in hazardous environments. Some are intended to explore not only natural terrains but also artificial environments, including stairs. This paper explores algorithms to autonomously climb stairs. The algorithms were derived and implemented for a specific mobile robot with the ability to traverse such obstacles by changing its tracks configuration. Furthermore, algorithms have been developed for conditions under which the mobile robot halts its motion during the climbing process when at risk of flipping over or falling down. The technical problems related to the implementation of some of these functions have been identified and analyzed, and their solutions validated and tested. The algorithms and solutions were validated experimentally, illustrating the effectiveness of autonomous climbing of stairs.

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

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.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.006
GPT teacher head0.194
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

Quick stats

Citations35
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Locomotion and ControlFrench-language works237,207