Random Obstacle Advoidance oleh Non Player Character Menggunakan Algoritma A*

Authors

  • Latius Hermawan UNIKA Musi Charitas Palembang
  • Maria Bellaniar Ismiati

DOI:

https://doi.org/10.26623/transformatika.v14i2.438

Keywords:

Algoritma A*, Pathfinding, Obstacle Advoidance, Kecerdasan Buatan, AI

Abstract

Belum ditemukannya solusi yang optimal untuk menyelesaikan masalah pathfinding. Biasanya solusinya tergantung pada spesifik dari ketentuan untuk dapat menemukan jalan keluar untuk setiap permainan yang diberikan. Pathfinding yang optimal merupakan suatu hal yang sulit untuk ditemukan, dimana terdapat perbedaan antara istilah path dan shortest path. Sehingga pathfinding yang ada bertujuan untuk menemukan jalur terpendek yang optimal. Salah satu algoritma yang digunakan pada pathfinding adalah A* digunakan dalam melakukan pencarian jalur yang optimal yang menghubungkan dua titik pada peta (grafik) dari permainan yang ada. Algoritma A* dapat membantu NPC untuk menemukan rute dalam mencari keberadaan target dengan berbagai halangan yang disediakan secara acak dalam satu waktu. Sehingga algoritma ini dapat digunakan untuk mencari rute walaupun ada banyak obstacle yang bermunculan secara acak.

References

Jung Y. An Effective Method of Pathfinding in a Car Racing Game. IEEE Computer and Automation Engineering (ICCAE) The 2nd International Conference : 544-547 .2010.

Geethu E, Mathew. Direction Based Heuristic For Pathfinding In Video Games, IEEE Sponsored Second International Conference On Electronics And Communication Systems.2015.

Bj ¶rnsson, Y. TBA*: Time-Bounded A*. IEEE Twenty-first International Joint Conference on Artificial Intelligence (IJCAI-09); 431-436.2009.

Jafar A. Portable Non-Player Character Tutors with Quest Activities, IEEE Virtual Reality : 253-354, 2010.

S. Priesterjahn, O. Kramer, A. Evolution of human competitive agents in modern computer games. IEEE Congress on

Evolutionary Computation (CEC2006): 777 784. 2006.

J. Hagelb ¤ck and S. J. Johansson, The rise of potential fields in realtime strategy bots. Fourth Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE) :

47. 2008.

P. Avery, S. Louis. Evolving Coordinated Spatial Tactics For Autonomous Entities Using Influence Maps. IEEE Symposium on Computational Intelligence and Games (CIG2009) : 341 348. 2009.

R. Dechter and J. Pearl, Generalized Best-First Search Strategies And The Optimality Of A*. Journal of the ACM, vol. 32 : 505-536. 1985.

D. M. Bourg, and G. Seemann, AI for Game Developers 1st ed., O'Reilly Media : 51-75. 2004.

Hartley, T. In-Game Adaptation Of A Navigation Mesh Cell Path. IEEE 17th International Conference on Computer Games: AI, Animation, Mobile,

Jie Hu. A Pathfinding Algorithm in Real-time Strategy Game based on Unity3D . IEEE ICALIP : 1159-1162. 2012.

Riftadi, M. Variasi Penggunaan Fungsi Heuristik dalam Pengaplikasian Algoritma A*, Makalah IF2251, Teknik Informatika ITB, Bandung. 2007.

Nelly I. Membangun Game Edukasi Sejarah Walisongo. Jurnal Ilmiah Komputer dan Informatika (KOMPUTA). 2012.

Zou, Huilai., Qu, Zening., Qu, Youtian. Optimized Application and Practice of A* Algorithm in Game Map Path- Finding.

Yunifa, Mochamad Hariadi dan Supeno Mardi. Strategi Menyerang pada Game FPS Menggunakan Hierarchy Finite Machine dan Logika Fuzzy, Institut Teknologi Sepuluh November, 2012.

Downloads

Published

2017-01-30

Issue

Vol. 14 No. 2 (2017): January 2017

Section

Artikel

License

Authors who publish with this journal agree to the following terms:

  1. 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.
  2. 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.
  3. 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.

Creative Commons License
Transformatika is licensed under a  Creative Commons Attribution 4.0 International License.