首页 | 本学科首页   官方微博 | 高级检索  
     

双层A^*算法在游戏寻路方面的研究
引用本文:蔡方方,杨士颖,张小凤,刘东平.双层A^*算法在游戏寻路方面的研究[J].微型电脑应用,2010,26(1):26-28.
作者姓名:蔡方方  杨士颖  张小凤  刘东平
作者单位:上海大学影视学院,上海,200072
摘    要:A^*算法是目前实时游戏中使用最广泛的寻路算法.但A^*作为最基本的算法思想,并不能直接应用于实际项目中。该文提出了一种结合地图四叉树预处理的双层A^*寻路算法,在提高效率的同时保证局部搜索精度,另外采用对移动单位赋予优先级的方法来解决移动阻塞问题。实验证明能改善多单位的移动和避让问题,能同时提高搜索效率和增强游戏实时效果。

关 键 词:A^*算法  路径搜索  游戏开发

Research on Two-tiered A-star Algorithm in Game Path-finding
Cai Fangfang,Yang Shiying,Zhang Xiaofeng,Liu Dongping.Research on Two-tiered A-star Algorithm in Game Path-finding[J].Microcomputer Applications,2010,26(1):26-28.
Authors:Cai Fangfang  Yang Shiying  Zhang Xiaofeng  Liu Dongping
Affiliation:Tsai Fangfang,Yang Shiying,Zhang Xiaofeng,Liu Dongping (School of Film , Television Art , Technology,Shanghai University,Shanghai200072,China)
Abstract:A-star algorithm is widely used in real-time games now. But it can not put into practice directly as a basic theory,This paper introduces a two-tiered A-star path-finding algorithm, which to improve the searching quality through the quad-tree map pre-calculation and the high precision local map. simultaneously, we specify the priority of the unit to help give way to each other.Finally, the experiment shows the method can help avoid the traffic jam among the moving-units and to enhance the visual quality of ...
Keywords:A-star  Path-finding  Game Developing  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号