Sciweavers

Share
PKDD
2009
Springer

Parallel Subspace Sampling for Particle Filtering in Dynamic Bayesian Networks

9 years 29 days ago
Parallel Subspace Sampling for Particle Filtering in Dynamic Bayesian Networks
Monitoring the variables of real world dynamic systems is a difficult task due to their inherent complexity and uncertainty. Particle Filters (PF) perform that task, yielding probability distribution over the unobserved variables. However, they suffer from the curse of dimensionality problem: the number of particles grows exponentially with the dimensionality of the hidden state space. The problem is aggravated when the initial distribution of the variables is not well known, as happens in global localization problems. We present a new parallel PF for systems whose variable dependencies can be factored into a Dynamic Bayesian Network. The new algorithms significantly reduce the number of particles, while independently exploring different subspaces of hidden variables to build particles consistent with past history and measurements. We demonstrate this new PF approach on some complex dynamical system estimation problems, showing that our method successfully localizes and tracks hidden...
Eva Besada-Portas, Sergey M. Plis, Jesús Ma
Added 26 Jul 2010
Updated 26 Jul 2010
Type Conference
Year 2009
Where PKDD
Authors Eva Besada-Portas, Sergey M. Plis, Jesús Manuel de la Cruz, Terran Lane
Comments (0)
books