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

Pełny rekord metadanych

DC pole	Wartość	Język
dc.contributor.author	Wojak, Anna	-
dc.date.accessioned	2017-11-25T22:48:06Z	-
dc.date.available	2017-11-25T22:48:06Z	-
dc.date.issued	2008	-
dc.identifier.citation	Annales Mathematicae Silesianae, Nr 22 (2008), s. 69-82	pl_PL
dc.identifier.issn	0860-2107	-
dc.identifier.uri	http://hdl.handle.net/20.500.12128/457	-
dc.description.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.	pl_PL
dc.language.iso	en	pl_PL
dc.rights	Uznanie autorstwa-Użycie niekomercyjne-Bez utworów zależnych 3.0 Polska	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/pl/	*
dc.subject	Shortest Path	pl_PL
dc.subject	Obstacles	pl_PL
dc.subject	Visibility Graph	pl_PL
dc.title	Application of the A∗ algorithm to problems of the Euclidean shortest paths in the plane with polygonal obstacles	pl_PL
dc.type	info:eu-repo/semantics/article	pl_PL
Pojawia się w kolekcji:	Artykuły (WNŚiT)

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