@article{ART000973323},
author={이세일},
title={Dynamic Programming Algorithm Path-finding for Applying Game},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2005},
volume={10},
number={4},
pages={213-219}
TY - JOUR
AU - 이세일
TI - Dynamic Programming Algorithm Path-finding for Applying Game
JO - Journal of The Korea Society of Computer and Information
PY - 2005
VL - 10
IS - 4
PB - The Korean Society Of Computer And Information
SP - 213
EP - 219
SN - 1598-849X
AB - 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.
KW - Dynamic Programming;A*;Artificial Intelligence Game;Tile Map
DO -
UR -
ER -
이세일. (2005). Dynamic Programming Algorithm Path-finding for Applying Game. Journal of The Korea Society of Computer and Information, 10(4), 213-219.
이세일. 2005, "Dynamic Programming Algorithm Path-finding for Applying Game", Journal of The Korea Society of Computer and Information, vol.10, no.4 pp.213-219.
이세일 "Dynamic Programming Algorithm Path-finding for Applying Game" Journal of The Korea Society of Computer and Information 10.4 pp.213-219 (2005) : 213.
이세일. Dynamic Programming Algorithm Path-finding for Applying Game. 2005; 10(4), 213-219.
이세일. "Dynamic Programming Algorithm Path-finding for Applying Game" Journal of The Korea Society of Computer and Information 10, no.4 (2005) : 213-219.
이세일. Dynamic Programming Algorithm Path-finding for Applying Game. Journal of The Korea Society of Computer and Information, 10(4), 213-219.
이세일. Dynamic Programming Algorithm Path-finding for Applying Game. Journal of The Korea Society of Computer and Information. 2005; 10(4) 213-219.
이세일. Dynamic Programming Algorithm Path-finding for Applying Game. 2005; 10(4), 213-219.
이세일. "Dynamic Programming Algorithm Path-finding for Applying Game" Journal of The Korea Society of Computer and Information 10, no.4 (2005) : 213-219.
