Description

• Title:
  Application of the A* algorithm to problems of the Euclidean shortest paths in the plane with polygonal obstacles
• Creator:
  Wojak, Anna
• Description:
  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.
• Object availability:
  free access
• Date:
  2008.09.30
• Type:
  info:eu-repo/semantics/article;
  info:eu-repo/semantics/publishedVersion;
  Recenzowany artykuł
• Language:
  English
• Source:
  Annales Mathematicae Silesianae; Vol. 22 (2008); 69-82;
  Annales Mathematicae Silesianae; Tom 22 (2008); 69-82;
  2391-4238;
  0860-2107
• Format:
  application/pdf
• Publisher:
  University of Silesia Press
• Relation: https://journals.us.edu.pl/index.php/AMSIL/article/view/14053/10755
• Subject:
  shortest path;
  obstacles;
  visibility graph
• Identifier: https://journals.us.edu.pl/index.php/AMSIL/article/view/14053
• Data provider:
  Czasopisma Wydawnictwa Uniwersytetu Śląskiego
• Can I use it?:
  seek permission
• Type:
  other