Energy Efficient Routing Estimation in Electric Vehicle with Online Rolling Resistance Estimation
Bibliographic record
Abstract
Against the gas emission and fuel dependency, the number of electrical vehicles (EV) is expected to rise in the future. However, EVs have less autonomy than gas vehicles, causing driver anxiety about EV running out of energy. To reduce driver anxiety of battery electric vehicle (BEV), we aim in this study at finding the near optimal route with minimal energy consumption. First, 10- intersection road network is used to construct the traveling scenario. Road segments vary with respect to length and type of road pavement (Gravel or Asphalt). The proposed routing technique includes a robust estimation of the rolling resistance coefficient. To this end, a Recursive Least Square (RLS)-based algorithm is performed to estimate BEV rolling resistance coefficient on Gravel and Asphalt roads. An experimental work is performed on NEtwork MObility (NEMO) to test and validate the proposed estimation method. Finally, the routing technique is developed in order to give the driver more freedom and convenience to find at each intersection the most efficient road segment in terms of consumed energy. The consumed energy is a function of the segment distance and the estimated rolling resistance coefficient corresponding to Asphalt or Gravel pavement. Our technique allowed finding the near optimal route that allows less power consumption computed at the 5 intersections with the longer distance than the shortest path. This development is a starting point to contribute promoting the use of EVs.
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.000 |
| 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.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".