Abstract
In decentralised estimation, locally measured data are processed locally and the local filters are unaware of the other ones. Due to the lack of the global knowledge, the fusion of the local estimates cannot utilise the correlations of the local estimate errors in the computation of the fused mean square error matrix. For this reason, algorithms of fusion under unknown correlations have been designed to provide upper bounds of these matrices. This paper reveals a fundamental relation between the upper bounds and Minkowski sums of ellipsoids. The obtained insight improves the comprehension of the fusion algorithms. Application of the ellipsoidal calculus is illustrated using elemental examples.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
