Decentralised possibilistic inference with applications to target tracking
Fusing and sharing information from multiple sensors over a network is a challenging task. Part of this challenge arises from the absence of a foundational rule for fusing probability distributions, with various approaches stemming from different principles. Yet, when expressing tracking algorithms within the framework of possibility theory, one specific fusion rule can be proved to be exact in the sense that it is equivalent to the non-distributed possibilistic approach. In this article, this fusion rule is applied to decentralised fusion, based on the possibilistic analogue of the Bernoulli filter. We then show that the proposed approach outperforms its probabilistic counterpart on simulated data.
PDF AbstractTasks
Datasets
Add Datasets
introduced or used in this paper
Results from the Paper
Submit
results from this paper
to get state-of-the-art GitHub badges and help the
community compare results to other papers.
Methods
No methods listed for this paper. Add
relevant methods here
