MétaCan
Menu
Back to cohort
Record W7034744560

Uncertainty Quantification of Tightly Integrated LiDAR/IMU Localization Algorithms

2023· dissertation· en· W7034744560 on OpenAlexfundno aff

Bibliographic record

VenueVTechWorks (Virginia Tech) · 2023
Typedissertation
Languageen
FieldComputer Science
TopicCloud Data Security Solutions
Canadian institutionsnot available
FundersCanadian Institute for Advanced ResearchMassachusetts Institute of TechnologyNational Science Foundation
KeywordsInertial measurement unitRangingLidarOrientation (vector space)Inertial navigation systemExploitMeasurement uncertaintyExtended Kalman filterKalman filter
DOInot available

Abstract

fetched live from OpenAlex

Safety risk evaluation is critical in autonomous vehicle applications. This research aims to develop, implement, and validate new safety monitoring methods for navigation in Global Navigation Satellite System (GNSS)-denied environments. The methods quantify uncertainty in sensors and algorithms that exploit the complementary properties of light detection and ranging (LiDAR) and inertial measuring units (IMU). This dissertation describes the following four contributions. First, we focus on sensor augmentation for landmark-based localization. We develop new IMU/LiDAR integration methods that guarantee a bound on the integrity risk, which is the probability that the navigation error exceeds predefined acceptability limits. IMU data improves LiDAR position and orientation (pose) prediction and LiDAR limits the IMU error drift over time. In addition, LiDAR return-light intensity measurements improve landmarks recognition. As compared to using the sensors individually, tightly-coupled IMU/LiDAR not only increases pose estimation accuracy but also reduces the risk of incorrectly associating perceived features with mapped landmarks. Second, we consider algorithm improvements. We derive and analyze a new data association method that provides a tight bound on the risk of incorrect association for LiDAR feature-based localization. The new data association criterion uses projections of the extended Kalman filter's (EKF) innovation vector rather than more conventional innovation vector norms. This method decreases the integrity risk by improving our ability to predict the risk of incorrect association. Third, we depart from landmark-based approaches. We develop a spherical grid-based localization method that leverages quantization theory to bound navigation uncertainty. This method is integrated with an iterative EKF to establish an analytical bound on the vehicle's pose estimation error. Unlike landmark-based localization which requires feature extraction and data association, this method uses the entire LiDAR point cloud and is robust to extraction and association failures. Fourth, to validate these methods, we designed and built two testbeds for indoor and outdoor experiments. The indoor testbed includes a sensor platform installed on a rover moving on a figure-eight track in a controlled lab environment. The repeated figure-eight trajectory provides empirical pose estimation error distributions that can directly be compared with analytical error bounds. The outdoor testbed required another set of navigation sensors for reference truth trajectory generation. Sensors were mounted on a car to validate our algorithms in a realistic automotive driving 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.

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.008
metaresearch head score (Gemma)0.031
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: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.040

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.031
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.002
Scholarly communication0.0030.004
Open science0.0020.005
Research integrity0.0010.002
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.021
GPT teacher head0.285
Teacher spread0.264 · 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
GenreEmpirical

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
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueVTechWorks (Virginia Tech)Same topicCloud Data Security SolutionsFrench-language works237,207