Sciweavers

Share
TSP
2011

Decentralized Particle Filter With Arbitrary State Decomposition

11 years 4 months ago
Decentralized Particle Filter With Arbitrary State Decomposition
—In this paper, a new particle filter (PF) which we refer to as the decentralized PF (DPF) is proposed. By first decomposing the state into two parts, the DPF splits the filtering problem into two nested sub-problems and then handles the two nested sub-problems using PFs. The DPF has the advantage over the regular PF that the DPF can increase the level of parallelism of the PF. In particular, part of the resampling in the DPF bears a parallel structure and can thus be implemented in parallel. The parallel structure of the DPF is created by decomposing the state space, differing from the parallel structure of the distributed PFs which is created by dividing the sample space. This difference results in a couple of unique features of the DPF in contrast with the existing distributed PFs. Simulation results of two examples indicate that the DPF has a potential to achieve in a shorter execution time the same level of performance as the regular PF.
Tianshi Chen, Thomas B. Schön, Henrik Ohlsson
Added 15 May 2011
Updated 15 May 2011
Type Journal
Year 2011
Where TSP
Authors Tianshi Chen, Thomas B. Schön, Henrik Ohlsson, Lennart Ljung
Comments (0)
books