MétaCan
Menu
Back to cohort
Record W2077539472 · doi:10.1109/ais.2010.5547019

Environment mapping using probabilistic quadtree for the guidance and control of autonomous mobile robots

2010· article· en· W2077539472 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
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsRoyal Military College of Canada
Fundersnot available
KeywordsQuadtreeMobile robotComputer scienceProbabilistic logicRobotMotion planningMobile robot navigationObstacle avoidanceArtificial intelligenceComputer visionObstacleReal-time computingRobot controlGeography

Abstract

fetched live from OpenAlex

This paper presents the implementation of an environment mapping technique based on a probabilistic quadtree which records the location of static and dynamic obstacles, as well as the certainty over each obstacle's estimated position. The quadtree-based map is updated online (i.e. near-real time) based on multi-sensor feeds originating from one to three X80 mobile robots operating simultaneously. The probabilistic quadtree map is part of a guidance and navigation control system which combines a Genetic Algorithm-based global path planner and a Potential Field local controller. The centralized map is shared by all mobile robots although each robot has an independent controller. Performance of the proposed method for this guidance and navigation control system is demonstrated experimentally with the Dr. Robot's ™ wireless X80 mobile robots.

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.001
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.451
Threshold uncertainty score0.304

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.022
GPT teacher head0.244
Teacher spread0.222 · 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

Citations6
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207