pith. sign in

arxiv: 2012.04602 · v2 · pith:TYYRFC6Xnew · submitted 2020-12-08 · 📊 stat.ME · stat.AP

Online Particle Smoothing with Application to Map-matching

classification 📊 stat.ME stat.AP
keywords map-matchingonlineapproximationfixed-lagintroducemethodparticleroad
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.