Optimization-based Path Planning for an Autonomous Vehicle in a Racing Track
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
Path planning is discussed in this article for an autonomous vehicle given a route to follow. Route data is considered to be available for a distance ahead of the vehicle in a receding horizon manner. Linear approximation of the nonlinear equations for a vehicle following a path is obtained. Based on these equations, the optimization problem is formed in a convex optimization format and solved to find the optimal path. Optimality is a trade-off between comfort and travel time. Results are provided for some cases considering that the vehicle is traveling in the Suzuka circuit and the observable horizon ahead of the vehicle is a part of this track. Results are discussed for a few trade-off values and analyzed from the practical point of view, which shows that the method is capable of producing an optimal path to follow in an insignificant amount of time. Finally, an alternative approach for improving model accuracy is proposed and discussed. Finally, it has been concluded that the proposed method has a significant potential for motion planning/controlling applications for an autonomous vehicle using model predictive control.
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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 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