Probability-Aware Parking Selection

• URL: http://arxiv.org/abs/2601.00521v1
• Date: Fri, 02 Jan 2026 01:13:47 GMT
• Title: Probability-Aware Parking Selection
• Authors: Cameron Hickert, Sirui Li, Zhengbing He, Cathy Wu,
• Abstract summary: Current parking navigation systems often underestimate total travel time by failing to account for the time spent searching for a parking space.<n>This paper introduces the probability-aware parking selection problem, which aims to direct drivers to the best parking location rather than straight to their destination.
• Score: 18.77524916287049
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Current parking navigation systems often underestimate total travel time by failing to account for the time spent searching for a parking space, which significantly affects user experience, mode choice, congestion, and emissions. To address this issue, this paper introduces the probability-aware parking selection problem, which aims to direct drivers to the best parking location rather than straight to their destination. An adaptable dynamic programming framework is proposed for decision-making based on probabilistic information about parking availability at the parking lot level. Closed-form analysis determines when it is optimal to target a specific parking lot or explore alternatives, as well as the expected time cost. Sensitivity analysis and three illustrative cases are examined, demonstrating the model's ability to account for the dynamic nature of parking availability. Acknowledging the financial costs of permanent sensing infrastructure, the paper provides analytical and empirical assessments of errors incurred when leveraging stochastic observations to estimate parking availability. Experiments with real-world data from the US city of Seattle indicate this approach's viability, with mean absolute error decreasing from 7% to below 2% as observation frequency grows. In data-based simulations, probability-aware strategies demonstrate time savings up to 66% relative to probability-unaware baselines, yet still take up to 123% longer than direct-to-destination estimates.

Related papers

• A Cost-Effective Framework for Predicting Parking Availability Using Geospatial Data and Machine Learning [0.30758169771529686]
  Students need to find vacant parking spots quickly and conveniently during class timings.<n>We propose a smart framework that integrates multiple data sources, including street maps, mobility, and meteorological data.<n>The framework will use the expected parking entrance and time to specify a suitable parking area.
  arXiv  Detail & Related papers  (2025-08-18T23:24:19Z)
• Crowdsourced reviews reveal substantial disparities in public perceptions of parking [2.3034861262968453]
  This study introduces a cost-effective and widely accessible data source, crowdsourced online reviews, to investigate public perceptions of parking across the U.S. We examine 4,987,483 parking-related reviews for 1,129,460 points of interest (POIs) across 911 core-based statistical areas (CBSAs) sourced from Google Maps. Findings reveal significant variations in parking sentiment across POI types and CBSAs, with Restaurant POIs showing the most negative.
  arXiv  Detail & Related papers  (2024-07-06T15:17:17Z)
• 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)
• Efficient Parking Search using Shared Fleet Data [2.0967973517861003]
  Finding a free parking spot in a smart environment can be modeled and solved as a Markov decision process (MDP) Knowing the parking intention of every vehicle in the environment would eliminate uncertainty. In this paper, we examine the question of how useful sharing data within a vehicle fleet might be for the search times of particular drivers.
  arXiv  Detail & Related papers  (2024-04-16T15:20:28Z)
• Truck Parking Usage Prediction with Decomposed Graph Neural Networks [15.291200515217513]
  Truck parking on freight corridors faces the major challenge of insufficient parking spaces.<n>It has been shown that providing accurate parking usage prediction can be a cost-effective solution to reduce unsafe parking practices.<n>This paper presents the Regional Temporal Conal Network (Reg-TCN) to predict parking usage across the entire state.
  arXiv  Detail & Related papers  (2024-01-23T17:14:01Z)
• Uncertainty Quantification for Image-based Traffic Prediction across Cities [63.136794104678025]
  Uncertainty quantification (UQ) methods provide an approach to induce probabilistic reasoning. We investigate their application to a large-scale image-based traffic dataset spanning multiple cities. We find that our approach can capture both temporal and spatial effects on traffic behaviour in a representative case study for the city of Moscow.
  arXiv  Detail & Related papers  (2023-08-11T13:35:52Z)
• iPLAN: Intent-Aware Planning in Heterogeneous Traffic via Distributed Multi-Agent Reinforcement Learning [57.24340061741223]
  We introduce a distributed multi-agent reinforcement learning (MARL) algorithm that can predict trajectories and intents in dense and heterogeneous traffic scenarios. Our approach for intent-aware planning, iPLAN, allows agents to infer nearby drivers' intents solely from their local observations.
  arXiv  Detail & Related papers  (2023-06-09T20:12:02Z)
• 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)
• Can Autonomous Vehicles Identify, Recover From, and Adapt to Distribution Shifts? [104.04999499189402]
  Out-of-training-distribution (OOD) scenarios are a common challenge of learning agents at deployment. We propose an uncertainty-aware planning method, called emphrobust imitative planning (RIP) Our method can detect and recover from some distribution shifts, reducing the overconfident and catastrophic extrapolations in OOD scenes. We introduce an autonomous car novel-scene benchmark, textttCARNOVEL, to evaluate the robustness of driving agents to a suite of tasks with distribution shifts.
  arXiv  Detail & Related papers  (2020-06-26T11:07:32Z)
• The Importance of Prior Knowledge in Precise Multimodal Prediction [71.74884391209955]
  Roads have well defined geometries, topologies, and traffic rules. In this paper we propose to incorporate structured priors as a loss function. We demonstrate the effectiveness of our approach on real-world self-driving datasets.
  arXiv  Detail & Related papers  (2020-06-04T03:56:11Z)
• 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)

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.