Entropy-based Optimization via A* Algorithm for Parking Space Recommendation

TL;DR

This paper proposes an entropy-based A* algorithm to optimize parking space recommendations, effectively finding the shortest route and handling environmental uncertainties.

Contribution

It introduces a novel combination of entropy method with A* algorithm for improved parking space path planning.

Findings

Achieves shortest route for parking recommendations

Robust to environmental factors

Outperforms traditional methods in experiments

Abstract

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.