Adapting the A* algorithm for park spot routing

Hedderich, Mareike; Fastenrath, Ulrich; Isaac, Gordon; Bogenberger, Klaus

doi:10.1016/j.trpro.2017.12.013

Cited by 10 publications

(4 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…ParkAssistant [11] aims to minimize an overall measure of parking cost that incorporates parking price and time, traffic rules, driver preference, and other factors. PSR [15] adapts the A* algorithm in a road network simulation environment. A number of agent-based models [2,10,24,37,38] perform simulations of driver behavior and parking supply.…”

Section: Route Planningmentioning

confidence: 99%

Hard to Park?

Arora

Cook

Kumar

et al. 2019

Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &Amp; Data Mining

View full text Add to dashboard Cite

In this paper we consider the problem of estimating the difficulty of parking at a particular time and place; this problem is a critical sub-component for any system providing parking assistance to users. We describe an approach to this problem that is currently in production in Google Maps, providing inferences in cities across the world. We present a wide range of features intended to capture different aspects of parking difficulty and study their effectiveness both alone and in combination. We also evaluate various model architectures for the prediction problem. Finally, we present challenges faced in estimating parking difficulty in different regions of the world, and the approaches we have taken to address them.

show abstract

Section: Route Planningmentioning

confidence: 99%

Hard to Park?

Arora

Cook

Kumar

et al. 2019

Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &Amp; Data Mining

View full text Add to dashboard Cite

show abstract

“…Against the background of issues related to the subject of parking lots, publications describing methods and tools for finding a free parking space in an urban area [6][7][8][9], parking management [10,11], and analysis of data about their users stand out in the literature [12,13]. A particular problem is posed by the establishment of appropriate technical parameters for vehicle stops in large urban agglomerations, where available space is limited.…”

Section: Introductionmentioning

confidence: 99%

Characteristics of Parking Lots Located along Main Roads in Terms of Cargo Truck Requirements: A Case Study of Poland

Betkier

Macioszek

2022

Sustainability

View full text Add to dashboard Cite

The issue related to parking lots has a multidimensional nature. For the purposes of the article, the analysis covered 113 parking lots located directly next to national roads in the Mazovian Voivodeship (Poland), which is similar in terms of economic development and conditions of the linear infrastructure to other countries in Central Europe. The conducted research included analyzing the correlation of parameters in individual parking lots and those related to nearby roads (traffic volume, technical quality) and the type of area in which they occurred (population density). In addition, the presented results describe the capacity of parking in the analyzed region in terms of the number of available parking slots for heavy goods vehicles, the size of the additional operating area, and the presence of security-related elements (fencing, lighting, physical protection, monitoring). The analysis demonstrated a correlation between some parameters (type of nearby road and security rs = 0.35, area size and number of slots rs = 0.35) and significant differences in results between private and public parking lots (average number of slots 18 versus 34, percent of most secured parkings 45% versus 69%). The obtained innovative results can be used by public institutions and entities providing parking services to reorganize the space at parking places and to conduct more effective analyses from the point of view of future investments in infrastructure accompanying the public road network.

show abstract

“…The algorithm also considered parking rules of streets, traffic conditions, probabilities of finding an empty parking spot, and drivers' utility. Moreover, Hedderich et al (8,9) developed a PSR system based on an A* algorithm to search for optimal routes for vehicles with the highest parking probabilities. The system was designed for on-street parking with the consideration of both vehicle travel time and parking probability.…”

mentioning

confidence: 99%

“…The optimal route helps the vehicle to arrive its destination with the highest probability as well as maintaining a high parking probability close to the destination. However, the work of Hedderich et al (8,9,11) always assumed that the parking probability was constant, which ignored the dynamics of vehicle arrival and departure to parking garages and on-street parking. In the real world, timedependent parking probabilities limit the implementations of the proposed systems and reduce their benefits.…”

mentioning

confidence: 99%

Dynamic Vehicle Routing with Parking Probability under Connected Environment

Yang

Oguchi

2021

Transportation Research Record: Journal of the Transportation R

View full text Add to dashboard Cite

In downtown areas of large cities, it is very challenging for drivers to find available parking spots, even when they are provided with information on parking availability and location information. To overcome this challenge, this paper develops a dynamic vehicle routing system to search for the optimal routes for connected vehicles to find parking spots successfully and to minimize total trip time, including driving time and walking time. The system predicts the probability of each parking lot having available parking spots based on the existing available number of spots and the vehicle arrival and departure rates collected by connected vehicles. This probability is integrated in the search for vehicle routes to minimize total travel and walking times. Numerical experiments indicate that the proposed system can reduce the cruising time spent searching for available parking spots, and the total trip time can be reduced by up to 24%. In addition, the system can decrease the number of re-routing decisions, which reduces the stress of drivers on the road. A sensitivity analysis of the parking probability is also conducted. Some future work based on the proposed system is proposed in the conclusion to this paper.

show abstract

Adapting the A* algorithm for park spot routing

Cited by 10 publications

References 4 publications

Hard to Park?

Hard to Park?

Characteristics of Parking Lots Located along Main Roads in Terms of Cargo Truck Requirements: A Case Study of Poland

Dynamic Vehicle Routing with Parking Probability under Connected Environment

Contact Info

Product

Resources

About