Online Particle Smoothing with Application to Map-matching
arXiv:2012.04602 · doi:10.1109/TSP.2022.3141259
Abstract
We introduce a novel method for online smoothing in state-space models that utilises a fixed-lag approximation to overcome the well known issue of path degeneracy. Unlike classical fixed-lag techniques that only approximate certain marginals, we introduce an online resampling algorithm, called particle stitching, that converts these marginal samples into a full posterior approximation. We demonstrate the utility of our method in the context of map-matching, the task of inferring a vehicle's trajectory given a road network and noisy GPS observations. We develop a new state-space model for the difficult task of map-matching on dense, urban road networks.
References in corpus (7)
- Sequential Monte Carlo smoothing with application to parameter estimation in non-linear state space models
- Sequential Monte Carlo smoothing for general state space hidden Markov models
- Compressed Monte Carlo with application in particle filtering
- Particle ancestor sampling for near-degenerate or intractable state transition models
- Particle-based adaptive-lag online marginal smoothing in general state-space models
- Probabilistic map-matching using particle filters
- Nearly Consistent Finite Particle Estimates in Streaming Importance Sampling