Abstract
In this research, in order to find a high efficiency automated valet parking lot, a multi-story car parking proposed by the authors, possible algorisms of entering and exiting are proposed. And, by combining those algorisms, efficiency comparisons of the automated valet parking lot were simulated. The algorisms were as follows: (1) The entering location number is decided with uniform random numbers. This is the most realistic entering method. (2) The target location of entering is decided in order of the smallest number available. Therefore, if a location which is close to the exit is available, even a car entering later can park there. (3) Entering cars will be parked in order of the smallest number of parking location. If locations are full, “garbage collection” will be performed to fill up the empty parking locations in order of the smallest parking location number (starting from close to the exit), then creating an empty space in a far parking location from the exit. Next, exiting algorisms which were used are as follows: (1) Move the car that was requested to exit to the exit. (2) Move the car that was requested to exit to the exit, then the latest entering car is moved to the parking location which is available. (3) Move the car that was requested to exit to the exit, then cars parked at the next parking location number are sequentially moved to the available parking spaces. By the results of simulations, which parking method had the highest efficiency as an automated valet parking lot was clearly shown, and useful features were demonstrated.
