CAJ | 학술논문

研究了应用于游戏中的多个路径搜寻算法,以及游戏路径搜寻的一些特点,提出了基于最优路径存储的寻径算法.主要是通过最优路径矩阵存储部分的最优路径,减少大量路径的重复计算,提高游戏中的路径计算效率.针对游戏场景角色的移动引起路径点通行状态的变化导致当前的最优路径失效,提出了路径更新算法,更新最优路径矩阵当中的最优路径.另外,针对地图路径点规模增大的情况,提出了地图路径点分块处理的策略,然后对每一子块分别使用最优路径矩阵进行路径存储.
연구료응용우유희중적다개로경수심산법,이급유희로경수심적일사특점,제출료기우최우로경존저적심경산법.주요시통과최우로경구진존저부분적최우로경,감소대량로경적중복계산,제고유희중적로경계산효솔.침대유희장경각색적이동인기로경점통행상태적변화도치당전적최우로경실효,제출료로경경신산법,경신최우로경구진당중적최우로경.령외,침대지도로경점규모증대적정황,제출료지도로경점분괴처리적책략,연후대매일자괴분별사용최우로경구진진행로경존저.
@@@@Researching some path finding algorithms used in the game, as well as some of the features of game path finding, and giving the routing algorithm based on the optimal path storage. Storing part of the optimal path through the optimal matrix to reduce the large number of repeated path computation, and improve the efficiency of path computation in the game. For the role movement in game scenes changing the state of path points to pass lead to the optimal path of the optimal path matrix invalid. Path update algorithm is given to update the optimal path of the optimal path matrix. As map path points become larger and larger, map paths are divided; then paths are stored for each sub-block using the optimal path matrix.