MétaCan
Menu
Back to cohort

Scan Context 3D Lidar Inertial Odometry via Iterated ESKF and Incremental K-Dimensional Tree

2022· article· en· W4308091063 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 institutionsDalhousie University
Fundersnot available
KeywordsOdometryComputer scienceLidarArtificial intelligenceContext (archaeology)Computer visionSegmentationTree (set theory)AlgorithmRobotMathematicsRemote sensingMobile robotGeography

Abstract

fetched live from OpenAlex

This paper focused on a 3D lidar inertial odometry algorithm framework that improves the LeGO-LOAM by constructing a new back-end optimization algorithm. In comparison with the LeGO-LOAM, the feature extraction and image projection processes are still the same. Two-step Levenberg Marquardt was replaced with an iterated ESKF method in the lidar odometry to produce a better initial pose for the robots, and the k-d tree method in the lidar mapping is replaced with the ikd-Tree method to ensure high performance mapping process in real time. In the loop closure, a scan context search method is added to better correct the algorithm’s final trajectory. We compare the improved algorithm with LeGO-LOAM and the two other methods, LIO-SAM and A-LOAM, using three datasets gathered from the Mulran dataset with different large-scale outdoor scenes. We show that the improved algorithm achieves similar or better accuracy in real-time than the other three algorithms.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.197
Threshold uncertainty score1.000

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.0010.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.006
GPT teacher head0.183
Teacher spread0.176 · 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

Citations4
Published2022
Admission routes1
Has abstractyes

Explore more

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