Decentralised possibilistic inference with applications to target tracking
Abstract
Fusing and sharing information from multiple sensors over a network is a challenging task, partly due to the absence of a foundational rule for fusing probability distributions that preserves the independence of sources. To address this, we propose a decentralised inference framework based on possibility theory. Unlike probabilistic approaches that rely on ad-hoc averaging, we derive a principled fusion rule that is proven to be asymptotically exact, meaning it recovers the posterior of the optimal centralised possibilistic approach. We apply this rule to the possibilistic Bernoulli filter, leveraging its hierarchical nature to jointly infer data association and state estimation, distinct from standard decentralised Kalman filtering. We demonstrate that the proposed approach maintains the independence of local posteriors during fusion and, even under necessary approximations to handle Gaussian mixtures, significantly outperforms probabilistic geometric and arithmetic average fusion baselines in terms of cardinality and localisation error.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.