Algorithms for matching and predicting trajectories

DOI10.1137/1.9781611972917.9MaRDI QIDQ5233702zbMATH OpenOpenAlexFDO

Authors Jochen Eisner, Stefan Funke, Andre Herbst, Andreas Spillner, Sabine Storandt

Publication date 12 September 2019

Published in 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5b1d4e9ad74125133aacf6632404b38b92f88693

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1951554
• Map Construction Algorithms
• Approximate Map Matching with respect to the Fréchet Distance
• Constructing street networks from GPS trajectories
• Minimizing walking length in map matching

Cited in

(8)

• Algorithms and insights for RaceTrack
• A robust map matching method by considering memorized multiple matching candidates
• Mining driving preferences in multi-cost networks
• Constructing street networks from GPS trajectories
• scientific article; zbMATH DE number 1951554 (Why is no real title available?)
• Towards mathematical programming methods for predicting user mobility in mobile networks
• Uncertain trajectory prediction method using non-parametric density estimation
• Algorithms and Insights for RaceTrack

This page was built for publication: Algorithms for matching and predicting trajectories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233702)