20.500.12556/DKUM-42009 IZBOLJŠAVE ALGORITMA A* ZA ISKANJE OPTIMALNIH POTI IMPROVEMENTS OF A* ALGORITHM FOR OPTIMAL PATH SEARCH V diplomski nalogi predstavimo nekaj najučinkovitejših izpeljank algoritma A* za iskanje optimalnih poti med vozlišči grafa. Med opisane algoritme spadajo originalni algoritem A*, algoritem IDA*, algoritem RBFS, algoritem dvosmernega iskanja, algoritem HPA* ter algoritem SMA*. Algoritme primerjamo s pomočjo implementirane aplikacije na labirintih, ki so ustvarjeni s Primovim algoritmom. Z analizo rezultatov izpostavimo prednosti in slabosti posameznih algoritmov. This diploma work presents a few most effective variations of the A* algorithm for optimal pathfinding between the nodes of the graph. The algorithms I present are the original A* algorithm, IDA* algorithm, RBFS algorithm, bidirectional search algorithm, HPA* algorithm and SMA* algorithm. We compare the algorithms with the help of an implemented application on mazes, created with Prim's algorithm. For the analysis of the results, we expose the advantages and disadvantages of individual algorithms. algoritem A* algoritem dvosmernega iskanja IDA* RBFS SMA* A* algorithm bidirectional search algorithm IDA* RBFS SMA* true true false [S. Šlaus] Slovenski jezik Angleški jezik Diplomsko delo/naloga 2013-09-09 22:01:56 2013-09-19 15:52:39 2022-05-06 03:07:04 2021-04-26 03:27:30 2013 0 Maribor 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.8(043.2) 17493270 URN:SI:UM:DK:LWEK7LGQ UNI_Slaus_Samo_2013.pdf UNI_Slaus_Samo_2013.pdf 1 1B4139AD85F0A4E31E903DCAA2D23D7B 427724d0c5b01cf77631db5cf6054d7f703774d1d4464874371a2e64793a6bc8 4a37607c-7c0a-11eb-bb7a-00155d0001ca https://dk.um.si/Dokument.php?lang=slv&id=58422 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0