Research on the Application of Computer Big Data Technology in Smart Travel
Bibliographic record
Abstract
This paper mainly focuses on the algorithms related to local path planning and path tracking control of unmanned vehicles in the process of obstacle avoidance. By introducing the temporal dimension as a reference, the perceptual results are projected onto the 3D spatio-temporal navigation map by combining the multi-target behavior prediction and other means; by increasing the temporal dimension, the static obstacles and dynamic obstacles are unified into the same parameter space. Under this parameter space, the front-end A* path search initializes the unified B spline curve control points, designs the trajectory cost function and performs nonlinear optimization to generate a spatio-temporal trajectory that satisfies the safety collision-free and vehicle motion constraints (speed and acceleration limits), thus transforming the decision and planning problem under the two-dimensional fence dynamic physical space into a static scene decision and planning problem under the three-dimensional spatio-temporal space. Through simulation verification, the whole process of the proposed trajectory planning method takes 51.27ms on average, which meets the driving requirements of driverless cars. In addition, by adjusting the search conditions of the A* algorithm, its overall planning efficiency is improved by 27.86% compared with the search speed of the traditional algorithm. The actual feeling and data results from the real vehicle experiments show its good tracking effect, which verifies the effectiveness and practicality of the algorithm proposed in this paper.
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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.005 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.006 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".