.png){kind=icon}
Return
Puzzle-based parking
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trc.2021.103112.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In a common parking lot, much of the space is devoted not to parking but to lanes in which cars travel to and from parking spaces. Lanes must not be blocked for one simple reason: a blocked car might need to leave before the car that blocks it. Self-parking and intelligent communication capabilities of autonomous vehicles introduces an opportunity to overcome this constraint, and therefore to achieve much higher storage capacity of cars. We show how to maximize the number of cars in a parking lot that assumes interfering cars could be moved out of the way by a centralized controller. We provide optimal results for small lots with a single entry point, and we offer heuristic methods for larger lots. Improvements in parking capacity of 80 percent is possible.
Keywords:
High density parking
Autonomous vehicles
Rush Hour puzzle
heuristic search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.9
Papers:
4.7K
Citations:
3.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more