Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Performance metrics and bounds for Kalman filters with unknown or misspecified models
Download
10818656.pdf
Date
2026-7-02
Author
Kurt, Batın
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
58
views
0
downloads
Cite This
This thesis proposes analytical and computationally efficient performance prediction methods for various Kalman filtering and smoothing algorithms under unknown or misspecified models. The considered setting is motivated by 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 true state trajectory is deterministic and available as reference data for performance evaluation, whereas Kalman filter and smoother-based estimators are derived under assumed stochastic state-space models. In addition, the true measurement model may differ from the model assumed by the estimators. This mismatched setting makes performance assessment nontrivial, while Monte Carlo evaluation can be computationally expensive. To address these problems, analytical mean square error (MSE) expressions are derived for the Kalman filter and smoother under deterministic state trajectories and measurement-model mismatch. Although the resulting batch and horizon-recursive formulations provide exact analytical performance predictions, their computational complexities grow cubically and quadratically, respectively, with the trajectory length. To overcome this limitation, an equivalent formulation of the Kalman smoother is considered, in which independent forward and backward recursions enable MSE computation with linear time complexity. The analysis is then extended to nonlinear systems by considering the iterated extended Kalman smoother under deterministic state trajectories and measurement-model misspecification. For this case, a lower bound on the MSE is derived using the misspecified Cramér-Rao lower bound. Simulation results validate the proposed methods and bounds, demonstrating their accuracy and computational efficiency for performance assessment.
Subject Keywords
Performance Prediction
,
Kalman Filter
,
Kalman Smoother
,
Model Misspecification
,
Fixed State Trajectories
URI
https://hdl.handle.net/11511/119934
Collections
Graduate School of Natural and Applied Sciences, Thesis
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
B. Kurt, “Performance metrics and bounds for Kalman filters with unknown or misspecified models,” M.S. - Master of Science, Middle East Technical University, 2026.