Bibliographic record
Abstract
The current development of autonomous driving technology is very hot, which involves two fundamental aspects: one is the operating system as the foundation, and the other is the algorithm application. The theme of this review is to study the related algorithmic technologies and combine them with one of the key functions of autonomous driving: autonomous routing. The review discusses the application direction and environment of this function, and involves the use of algorithms in the backend. Autonomous routing is a key concept in multiple technical fields and plays an important role in helping entities effectively navigate complex environments. This review centers on the concept of autonomous routing and focuses on its application direction, usage environment, and supporting algorithms. The core research question is autonomous routing and its working principle. The review analyzes the main application scenarios of autonomous routing, such as autonomous driving and game development, and explores the algorithms commonly used in these scenarios. By conducting a comprehensive analysis of the main usage environments and algorithm structures, the review provides insights into the current state of autonomous routing technology. The research findings show that autonomous routing technology has been deeply embedded in multiple industries and is continuously expanding as the demand for technology grows. Furthermore, the review explores the potential future development of autonomous routing, anticipating that it will further develop in responding to various new challenges and opportunities.
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.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.004 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".