Skip navigation

Please use this identifier to cite or link to this item:
Title: Application of the A∗ algorithm to problems of the Euclidean shortest paths in the plane with polygonal obstacles
Authors: Wojak, Anna
Keywords: Shortest Path; Obstacles; Visibility Graph
Issue Date: 2008
Citation: Annales Mathematicae Silesianae, Nr 22 (2008), s. 69-82
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.
ISSN: 0860-2107
Appears in Collections:Artykuły (WNŚiT)

Files in This Item:
File Description SizeFormat 
Wojak_Application_of_the_A_algorithm_to_problems.pdf982,74 kBAdobe PDFView/Open
Show full item record

Uznanie autorstwa - użycie niekomercyjne, bez utworów zależnych 3.0 Polska Creative Commons License Creative Commons