| 基于A*和Bresenham相结合的网络游戏寻路算法设计与实现 |
| |
| 引用本文： | 王同喜,孙淑霞.基于A*和Bresenham相结合的网络游戏寻路算法设计与实现[J].成都理工大学学报(自然科学版),2007,34(4):456-459. |
| |
| 作者姓名： | 王同喜 孙淑霞 |
| |
| 作者单位： | 长江大学计算机科学学院,湖北荆州,434023;成都理工大学网络教育学院,成都,610059;成都理工大学网络教育学院,成都,610059 |
| |
| 摘 要： | 网络游戏寻路算法主要是解决角色以最佳的方式走到指定地点的问题.该文首先介绍了一种基于启发式搜索的A*算法和获得直线路径的Bresenham算法,并结合游戏地图,给出网络游戏寻路算法及其具体实现方法.结果表明,A*算法结合Bresenham算法实现寻路提高了目标搜索的效率,从而突显了游戏角色和怪兽的智能性,增强了游戏的可玩性.
|
| 关 键 词： | 启发式搜索 A*算法 Bresenham算法 游戏地图 寻路 |
| 文章编号： | 1671-9727（2007）04-0456-04 |
| 修稿时间： | 2006-12-03 |
Design and realization of a net game path-seeking algorithm based on A* and Bresenham |
| |
| WANG Tong-xi,SUN Shu-xia.Design and realization of a net game path-seeking algorithm based on A* and Bresenham[J].Journal of Chengdu University of Technology: Sci & Technol Ed,2007,34(4):456-459. |
| |
| Authors: | WANG Tong-xi SUN Shu-xia |
| |
| Institution: | Faculty of Computer Science and Technology, Yangtze University, J ingzhou 434023, China ; College of Net Education, Chengdu University of Technology, Chengdu 610059, China |
| |
| Abstract: | A net game path-seeking algorithm mainly solves the problem of how to get to the destination in a best way.Firstly,this paper introduces the A* algorithm based on heuristic searching and bresenham algorithm for gaining a straight line path.Then,combined with the game map,it gives the net game path-seeking algorithm and its realization.The result reveals that the combination of the A* and Bresenham algorithms improves the efficiency of seeking path,and thus highlights the intelligence of game roles and beasts and makes the game more interesting. |
| |
| Keywords: | heuristic searching A* algorithm Bresenham algorithm game map path-seeking |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
