State estimations and noise identifications with intermittent corrupted observations via Bayesian variational inference
Authors: Peng Sun, Ruoyu Wang, Xue Luo
Organizations: School of Mathematical Sciences, Beihang University, Beijing, P. R. China 102206. · School of Mathematical Sciences, Beihang University, Beijing, P. R. China 102206, and Key Laboratory of Mathematics, Informatics and Behavioral Semantics (LMIB), Beihang University, Beijing, P. R. China 100191.
This paper focuses on the state estimation problem in distributed sensor networks, where intermittent packet dropouts, corrupted observations, and unknown noise covariances coexist. To tackle this challenge, we formulate the joint estimation of system states, noise parameters, and network reliability as a Bayesian variational inference problem, and propose a novel variational Bayesian adaptive Kalman filter (VB-AKF) to approximate the joint posterior probability densities of the latent parameters. Unlike existing AKF that separately handle missing data and measurement outliers, the proposed VB-AKF adopts a dual-mask generative model with two independent Bernoulli random variables, explicitly characterizing both observable communication losses and latent data authenticity. Additionally, the VB-AKF integrates multiple concurrent multiple observations into the adaptive filtering framework, which significantly enhances statistical identifiability. Comprehensive numerical experiments verify the effectiveness and asymptotic optimality of the proposed method, showing that both parameter identification and state estimation asymptotically converge to the theoretical optimal lower bound with the increase in the number of sensors.
Figures & tables
Fig. 1: Generative model of the linear filtering problem ( 1 )-( 2 ) with packet dropout and corrupted noises. Shaded nodes: observable variables; unshaded circles: latent parameters to be estimated; rectangles: hyper-parameters in priors.
Fig. 2: Latent parameters dependency. Global parameters shared across all sensor nodes, while local parameters (subscript i,k ) are different among individual sensors.
x^k∣k−1(j)=
Fkx^k−1∣k−1,
Pk∣k−1(j)=
FkPk−1∣k−1FkT+(EQk(j−1))−1.
Algorithm 1 Our proposed VB-AKF
Fig. 3: The RMSE of the state convergence comparison between the oracle KF and the proposed VB-AKF with different numbers of observation nodes N .
Fig. 4: State estimation and noise variance inferences under non-stationary perturbations with N=5 sensor nodes. Top: State trajectory tracking; Middle: Inference of observation noise variance Rk ; Bottom: Inference of process noise variance Qk .
Fig. 5: Performance of the proposed VB-AKF under severe data degradation (60% packet dropout and 60% data corruption). Top: Dropout rate inference; Second: Data clean rate identification; Third: Joint inference of process noise Qk and observation noise Rk ; Bottom: State estimation via centralized sequential fusion.
Fig. 6: Sensitivity analysis and statistical identifiability of corruption rate inference. (a) Identifiability degradation under strong baseline observation noise. (b) Exponential error convergence beyond the anomaly intensity threshold. (c) Identifiability degradation under intense process noise variations.
Department of Civil and Construction Engineering and Management, The University of Texas at Tyler, Tyler, TX, 75799, USA · Department of Civil, Environmental, and Geodetic Engineering, The Ohio State University, Columbus, OH, 43210, USA