Application of the A* algorithm to problems of the Euclidean shortest paths in the plane with polygonal obstacles
Anna Wojak · PUBLISHING HOUSE OF THE UNIVERSITY OF SILESIA (University of Silesia) · 2008
The Euclidean shortest path between two points s and t in the plane with the cellular decomposition in the presence of obstacles is considered. The A* algorithm for a visibility graph (VG) is used to avoid widened obstacles. Computational experiments show that the proposed algorithm is often faster and it analyzes fewer nodes than the classical Dijkstra algorithm.