A Dead Reckoning Calibration Scheme Based on Optimization with an Adaptive Quantum-Inspired Evolutionary Algorithm for Vehicle Self-Localization
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.
Bibliographic record
Abstract
Parameter calibration is critical for self-localization based on dead reckoning in the control of intelligent vehicles such as autonomous driving. Most traditional calibration methods for robotics control based on dead reckoning rely on data collection with specially designed paths. For the calibration of parameters in the control of intelligent vehicles, the design of such paths is considered impossible due to the complexity of road conditions. To solve this problem, an optimization-based dead reckoning calibration scheme is introduced in this research using the differential global positioning system to obtain the actual positions of the intelligent vehicle. In this scheme, the difference between the positions obtained through dead reckoning and the positions obtained through the differential global positioning system is selected as the optimization objective function to be minimized. An adaptive quantum-inspired evolutionary algorithm is developed to improve the quality and efficiency of optimization. Experiments with an intelligent vehicle were also conducted to demonstrate the effectiveness of the developed calibration scheme. In addition, the newly introduced adaptive quantum-inspired evolutionary algorithm is compared with the classic genetic algorithm and the classic quantum-inspired evolutionary algorithm using eight benchmark test functions considering computation quality and efficiency.
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 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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 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 it