Covariance intersection explained

Covariance intersection (CI) is an algorithm for combining two or more estimates of state variables in a Kalman filter when the correlation between them is unknown.[1] [2] [3] [4]

Formulation

Items of information a and b are known and are to be fused into information item c. We know a and b have mean/covariance

\hata

,

A

and

\hatb

,

B

, but the cross correlation is not known. The covariance intersection update gives mean and covariance for c as

C-1=\omegaA-1+(1-\omega)B-1,

\hatc=C(\omegaA-1\hata+(1-\omega)B-1\hatb).

where ω is computed to minimize a selected norm, e.g., the trace, or the logarithm of the determinant. While it is necessary to solve an optimization problem for higher dimensions, closed-form solutions exist for lower dimensions.[5]

Application

CI can be used in place of the conventional Kalman update equations to ensure that the resulting estimate is conservative, regardless of the correlation between the two estimates, with covariance strictly non-increasing according to the chosen measure. The use of a fixed measure is necessary for rigor to ensure that a sequence of updates does not cause the filtered covariance to increase.[1] [6]

Advantages

According to a recent survey paper [7] and,[8] the covariance intersection has the following advantages:

  1. The identification and computation of the cross covariances are completely avoided.
  2. It yields a consistent fused estimate, and thus a non-divergent filter is obtained.
  3. The accuracy of the fused estimate outperforms each local one.
  4. It gives a common upper bound of actual estimation error variances, which has robustness with respect to unknown correlations.

These advantages have been demonstrated in the case of simultaneous localization and mapping (SLAM) involving over a million map features/beacons.[9]

Motivation

It is widely believed that unknown correlations exist in a diverse range of multi-sensor fusion problems. Neglecting the effects of unknown correlations can result in severe performance degradation, and even divergence. As such, it has attracted and sustained the attention of researchers for decades. However, owing to its intricate, unknown nature, it is not easy to come up with a satisfying scheme to address fusion problems with unknown correlations. If we ignore the correlations, which is the so-called "naive fusion",[10] it may lead to filter divergence. To compensate this kind of divergence, a common sub-optimal approach is to artificially increase the system noise. However, this heuristic requires considerable expertise and compromises the integrity of the Kalman filter framework.[11]

Notes and References

  1. Ph.D. . Jeffrey . Uhlmann . 47808603 . Dynamic Map Building and Localization: New Theoretical Foundations . University of Oxford . 1995.
  2. Sonia . Marques . Covariance intersection algorithm for formation flying spacecraft navigation from RF measurements . 4 ISLAB workshop . 12 November 2007 .
  3. Simon J. . Julier . Jeffrey K. . Uhlmann . 2007 . 10.1.1.106.8515 . Using covariance intersection for SLAM . Robotics and Autonomous Systems . 55 . 7 . 3–20 . 10.1016/j.robot.2006.06.011.
  4. Lingji . Chen . Pablo O. . Arambel . Raman K. . Mehra . 2002 . Fusion under unknown correlation - Covariance intersection as a special case . International Conference on Information Fusion 2002 .
  5. Marc . Reinhardt . Benjamin . Noack . Uwe D. . Hanebeck . 2012 . Closed-form Optimization of Covariance Intersection for Low-dimensional Matrices . International Conference on Information Fusion 2012 .
  6. Elsevier . Jeffrey . Uhlmann . Covariance Consistency Methods for Fault-Tolerant Distributed Data Fusion . 4 . 201–215 . 2003.
  7. Wangyan Li, Zidong Wang, Guoliang Wei, Lifeng Ma, Jun Hu, and Derui Ding. "A Survey on Multi-Sensor Fusion and Consensus Filtering for Sensor Networks." Discrete Dynamics in Nature and Society, vol. 2015, Article ID 683701, 12 pages, 2015. http://www.hindawi.com/journals/ddns/2015/683701/
  8. Sequential covariance intersection fusion Kalman filter. Information Sciences. 2012-04-15. 293–309. 189. 10.1016/j.ins.2011.11.038. Zili. Deng. Peng. Zhang. Wenjuan. Qi. Jinfang. Liu. Yuan. Gao.
  9. Julier . S. . Uhlmann . J. . Building a Million-Beacon Map. . Proceedings of ISAM Conference on Intelligent Systems for Manufacturing . 2001. 10.1117/12.444158 .
  10. Analytical and Computational Evaluation of Scalable Distributed Fusion Algorithms. IEEE Transactions on Aerospace and Electronic Systems. 2010-10-01. 0018-9251. 2022–2034. 46. 4. 10.1109/TAES.2010.5595611. K.C.. Chang. Chee-Yee. Chong. S.. Mori. 2010ITAES..46.2022C. 46201683 .
  11. Book: Niehsen, W.. 2002-07-01. 901–904 vol.2. 2. 10.1109/ICIF.2002.1020907. Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997) . Information fusion based on fast covariance intersection filtering . 978-0-9721844-1-0. 122743543 .

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Covariance intersection".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.