MétaCan
Menu
Back to cohort

Optimal Speed Plan for the Overtaking of Autonomous Vehicles on Two-Lane Highways

2020· article· en· W3014882487 on OpenAlexafffund
Said M. Easa, Maksym Diachuk

Bibliographic record

VenueInfrastructures · 2020
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsToronto Metropolitan University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsOvertakingSensitivity (control systems)HeuristicTask (project management)Position (finance)SimulationComputer sciencePower (physics)Mode (computer interface)Control (management)Control theory (sociology)Automotive engineeringEngineeringTransport engineeringArtificial intelligence

Abstract

fetched live from OpenAlex

In passing maneuvers on two-lane highways, assessing the needed distance and the potential power reserve to ensure the required speed mode of the passing vehicle is a critical task of speed planning. This task must meet several mutually exclusive conditions that lead to successful maneuvers. This paper addresses three main aspects. First, the issues associated with a rational distribution of the speed of the passing vehicle for overtaking a long commercial vehicle on two-lane highways are discussed. The factors that affect the maneuver effectiveness are analyzed, considering the safety and cost. Second, a heuristic algorithm is proposed based on the rationale for choosing the necessary space and time for overtaking. The initial prediction’s sensitivity to fluctuations of the current measurements of the position and speed of the overtaking participants is examined. Third, an optimization technique for the passing vehicle speed distribution during the overtaking time using the finite element method is presented. Adaptive model predictive control is applied for tracking the references being generated. The presented model is illustrated using a simulation.

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.001
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.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0010.001
Scholarly communication0.0010.000
Open science0.0000.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0020.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.035
GPT teacher head0.265
Teacher spread0.231 · 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

Citations15
Published2020
Admission routes2
Has abstractyes

Explore more

Same venueInfrastructuresSame topicRobotic Path Planning AlgorithmsFrench-language works237,207