Lidar‐Binocular Camera‐Integrated Navigation System for Underground Parking
Bibliographic record
Abstract
It is well known that vehicles highly rely on satellite navigation in an open intelligent traffic environment. However, satellite navigation cannot obtain accurate positioning information for vehicles in the interior of underground garage, as they comprise a semienclosed navigation space, worse light than outdoors in a special traffic environment. To address this problem in this research, the Lidar‐binocular camera‐integrated navigation system (LBCINS) is established for underground parking indoor environment. The obtained Lidar data from the simulation experiment are preprocessed, and the matching results of the inertial navigation system (INS) under the normal distributions transform (NDT) algorithm and the iterative closest point (ICP) algorithm are compared. The simulation experiment results show that in the complex underground parking environment, the INS under Lidar‐NDT algorithm with binocular camera achieves a better performance. Then, in the field experiment, the 3D cloud point data were collected by the test vehicle that equipped with the proposed navigation system from an underground parking and obtained 199 pairs of feature points’ distances. Finally, four different statistical methods were used to analyze the calculated distance errors. Results show that under different error statistical methods, the distance error values of the proposed navigation system are 0.00901, 0.059, 0.00766, and 0.087 m, respectively which present a much higher precision than 5.0 m in the specification requested for inertial‐integrated navigation terminal.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
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 source (direct Gemma or distilled Codex), 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".