A Novel Local Motion Planning Framework for Autonomous Vehicles Based on Resistance Network and Model Predictive Control
Bibliographic record
Abstract
This paper presents a novel local motion planning framework in a hierarchical manner for autonomous vehicles to follow a trajectory and agilely avoid obstacles. In the upper layer, a new path-planning method based on the resistance network is applied to plan behaviors (e.g. lane keeping or changing), where the human-like factors can be included to simulate different driver styles, such as the aggressive, moderate, and conservative. The planned results (i.e. the lane-change command and the local planned path) will guide the lower-layer planner to decide the local motion. In the lower layer, for the sake of simplicity and alleviation of the computational burden, two separate model predictive controllers (MPC) based on a point-mass kinematic model are utilized for both longitudinal and lateral motion planning. Finally, a super-twisting sliding mode controller (STSMC) based motion tracker is designed to show the feasibility of the proposed decoupled planning method and decide the desired control actions of autonomous vehicles. Several scenarios are defined to comprehensively test and demonstrate the effectiveness and the real-time applicability of the new motion-planning framework. The results show that the proposed method performs very well in the planning and tracking process and takes less than 25 ms for the whole planning process, which can be easily implemented in real-world applications.
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.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 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".