Penerapan Pathfinding Menggunakan Algoritma A* Pada Non Player Character (NPC) Di Game
DOI:
https://doi.org/10.30646/sinus.v17i2.423Keywords:
Game, pathfinding, Algoritma A*, non palyer characterAbstract
In this Game , we implement a character designer at the enemy by applying the algorithm A * pathfinding Algorithm. Furthermore, A * is as the algorithm for searching solutions with the use of additional information (heuristics) in which it is an optimal solution. The purpose of developing this Adventure Game  is A * Algorithm implementation for Pathfinding using Unity 3D. Pathfinding is the fastest path of searching process from point of origin to point of destination by avoiding the various barriers along the path traveled without crashing the existing barrier along the way. Its design and development applies Unity 3D. The test result of algorithm in the Game  shows that the total of passed node result is 50 nodes. It is similar with the previous manual count result. Furthermore, the Game  route shows that its passed path is similar with manual count.
Â
References
Adi Botea, Bruno Bouzy, Michael Buro, Christian Bauckhage, D. N. (2013). Pathfinding in Game s. https://doi.org/10.4230/DFU.Vol6.12191.21
Barnouti, N. H., Al-Dabbagh, S. S. M., & Sahib Naser, M. A. (2016). Pathfinding in Strategy Game s and Maze Solving Using A* Search Algorithm. Journal of Computer and Communications, 04(11), 15–25. https://doi.org/10.4236/jcc.2016.411002
Blackman, S. (2013). Beginning 3D Game Development with Unity 4: Beginning 3D Game Development with Unity 4: https://doi.org/10.1007/978-1-4302-4900-9
Cowling, P., Buro, M., Bida, M., Botea, A., Bouzy, B., Butz, M., … Sipper, M. (2014). Search in Real-Time Video Game s. Artificial and Computational Intelligence in Game s, 6, 1–19. https://doi.org/http://dx.doi.org/10.4230/DFU.Vol6.12191.1
Cui, X., & Shi, H. (2011). A*-based Pathfinding in Modern Computer Game s. International Journal of Computer Science and Network Security, 11(1), 125–130. Retrieved from http://paper.ijcsns.org/07_book/201101/20110119.pdf
Fairclough, C., Fagan, M., Mac Namee, B., & Cunningham, P. (2001). Research Directions for AI in Computer Game s. Irish Conference on Artificial Intelligence and Cognitive Science, 333–344. Retrieved from http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.17.2579&rep=rep1&type=pdf
Graham, R., McCabe, H., & Sheridan, S. (2003). Pathfinding in computer Game s. ITB Journal, 4(2), 1–26. https://doi.org/10.4230/DFU.Vol6.12191.21
Hart, P., Nilson, N., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4.
Millington, I., & Funge, J. (2009). Artificial Intelligence for Game s, Second Edition. Representations. https://doi.org/10.1017/S0263574700004070
Niedermeier, R., & Sanders, P. (1996). On the Manhattan-Distance Between Points on Space-Filling Mesh-Indexings. Univ. Fak. Fur Informatik, 1–10.
Yap, P. (2002). Grid-based path-finding. Advances in Artificial Intelligence, 44–55.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are 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 an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their 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 published work (See The Effect of Open Access).
Â
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
