Advanced Path Planning for Autonomous Street-Sweeper Fleets under Complex Operational Conditions
Bibliographic record
Abstract
In recent years, autonomous mobile platforms have seen an increase in usage in several applications. One of which is street-sweeping. Although street-sweeping is a necessary process due to health and cleanliness, fleet operations are difficult to plan optimally. Since each vehicle has several constraints (battery, debris, and water), path planning becomes increasingly difficult to perform manually. Additionally, in real-world applications vehicles may become inactive due to a breakdown, which requires real-time scheduling technology to update the paths for the remaining vehicles. In this paper, the fleet street-sweeping problem can be solved using the proposed lower-level and higher-level path generation methods. For the lower level, a Smart Selective Navigator algorithm is proposed, and a modified genetic algorithm is used for the higher-level path planning. A case study was presented for Uchi Park, South Korea, where the proposed methodology was validated. Specifically, results generated from the ideal scenario (all vehicles operating) were compared to the breakdown scenario, where little to no difference in the overall statistics was observed. Additionally, the lower-level path generation could yield solutions with over 94% area coverage.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".