SYSYSPMar 16

Performance of the Kalman Filter and Smoother for Benchmark Studies

arXiv:2511.2203423.0h-index: 1
Predicted impact top 44% in SY · last 90 daysOriginality Synthesis-oriented
AI Analysis

This work addresses performance evaluation challenges in benchmark studies for target tracking, but it is incremental as it builds on existing Kalman filter methods.

The authors tackled the problem of inaccurate performance prediction in benchmark studies where true system dynamics are unknown, by deriving analytical mean square error expressions for the Kalman filter and smoother, resulting in accurate and computationally efficient predictions without relying on Monte Carlo simulations.

We propose analytical mean square error (MSE) expressions for the Kalman filter (KF) and the Kalman smoother (KS) for benchmark studies, where the true system dynamics are unknown or unavailable to the estimator. In such cases, as in benchmark evaluations for target tracking, the analysis relies on deterministic state trajectories. This setting introduces a model mismatch between the estimator and the true system, causing the covariance estimates to no longer reflect the actual estimation errors. To enable accurate performance prediction for deterministic state trajectories without relying on computationally intensive Monte Carlo simulations, we derive recursive MSE expressions with linear time complexity. The proposed framework also accounts for measurement model mismatch and provides an efficient tool for performance evaluation in benchmark studies involving long trajectories. Simulation results confirm the accuracy and computational efficiency of the proposed method.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes