Link Representation Learning for Probabilistic Travel Time Estimation

• URL: http://arxiv.org/abs/2407.05895v1
• Date: Mon, 8 Jul 2024 13:01:53 GMT
• Title: Link Representation Learning for Probabilistic Travel Time Estimation
• Authors: Chen Xu, Qiang Wang, Lijun Sun,
• Abstract summary: In this paper, we propose to model trip-level link travel time using a Gaussian hierarchical model. The results demonstrate its superior performance compared to state-of-the-art deterministic and probabilistic baselines. We find that the learned link representations align well with the physical geometry of the network, making them suitable as input for other applications.
• Score: 21.092166159353702
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Travel time estimation is a crucial application in navigation apps and web mapping services. Current deterministic and probabilistic methods primarily focus on modeling individual trips, assuming independence among trips. However, in real-world scenarios, we often observe strong inter-trip correlations due to factors such as weather conditions, traffic management, and road works. In this paper, we propose to model trip-level link travel time using a Gaussian hierarchical model, which can characterize both inter-trip and intra-trip correlations. The joint distribution of travel time of multiple trips becomes a multivariate Gaussian parameterized by learnable link representations. To effectively use the sparse GPS trajectories, we also propose a data augmentation method based on trip sub-sampling, which allows for fine-grained gradient backpropagation in learning link representations. During inference, we estimate the probability distribution of the travel time of a queried trip conditional on the completed trips that are spatiotemporally adjacent. We refer to the overall framework as ProbTTE. We evaluate ProbTTE on two real-world GPS trajectory datasets, and the results demonstrate its superior performance compared to state-of-the-art deterministic and probabilistic baselines. Additionally, we find that the learned link representations align well with the physical geometry of the network, making them suitable as input for other applications.

Related papers

• SPTTE: A Spatiotemporal Probabilistic Framework for Travel Time Estimation [21.092166159353702]
  Real-world trip data are often temporally sparse and unevenly distributed. SPTTE incorporates an RNN-based temporal Gaussian process parameterization to regularize sparse observations and capture temporal dependencies. Evaluations on real-world datasets demonstrate that SPTTE outperforms state-of-the-art probabilistic methods by over 10.13%.
  arXiv  Detail & Related papers  (2024-11-27T16:28:54Z)
• Efficient Data Representation for Motion Forecasting: A Scene-Specific Trajectory Set Approach [12.335528093380631]
  This study introduces a novel approach for generating scene-specific trajectory sets tailored to different contexts. A deterministic goal sampling algorithm identifies relevant map regions, while our Recursive In-Distribution Subsampling (RIDS) method enhances trajectory plausibility. Experiments on the Argoverse 2 dataset demonstrate that our method achieves up to a 10% improvement in Driving Area Compliance.
  arXiv  Detail & Related papers  (2024-07-30T11:06:39Z)
• MomentDiff: Generative Video Moment Retrieval from Random to Real [71.40038773943638]
  We provide a generative diffusion-based framework called MomentDiff. MomentDiff simulates a typical human retrieval process from random browsing to gradual localization. We show that MomentDiff consistently outperforms state-of-the-art methods on three public benchmarks.
  arXiv  Detail & Related papers  (2023-07-06T09:12:13Z)
• TAPIR: Tracking Any Point with per-frame Initialization and temporal Refinement [64.11385310305612]
  We present a novel model for Tracking Any Point (TAP) that effectively tracks any queried point on any physical surface throughout a video sequence. Our approach employs two stages: (1) a matching stage, which independently locates a suitable candidate point match for the query point on every other frame, and (2) a refinement stage, which updates both the trajectory and query features based on local correlations. The resulting model surpasses all baseline methods by a significant margin on the TAP-Vid benchmark, as demonstrated by an approximate 20% absolute average Jaccard (AJ) improvement on DAVIS.
  arXiv  Detail & Related papers  (2023-06-14T17:07:51Z)
• HTTE: A Hybrid Technique For Travel Time Estimation In Sparse Data Environments [4.711557349742932]
  This paper presents a novel hybrid algorithm for travel time estimation that leverages historical and sparse real-time trajectory data. Given a path and a departure time we estimate the travel time taking into account the historical information, the real-time trajectory data and the correlations among different road segments.
  arXiv  Detail & Related papers  (2023-01-12T21:07:14Z)
• Globally Optimal Event-Based Divergence Estimation for Ventral Landing [55.29096494880328]
  Event sensing is a major component in bio-inspired flight guidance and control systems. We explore the usage of event cameras for predicting time-to-contact with the surface during ventral landing. This is achieved by estimating divergence (inverse TTC), which is the rate of radial optic flow, from the event stream generated during landing. Our core contributions are a novel contrast maximisation formulation for event-based divergence estimation, and a branch-and-bound algorithm to exactly maximise contrast and find the optimal divergence value.
  arXiv  Detail & Related papers  (2022-09-27T06:00:52Z)
• UniTE -- The Best of Both Worlds: Unifying Function-Fitting and Aggregation-Based Approaches to Travel Time and Travel Speed Estimation [18.8579989956537]
  We present a Unifying approach to Travel time and speed estimation. It combines function-fitting and aggregation-based approaches into a unified framework. An empirical study finds that an instance of UniTE can improve the accuracies of travel speed distribution and travel time estimation by $40-64%$ and $3-23%$, respectively.
  arXiv  Detail & Related papers  (2021-04-27T16:55:24Z)
• SMART: Simultaneous Multi-Agent Recurrent Trajectory Prediction [72.37440317774556]
  We propose advances that address two key challenges in future trajectory prediction. multimodality in both training data and predictions and constant time inference regardless of number of agents.
  arXiv  Detail & Related papers  (2020-07-26T08:17:10Z)
• Implicit Latent Variable Model for Scene-Consistent Motion Forecasting [78.74510891099395]
  In this paper, we aim to learn scene-consistent motion forecasts of complex urban traffic directly from sensor data. We model the scene as an interaction graph and employ powerful graph neural networks to learn a distributed latent representation of the scene.
  arXiv  Detail & Related papers  (2020-07-23T14:31:25Z)
• Leveraging the Self-Transition Probability of Ordinal Pattern Transition Graph for Transportation Mode Classification [0.0]
  We propose the use of a feature retained from the Ordinal Pattern Transition Graph, called the probability of self-transition for transportation mode classification. The proposed feature presents better accuracy results than Permutation Entropy and Statistical Complexity, even when these two are combined.
  arXiv  Detail & Related papers  (2020-07-16T23:25:09Z)
• Road Network Metric Learning for Estimated Time of Arrival [93.0759529610483]
  In this paper, we propose the Road Network Metric Learning framework for Estimated Time of Arrival (ETA) It consists of two components: (1) a main regression task to predict the travel time, and (2) an auxiliary metric learning task to improve the quality of link embedding vectors. We show that our method outperforms the state-of-the-art model and the promotion concentrates on the cold links with few data.
  arXiv  Detail & Related papers  (2020-06-24T04:45:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.