基于Silverlight网页游戏的寻径优化算法  

Advanced algorithm search in Silverlight web game

作　　者：李子强[1] 宋余庆[1] 陈健美[1] 冯江[1] 

机构地区：[1]江苏大学计算机科学与通信工程学院,江苏镇江212013

出　　处：《计算机工程与应用》2013年第5期59-63,共5页Computer Engineering and Applications

基　　金：教育部博士点基金(No.20113227110010);江苏省高校自然基金(No.10KJB520004);江苏省软件与集成电路专项基金(No.2009[100]);江苏省普通高校研究生科研创新计划(No.CXZZ11_0575)

摘　　要：为了解决A*路径搜索算法在Silverlight网页游戏中的搜索费时和路径曲折等问题,在结合光线跨越算法和引入父结点指针的二叉堆存储开启列表的A*算法的基础上,提出了一种基于Silverlight网页游戏的寻径优化算法。该算法在现有研究的基础上使用光线跨越算法减小A*算法搜索规模,同时将动态关键点技术与光线跨越算法结合来优化算法返回的路径。将该算法在游戏所使用的网格地图中进行实验,实验结果表明,该算法能够有效地根据系统设定的通行条件寻找出一条最优的实际可行的路径,同时缩短寻路的时间消耗和所寻的路径长度,提高游戏的可玩性。Aimed to the problems of A＊ algorithm search in Silverlight web games, such as the path optimization problem and the time-consuming problem, this paper associates the light across algorithm with the A＊ algorithm search that uses the light across algorithm and the parent node pointer, and proposes an advanced algorithm search in Silverlight web games. The algo- rithm is based on the existing research results and uses the light across algorithm to reduce the A＊ algorithm search scale. Mean- while, it introduces the dynamic critical point technique that combined with the light across algorithm to optimize the path. The experiment in the grid map that used in Silverlight web games proves that this algorithm can effectively find out an optimal prac- tical path, according to the prevailing conditions set by the system. It can raise the search efficiency and reduce the complexity of the planning issue and improve the playability.

关 键 词：A＊算法 光线跨越算法 动态关键点 启发式搜索 地图寻径 Silverlight网页游戏 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]