Vehicle Path Recognition Approach Based on Incomplete Automatic Vehicle Identification
Bibliographic record
Abstract
Vehicle path recognition is one of the key methods used in urban traffic research, such as traffic flow characteristics analysis. Automatic vehicle identification (AVI) is often used for vehicle path recognition and is suitable for mixed traffic flow with connected automated vehicles (CAVs). However, there still remain issues in overcoming the difficulty of vehicle path identification caused by the discontinuity of AVI data and solving the problem of low precision of AVI application. To model the vehicle path, this paper selects the AVI system of Yicheng Town, Linfen City, Shanxi Province, as a test bed. The travel modes of private cars and taxis are discussed, and the quantified indicators of the model are determined. By combining the analytic hierarchy process (AHP) with the entropy weight method (EWM) to get the weights of the indicators, the path recognition model under incomplete AVI data is proposed. Finally, based on the path recognition model proposed in this paper, case studies are carried out for the private car and taxi path recognition, respectively. The validity of the path identification through practical studies and the effect of the number of missing nodes of AVI equipment on the accuracy of the model are discussed. The results show that the recognition of the travel path using the proposed model is consistent with the actual travel path. The accuracy of the proposed model is more than 60% when the number of missing nodes is less than 7 in total 31 nodes. Considering the decision models for private cars and taxis, respectively, the proposed model provides a method for vehicle path recognition based on incomplete AVI data.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".