Real-time path planning and following for nonholonomic unmanned ground vehicles
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
This paper describes a computationally cost-effective path planning method by combining a hybrid A∗ path planner with potential fields. The proposed real-time path planner is capable of finding the optimal, collision-free path for a non-holonomic unmanned ground vehicle (UGV) in an unstructured environment. First, a hybrid A <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∗</sup> path planner is designed to find the optimal path through connecting the current position of the UGV to the target in real-time while avoiding any obstacles in the vicinity of UGV. The advantages of the developed path planner are that, by using the potential field techniques and by excluding the nodes surrounding every obstacles, it significantly reduces the search space of the traditional A <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∗</sup> approach; it is also capable of distinguishing different types of obstacles by giving them distinct priorities based on their natures and safety concerns. Such an approach is essential to guarantee a safe navigation in the environment where humans are in close contact with autonomous vehicles. Then, with consideration of the kinematic constraints of the UGV, a smooth and drivable geometric path is generated. Finally, extensive practical experiments are conducted in a dynamic environment to verify the effectiveness of the proposed path planning methodology.
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.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| 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