Path Planning Method for Electric Vehicles Based on Freeway Network
Bibliographic record
Abstract
Recently, electric vehicles (EVs) have received more and more attention, but the problem of the insufficient range is still the main reason that hinders electric vehicles to travel long distances. Under the premise of the battery capacity without technological innovation, the path planning method can ensure the safety and efficiency of electric vehicles in long-distance travel. This paper studies the actual freeway network to optimize the vehicle driving path and give the charging strategy based on the shortest travel time of a single vehicle. In this paper, a path and charging strategy planning model is proposed. In this model, the shortest travel time of a single vehicle is taken as the objective function, and the state of charging equipment in the actual road network and the safe electric quantity are considered as constraints. And the genetic algorithm is used to solve the model. Through case analysis, the rationality and optimization efficiency of the model proposed in this paper are verified. Finally, the sensitivity analysis of the three parameters of traffic volume, temperature, and travel speed is carried out with the Shanghai-Nanjing freeway network. The experimental results can get the nodes with the highest service pressure in the network, which can provide a theoretical basis for charging nodes’ expansion in the freeway network in the future.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.007 | 0.001 |
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".