Fully Probabilistic Design for Knowledge Transfer in a Pair of Kalman Filters

The problem of Bayesian knowledge transfer from a secondary to a primary Kalman filter is addressed. The secondary filter makes available its probabilistic data predictor, but an explicit Bayesian conditioning mechanism between the filters is assumed to be unavailable. Thus, fully probabilistic design is adopted. This leads to a novel and fully tractable three-step recursive extension of the traditional Kalman filter flow, involving an extra data-like step for merging the secondary data predictor. An adapted form of the algorithm yields performance in simulation equal to that of measurement vector fusion, with the advantage that the Bayesian design allows full distributional knowledge to be transferred. There is flexibility in the way probabilistic knowledge transfer between interacting Kalman filters can be specified using this optimal Bayesian design strategy, and these options are discussed in the letter.

[1]  J. A. Roecker,et al.  Comparison of two-sensor tracking methods based on state vector fusion and measurement fusion , 1988 .

[2]  Gavriel Salomon,et al.  T RANSFER OF LEARNING , 1992 .

[3]  T. Başar,et al.  A New Approach to Linear Filtering and Prediction Problems , 2001 .

[4]  Václav Smídl,et al.  Variational Bayesian Filtering , 2008, IEEE Transactions on Signal Processing.

[5]  C. Chang,et al.  Kalman filter algorithms for a multi-sensor system , 1976, 1976 IEEE Conference on Decision and Control including the 15th Symposium on Adaptive Processes.

[6]  Miguel Jerez,et al.  Filtering and Smoothing , 2018 .

[7]  Simo Särkkä,et al.  Bayesian Filtering and Smoothing , 2013, Institute of Mathematical Statistics textbooks.

[8]  Miroslav Kárný,et al.  Axiomatisation of fully probabilistic design , 2012, Inf. Sci..

[9]  Ramsey Michael Faragher,et al.  Understanding the Basis of the Kalman Filter Via a Simple and Intuitive Derivation [Lecture Notes] , 2012, IEEE Signal Processing Magazine.

[10]  J. Bernardo Expected Information as Expected Utility , 1979 .