Abstract
This study proposes a novel data fusion algorithm in sensor networks with simultaneous presence of set-membership and stochastic Gaussian measurement uncertainties. The proposed method is grounded in the marriage of ellipsoidal calculus theory and data compression algorithm. The point-valued measurement and the set-valued measurement are compressed into a uniform framework during the estimation. An optimal Kalman gain is obtained that minimises the upper bound of the mean square error of the estimation set. The proposed algorithm is applied to the target tracking problem and the estimation results show that the proposed algorithm improves the tracking performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.