计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2014年
10期
308-313
,共6页
虚拟场景%寻路算法%优化方法%有宽度物体%最远可见节点%节点合并
虛擬場景%尋路算法%優化方法%有寬度物體%最遠可見節點%節點閤併
허의장경%심로산법%우화방법%유관도물체%최원가견절점%절점합병
virtual scene%path finding algorithm%optimization method%object with a width%farthest and visible node%node merging
提出一种虚拟场景中有宽度物体移动路径的优化方法,在地图掩码数据经过寻路算法搜索后,得到一组连续路径节点组成的节点集,从起始节点出发,沿着路径节点找出离起始节点最远且没有障碍物遮挡的可见节点,作为下一个起点,循环往复直至节点集的终止节点,并顺序连接这些可见节点,即可得到优化路径。通过合并节点集中的多余节点,使路径更平滑,从而减少物体移动过程中改变方向的次数,解决有宽度物体无法通过狭窄通道后,须重新计算路径的问题,达到了更好的用户体验效果。
提齣一種虛擬場景中有寬度物體移動路徑的優化方法,在地圖掩碼數據經過尋路算法搜索後,得到一組連續路徑節點組成的節點集,從起始節點齣髮,沿著路徑節點找齣離起始節點最遠且沒有障礙物遮擋的可見節點,作為下一箇起點,循環往複直至節點集的終止節點,併順序連接這些可見節點,即可得到優化路徑。通過閤併節點集中的多餘節點,使路徑更平滑,從而減少物體移動過程中改變方嚮的次數,解決有寬度物體無法通過狹窄通道後,鬚重新計算路徑的問題,達到瞭更好的用戶體驗效果。
제출일충허의장경중유관도물체이동로경적우화방법,재지도엄마수거경과심로산법수색후,득도일조련속로경절점조성적절점집,종기시절점출발,연착로경절점조출리기시절점최원차몰유장애물차당적가견절점,작위하일개기점,순배왕복직지절점집적종지절점,병순서련접저사가견절점,즉가득도우화로경。통과합병절점집중적다여절점,사로경경평활,종이감소물체이동과정중개변방향적차수,해결유관도물체무법통과협착통도후,수중신계산로경적문제,체도료경호적용호체험효과。
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.