MétaCan
Menu
Back to cohort
Record W1583427947 · doi:10.1115/imece2014-36412

Automotive Tracking Technique Using a New IMM Based PDA-SVSF

2014· article· en· W1583427947 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsMcMaster University
Fundersnot available
KeywordsKalman filterClutterComputer scienceTracking (education)Probabilistic logicVehicle dynamicsControl theory (sociology)AlgorithmEngineeringArtificial intelligenceAutomotive engineeringRadar

Abstract

fetched live from OpenAlex

Car tracking algorithms are important for a number of applications, including self-driving cars and vehicle safety systems. The probabilistic data association (PDA) algorithm, in conjunction with Kalman Filter (KF), and interacting multiple model (IMM) are well studied, specifically in the aero-tracking applications. This paper studies single targets while performing maneuvers in the presence of clutter, which is a common scenario for road vehicle tracking applications. The relatively new smooth variable structure filter (SVSF) is demonstrated to be robust and stable filtering strategy under the presence of modeling uncertainties. In this paper, SVSF based PDA technique is combined with IMM method. The new method, referred to as IMM-PDA-SVSF is simulated under several possible car motion scenarios. Also, the algorithm is tested on a real experimental data acquired by GPS device.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.881
Threshold uncertainty score0.710

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.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.026
GPT teacher head0.258
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