MétaCan
Menu
Back to cohort
Record W2909577512 · doi:10.1109/iemcon.2018.8614944

Fuel Efficient Route Planning Using VANET

2018· article· en· W2909577512 on OpenAlexaff
Nazmul Sumon, Arunita Jaekel

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsComputer scienceVehicular ad hoc networkScalabilityKey (lock)Traffic congestionComputer networkWireless ad hoc networkTRIPS architectureMetric (unit)Route planningWirelessTransport engineeringTelecommunicationsComputer securityEngineeringDatabase

Abstract

fetched live from OpenAlex

Traffic congestion due to overloaded road infrastructure is a key contributing factor of global warming. Dynamic route planning (DRP) of vehicles can be helpful to reduce congestion and provide faster and more fuel-efficient trips for vehicles. VANET (Vehicular Ad Hoc Network) and its associated WAVE (Wireless Access in Vehicular Environment) standards facilitate this process, by allowing vehicles to share accumulated travel data with each other and plan their routes based on the gathered information. Communication and decision making can be carried out using centralized or distributed approach and should consider network usage and scalability. In this paper, we propose a novel and scalable dynamic route planning approach that uses real-time traffic information to update vehicle routes. We introduce the concept of a delay threshold at intersections to identify traffic congestion and propose a hybrid metric that considers average travel time and occupancy rate for each road segment. Our simulation results indicate that the proposed approach can lead to reductions in trip time and carbon emissions.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.020
Threshold uncertainty score0.039

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.017
GPT teacher head0.240
Teacher spread0.223 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations7
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicVehicular Ad Hoc Networks (VANETs)French-language works237,207