IMPLEMENTASI ALGORITMA A-STAR DALAM MENENTUKAN RUTE PENGEJARAN OPTIMAL PADA PERMAINAN MEMBASMI NARKOBA
DOI:
https://doi.org/10.25124/jett.v8i1.3830Abstract
Drugs have several negative effects such as dependence, brain and nerve damage, to death if abused. Socialization about the dangers of drug abuse in society by police is still carried out conventionally so that it is less effective especially during the Covid-19 pandemic like today. In this research, an Android game that can convey material on the dangers of drugs in an interesting, interactive, and effective way will be proposed. In the proposed game, an artificial intelligence will be applied to the enemies in order to pursue player through optimal route. One of the algorithms for determining the closest route from the initial location to the destination is A-Star. A-Star algorithm utilize heuristics in evaluating nodes on a grid-shaped map so that its computation time is shorter than Dijkstra's. Based on the analysis that has been carried out, it is known that the overall performance of A-Star algorithm is good where the seven enemies in game can pursue player in real-time through optimal route. The enemies, however, are unable to cooperate in surround player and tend to gather at one point through the same route so that the effectiveness of the pursuit is not maximized. The proposed game can also convey material about the types of drugs and their negative impacts in an interesting, interactive, and effective manner through with gamepedia menu as well as the enemy characters displayed throughout the game.
Downloads
References
Silalahi, D. H.. 2019. Penanggulangan Tindak Pidana Penyalahgunaan Narkotika. 1st ed. Medan: EnamMedia.
Arif, A.. 2020. Aplikasi Pengenalan Jenis Narkoba Berbasis Android Pada Badan Narkotika Nasional Kota Pagar Alam. Indones. J. Comput. Sci.. 9:1 53–64.
Pimpinan Pusat Gerakan Nasional Anti Narkoba. 2020. Jagalah Dirimu dan Keluargamu dari Api Narkoba. 1st ed. Jakarta: Majelis Ulama Indonesia.
Tumiwa K K, dkk. 2021. Tetap Kreatif dan Inovatif di Tengah Pandemi Covid-19 (Jilid 2). 1st ed. Pekalongan: PT. Nasya Expanding Management.
Wibawanto, W.. 2020. Game Edukasi RPG (Role Playing Game). 1st ed. Semarang: LPPM UNNES,
Ahdiyat M A, dan Irwansyah. 2018. Analisis Keterlibatan Komunitas dalam Industri Permainan Daring di Indonesia. Interak. J. Ilmu Komun.. 7:2 105–115.
Tommy L, Kirana C, dan Lindawati V. 2019. Recommender System dengan Kombinasi Apriori dan Content-Based Filtering pada Aplikasi Pemesanan Produk. J. Teknoinfo. 13:2 84–95.
Sazaki Y, Satria H, Primanita A, dan Syahroyni M. 2018. Analisa Perbandingan Algoritma A* dan Dynamic Pathfinding Algorithm dengan Dynamic Pathfinding Algorithm untuk NPC pada Car Racing Game. J. Teknol. Inf. dan Ilmu Komput.. 5:1 95–103.
Umar R, Yudhana A, dan Prayudi A. 2021. Analisis Perbandingan Algoritma Djikstra, A-Star, dan Floyd Warshall dalam Pencarian Rute Terdekat pada Objek Wisata Kabupaten Dompu. J. Teknol. Inf. dan Ilmu Komput.. 8:2 227–234.
Juniawan F P, dan Sylfania D Y. 2020. Penentuan Rute Terpendek Tujuan Wisata di Kota Toboali Menggunakan Algoritme Dijkstra Berbasis Web. J. Teknol. Inf. dan Ilmu Komput.. 7: 1 211–218.
Tommy L, dan Japriadi Y S. 2018. Implementasi Algoritma Dijkstra pada Aplikasi Pencarian Jalur Terpendek Lokasi SPBU di Pangkalpinang Berbasis Android. in Konferensi Nasional Sistem Informasi. 1018–1023.
Dewi R N, Atmodjo D W P, dan Purwaningsih M. 2020. Aplikasi Penentuan Rute dan Waktu Tempuh ke Halte Transjakarta Terdekat dengan Algoritme Dijkstra Berbasis Location Base System. J. Teknol. Inf. dan Ilmu Komput.. 7:4 653–660.
Musril H. A.. 2017. Penerapan Open Shortest Path First (OSPF) untuk Menentukan Jalur Terbaik dalam Jaringan. J. Elektro dan Telekomun. Terap.. 4:1 421–431.
Attamimi I, Yahya W, dan Hanafi M H.. 2017. Analisis Perbandingan Algoritma Floyd-Warshall dan Dijkstra untuk Menentukan Jalur Terpendek Pada Jaringan Openflow. J. Pengemb. Teknol. Inf. dan Ilmu Komput.. 1:12 1842–1849.
Wayahdi M R, Ginting S H N, dan Syahputra D. 2021. Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path. Int. J. Adv. Data Inf. Syst. 2:1 45–52.
Zainulhayat L, dan Purwanto T H. 2017. Perbandingan Rute Optimum Hasil Perhitungan Algoritma Dijkstra dan A-Star untuk Sirkulasi Paket Jasa Ekspedisi JNE di D.I. Yogyakarta. J. Bumi Indones. 6:3 1–10.
Maaruf K. C.. 2016. Kecerdasan Buatan Menggunakan Algoritma A Star (A*) dalam Permainan Ular Tangga (Snake 3D). in Seminar Nasional Teknologi Informasi dan Multimedia. 19–24.
Widodo W, dan Ahmad I. 2017. Penerapan Algoritma A Star (A*) pada Game Petualangan Labirin Berbasis Android. Khazanah Inform. J. Ilmu Komput. dan Inform.. 3:2 57–63.
Umami N A, Agustina I, dan Fauziah. 2018. Rancang Bangun Game Android Adventure Finding Diamond dengan Unity 3D Menggunakan Metode Dynamic Weighting A*. JOINTECS (Journal Inf. Technol. Comput. Sci.. 3:1 45–50.
Hermanto D, dan Dermawan S.. 2018. Penerapan Algoritma A-Star Sebagai Pencari Rute Terpendek pada Robot Hexapod. J. Nas. Tek. Elektro. 7:2 122–129.
Putra A B W, Rachman A A, Santoso A, dan Mulyanto. 2020. Perbandingan Hasil Rute Terdekat Antar Rumah Sakit di Samarinda Menggunakan Algoritma A*(star) dan Floyd-Warshall. J. Sisfokom (Sistem Inf. dan Komputer). 9:1 59–68.
Colls M G, dan Martínez de Osés F X.. 2016. A Ship Routing System Applied at Short Sea Distances. J. Marit. Res.. 13:2 3–6.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Copyright Notice
An author who publishes in the Jurnal Elektro dan Telekomunikasi Terapan agrees to the following terms:
- Author retains the copyright and grants the journal the right of first publication of the work simultaneously licensed under the Creative Commons Attribution-NonCommercial 4.0 International License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal
- Author is able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book) with the acknowledgement of its initial publication in this journal.
- Author is permitted and encouraged to post his/her work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of the published work (See The Effect of Open Access).
Read more about the Creative Commons Attribution-NonCommercial 4.0 International License. here: http://creativecommons.org/licenses/by-nc/4.0/.
Privacy Statement
The names and email addresses entered in this journal site will be used exclusively for the stated purposes of this journal and will not be made available for any other purpose or to any other party.
