Aiming at the problems of lots of vehicles in underground parking lots and difficulties of parking

and low efficiency of parking space guidance

a two-way sector search method

which is a shortest path planning for empty parking spaces in underground parking lot road network model in search direction and search range is proposed. This method classifies the road network features in the field by improving the Dijkstra algorithm

and takes the driver’s parking and the optimal route to the elevator as the basic principle

use the strategy of"vehicle staggered guidance and parking space partition selection"for path search. The experimental simulation shows that the modified Dijkstra algorithm improves the search efficiency of the target node compared to the classical algorithm.