Toward High Automatic Driving by a Dynamic Optimal Trajectory Planning Method Based on High-Order Polynomials
Bibliographic record
Abstract
This paper intends to present a novel optimal trajectory planning method for obstacle avoidance on highways. Firstly, a mapping from the road Cartesian coordinate system to the road Frenet-based coordinate system is built, and the path lateral offset in the road Frenet-based coordinate system is represented by a function of quintic polynomial respecting the traveled distance along the road centerline. With different terminal conditions regarding its position, heading and curvature of the endpoint, and together with initial conditions of the starting point, the path planner generates a bunch of candidate paths via solving nonlinear equation sets numerically. A path selecting mechanism is further built which considers a normalized weighted sum of the path length, curvature, consistency with the previous path, as well as the road hazard risk. The road hazard is composed of Gaussian-like functions both for the obstacle and road boundaries, which means, if one path is near the obstacle or road boundaries, the driving risk would become large and the path would not be preferred chosen. Then the optimal collision-free path would be transformed back to the road Cartesian coordinate system and used for tracking by the path following module. Moreover, the speed profile along with the optimal path which is also based on polynomials respecting the traveled distance is determined by the multi-object optimization technique, which incorporates the driving comfort and safety simultaneously. Finally, several scenarios for obstacle avoidance on different shapes of the highway are simulated to verify the effectiveness of the proposed framework.
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.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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".