MétaCan
Menu
Back to cohort
Record W2065602781 · doi:10.1163/016918610x512604

Concurrent Map Building and Behavior Learning for Navigation in Unknown Environments

2010· article· en· W2065602781 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

VenueAdvanced Robotics · 2010
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsMobile robotComputer scienceGridGrid referenceMobile robot navigationRobotArtificial intelligenceSonarInterface (matter)Occupancy grid mappingReal-time computingHuman–computer interactionComputer visionRobot control

Abstract

fetched live from OpenAlex

In this paper, we report a robust and low-cost navigation algorithm for an unknown environment based on integration of a grid-based map building algorithm with behavior learning. The study focuses on mobile robots that utilize ultrasonic sensors as their prime interface with the outside world. The proposed algorithm takes into account environmental information to augment the readings from the low angular accuracy sonar measurements for behavior learning. The environmental information is obtained by an online grid-based map learning design that is concurrently operating with the behavior learning algorithm. The proposed algorithm is implemented and tested on an in-house-built mobile robot, and its performance is verified through online navigation in an indoor 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.

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: Methods
Teacher disagreement score0.321
Threshold uncertainty score0.589

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.012
GPT teacher head0.281
Teacher spread0.269 · 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