| 2D游戏地图的寻路实现 |
| |
| 引用本文： | 邱 磊,张 辉.2D游戏地图的寻路实现[J].湖南工业大学学报,2012,26(1):66-69. |
| |
| 作者姓名： | 邱 磊 张 辉 |
| |
| 作者单位： | 武汉船舶职业技术学院电气与电子T程学院,湖北武汉,430050 |
| |
| 基金项目： | 湖北省优秀中青年人才科研基金资助项目（Q20106101） |
| |
| 摘 要： | 对2D游戏领域的地图寻路算法进行了研究。阐述了A＊寻路算法和D＊寻路算法，并在BlitzBasic2D游戏开发平台仿真实现了2种路径搜索算法。实验结果表明：A＊算法适合在静态地图中搜索路径，而D＊算法在动态地图中搜索路径更迅速、有效，且随着结点数量的增加，D＊算法优于A＊算法。
|
| 关 键 词： | 人工智能 游戏地图 A＊算法 D＊算法 |
| 收稿时间： | 8/2/2011 12:00:00 AM |
Implementation of Path Finding on 2D Game Maps |
| |
| Qiu Lei and Zhang Hui.Implementation of Path Finding on 2D Game Maps[J].Journal of Hnnnan University of Technology,2012,26(1):66-69. |
| |
| Authors: | Qiu Lei and Zhang Hui |
| |
| Affiliation: | (College of Electrical and Electronic Engineering,Wuhan Institute of Shipbuilding Technology,Wuhan 430050,China) |
| |
| Abstract: | Researched into path finding algorithm on map in the field of 2D game. Expounded A* algorithm and D* algorithm and simulated two path-search algorithms on the Blitz Basic 2D game development platform. Experimental results indicate that A* algorithm is suitable for searching path on static game map, D* algorithm is very quickly and effectively when searching path in dynamic game map environment, and as the number of nodes increasing, the performance of D* is better than A*. |
| |
| Keywords: | artificial intelligence game map A* algorithm D* algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《湖南工业大学学报》浏览原始摘要信息 |
|
点击此处可从《湖南工业大学学报》下载全文 |
