A New Strategy for Combining Nonlinear Kalman Filters With Smooth Variable Structure Filters
Bibliographic record
Abstract
Bayesian filters exemplified by the celebrated Kalman Filter (KF), and its non-linear variants rely on a fairly accurate state-space model of the system under study. To address the issue of modelling uncertainty in state estimation, the smooth variable structure filter (SVSF) was proposed in 2007. Since then, several SVSF variants have been proposed to extend its domain of applicability. In some of these algorithms, SVSF has been viewed as a complementary approach alongside the well-established nonlinear Kalman Filters. This paper seeks a general framework for SVSF formulation to unify some of the recent developments in SVSF literature under one umbrella. In this way, the SVSF variants are revisited as special cases of the proposed framework. This paper proposes a new strategy to combine SVSF filters with other nonlinear filters and puts existing SVSF filters under one umbrella. Six filters are formulated based on the proposed method of combining filters. The proposed filters relax limitations of existing SVSF variants, making the proposed filters more universal. In simulations, the new filters outperform state-of-the-art nonlinear KFs and some existing SVSF filters. To demonstrate the merits of the proposed framework, the new filters are applied to target tracking and are comparatively evaluated.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| 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".