Digital Twins Based Intelligent State Prediction Method for Maneuvering-Target Tracking
Bibliographic record
Abstract
Maneuvering-target tracking has always been an important and challenge work because the unknown and changeable motion-models can easily lead to the failure of model-driven target tracking. Recently, many neural network methods are proposed to improve the tracking accuracy by constructing direct mapping relationships from noisy observations to target states. However, limited by the coverage of training data, those data-driven methods suffer other problems, such as weak generalization abilities and unstable tracking effects. In this paper, a digital twin system for maneuvering-target tracking is built, and all kinds of simulated data are created with different motion-models. Based on those data, the features of noisy observations and their relationship to target states are found by two specially designed neural networks: one eliminates the observation noises and the other one predicts the target states according to the noise-limited observations. Combining the above two networks, the state prediction method is proposed to intelligently predict targets by understanding the information of motion-model hidden in noisy observations. Simulation results show that, in comparison with the state-of-the-art model-driven and data-driven methods, the proposed method can correctly and timely predict the motion-models, increase the tracking generalization ability and reduce the tracking root-mean-squared-error by over 50% in most of maneuvering-target tracking scenes.
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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".