Sensor-based navigation for car-like mobile robots based on a generalized Voronoi graph
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
Our research objective is to realize sensor-based navigation for car-like mobile robots. We adopt the generalized Voronoi graph (GVG) for the robot's local path and a map representation. It has the advantage to describe the mobile robot's path for sensor-based navigation from the point of view of completeness and safety. However, it is impossible to apply the path to car-like mobile robots directly, because the limitation of the minimum turning radius for a car-like robot may prevent it from following the GVG exactly. To solve this problem, we propose a local smooth path-planning algorithm for car-like mobile robots. Basically, an initial local path is generated by a conventional path-planning algorithm using GVG theory and it is modified smoothly by a Bezier curve to enable the car-like robots to follow it by maximizing our evaluation function. In this paper, we introduce a local smooth path-planning algorithm based on the GVG and explain the details of our evaluation function. Simulation and experimental results support the validity of the algorithm.
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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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