본문 바로가기
  • Home

Dynamic Programming Algorithm Path-finding for Applying Game

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2005, 10(4), pp.213-219
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

이세일 1

1공주대학교

Candidate

ABSTRACT

In order to move NPC's to target location at game maps, various algorithm including A* has been used. The most frequently used algorithm among them is A* with fast finding speed. But A* has the following problems. The first problem is that at randomly changing map, it is necessary to calculate all things again whenever there are any changes. And when calculation is wrong, it is not possible to search for target. The second problem is that it is difficult to move avoiding dangerous locations damaging NPC such as an obstruction. Although it is possible to avoid moving to locations with high weight by giving weight to dangerous factors, it is difficult to control in case NPC moves nearby dangerous factors.In order to solve such problems, in this thesis, the researcher applied Dynamic Programming to path-finding algorithm. As the result of its application, the researcher could confirm that the programming was suitable for changes at the map with random change and NPC's avoided the factors being dangerous to them far away. In addition, when compared to A*, there were good results.

Citation status

* References for papers published after 2022 are currently being built.