Route to Time and Time to Route: Travel Time Estimation from Sparse Trajectories

• URL: http://arxiv.org/abs/2206.10418v1
• Date: Tue, 21 Jun 2022 14:16:58 GMT
• Title: Route to Time and Time to Route: Travel Time Estimation from Sparse Trajectories
• Authors: Zhiwen Zhang, Hongjun Wang, Zipei Fan, Jiyuan Chen, Xuan Song, and Ryosuke Shibasaki
• Abstract summary: This paper aims to resolve the problem of travel time estimation (TTE) and route recovery in sparse scenarios. We formulate this problem as an inexact supervision problem in which the training data has coarsely grained labels. We propose an EM algorithm to alternatively estimate the travel time of inferred route through weak supervision in E step and retrieve the route based on estimated travel time in M step for sparse trajectories.
• Score: 7.602975042011819
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Due to the rapid development of Internet of Things (IoT) technologies, many online web apps (e.g., Google Map and Uber) estimate the travel time of trajectory data collected by mobile devices. However, in reality, complex factors, such as network communication and energy constraints, make multiple trajectories collected at a low sampling rate. In this case, this paper aims to resolve the problem of travel time estimation (TTE) and route recovery in sparse scenarios, which often leads to the uncertain label of travel time and route between continuously sampled GPS points. We formulate this problem as an inexact supervision problem in which the training data has coarsely grained labels and jointly solve the tasks of TTE and route recovery. And we argue that both two tasks are complementary to each other in the model-learning procedure and hold such a relation: more precise travel time can lead to better inference for routes, in turn, resulting in a more accurate time estimation). Based on this assumption, we propose an EM algorithm to alternatively estimate the travel time of inferred route through weak supervision in E step and retrieve the route based on estimated travel time in M step for sparse trajectories. We conducted experiments on three real-world trajectory datasets and demonstrated the effectiveness of the proposed method.

Related papers

• Deep Learning for Trajectory Data Management and Mining: A Survey and Beyond [58.63558696061679]
  Trajectory computing is crucial in various practical applications such as location services, urban traffic, and public safety. We present a review of development and recent advances in deep learning for trajectory computing (DL4Traj) Notably, we encapsulate recent advancements in Large Language Models (LLMs) that hold potential to augment trajectory computing.
  arXiv  Detail & Related papers  (2024-03-21T05:57:27Z)
• Multitask Weakly Supervised Learning for Origin Destination Travel Time Estimation [8.531695291898815]
  This paper starts to estimate the OD trips travel time combined with the road network. A novel route recovery function has been proposed to maximize the current route's co occurrence probability. We conduct experiments on a wide range of real world taxi datasets in Xi'an and Chengdu.
  arXiv  Detail & Related papers  (2023-01-13T00:11:56Z)
• Correlating sparse sensing for large-scale traffic speed estimation: A Laplacian-enhanced low-rank tensor kriging approach [76.45949280328838]
  We propose a Laplacian enhanced low-rank tensor (LETC) framework featuring both lowrankness and multi-temporal correlations for large-scale traffic speed kriging. We then design an efficient solution algorithm via several effective numeric techniques to scale up the proposed model to network-wide kriging.
  arXiv  Detail & Related papers  (2022-10-21T07:25:57Z)
• Deep Learning Aided Packet Routing in Aeronautical Ad-Hoc Networks Relying on Real Flight Data: From Single-Objective to Near-Pareto Multi-Objective Optimization [79.96177511319713]
  We invoke deep learning (DL) to assist routing in aeronautical ad-hoc networks (AANETs) A deep neural network (DNN) is conceived for mapping the local geographic information observed by the forwarding node into the information required for determining the optimal next hop. We extend the DL-aided routing algorithm to a multi-objective scenario, where we aim for simultaneously minimizing the delay, maximizing the path capacity, and maximizing the path lifetime.
  arXiv  Detail & Related papers  (2021-10-28T14:18:22Z)
• 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)
• STAD: Spatio-Temporal Adjustment of Traffic-Oblivious Travel-Time Estimation [1.1731001328350983]
  We present STAD, a system that adjusts travel time estimates for any trip request expressed in the form of origin, destination, and departure time. STAD uses machine learning and sparse trips data to learn the imperfections of any basic routing engine. Experiments on real trip datasets from Doha, New York City, and Porto show a reduction in median absolute errors of 14% in the first two cities and 29% in the latter.
  arXiv  Detail & Related papers  (2020-06-08T09:47:55Z)
• FMA-ETA: Estimating Travel Time Entirely Based on FFN With Attention [88.33372574562824]
  We propose a novel framework based on feed-forward network (FFN) for ETA, FFN with Multi-factor self-Attention (FMA-ETA) The novel Multi-factor self-attention mechanism is proposed to deal with different category features and aggregate the information purposefully. Experiments show FMA-ETA is competitive with state-of-the-art methods in terms of the prediction accuracy with significantly better inference speed.
  arXiv  Detail & Related papers  (2020-06-07T08:10:47Z)
• TRIPDECODER: Study Travel Time Attributes and Route Preferences of Metro Systems from Smart Card Data [7.09698718567578]
  We strategicallypropose two inference tasks to handle the recovering, one to infer the travel time of each travel link thatcontributes to the total duration of any trip inside metro network. TripDecoder achieves the best accuracy and efficiency in both datasets.
  arXiv  Detail & Related papers  (2020-05-01T08:39:48Z)
• Constructing Geographic and Long-term Temporal Graph for Traffic Forecasting [88.5550074808201]
  We propose Geographic and Long term Temporal Graph Convolutional Recurrent Neural Network (GLT-GCRNN) for traffic forecasting. In this work, we propose a novel framework for traffic forecasting that learns the rich interactions between roads sharing similar geographic or longterm temporal patterns.
  arXiv  Detail & Related papers  (2020-04-23T03:50:46Z)
• Neural Networks Model for Travel Time Prediction Based on ODTravel Time Matrix [0.0]
  Two neural network models namely multi-layer(MLP) perceptron and long short-term model(LSTM) are developed for predicting link travel time of a busy route. The experiment result showed that both models can make near-accurate predictions however, LSTM is more susceptible to noise as time step increases.
  arXiv  Detail & Related papers  (2020-04-08T15:01:13Z)
• Street-level Travel-time Estimation via Aggregated Uber Data [2.838842554577539]
  Estimating temporal patterns in travel times along road segments in urban settings is of central importance to traffic engineers and city planners. We propose a methodology to leverage coarse-grained and aggregated travel time data to estimate the street-level travel times of a given metropolitan area.
  arXiv  Detail & Related papers  (2020-01-13T21:14:38Z)

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.