Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer
Akbar Ramadhan
Fakultas Ilmu Komputer, Universitas Brawijaya
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Penerapan Theta* Pathfinding untuk Navigasi Non-Player Character pada Gim Maze Akbar Ramadhan; Eriq Muhammad Adams Jonemaro; Muhammad Aminul Akbar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 9 (2019): September 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (572.092 KB)

Abstract

Video Game development has grown as time passes, with an example of Computer Graphic which resulted in products that are almost on par with reality. Varieties of game engine available for developers helps the growth of game development and game industries. One aspect of game development which has also grown is Artificial Intelligence (AI). AI has the ability to give the game a feeling of reality, with its intelligence that is almost like that of a human. One use of AI that is frequently used is Pathfinding. Pathfinding is a searching method from one point to another driven by AI. A* is the most frequently used pathfinding, because A* is guaranteed to give the optimal path. However, the generated path is not always the closest path, as there are other omitted paths which can optimized further with post-processing technique. There are lots of alternative beside A*, one example is Theta* Pathfinding, which is an algorithm that was developed from A*. This research discusses Theta* Pathfinding and its performance compared to basic A* Pathfinding in a maze game. The result of this research shows that Theta* Pathfinding generates a shorter, more optimal route and a shorter time compared to that of A* Pathfinding.
Co-Authors Eriq Muhammad Adams Jonemaro Muhammad Aminul Akbar