Entropy-based Optimization via A* Algorithm for Parking Space Recommendation
This addresses parking space recommendation for drivers, but it is incremental as it combines existing methods (entropy and A*) for a specific application.
The paper tackled the problem of recommending parking spaces by optimizing path planning for both finding a vacant spot and exiting quickly, using an entropy-based approach with the A* algorithm, resulting in the shortest route and robustness to environmental factors.
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.