arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1401.3857cs.AI
收藏

基于案例的视频游戏实时的启发式搜索子目标寻路算法

Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding

University of Alberta(阿尔伯塔大学);Reykjavik University(雷克雅未克大学);University of British Columbia Okanagan(不列颠哥伦比亚大学奥肯那根分校)

Vadim Bulitko, Yngvi Björnsson, Ramon Lawrence

摘要:

实时的【形】启发式搜索算法满足一个恒定的约束上的规划量,每个动作,独立于问题的大小。因此,随着问题变得更大,它们也会扩大规模。这种特性将使它们非常适合于视频游戏,其中人工智能控制的代理必须对用户命令和其他代理的动作做出快速反应。缺点是,实时的【形】搜索算法采用的学习方法经常导致解决方案质量差,并导致代理通过重复访问相同的问题状态而显得不合理。最近,一种新的算法D LRTA* 改变了这种情况,该算法试图通过自动选择子目标来消除学习。D LRTA* 非常适合视频游戏,除了它有一个复杂且内存要求很高的预计算阶段,在此期间它构建了一个子目标数据库。在本文中,我们提出了一种更简单,更节省内存的方法来预先计算子目标,从而消除了在视频游戏中应用最先进的实时的【形】搜索方法的主要障碍。新算法解决了一些随机选择的问题离线,压缩成一系列的子目标的解决方案,并将它们存储在数据库中。当在线提出一个新问题时,它会在数据库中查询最相似的先前解决的案例,并使用其子目标来解决问题。在四个大型视频游戏地图上的寻路领域,新算法提供的解决方案是原来的八倍,同时使用的内存减少了57倍,预计算时间减少了14%。

英文摘要:

Real-time heuristic search algorithms satisfy a constant bound on the amount of planning per action, independent of problem size. As a result, they scale up well as problems become larger. This property would make them well suited for video games where Artificial Intelligence controlled agents must react quickly to user commands and to other agents actions. On the downside, real-time search algorithms employ learning methods that frequently lead to poor solution quality and cause the agent to appear irrational by re-visiting the same problem states repeatedly. The situation changed recently with a new algorithm, D LRTA*, which attempted to eliminate learning by automatically selecting subgoals. D LRTA* is well poised for video games, except it has a complex and memory-demanding pre-computation phase during which it builds a database of subgoals. In this paper, we propose a simpler and more memory-efficient way of pre-computing subgoals thereby eliminating the main obstacle to applying state-of-the-art real-time search methods in video games. The new algorithm solves a number of randomly chosen problems off-line, compresses the solutions into a series of subgoals and stores them in a database. When presented with a novel problem on-line, it queries the database for the most similar previously solved case and uses its subgoals to solve the problem. In the domain of pathfinding on four large video game maps, the new algorithm delivers solutions eight times better while using 57 times less memory and requiring 14% less pre-computation time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑