Sigma Point Belief Propagation

Abstract

The sigma point (SP) filter, also known as unscented Kalman filter, is an attractive alternative to the extended Kalman filter and the particle filter. Here, we extend the SP filter to nonsequential Bayesian inference corresponding to loopy factor graphs. We propose sigma point belief propagation (SPBP) as a low-complexity approximation of the belief propagation (BP) message passing scheme. SPBP achieves approximate marginalizations of posterior distributions corresponding to (generally) loopy factor graphs. It is well suited for decentralized inference because of its low communication requirements. For a decentralized, dynamic sensor localization problem, we demonstrate that SPBP can outperform nonparametric (particle-based) BP while requiring significantly less computations and communications.

5 pages, 1 figure

Cited by in corpus (10)

• Partial Consensus and Conservative Fusion of Gaussian Mixtures for Distributed PHD Fusion
• Cooperative Simultaneous Localization and Synchronization in Mobile Agent Networks
• Cooperative Localization for Mobile Networks: A Distributed Belief Propagation - Mean Field Message Passing Algorithm
• Message Passing-Based 9-D Cooperative Localization and Navigation with Embedded Particle Flow
• TOA-based passive localization of multiple targets with inaccurate receivers based on belief propagation on factor graph
• On Approximate Nonlinear Gaussian Message Passing On Factor Graphs
• Distributed Localization and Tracking of Mobile Networks Including Noncooperative Objects - Extended Version
• Neural Enhanced Belief Propagation for Cooperative Localization
• Peregrine: Network Localization and Navigation with Scalable Inference and Efficient Operation
• RSS-based Cooperative Localization and Orientation Estimation Exploiting Directive Antenna Patterns