MétaCan
Menu
Back to cohort
Record W2962903771 · doi:10.1109/tits.2018.2820044

Cooperative Vehicle Speed Fault Diagnosis and Correction

2018· article· en· W2962903771 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

VenueIEEE Transactions on Intelligent Transportation Systems · 2018
Typearticle
Languageen
FieldComputer Science
TopicNetwork Time Synchronization Technologies
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsAutomotive industryFault (geology)CAN busEngineeringTraction control systemComputer scienceVehicle dynamicsTelecommunications networkControl engineeringFunction (biology)Traction (geology)Real-time computingAutomotive engineeringComputer network

Abstract

fetched live from OpenAlex

Reliable estimation of vehicle speed is an active topic of research in the automotive industry and academia due to its technical challenges as well as applications to vehicle traction and stability control. In this direction, the emergence of new generations of communication technologies has brought new perspectives to traditional studies on vehicle speed estimation and control. To this end, this paper introduces a cooperative vehicle speed fault diagnosis and correction algorithm. The distributed part of the algorithm is based on a distributed function calculation algorithm for vehicle networks. The introduced algorithm enables each vehicle to gather some information from other vehicles in the network in a distributed manner and is robust to communication failures. A procedure to use such information for a single vehicle to diagnose and correct a possible fault in its own speed estimation/measurement is discussed. The functionality and performance of the proposed algorithms are verified via illustrative examples and simulation results.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.964
Threshold uncertainty score0.911

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.001
Open science0.0000.000
Research integrity0.0000.000
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.022
GPT teacher head0.255
Teacher spread0.232 · 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