Published: 2008-09-30

Application of the A* algorithm to problems of the Euclidean shortest paths in the plane with polygonal obstacles

Anna Wojak

Abstract

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.

Download files

Citation rules

Wojak, A. (2008). Application of the A* algorithm to problems of the Euclidean shortest paths in the plane with polygonal obstacles. Annales Mathematicae Silesianae, 22, 69–82. Retrieved from https://journals.us.edu.pl/index.php/AMSIL/article/view/14053

Similar Articles

You may also start an advanced similarity search for this article.

Domyślna okładka

Vol. 22 (2008)
Published: 2008-09-30


ISSN: 0860-2107
eISSN: 2391-4238
Ikona DOI 10.1515/amsil

Publisher
University of Silesia Press

This website uses cookies for proper operation, in order to use the portal fully you must accept cookies.