Trajectory Optimization for Autonomous Highway Driving Using Quintic Splines
Bibliographic record
Abstract
This paper introduces a robust and efficient Localized Spline-based Path-Planning (LSPP) algorithm designed to enhance autonomous vehicle navigation on highways. The LSPP approach prioritizes smooth maneuvering, obstacle avoidance, passenger comfort, and adherence to road constraints, including lane boundaries, through optimized trajectory generation using quintic spline functions and a dynamic speed profile. Leveraging real-time data from the vehicle’s sensor fusion module, the LSPP algorithm accurately interprets the positions of surrounding vehicles and obstacles, creating a safe, dynamically feasible path that is relayed to the Model Predictive Control (MPC) track-following module for precise execution. The theoretical distinction of LSPP lies in its modular integration of: (1) a finite state machine (FSM)-based decision-making layer that selects maneuver-specific goal states (e.g., keep lane, change lane left/right); (2) quintic spline optimization to generate smooth, jerk-minimized, and kinematically consistent trajectories; (3) a multi-objective cost evaluation framework that ranks competing paths according to safety, comfort, and efficiency; and (4) a closed-loop MPC controller to ensure real-time trajectory execution with robustness. Extensive simulations conducted in diverse highway scenarios and traffic conditions demonstrate LSPP’s effectiveness in delivering smooth, safe, and computationally efficient trajectories. Results show consistent improvements in lane-keeping accuracy, collision avoidance, enhanced materials wear performance, and planning responsiveness compared to traditional path-planning methods. These findings confirm LSPP’s potential as a practical and high-performance solution for autonomous highway driving.
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 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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".