An SVSF-Based Generalized Robust Strategy for Target Tracking in Clutter
Bibliographic record
Abstract
Autonomous self-drive requires intelligence and cognition that relies on observations and tracking of the state of motion of surrounding vehicles. This information can be acquired by using sensors; however, these are often affected by clutter and noise that, in turn, introduce the issues of estimation and data origin uncertainty into the tracking system. The most popular methods for estimation and tracking are based on the well-studied Kalman filter (KF). KF is optimal when noise is white and remains so despite uncertainties in the filter model; the robustness and stability of the KF is affected if this condition is not met. The smooth variable structure filter (SVSF) is a relatively new method that is more robust to disturbances and uncertainties. The SVSF ensures stability by using a discontinuous corrective term that maintains estimates to within a subspace of the true state trajectory. The discontinuous corrective term results in chattering that is removed by using a smoothing boundary layer. In this paper, a generalized covariance formulation of the SVSF and a generalized optimal time-varying smoothing boundary layer are proposed. The generalized optimal SVSF is then combined with a joint probabilistic data association technique for target tracking. The robustness and accuracy of the new form of filtering and data association is validated and comparatively analyzed by its application to an experimental traffic monitoring system based on Light Detection and Ranging.
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.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.001 |
| 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".