Obstacle Avoidance in Real Time With Nonlinear Model Predictive Control of Autonomous Vehicles
Bibliographic record
Abstract
A Nonlinear model predictive control (NMPC) for trajectory tracking with the obstacle avoidance of autonomous road vehicles traveling at realistic speeds is presented in this paper, with a focus on the performance of those controllers with respect to the look-ahead horizon of the NMPC. Two different methods of obstacle avoidance are compared and then the NMPC is tested in several simulated but realistic tracking scenarios involving static obstacles on constrained roadways. In order to simplify the vehicle dynamics, a bicycle model is used for the prediction of future vehicle states in the NMPC framework. However, a high-fidelity, nonlinear CarSim vehicle model is used to evaluate the vehicle performance and test the controllers in the simulation results. The CPU time is also analyzed to evaluate these schemes for real-time applications. The results show that the NMPC controller provides satisfactory online tracking performance in a realistic scenario at normal road speeds while still satisfying the real-time constraints. In addition, it is shown that the longer prediction horizons allow for better responses of the controllers, which reduce the deviations while avoiding the obstacles, as compared with shorter horizons.
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.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.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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 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".