MétaCan
Menu
Back to cohort

MCMC Occupancy Grid Mapping with a Data-Driven Patch Prior

2021· article· en· W3205358776 on OpenAlexafffund
Rehman S. Merali, Timothy D. Barfoot

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobotics and Sensor-Based Localization
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsOccupancyOccupancy grid mappingMarkov chain Monte CarloComputer scienceGridSampling (signal processing)Gibbs samplingPosterior probabilityMarkov chainMonte Carlo methodBayesian probabilityAlgorithmArtificial intelligenceMobile robotStatisticsMathematicsComputer visionMachine learningRobotEngineering

Abstract

fetched live from OpenAlex

Occupancy grids have been widely used for mapping with mobile robots for several decades. Occupancy grids discretize the analog environment and seek to determine the occupancy probability of each cell. More recent occupancy grid mapping algorithms have shown the advantage of capturing cell correlations in the measurement model and the posterior. By estimating the probability of a given map as opposed to a cell, these algorithms have been able to better capture the occupancy probability of cells in the map. The advantage of incorporating data-driven prior probabilities in occupancy grid mapping is explored. A form of Markov Chain Monte Carlo (MCMC) known as Gibbs sampling allows us to sample maps from the full posterior. Previous research has sampled the occupancy probability of each cell, but this paper extends that work to sample a larger patch of cells and highlights the benefit of obtaining the prior for each patch from real maps.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation 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.027
Threshold uncertainty score0.054

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.007
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.002
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0030.002
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0050.001

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.029
GPT teacher head0.221
Teacher spread0.192 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations0
Published2021
Admission routes2
Has abstractyes

Explore more

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