Rao-Blackwellised Particle Filters (RBPFS) are a class of Particle
Filters (PFS) that exploit conditional dependencies between
parts of the state to estimate. By doing so, RBPFS can
improve the estimation quality while also reducing the overall
computational load in comparison to original PFS. However,
the computational complexity is still too high for many
real-time applications. In this paper, we propose a modified
RBPF that requires a single Kalman Filter (KF) iteration per
input sample. Comparative experiments show that while good
convergence can still be obtained, computational efficiency is
always drastically increased, making this algorithm an option
to consider for real-time implementations.
標簽：
Particle
Filters
Rao-Blackwellised
exploit
上傳時間：
2016-01-02
上傳用戶：refent
