arXiv:2410.04022cs.LGcs.AI2024-10被引 3

用实时车位服务能力构建动态图,高效预测大城市停车数据。

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

  • 基于车位实时服务能力构建动态图,捕捉真实停车偏好。
  • 结合图粗化与时空图卷积,提升大规模数据处理效率46.8%。
  • 适合城市交通规划、智慧停车系统开发者参考。

随着车辆数量激增,停车难已成为众多城市亟待解决的挑战。现有大规模城市停车预测研究常缺乏高效的深度学习模型与策略。本文提出一种基于实时车位服务能力的大规模停车图预测框架,旨在提升预测精度与效率。具体而言,引入图注意力机制,评估车位实时服务能力,构建反映真实停车偏好的动态停车图;为有效处理大规模数据,将图粗化技术与时间卷积自编码器结合,实现复杂城市停车图结构与特征的统一降维;随后采用时空图卷积模型在粗化图上进行预测,并通过预训练的自编码器-解码器模块将结果还原至原始维度。该方法在深圳市真实停车数据集上进行了严格测试,实验表明,相较于传统模型,本框架在准确率和效率上分别提升46.8%与30.5%。尤其在图规模扩大时,优势更为显著,展现出解决实际城市停车难题的巨大潜力。

原文摘要 · Abstract (English)

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.

停车预测图神经网络城市交通

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。