Partitioned Graph Convolution Using Adversarial and Regression Networks for Road Travel Speed Prediction

• URL: http://arxiv.org/abs/2103.00067v1
• Date: Fri, 26 Feb 2021 22:16:48 GMT
• Title: Partitioned Graph Convolution Using Adversarial and Regression Networks for Road Travel Speed Prediction
• Authors: Jakob Meldgaard Kj{\ae}r, Lasse Kristensen, Mads Alberg Christensen
• Abstract summary: We propose a framework for predicting road segment travel speed histograms for dataless edges. The framework achieves an accuracy of 71.5% intersection and 78.5% correlation on predicting travel speed histograms. Experiments show that partitioning the dataset into clusters increases the performance of the framework.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Access to quality travel time information for roads in a road network has become increasingly important with the rising demand for real-time travel time estimation for paths within road networks. In the context of the Danish road network (DRN) dataset used in this paper, the data coverage is sparse and skewed towards arterial roads, with a coverage of 23.88% across 850,980 road segments, which makes travel time estimation difficult. Existing solutions for graph-based data processing often neglect the size of the graph, which is an apparent problem for road networks with a large amount of connected road segments. To this end, we propose a framework for predicting road segment travel speed histograms for dataless edges, based on a latent representation generated by an adversarially regularized convolutional network. We apply a partitioning algorithm to divide the graph into dense subgraphs, and then train a model for each subgraph to predict speed histograms for the nodes. The framework achieves an accuracy of 71.5% intersection and 78.5% correlation on predicting travel speed histograms using the DRN dataset. Furthermore, experiments show that partitioning the dataset into clusters increases the performance of the framework. Specifically, partitioning the road network dataset into 100 clusters, with approximately 500 road segments in each cluster, achieves a better performance than when using 10 and 20 clusters.

Related papers

• Graph Construction with Flexible Nodes for Traffic Demand Prediction [44.1996864038085]
  This paper introduces a novel graph construction method tailored to free-floating traffic mode. We propose a novel density-based clustering algorithm (HDPC-L) to determine the flexible positioning of nodes in the graph. Comprehensive experiments on two real-world datasets, the Shenzhen bike-sharing dataset and the Haikou ride-hailing dataset, show that the method significantly improves the performance of the model.
  arXiv  Detail & Related papers  (2024-03-01T04:38:51Z)
• Adaptive Hierarchical SpatioTemporal Network for Traffic Forecasting [70.66710698485745]
  We propose an Adaptive Hierarchical SpatioTemporal Network (AHSTN) to promote traffic forecasting. AHSTN exploits the spatial hierarchy and modeling multi-scale spatial correlations. Experiments on two real-world datasets show that AHSTN achieves better performance over several strong baselines.
  arXiv  Detail & Related papers  (2023-06-15T14:50:27Z)
• MGL2Rank: Learning to Rank the Importance of Nodes in Road Networks Based on Multi-Graph Fusion [7.835154677901744]
  Existing methods for evaluating the importance of nodes in traffic networks only consider topological information and traffic volumes. We propose a graph learning-based framework (MGL2Rank) that integrates the rich characteristics of road networks to rank the importance of nodes.
  arXiv  Detail & Related papers  (2023-05-20T13:46:44Z)
• Hierarchical Graph Structures for Congestion and ETA Prediction [0.0]
  Traffic4cast is an annual competition to predict temporal traffic based on real world data. We propose an approach using Neural Networks that directly works on the road graph topology which was extracted from OpenStreetMap data. Our architecture can incorporate a hierarchical graph representation to improve the information flow between key intersections of the graph and the shortest paths connecting them.
  arXiv  Detail & Related papers  (2022-11-21T15:35:27Z)
• SPIN Road Mapper: Extracting Roads from Aerial Images via Spatial and Interaction Space Graph Reasoning for Autonomous Driving [64.10636296274168]
  Road extraction is an essential step in building autonomous navigation systems. Using just convolution neural networks (ConvNets) for this problem is not effective as it is inefficient at capturing distant dependencies between road segments in the image. We propose a Spatial and Interaction Space Graph Reasoning (SPIN) module which when plugged into a ConvNet performs reasoning over graphs constructed on spatial and interaction spaces projected from the feature maps.
  arXiv  Detail & Related papers  (2021-09-16T03:52:17Z)
• Scalable Learning With a Structural Recurrent Neural Network for Short-Term Traffic Prediction [12.550067622364162]
  This paper presents a scalable deep learning approach for short-term traffic prediction based on historical traffic data in a road network. The SRNN model trained with data of a road network is able to predict traffic speed of different road networks, with the fixed number of parameters to train.
  arXiv  Detail & Related papers  (2021-03-03T18:21:49Z)
• Road Scene Graph: A Semantic Graph-Based Scene Representation Dataset for Intelligent Vehicles [72.04891523115535]
  We propose road scene graph,a special scene-graph for intelligent vehicles. It provides not only object proposals but also their pair-wise relationships. By organizing them in a topological graph, these data are explainable, fully-connected, and could be easily processed by GCNs.
  arXiv  Detail & Related papers  (2020-11-27T07:33:11Z)
• 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)
• VectorNet: Encoding HD Maps and Agent Dynamics from Vectorized Representation [74.56282712099274]
  This paper introduces VectorNet, a hierarchical graph neural network that exploits the spatial locality of individual road components represented by vectors. By operating on the vectorized high definition (HD) maps and agent trajectories, we avoid lossy rendering and computationally intensive ConvNet encoding steps. We evaluate VectorNet on our in-house behavior prediction benchmark and the recently released Argoverse forecasting dataset.
  arXiv  Detail & Related papers  (2020-05-08T19:07:03Z)
• 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)
• 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.