  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.
