MétaCan
Menu
Back to cohort
Record W1947421145 · doi:10.1109/robot.1997.614315

Probabilistic octree modeling of a 3D dynamic environment

2002· article· en· W1947421145 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
TopicRobotics and Sensor-Based Localization
Canadian institutionsUniversité Laval
Fundersnot available
KeywordsOctreeOccupancy grid mappingComputer scienceProbabilistic logicWorkspaceOccupancyComputationGridRange (aeronautics)Frame (networking)Motion planningGaussianAlgorithmMobile robotArtificial intelligenceRobotMathematicsEngineering

Abstract

fetched live from OpenAlex

Probabilistic occupancy grids have proved to be very useful for workspace modeling in 2D environments. Due to the expansion of computational load, this approach was not tractable for mapping a 3D environment in real applications. In this paper, the original occupancy grid scheme is revisited and a generic closed-form function is introduced to avoid numerical computation of probabilities for a range sensor with Gaussian error distribution. Occupancy probabilities are computed and stored in a multiresolution octree for improved performance and compactness. Occupancy models are built in local reference frames and linked to a global reference frame through uncertain spatial relationships that can be updated dynamically. This scheme is used for building a 3D map in a telerobotic maintenance application of electric power lines where perturbations may cause motion of object assembly.

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.934
Threshold uncertainty score0.338

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.013
GPT teacher head0.171
Teacher spread0.158 · 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

Citations60
Published2002
Admission routes1
Has abstractyes

Explore more

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