20.500.12556/DKUM-74526 Algoritmi iskanja poti v labirintu zaključno delo Maze pathfinding algorithms 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 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. najkrajša pot Iskanje v širino Dijkstrov algoritem algoritem A* Usmerjeno požrešno iskaje shortest path Breadth-First Search Dijkstra's algorithm A* algorithm Greedy Best-First Search. true true false [U. Burja] Slovenski jezik Angleški jezik Diplomsko delo/naloga 2019-08-29 19:55:52 2019-11-22 09:51:15 2022-08-09 09:12:15 2020-01-09 03:15:20 2019 0 Maribor 0 Maribor VI, 41 f. 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.021:688-749.8(043.2) 22901526 URN:SI:UM:DK:8ZOUPDRE VS_Burja_Urban_2019.pdf VS_Burja_Urban_2019.pdf 1 DCA30B53BE8B49E0BA4BC8C1E1B8EC33 70fb5bdb5c48a925df36dc5624036905ce7d7c53b409160cf97e2db8d512a21b df9f665c-7c10-11eb-bb7a-00155d0001ca 20.500.12556/dkum/403a54f1-0209-4930-a5d2-d1163d4a2b05 https://dk.um.si/Dokument.php?lang=slv&id=136784 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0