Algoritmi iskanja poti v labirintu

zaključno delo

Urban Burja (Author), Simon Kolmanič (Mentor)

Abstract

Namen diplomske naloge je predstavitev različnih pristopov reševanja problema iskanja poti v labirintu med dvema točkama. Spoznali smo klasične metode, kot so iskanje v širino, iskanje v globino, Dijkstrov algoritem, algoritem A*, Usmerjeno požrešno iskanje ter algoritem levega pravila. Vsak algoritem smo opisali in ga vizualno predstavili. V zaključku pogledamo še rezultate posameznega pristopa na dveh primerih ter opišemo naše ugotovitve

Keywords

najkrajša pot;Iskanje v širino;Dijkstrov algoritem;algoritem A*;usmerjeno požrešno iskanje;diplomske naloge;

Data

Language:	Slovenian
Year of publishing:	2019
Typology:	2.11 - Undergraduate Thesis
Organization:	UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher:	[U. Burja]
UDC:	004.021(043.2)
COBISS:	22901526
Views:	652
Downloads:	95
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Maze pathfinding algorithms
Secondary abstract:	Purpose of this degree paper is to present different methods for solving the problem of finding a path in a labyrinth between two points. We are introduced to classical methods such as Breadth-First Search, Depth-First Search, Dijkstra's algorithm, Astar, Greedy Best-First Search, and Left turn algorithm. We described each algorithm and visually presented them. In the end, we look at the results of each method on two examples and describe our findings.
Secondary keywords:	shortest path;Breadth-First Search;Dijkstra's algorithm;A* algorithm;Greedy Best-First Search.;
Type (COBISS):	Bachelor thesis/paper
Thesis comment:	Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije
Pages:	VI, 41 f.
ID:	11210259