Computational Complexity Comparison of Multi-Sensor Single Target Data Fusion Methods by MATLAB

  • Hoseini S
  • Reza Ashraf M
N/ACitations
Citations of this article
26Readers
Mendeley users who have this article in their library.

Abstract

Target tracking using observations from multiple sensors can achieve better estimation performance than a single sensor. The most famous estimation tool in target tracking is Kalman filter. There are several mathematical approaches to combine the observations of multiple sensors by use of Kalman filter. An important issue in applying a proper approach is computational complexity. In this paper, four data fusion algorithms based on Kalman filter are considered including three centralized and one decentralized methods. Using MATLAB, computational loads of these methods are compared while number of sensors increases. The results show that inverse covariance method has the best computational performance if the number of sensors is above 20. For a smaller number of sensors, other methods, especially group sensors, are more appropriate..

Cite

CITATION STYLE

APA

Hoseini, S. A., & Reza Ashraf, M. (2013). Computational Complexity Comparison of Multi-Sensor Single Target Data Fusion Methods by MATLAB. International Journal of Chaos, Control, Modelling and Simulation, 2(2), 1–8. https://doi.org/10.5121/ijccms.2013.2201

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free