Komparasi kinerja algoritma BFS, Dijkstra, Greedy BFS, dan A* dalam melakukan pathfinding

Sugianti, Nadila, Mardhiyah, Ainatul and Fadilah, Nurma Romihim (2020) Komparasi kinerja algoritma BFS, Dijkstra, Greedy BFS, dan A* dalam melakukan pathfinding. JISKA (Jurnal Informatika Sunan Kalijaga), 5 (3). pp. 194-205. ISSN 2528-0074

Preview

Text 13288.pdf - Published Version Available under License Creative Commons Attribution Non-commercial. Download (463kB) | Preview

Abstract

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.

Item Type:	Journal Article
Depositing User:	ainatul mardhiyah mardhiyah
Date Deposited:	13 Apr 2023 13:16

Downloads

Origin of downloads

Actions (login required)

View Item