LIDAR-INERTIAL NAVIGATION BASED ON MAP AIDED DISTANCE CONSTRAINT AND FACTOR GRAPH OPTIMIZATION
Bibliographic record
Abstract
Abstract. The simultaneous localization and mapping (SLAM) is one of the well-developed positioning technology that provides high accuracy and reliability positioning for automatic vehicles and robotics applications. Integrating Light Detection and Ranging (LiDAR) with an Inertial Measurement Unit (IMU) has emerged as a promising technique for achieving stable navigation results in dense urban environments, outperforming vision-based or pure Inertial Navigation System (INS) solutions. However, conventional LiDAR-Inertial SLAM systems often suffer from limited perception of surrounding geometric information, resulting in unexpected and accumulating errors. In this paper, we proposed a LiDAR-Inertial SLAM scheme that utilizes a prior structural information map which is generated from opensource OpenStreetMap (OSM). In contrast to conventional solutions of OSM-aided SLAM approaches, our method extracts the vectorized models of road and building and synthetically generates dense point maps for LiDAR registration. Specifically, a structural map processing module extracts the road models and building models from OSM and generates a structure information map (SIM) with dense point clouds. Secondly, a map aided distance (MD) constraint is calculated by registering selected keyframes and the prior SIM. Finally, a factor graph optimization (FGO) algorithm is involved to integrate the relative transformation obtained from LiDAR odometry, IMU pre-integration, and the map aided distance constraints. To evaluate the proposed LiDAR-based positioning accuracy, experimental evaluation is implemented in an opensource dataset collected in the urban canyon environments. Experimental results demonstrates that with the help of the proposed MD constraint, the LiDAR-based navigation solution can achieve accurate positioning, with a root mean square deviation (RSME) of 4.7 m.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
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".