Toward Safer and Energy Efficient Global Trajectory Planning of Self-Guided Vehicles for Material Handling System in Dynamic Environment
Bibliographic record
Abstract
For a sustainable operation of multiple Self-Guided Vehicles (SGVs) in a dynamic manufacturing environment, it is essential to guarantee collision-free and efficient navigation to the autonomous mobile platforms and safety to the surrounding subjects. To prevent from navigation failures, an SGV must avoid conflicts that constrain itself to abruptly brake or stop to avoid collisions. These inefficient conflicts result from unexpected changes in the configuration space or due to nearby unforeseen obstacle. In this paper, a navigation approach is proposed to adapt the global trajectory in order to reduce conflict occurrence while limiting energy consumption of the mobile platform. To generate such trajectory, first the collision risks are characterized using an objective risk perception parameter, the Time-To-Collision TTC, that rely on the kinematics of the egoSGV and the neighboring obstacles. Next, weighted Kernel Density Estimation (wKDE) defines the spatial distribution of conflict severity in configuration space. The defined zones are incorporated as a conflict layer in the global map. Then, a global trajectory planner algorithm is used to weigh between the length cost and conflict cost. Finally, to test the proposed solution, a simulation is performed in a factory-like environment, then an experiment is conducted with a real SGV. In comparison with the state-of-the-art geometrical path planning method, the results show that the proposed approach reduces navigation failures by up to 52%, while reducing the trajectory execution time by around up to 10 %. Also, the smoothness of the executed motion allowed to reduce energy consumption by over 12%.
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.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".