Reducing Street Parking Search Time via Smart Assignment Strategies

• URL: http://arxiv.org/abs/2508.19979v1
• Date: Wed, 27 Aug 2025 15:39:25 GMT
• Title: Reducing Street Parking Search Time via Smart Assignment Strategies
• Authors: Behafarid Hemmatpour, Javad Dogani, Nikolaos Laoutaris,
• Abstract summary: Real-time assistants based on mobile phones have been proposed, but their effectiveness is understudied.<n>This work quantifies how varying levels of user coordination and information availability through such apps impact search time and the probability of finding street parking.<n>In high-fidelity simulations of Madrid's parking network with real traffic data, users of Cord-Approx averaged 6.69 minutes to find parking, compared to 19.98 minutes for non-users without an app.
• Score: 1.6312989763677892
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In dense metropolitan areas, searching for street parking adds to traffic congestion. Like many other problems, real-time assistants based on mobile phones have been proposed, but their effectiveness is understudied. This work quantifies how varying levels of user coordination and information availability through such apps impact search time and the probability of finding street parking. Through a data-driven simulation of Madrid's street parking ecosystem, we analyze four distinct strategies: uncoordinated search (Unc-Agn), coordinated parking without awareness of non-users (Cord-Agn), an idealized oracle system that knows the positions of all non-users (Cord-Oracle), and our novel/practical Cord-Approx strategy that estimates non-users' behavior probabilistically. The Cord-Approx strategy, instead of requiring knowledge of how close non-users are to a certain spot in order to decide whether to navigate toward it, uses past occupancy distributions to elongate physical distances between system users and alternative parking spots, and then solves a Hungarian matching problem to dispatch accordingly. In high-fidelity simulations of Madrid's parking network with real traffic data, users of Cord-Approx averaged 6.69 minutes to find parking, compared to 19.98 minutes for non-users without an app. A zone-level snapshot shows that Cord-Approx reduces search time for system users by 72% (range = 67-76%) in central hubs, and up to 73% in residential areas, relative to non-users.

Related papers

• Dynamic Configuration of On-Street Parking Spaces using Multi Agent Reinforcement Learning [3.8043591176728317]
  We explore how the impact of on-street parking on traffic congestion could be minimized, by dynamically configuring on-street parking spaces.<n>Our proposed solution comprises a two-layer multi agent reinforcement learning based framework, which is inherently scalable to large road networks.<n>Our experiments show that the proposed framework could reduce the average travel time loss of vehicles significantly, reaching upto 47%, with a negligible increase in the walking distance for parking.
  arXiv  Detail & Related papers  (2025-12-02T04:33:26Z)
• 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)
• Your Car Tells Me Where You Drove: A Novel Path Inference Attack via CAN Bus and OBD-II Data [57.22545280370174]
  On Path Diagnostic - Intrusion & Inference (OPD-II) is a novel path inference attack leveraging a physical car model and a map matching algorithm. We implement our attack on a set of four different cars and a total number of 41 tracks in different road and traffic scenarios.
  arXiv  Detail & Related papers  (2024-06-30T04:21:46Z)
• 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)
• Vehicle Occurrence-based Parking Space Detection [5.084185653371259]
  This work presents an automatic parking space detection method, which receives a sequence of images of a parking lot and returns a list of coordinates identifying the detected parking spaces. The results using twelve different subsets from the PKLot and CNRPark-EXT parking lot datasets show that the method achieved an AP25 score up to 95.60% and AP50 score up to 79.90%.
  arXiv  Detail & Related papers  (2023-06-16T16:22:45Z)
• Learning to Control and Coordinate Mixed Traffic Through Robot Vehicles at Complex and Unsignalized Intersections [33.0086333735748]
  We propose a multi-agent reinforcement learning approach for the control and coordination of mixed traffic by RVs at real-world, complex intersections. Our method can prevent congestion formation via merely 5% RVs under a real-world traffic demand of 700 vehicles per hour. Our method is robust against blackout events, sudden RV percentage drops, and V2V communication error.
  arXiv  Detail & Related papers  (2023-01-12T21:09:58Z)
• 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)
• Public Parking Spot Detection And Geo-localization Using Transfer Learning [0.0]
  In cities around the world, locating public parking lots with vacant parking spots is a major problem, costing commuters time and adding to traffic congestion. This work illustrates how a dataset of Geo-tagged images from a mobile phone camera, can be used in navigating to the most convenient public parking lot in Johannesburg with an available parking space, detected by a neural network powered-public camera.
  arXiv  Detail & Related papers  (2022-09-01T04:09:51Z)
• A Keypoint-based Global Association Network for Lane Detection [47.93323407661912]
  Lane detection is a challenging task that requires predicting complex topology shapes of lane lines and distinguishing different types of lanes simultaneously. We propose a Global Association Network (GANet) to formulate the lane detection problem from a new perspective. Our method outperforms previous methods with F1 score of 79.63% on CULane and 97.71% on Tusimple dataset with high FPS.
  arXiv  Detail & Related papers  (2022-04-15T05:24:04Z)
• Learning-Based Path Planning for Long-Range Autonomous Valet Parking [37.70834223132688]
  Long-range autonomous valet parking (LAVP) is presented. An Electric Autonomous Vehicle (EAV) is deployed in the city, which can pick up, drop off users at their required spots, and then drive to the car park out of city center autonomously. We propose a learning based algorithm, which is named as Double-Layer Ant Colony Optimization (DL-ACO) algorithm.
  arXiv  Detail & Related papers  (2021-09-23T21:55:12Z)
• METEOR: A Massive Dense & Heterogeneous Behavior Dataset for Autonomous Driving [42.69638782267657]
  We present a new and complex traffic dataset, METEOR, which captures traffic patterns in unstructured scenarios in India. METEOR consists of more than 1000 one-minute video clips, over 2 million annotated frames with ego-vehicle trajectories, and more than 13 million bounding boxes for surrounding vehicles or traffic agents. We use our novel dataset to evaluate the performance of object detection and behavior prediction algorithms.
  arXiv  Detail & Related papers  (2021-09-16T01:01:55Z)
• An Experimental Urban Case Study with Various Data Sources and a Model for Traffic Estimation [65.28133251370055]
  We organize an experimental campaign with video measurement in an area within the urban network of Zurich, Switzerland. We focus on capturing the traffic state in terms of traffic flow and travel times by ensuring measurements from established thermal cameras. We propose a simple yet efficient Multiple Linear Regression (MLR) model to estimate travel times with fusion of various data sources.
  arXiv  Detail & Related papers  (2021-08-02T08:13:57Z)
• Infostop: Scalable stop-location detection in multi-user mobility data [0.0]
  We describe the Infostop algorithm that overcomes the limitations of the state-of-the-art solution by leveraging the flow-based network community detection algorithm Infomap. We show that the size of locations detected by Infostops for increasing number of users and that time complexity grows slower than for previous solutions.
  arXiv  Detail & Related papers  (2020-03-31T17:02:19Z)

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.