Komparasi Kinerja Algoritma BFS, Dijkstra, Greedy BFS, dan A* dalam Melakukan Pathfinding

Autor:	Ainatul Mardhiyah, Nurma Romihim Fadilah, Nadila Sugianti
Rok vydání:	2020
Předmět:	Computer science Diagram Shortest path problem Process (computing) Information technology Heuristic function T58.5-58.64 Pathfinding Dijkstra's algorithm Algorithm Execution time
Zdroj:	JISKA (Jurnal Informatika Sunan Kalijaga), Vol 5, Iss 3 (2020)
ISSN:	2528-0074 2527-5836
DOI:	10.14421/jiska.2020.53-07
Popis:	Pathfinding is a computational process in finding the best route between two points or nodes to find the shortest path. This method has many algorithms that can be applied in various fields. In carrying out the pathfinding, speed and distance are considered as important. Through the test diagram, this paper illustrates the execution steps related to the pathfinding algorithm which includes BFS, Dijkstra, Greedy BFS, and A * for comparison. From several studies, the authors identified that execution time and mileage can be used optimally in the comparison process. Input variables as well as media used are 2-dimensional grids and heuristic function calculations. The analogy is carried out on a unity platform with the C# programming language, producing A * as a more flexible pathfinding algorithm to be implemented in various domains.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::555ef5eb30222f6237710998158af605 https://doi.org/10.14421/jiska.2020.53-07 Zobrazit plný text záznamu