This paper addresses the path planning problems for recommending parking spaces, given the difficulties of identifying the most optimal route to vacant parking spaces and the shortest time to leave the parking space. Our optimization approach is based on the entropy method and realized by the A* algorithm. Experiments have shown that the combination of A* and the entropy value induces the optimal parking solution with the shortest route while being robust to environmental factors.

翻译：本文论述建议停车位的路径规划问题,因为很难确定最理想的停车位空缺路线和最短的离开停车位时间,我们的最佳办法以“A*”算法为基础,通过“A*”算法实现,实验表明,A*和“entropy”值相结合,既能适应环境因素,又能带来最优的停车方式,最短的路线是最优的停车方式。