MétaCan
Menu
Back to cohort
Record W2160174980 · doi:10.1109/crv.2012.49

Enhancing Exploration in Topological Worlds with Multiple Immovable Markers

2012· article· en· W2160174980 on OpenAlexafffund
Hui Wang, Michael Jenkin, Patrick Dymond

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobotics and Sensor-Based Localization
Canadian institutionsYork University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsVertex (graph theory)RobotComputer scienceTopology (electrical circuits)Topological complexityTheoretical computer scienceArtificial intelligenceMathematicsCombinatoricsGraphPure mathematics

Abstract

fetched live from OpenAlex

The fundamental problem in robotic exploration and mapping of an unknown environment is answering the question 'have I been here before?', which is also known as the 'loop closing' problem. One approach to answering this problem in embedded topological worlds is to resort to the use of an external marking aid that can help the robot disambiguate places. This paper investigates the power of different marker-based aids in topological exploration. We describe enhanced versions of edge- and vertex-based marker algorithms and demonstrate algorithms with enhanced lower bounds in terms of number of markers and motions required in order to map an embedded topological environment.

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 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.533
Threshold uncertainty score0.231

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.205
Teacher spread0.191 · 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 teacher head, 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

Citations3
Published2012
Admission routes2
Has abstractyes

Explore more

Same topicRobotics and Sensor-Based LocalizationFrench-language works237,207