Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 7267-7278· 0 citations· 69 references
TL;DR
This work proposes RouteSeg, a dynamic programming–based segmentation algorithm that optimizes this formulation using uniformly sampled spatial points and a trajectory repair module to handle anomalous trajectories, and shows that this method consistently outperforms ad-hoc and adapted state-of-the-art segmentation strategies.
Abstract
Estimated Time of Arrival (ETA) is a core service for ride-hailing, public transit, and map-based navigation platforms. While prior studies have extensively explored model architectures and learning algorithms, route segmentation remains largely underexplored. Predefined spatial markers in existing approaches often obscure fine-grained traffic variations by aggregating route data. Consequently, distinct local patterns are mapped to similar features, introducing ambiguity that limits ETA accuracy. Leveraging large-scale, fine-grained vehicle trajectories, we reformulate route segmentation as a function approximation problem. By projecting trajectories into a distance–time space, we model route-level traffic evolution as an underlying piecewise linear function, where segment boundaries correspond to stable traffic regimes. We propose RouteSeg, a dynamic programming–based segmentation algorithm that optimizes this formulation using uniformly sampled spatial points and a trajectory repair module to handle anomalous trajectories. Experiments on real-world datasets spanning multiple cities and millions of trajectories show that our method consistently outperforms ad-hoc and adapted state-of-the-art segmentation strategies. Moreover, online evaluation of our system on the Chelaile Bus ETA service across two cities demonstrates a 90% reduction in storage and a 25% decrease in CPU utilization while maintaining equivalent performance. These results support an anticipated nationwide deployment across over 460 cities, expected to reduce operational costs by approximately 5,000 USD per month.
This work presents TraSGen, a distributed, scalable, and continuous trajectory stream generator designed specifically for large-scale benchmarking of trajectory-driven systems, built on a shared-nothing architecture that scales horizontally to support large and continuous trajectory workloads.
Salman Ahmed Shaikh, Komal Mariam, Hiroyuki Kitagawa et al.· ACM Transactions on Spatial...· 0 citations
AIS trajectories in and around ports are often incomplete because of transmission interruptions, reception failures, and infrastructure outages. In this paper, we investigate whether the Data-driven AIS Trajectory Interpolation method (DAISTIN), which reconstructs missing trajectory segments using a graph derived from...
Results confirm that explicitly coupling traffic prediction with online trajectory replanning enables more adaptive and efficient navigation under time-varying traffic conditions.
Hassan Haghighi, Maamar El Amine Hamri, D. Asadi et al.· Data Science for Transportat...· 1 citation
To address the limitations of traditional route choice models, including their dependence on manually constructed path sets, their difficulty in capturing nonlinear decision preferences, and their insufficient consideration of dynamic congestion factors, this paper proposes an urban vehicle route choice modeling method...
Shu-Kang Zheng, Chang-Jiang Zheng, Gen-Hua Ma et al.· Applied Sciences· 0 citations
Automatic vehicle location (AVL) data produced by transit vehicles is invaluable in performance studies, but turning raw AVL points into a detailed view of vehicle stop-and-gos is burdensome: the datasets are sparse, noisy, and prone to blunders. While recent research has explored methods of reconstructing trajectories...
A novel spatio-temporally complementary feature propagation framework that leverages the strengths of two distinct data sources: spatially sparse but temporally dense loop detector data, and a spatially complete but temporally sparse macroscopic transportation model is proposed.
Ling-Hang Sun, Qi-Shen Zhou, M. Makridis et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.