Optimal Cooperative Path Planning Considering Driving Intention for Shared Control
Bibliographic record
Abstract
<div class="section abstract"><div class="htmlview paragraph">This paper presents an optimal cooperative path planning method considering driver’s driving intention for shared control to address target path conflicts during the driver-automation interaction by using the convex optimization technique based on the natural cubic spline. The optimal path criteria (e.g. the optimal curvature, the optimal heading angle) are formulated as quadratic forms using the natural cubic spline, and the initial cooperative path profiles of the cooperative path in the Frenet-based coordinate system are induced by considering the driver’s lane-changing intention recognized by the Support Vector Machine (SVM) method. Then, the optimal cooperative path could be obtained by the convex optimization techniques. The noncooperative game theory is adopted to model the driver-automation interaction in this shared control framework, where the Nash equilibrium solution is derived by the model predictive control (MPC) approach. Finally, the proposed framework is tested with different driver’s driving intentions to avoid obstacles on a straight road and a curvy road. As a result, the planned path could continuously adapt to the driving intention and various road shapes, and the path conflicts between the human driver and the controller is also decreased by the proposed cooperative path planning method in the game-based shared control framework.</div></div>
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.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.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 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".