Multi-Vehicle Tracking With Road Maps and Car-Following Models
Bibliographic record
Abstract
Multi-vehicle tracking is crucial in many applications, such as traffic surveillance, intelligent transportation systems, and advanced driver assistance systems. Most conventional multi-target tracking algorithms are not ideal for multi-vehicle tracking, since they assume that the targets move independently of one another. However, due to traffic volume and limited lane resources, vehicles have to interact with their neighbors, resulting in highly dependent motions. To address this limitation, this paper proposes a novel multi-vehicle tracking algorithm for the single-lane case that considers motion dependence across vehicles by integrating the car-following model (CFM) into the tracking process with on-road constraints. A new CFM-based motion model that describes the dependent motion of vehicles in the single-lane case is proposed, and the notion of car-following clusters is defined. In order to exploit all available information in sensor measurements, the proposed algorithm updates the state estimates of car-following clusters by utilizing a stacked-update strategy. Furthermore, the variable structure interacting multiple model estimator is modified and integrated into the proposed algorithm to handle maneuvers that may violate the CFM. Simulation results demonstrate the superiority of the proposed multi-vehicle tracking algorithm over other state-of-the-art multi-vehicle tracking algorithms.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".