计算机科学 ›› 2013, Vol. 40 ›› Issue (11): 316-319.

• 图形图像与模式识别 • 上一篇    

基于地图非均匀划分的Android游戏智能体寻径算法

李红波,赵宽,吴渝   

  1. 重庆邮电大学计算机学院网络智能研究所 重庆400065;重庆邮电大学计算机学院网络智能研究所 重庆400065;重庆邮电大学计算机学院网络智能研究所 重庆400065
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受教育部新世纪优秀人才支持计划项目(教技司[2008]274号),重庆市原创动漫技术及软件(工具)技术研发团队(国科发高[2009]593号)资助

Routing Algorithm for Android Game Agents Based on Non-uniform Partition of Map

LI Hong-bo,ZHAO Kuan and WU Yu   

  • Online:2018-11-16 Published:2018-11-16

摘要: 针对当前Android手机CPU频率较低、内存较小等手机资源不足的问题,在分层寻径算法的基础上提出了基于地图非均匀划分的智能体寻径优化算法。该优化算法在预处理阶段对游戏地图进行非均匀划分,生成抽象地图,在线搜索阶段首先在抽象地图的关键点中进行寻径,再在每个子图中进行路径搜索,最终到达目标节点。实验结果表明,与HPA* Enhancements算法和KM-A*算法相比,提出的算法搜索时间更短,遍历点数更少,能够取得更好的效果。最后,在算法中考虑了地形因素,加入了地形因子,让算法更能适应Android手机游戏的需要。

关键词: Android手机,分层寻径算法,非均匀划分,地形因子

Abstract: For Android phones there are problems of insufficient mobile phone resources like the lower CPU frequency and smaller memory.To solve these problems,on the basis of the hierarchical routing algorithm,a routing algorithm for Android game agents based on non-uniform partition of map was presented.In this algorithm,the game map is non-uniformly partitioned to generate the abstract map in preprocessing phase.And in online searching phase,it first finds paths in key points of the abstract map,then searches paths in each sub-map until the destination node is found.The experiment results indicate that compared with the HPA* Enhancements and KM-A*,the algorithm has the advantages of shorter searching time,fewer traverse points and better results.Finally,a topographical factor is taken into consideration in order to adapt this algorithm to the need of the Android phone games.

Key words: Android phones,Hierarchical routing algorithm,Non-uniform partition,Topographical factor

[1] 宋青,汪小帆.最短路径算法加速技术研究综述[J].电子科技大学学报,2012,1(2):176-184
[2] 林巧民,林萍,王汝传.基于OGRE的智能游戏引擎的设计与实现[J].南京邮电大学学报:自然科学版,2010,0(2):71-76
[3] 李志建,郑新奇,王淑晴,等.改进A*算法及其在GIS路径搜索中的应用[J].系统仿真学报,2009,1(10):3116-3119
[4] 谭德荣,严新平.变权值加快收敛的路径寻优实时算法[J].交通运输工程学报,2004,4(1):118-120
[5] 李得伟,韩宝明,韩宇.一种逆向改进型A*路径搜索算法[J].系统仿真学报,2007,9(22):5175-5177
[6] Botea A,Muller M,Schaeffer J.Near optimal hierarchical path-finding[J].Journal of Game Development,2004,1:7-28
[7] Jansen M R,Buro M.HPA* enhancements[C]∥Proceedings of the Third Artificial Intelligence and Interactive Digital Entertainment Conference.Stanford,California,USA,2007:84-87
[8] Li Yan,Chen Cai,Li Wen-liang,et al.KM-Aa*:A pathfinding algorithm for computer games based on Aa* and K-means Clustering[C]∥Proceedings of 2010The 3rd International Confe-rence on Computational Intelligence and Industrial Application.Volume 7,Wuhan,China,2010:391-394
[9] 雷小锋,谢昆青,林帆,等.一种基于K-Means局部最优性的搞笑聚类算法[J].软件学报,2008,9(7):1683-1692
[10] 于海涛,贾美娟,王慧强,等.基于人工鱼群的优化K-means聚类算法[J].计算机科学,2012,9(12):60-64

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!