MétaCan
Menu
Back to cohort
Record W3099595741 · doi:10.1177/0361198120959329

Systematic Evaluation of a Multi-Lane Green-Driving Algorithm in a Mixed Connected Environment

2020· article· en· W3099595741 on OpenAlexaff
Hao Yang, Kentaro Oguchi

Bibliographic record

VenueTransportation Research Record Journal of the Transportation Research Board · 2020
Typearticle
Languageen
FieldEngineering
TopicTraffic control and management
Canadian institutionsMcMaster University
Fundersnot available
KeywordsSmoothingAlgorithmComputer scienceWork (physics)Energy (signal processing)Control (management)Efficient energy useTransport engineeringSimulationEngineeringMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

Vehicles traveling under oscillated traffic have low energy efficiency and high air pollutant emissions. Green driving with the help of connected vehicles (CVs) attracts a lot of research effort to improve vehicle energy efficiency. However, it is very challenging to perform green driving on multi-lane freeways under a mixed connected environment. In the researchers’ previous work, one innovative green-driving algorithm was proposed to solve the multi-lane problem with only one CV. In this study, a systematic analysis of the algorithm is conducted to understand its benefits and limitations on smoothing traffic oscillations. The effect of the steady states and the number of lanes is also analyzed. In addition, the algorithm is extended to a more general scenario with multiple CVs. The extended system coordinates multiple CVs to form multiple moving bottlenecks to mitigate traffic oscillation more efficiently as well as providing more realistic instructions to CVs. The evaluation of the extended system concludes with the most effective strategies to control CVs to smooth oscillations.

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.002
metaresearch head score (Gemma)0.005
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: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

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

Opus teacher head0.086
GPT teacher head0.328
Teacher spread0.242 · 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

Citations2
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueTransportation Research Record Journal of the Transportation Research BoardSame topicTraffic control and managementFrench-language works237,207