虚拟场景中有宽度物体移动路径的优化方法  

Optimization Method of Moving Path for Object with a Width in Virtual Scene

作　　者：吴拥民[1,2] 张斌 

机构地区：[1]闽江学院计算机科学系,福州350108 [2]网龙网络有限公司程序研发部,福州350003

出　　处：《计算机工程》2014年第10期308-313,共6页Computer Engineering

摘　　要：提出一种虚拟场景中有宽度物体移动路径的优化方法,在地图掩码数据经过寻路算法搜索后,得到一组连续路径节点组成的节点集,从起始节点出发,沿着路径节点找出离起始节点最远且没有障碍物遮挡的可见节点,作为下一个起点,循环往复直至节点集的终止节点,并顺序连接这些可见节点,即可得到优化路径。通过合并节点集中的多余节点,使路径更平滑,从而减少物体移动过程中改变方向的次数,解决有宽度物体无法通过狭窄通道后,须重新计算路径的问题,达到了更好的用户体验效果。The optimization path finding algorithm computes a moving path of the object with a width in game scene, which searches a continuous node composed of a node-set from map mask. Starting from the initial node,along the path from start node to find the farthest node and no visible obstacles,as a starting point,move in circles until the termination node set. Then sequentially connect these visible nodes,which can get optimal path. The redundant node with node set, makes the path smooth,reduces the times of changing direction in the process of moving objects,eliminates the object with a width not pass through a narrow channel, needs to re-compute the path problem, which achieves a better user experience.

关 键 词：虚拟场景 寻路算法 优化方法 有宽度物体 最远可见节点 节点合并 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]