Nonlinear Estimation Techniques Applied on Target Tracking Problems
Bibliographic record
Abstract
This paper discusses the application of four nonlinear estimation techniques on two benchmark target tracking problems. The first problem is a generic air traffic control (ATC) scenario, which involves nonlinear system equations with linear measurements. The second study is a classical ground surveillance problem, where a moving airborne platform with a sensor is used to track a moving target. The tracking scenario is set in two dimensions, with the measurement providing nonlinear bearing-only observations. These two target tracking problems provide a good benchmark for comparing the following nonlinear estimation techniques: the common extended and unscented Kalman filters (EKF/UKF), the particle filter (PF), and the relatively new smooth variable structure filter (SVSF). The results of applying the SVSF on the two target tracking problems demonstrate its stability and robustness. Both of these attributes make use of the SVSF advantageous over other popular methods. The filters performances are quantified in terms of robustness, resilience to poor initial conditions and measurement outliers, and tracking accuracy and computational complexity. The purpose of this paper is to demonstrate the effectiveness of applying the SVSF on nonlinear target tracking problems, which in the past have typically been solved by Kalman or particle filters.
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.006 |
| 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.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".