Efficient Large-Scale Urban Parking Prediction: Graph Coarsening Based on Real-Time Parking Service Capability

• URL: http://arxiv.org/abs/2410.04022v1
• Date: Sat, 5 Oct 2024 03:54:25 GMT
• Title: Efficient Large-Scale Urban Parking Prediction: Graph Coarsening Based on Real-Time Parking Service Capability
• Authors: Yixuan Wang, Zhenwu Chen, Kangshuai Zhang, Yunduan Cui, Lei Peng,
• Abstract summary: This paper proposes an innovative framework for predicting large-scale urban parking graphs leveraging real-time service capabilities. To effectively handle large-scale parking data, this study combines graph coarsening techniques with temporal convolutional autoencoders. Our framework achieves improvements of 46.8% and 30.5% in accuracy and efficiency, respectively.
• Score: 7.5350858327743095
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the sharp increase in the number of vehicles, the issue of parking difficulties has emerged as an urgent challenge that many cities need to address promptly. In the task of predicting large-scale urban parking data, existing research often lacks effective deep learning models and strategies. To tackle this challenge, this paper proposes an innovative framework for predicting large-scale urban parking graphs leveraging real-time service capabilities, aimed at improving the accuracy and efficiency of parking predictions. Specifically, we introduce a graph attention mechanism that assesses the real-time service capabilities of parking lots to construct a dynamic parking graph that accurately reflects real preferences in parking behavior. To effectively handle large-scale parking data, this study combines graph coarsening techniques with temporal convolutional autoencoders to achieve unified dimension reduction of the complex urban parking graph structure and features. Subsequently, we use a spatio-temporal graph convolutional model to make predictions based on the coarsened graph, and a pre-trained autoencoder-decoder module restores the predicted results to their original data dimensions, completing the task. Our methodology has been rigorously tested on a real dataset from parking lots in Shenzhen. The experimental results indicate that compared to traditional parking prediction models, our framework achieves improvements of 46.8\% and 30.5\% in accuracy and efficiency, respectively. Remarkably, with the expansion of the graph's scale, our framework's advantages become even more apparent, showcasing its substantial potential for solving complex urban parking dilemmas in practical scenarios.

Related papers

• Leverage Multi-source Traffic Demand Data Fusion with Transformer Model for Urban Parking Prediction [4.672121078249809]
  This study proposes a parking availability prediction framework integrating spatial-temporal deep learning with multi-source data fusion. The framework is based on the Transformer as the spatial-temporal deep learning model. Real-world empirical data was used to verify the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2024-05-02T07:28:27Z)
• Improving Demand Forecasting in Open Systems with Cartogram-Enhanced Deep Learning [2.684349361878955]
  In this study, we propose a deep learning framework to predict rental and return patterns by leveraging cartogram approaches. We apply this method to public bicycle rental-and-return data in Seoul, South Korea.
  arXiv  Detail & Related papers  (2024-03-24T07:29:12Z)
• Truck Parking Usage Prediction with Decomposed Graph Neural Networks [15.291200515217513]
  Truck parking on freight corridors faces the major challenge of insufficient parking spaces. It has been shown that providing accurate parking usage prediction can be a cost-effective solution to reduce unsafe parking practices. This paper presents the Regional Temporal Graph Neural Network (RegT-CN) to predict parking usage across the entire state.
  arXiv  Detail & Related papers  (2024-01-23T17:14:01Z)
• Deep Prompt Tuning for Graph Transformers [55.2480439325792]
  Fine-tuning is resource-intensive and requires storing multiple copies of large models. We propose a novel approach called deep graph prompt tuning as an alternative to fine-tuning. By freezing the pre-trained parameters and only updating the added tokens, our approach reduces the number of free parameters and eliminates the need for multiple model copies.
  arXiv  Detail & Related papers  (2023-09-18T20:12:17Z)
• Implicit Occupancy Flow Fields for Perception and Prediction in Self-Driving [68.95178518732965]
  A self-driving vehicle (SDV) must be able to perceive its surroundings and predict the future behavior of other traffic participants. Existing works either perform object detection followed by trajectory of the detected objects, or predict dense occupancy and flow grids for the whole scene. This motivates our unified approach to perception and future prediction that implicitly represents occupancy and flow over time with a single neural network.
  arXiv  Detail & Related papers  (2023-08-02T23:39:24Z)
• Beyond Prediction: On-street Parking Recommendation using Heterogeneous Graph-based List-wise Ranking [18.08128929432942]
  We first time propose an on-street parking recommendation (OPR) task to directly recommend a parking space for a driver. We design a highly efficient heterogeneous graph called ESGraph to represent historical and real-time meters' turnover events. A ranking model is further utilized to learn a score function that helps recommend a list of ranked parking spots.
  arXiv  Detail & Related papers  (2023-04-29T03:59:35Z)
• Predicting vacant parking space availability zone-wisely: a graph based spatio-temporal prediction approach [0.25782420501870296]
  Accurately predicting vacant parking space (VPS) information plays a crucial role in intelligent parking guidance systems. This paper proposes a graph data-based model ST-GBGRU to predict the number of VPSs in short-term and long-term. The results show that in the short-term and long-term prediction tasks, ST-GBGRU model can achieve high accuracy and have good application prospects.
  arXiv  Detail & Related papers  (2022-05-03T12:24:39Z)
• Model-based Decision Making with Imagination for Autonomous Parking [50.41076449007115]
  The proposed algorithm consists of three parts: an imaginative model for anticipating results before parking, an improved rapid-exploring random tree (RRT) and a path smoothing module. Our algorithm is based on a real kinematic vehicle model; which makes it more suitable for algorithm application on real autonomous cars. In order to evaluate the algorithm's effectiveness, we have compared our algorithm with traditional RRT, within three different parking scenarios.
  arXiv  Detail & Related papers  (2021-08-25T18:24:34Z)
• Deep Multi-Task Learning for Joint Localization, Perception, and Prediction [68.50217234419922]
  This paper investigates the issues that arise in state-of-the-art autonomy stacks under localization error. We design a system that jointly performs perception, prediction, and localization. Our architecture is able to reuse computation between both tasks, and is thus able to correct localization errors efficiently.
  arXiv  Detail & Related papers  (2021-01-17T17:20:31Z)
• ParkPredict: Motion and Intent Prediction of Vehicles in Parking Lots [65.33650222396078]
  We develop a parking lot environment and collect a dataset of human parking maneuvers. We compare a multi-modal Long Short-Term Memory (LSTM) prediction model and a Convolution Neural Network LSTM (CNN-LSTM) to a physics-based Extended Kalman Filter (EKF) baseline. Our results show that 1) intent can be estimated well (roughly 85% top-1 accuracy and nearly 100% top-3 accuracy with the LSTM and CNN-LSTM model); 2) knowledge of the human driver's intended parking spot has a major impact on predicting parking trajectory; and 3) the semantic representation of the environment
  arXiv  Detail & Related papers  (2020-04-21T20:46:32Z)
• Spatiotemporal Relationship Reasoning for Pedestrian Intent Prediction [57.56466850377598]
  Reasoning over visual data is a desirable capability for robotics and vision-based applications. In this paper, we present a framework on graph to uncover relationships in different objects in the scene for reasoning about pedestrian intent. Pedestrian intent, defined as the future action of crossing or not-crossing the street, is a very crucial piece of information for autonomous vehicles.
  arXiv  Detail & Related papers  (2020-02-20T18:50:44Z)

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.