STAD: Spatio-Temporal Adjustment of Traffic-Oblivious Travel-Time Estimation

• URL: http://arxiv.org/abs/2006.09892v1
• Date: Mon, 8 Jun 2020 09:47:55 GMT
• Title: STAD: Spatio-Temporal Adjustment of Traffic-Oblivious Travel-Time Estimation
• Authors: Sofiane Abbar, Rade Stanojevic, Mohamed Mokbel
• Abstract summary: 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.
• Score: 1.1731001328350983
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Travel time estimation is an important component in modern transportation applications. The state of the art techniques for travel time estimation use GPS traces to learn the weights of a road network, often modeled as a directed graph, then apply Dijkstra-like algorithms to find shortest paths. Travel time is then computed as the sum of edge weights on the returned path. In order to enable time-dependency, existing systems compute multiple weighted graphs corresponding to different time windows. These graphs are often optimized offline before they are deployed into production routing engines, causing a serious engineering overhead. In this paper, we present STAD, a system that adjusts - on the fly - 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, before it turns it into a full-fledged time-dependent system capable of adjusting travel times to real traffic conditions in a city. STAD leverages the spatio-temporal properties of traffic by combining spatial features such as departing and destination geographic zones with temporal features such as departing time and day to significantly improve the travel time estimates of the 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. We also show that STAD performs better than different commercial and research baselines in all three cities.

Related papers

• 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)
• Meta-Learning over Time for Destination Prediction Tasks [53.12827614887103]
  A need to understand and predict vehicles' behavior underlies both public and private goals in the transportation domain. Recent studies have found, at best, only marginal improvements in predictive performance from incorporating temporal information. We propose an approach based on hypernetworks, in which a neural network learns to change its own weights in response to an input.
  arXiv  Detail & Related papers  (2022-06-29T17:58:12Z)
• Route to Time and Time to Route: Travel Time Estimation from Sparse Trajectories [7.602975042011819]
  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.
  arXiv  Detail & Related papers  (2022-06-21T14:16:58Z)
• Spatio-Temporal Graph Few-Shot Learning with Cross-City Knowledge Transfer [58.6106391721944]
  Cross-city knowledge has shown its promise, where the model learned from data-sufficient cities is leveraged to benefit the learning process of data-scarce cities. We propose a model-agnostic few-shot learning framework for S-temporal graph called ST-GFSL. We conduct comprehensive experiments on four traffic speed prediction benchmarks and the results demonstrate the effectiveness of ST-GFSL compared with state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-27T12:46:52Z)
• Spatio-Temporal Joint Graph Convolutional Networks for Traffic Forecasting [75.10017445699532]
  Recent have shifted their focus towards formulating traffic forecasting as atemporal graph modeling problem. We propose a novel approach for accurate traffic forecasting on road networks over multiple future time steps.
  arXiv  Detail & Related papers  (2021-11-25T08:45:14Z)
• Spatial-Temporal Dual Graph Neural Networks for Travel Time Estimation [5.614908141182951]
  We propose a graph-based deep learning framework for travel time estimation, namely Spatial-Temporal Dual Graph Neural Networks (STDGNN) We first establish the spatial-temporal dual graph architecture to capture the complex correlations of both intersections and road segments. In order to capture the joint spatial-temporal dynamics of the intersections and road segments, we adopt the spatial-temporal learning layer.
  arXiv  Detail & Related papers  (2021-05-28T05:15:45Z)
• Boosting Algorithms for Delivery Time Prediction in Transportation Logistics [2.147325264113341]
  We show that travel time prediction can help mitigate high delays in postal services. Some boosting algorithms, such as light gradient boosting and catboost, have a higher performance in terms of accuracy and runtime efficiency.
  arXiv  Detail & Related papers  (2020-09-24T11:01: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)
• 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.