GRU-based Adaptive Exponentially Weighted Kalman Filter With Forgetting Factor Learning

This study proposes a Gated Recurrent Unit (GRU)-based Adaptive Exponentially Weighted Kalman Filter (GEWKF) to dynamically estimate the forgetting factor, addressing the limitations of conventional exponentially weighted Kalman filters (EWKFs) relying on fixed parameters. Unlike static EWKFs, the proposed GEWKF adaptively tunes the forgetting factor in real time, enhancing robustness and estimation accuracy during abrupt model changes. In contrast to previous deep learning-based adaptive filters that predict complex covariance matrices or full filter gains often at high computational cost and interpretability, GEWKF learns only a single scalar parameter while preserving the recursive framework of the standard Kalman filter. A GRU-based recurrent neural network leverages time-series data, including state prediction errors and measurement residuals, to compute the optimal forgetting factor efficiently and reliably. Simulations reveal that the GEWKF filter matches the performance of the standard Kalman filter under nominal conditions and significantly outperforms both the standard KF and fixed-parameter EWKF under sudden uncertainties. These results highlight that the GEWKF offers a practical and principled framework for state estimation, balancing adaptability, computational efficiency, real-time applicability, and interpretability.

Authors

Publication Details

Journal
Journal of Institute of Control Robotics and Systems
Published
2026-01-13
DOI
https://doi.org/10.5302/j.icros.2026.25.0241
Primary Topic
Target Tracking and Data Fusion in Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GRU-based Adaptive Exponentially Weighted Kalman Filter With Forgetting Factor Learning

Bo-Kyu Kwon, Sun-Ho Jang, Soyeon Kwon
Journal of Institute of Control Robotics and Systems
Target Tracking and Data Fusion in Sensor Networks
article

GRU-based Adaptive Exponentially Weighted Kalman Filter With Forgetting Factor Learning

Bo-Kyu Kwon, Sun-Ho Jang, Soyeon Kwon
article en

Abstract

This study proposes a Gated Recurrent Unit (GRU)-based Adaptive Exponentially Weighted Kalman Filter (GEWKF) to dynamically estimate the forgetting factor, addressing the limitations of conventional exponentially weighted Kalman filters (EWKFs) relying on fixed parameters. Unlike static EWKFs, the proposed GEWKF adaptively tunes the forgetting factor in real time, enhancing robustness and estimation accuracy during abrupt model changes. In contrast to previous deep learning-based adaptive filters that predict complex covariance matrices or full filter gains often at high computational cost and interpretability, GEWKF learns only a single scalar parameter while preserving the recursive framework of the standard Kalman filter. A GRU-based recurrent neural network leverages time-series data, including state prediction errors and measurement residuals, to compute the optimal forgetting factor efficiently and reliably. Simulations reveal that the GEWKF filter matches the performance of the standard Kalman filter under nominal conditions and significantly outperforms both the standard KF and fixed-parameter EWKF under sudden uncertainties. These results highlight that the GEWKF offers a practical and principled framework for state estimation, balancing adaptability, computational efficiency, real-time applicability, and interpretability.

Journal of Institute of Control Robotics and SystemsVol. 32(1)
Openalex Percentile: Top 90%
Target Tracking and Data Fusion in Sensor Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.