Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (1): 104-104.
• 产品、研发、测试 • Previous Articles Next Articles
HongZhi XU,,
Received:
Revised:
Online:
Published:
Contact:
徐洪智,李仁发,颜一鸣
通讯作者:
Abstract: Analyzed the algorithm of breadth-first, depth-first and heuristic-Search in path-finding for the map of game, put forward the Branch-and-Bound algorithm marking path directly based on breadth-first, the algorithm can find the shortest path by using O (N+L) at most, and can meet the path-finding requirements for game map with complicated landform.
Key words: game map, path, Branch-and-Bound, search
摘要: 分析了游戏地图寻径中的宽度优先,深度优先和启发式搜索算法,提出了一种基于宽度优先直接标记路径的分支限界搜索算法,最多使用O(N+L)的时间完成最短路径搜索,能很好的适用游戏地图中复杂地形的寻径要求。
关键词: 游戏地图, 路径, 分支限界, 搜索
HongZhi XU,,. Application of Branch-and-Bound Algorithm in Path-Finding for the Map of Game[J]. Computer Engineering and Applications, 2007, 43(1): 104-104.
徐洪智,李仁发,颜一鸣. 分支限界法在游戏地图寻径中的应用[J]. 计算机工程与应用, 2007, 43(1): 104-104.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2007/V43/I1/104