MétaCan
Menu
Back to cohort
Record W2290852076 · doi:10.1109/glocom.2015.7417852

Movement Prediction in Vehicular Networks

2015· article· en· W2290852076 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venue2015 IEEE Global Communications Conference (GLOBECOM) · 2015
Typearticle
Languageen
FieldEngineering
TopicVehicular Ad Hoc Networks (VANETs)
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceKalman filterReliability (semiconductor)Hidden Markov modelMovement (music)Reduction (mathematics)Filter (signal processing)Extended Kalman filterMarkov chainArtificial intelligenceMachine learningPower (physics)Mathematics

Abstract

fetched live from OpenAlex

The fast and frequent movement of vehicles creates many challenges in vehicular networks, such as handling regular topological changes. Predicting a vehicle's future location by preemptively adjusting to changes caused by vehicle movements is a potential solution to many of these problems. However, reliably predicting vehicle movement remains an issue due to its stochastic nature. This paper proposes a prediction method that probabilistically analyzes the vehicle's current movement to determine the vehicle's future steps. This is accomplished by combining the Kalman filter and hidden Markov model to include both temporal and historical data, thus improving the prediction reliability by the consideration of more system variables. The proposed approach is tested and compared to other recent approaches through simulation using SUMO and NS-2. The results show a 50% prediction error reduction of the proposed approach in comparison to other methods.

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.

Full frame distilled prediction

Teacher imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.608
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.043
GPT teacher head0.271
Teacher spread0.228 · 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