基于A*算法的停车场路径引导设计

Path Planning and Design of Parking Space Based on A*Algorithm

为提高停车场停车效率和选择最佳停车位,根据停车场的车位布局及车位使用状况,设计了泊车路径规划模型。把空闲车位抽象为二维坐标系的坐标点,分别计算其距离用户位置的曼哈顿距离,选取曼哈顿距离最小值的停车位为最优车位。选用改进的A*算法为停车路径规划算法,为进一步优化算法遍历过程,使之更加适用于停车场车位分布较分散的情况,以停车位对应路段为遍历节点进行路径搜索,并完成路径规划,结果表明:该方法有效地去除了冗余节点,提高了算法遍历速度。

In order to improve the parking efficiency of the parking lot and choose the best parking space, a parking route planning model is designed according to the parking space layout and parking space usage conditions of the parking lot. The idle parking spaces are abstracted as coordinate points in a two-dimensional coordinate system, and the Manhattan distance from the user’s location is calculated respectively, and the parking space with the minimum Manhattan distance is selected as the optimal parking space. The improved A* algorithm is selected as the parking path planning algorithm. In order to further optimize the algorithm traversal process, it is more suitable for the situation of scattered parking spaces in the parking lot. The road section searches for the path for traversing nodes and completes the path planning. The results show that the method effectively removes redundant nodes and improves the algorithm traversal speed.