LiDAR Based Classification Optimization of Localization Policies of Autonomous Vehicles
Bibliographic record
Abstract
People through many years of experience, have developed a great intuitive sense for navigation and spatial awareness. With this intuition people are able to apply a near rules based approach to their driving. With a transition to autonomous driving, these intuitive skills need to be taught to the system which makes perception is the most fundamental and critical task. One of the major challenges for autonomous vehicles is accurately knowing the position of the vehicle relative to the world frame. Currently, this is achieved by utilizing expensive sensors such as a differential GPS which provides centimeter accuracy, or by using computationally taxing algorithms to attempt to match live input data from LiDARs or cameras to previously recorded data or maps. Within this paper an algorithm and accompanying hardware stack is proposed to reduce the computational load on the localization of the robot relative to a prior map. The principal of the software stack is to leverage deep learning and powerful filters to perform classification of landmark objects within a scan of the LiDAR. These landmarks can have highly accurate known world coordinates and will be used for position estimation and localization of the vehicle. To develop this framework two phases will have to be conducted. The first will be developing the training set for these landmarks, which will be done by leveraging a dedicated computing platform designed to filter the raw LiDAR data, removing all unnecessary elements leaving only high density clusters which can be used as landmarks. A differential GPS will be used to determine the “true” world coordinates of these landmarks and this data will be attached to the map. The second phase will be deployment of the system on a live vehicle. The sensor suite will consist of a LiDAR, IMU, and standard GPS. The GPS will be used to roughly localize the vehicle to a couple meter distance, from here the proposed framework will search the prior map for the classified elements and do position estimation of the robots position based on the landmark’s associated meta data.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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 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".