Comparative Analysis of Pathfinding Algorithms A *, Dijkstra, and BFS on Maze Runner Game

Permana, Silvester Dian Handy; Bintoro, Ketut Bayu Yogha; Arifitama, Budi; Syahputra, Ade

doi:10.30645/ijistech.v1i2.7

Cited by 26 publications

(16 citation statements)

References 5 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, in our graph, weights which are the number of traverses by taxis are not equal. Moreover, they are slower than in the Dijkstra algorithm [58]. e Greedy algorithm uses heuristics and A * algorithms which are a combination of the Greedy algorithm and the Dijkstra algorithm.…”

Section: Weighing Methodmentioning

confidence: 99%

An Improved Route‐Finding Algorithm Using Ubiquitous Ontology‐Based Experiences Modeling

et al. 2019

View full text Add to dashboard Cite

Every day, people are hired in different organizations and old and retiring employees are eliminated from enterprise systems. Eliminating these individuals from organizations leads to the loss of their spatial experiences. In addition, since new employees lack relevant experience, they need a long time to develop the correct skills for the company and may even cause damage to the organization during this learning process. Therefore, storing the spatial experience of individuals is a critical issue. Due to the intelligence of ubiquitous Geospatial Information System (GIS), any experience from any user can be received and stored. In the future, based on these experiences, an appropriate service to each user may be provided as needed. This paper aims to propose an ontology-based model to store spatial experiences in the field of ubiquitous GIS route finding. For this purpose, first ontology is designed for route finding, and then according to this ontology, an ontology-based route-finding algorithm is developed for ubiquitous GIS. Finally, this algorithm is implemented for Tehran, Iran, and its results are compared with the shortest path algorithm (Dijkstra’s algorithm) in terms of the route length and travel time for peak traffic time. The results show that while the route length obtained from the ontology-based algorithm is more than Dijkstra’s algorithm, the travel time is lower, and on some routes the difference in travel time saved reaches 35 minutes.

show abstract

Section: Weighing Methodmentioning

confidence: 99%

An Improved Route‐Finding Algorithm Using Ubiquitous Ontology‐Based Experiences Modeling

et al. 2019

View full text Add to dashboard Cite

show abstract

“…There are different search methods in graphs; one of the best known and used is the Dijkstra Algorithm, which calculates the most optimal route from a point [12]. However, there are also the BFS (Breadth-First Search) and DFS (Depth First Search) algorithms, and both are examples of uninformed search algorithms [33]. The Dijkstra algorithm is used in this study.…”

Section: Evacuation Routesmentioning

confidence: 99%

Outdoors Evacuation Routes Algorithm Using Cellular Automata and Graph Theory for Uphills and Downhills

Velasquez

Alvarez-Alvarado

2021

Sustainability

View full text Add to dashboard Cite

This paper proposes an innovative algorithm for the determination of the optimal outdoor evacuation routes in hills. The algorithm uses web services to obtain the Google Image Tile (a portion of the area to evaluate) and each area’s geographic information. Then, the routes are calculated using cellular automata in 3D and graph theory with geographic information obtained from Google Maps (latitude, longitude, and elevation). The calculation of evacuation routes per study area is performed in an adequate time, revealing the potential of the proposed approach for different applications in emergency scenarios such as wildfires, smart transport, and climbing.

show abstract

“…Kemudian Menurut Arif Cahyo, dan maful prayoga algoritma A* memiliki laju yang lebih cepat dan lebih baik dari dijkstra [7]. Lalu menurut percobaan yang dilakukan Silvester Dian Handi permana antara algoritma A*, BFS, dan Dijkstra untuk diterapkan pada game terutama game bertipe maze lebih baik menggunakan algoritma A* namun bila bloknya lebih banyak maka algoritma Djikstra lebih baik dan itu semua tegantung pada aplikasi apa yang akan dipakai [8]. Selain itu Algoritma Dijkstra ini juga memiliki sisi pembelajaran secara tidak langsung salah satunya adalah mencari jalan keluar yang melatih otak untuk berfikir.…”

Section: Pendahuluanunclassified

Penerapan Algoritma Dijkstra Pada Game Learning Matematika Berbasis Android

Adler¹,

Ramadhan²

2021

Komputika

View full text Add to dashboard Cite

ABSTRAK â€“ Sebuah lembaga survey di bidang game. Newzoo menempatkan Indonesia di peringkat ke-16 dunia dalam hal penggunaan game yang cukup diminati oleh rentang usia produktif 10 â€“ 20 tahun. Untuk itulah perlu adanya proses pembelajaran dan pendidikan terhadap game agar anak-anak di usia tersebut tidak kecanduan game yang akan merusak sel otak. Maka dari itu dengan membangun serta merancang game maze yang memiliki nilai edukasi yang sangat baik untuk anak-anak, maka dari itu digunakan algoritma Dijkstra, sebagai sistem kecerdasan buatan untuk mencari jalan tercepat menuju suatu lokasi. Yang akan melatih otak anak-anak untuk berfikir dan berkembang agar nantinya anak-anak tidak ketergantung lagi pada permainan yang bersifat merusak. Dengan menggunakan kusioner yang telah dirancang maka dapat diambil kesimpulan bahwasannya dari 18 orang anak dari rentang kelas 5 SD sampai kelas 1 SMP yang memainkan game ini 88.9% diantaranya merasa game ini sudah sesuai dengan materi yang mereka pelajari, kemudian game ini juga dirasa menyenangkan dan mereka ingin memainkannya lagi. Yang artinya game ini dapat digunakan sebagai alternatif pembelajaran di sekolah. Kata Kunci â€“ Algoritma Dijkstra; Game Maze; Kecerdasan Buatan; Android; Learning Matematika.

show abstract

Comparative Analysis of Pathfinding Algorithms A *, Dijkstra, and BFS on Maze Runner Game

Abstract: Abstract

Cited by 26 publications

References 5 publications

An Improved Route‐Finding Algorithm Using Ubiquitous Ontology‐Based Experiences Modeling

An Improved Route‐Finding Algorithm Using Ubiquitous Ontology‐Based Experiences Modeling

Outdoors Evacuation Routes Algorithm Using Cellular Automata and Graph Theory for Uphills and Downhills

Penerapan Algoritma Dijkstra Pada Game Learning Matematika Berbasis Android

Contact Info

Product

Resources

About