游戏场景中基于势场的交互寻路方法

Interactive Path-planning Method Based on Artificial Potential Field in Game Scenarios

在即时战略游戏中,路径规划是一种重要且常见的任务。游戏的实时性要求玩家能够快速寻找一条进攻的路径,而且游戏单元之间普遍存在的交互作用对寻路质量有着重要的影响。传统的寻路算法如Dijkstra算法虽然能够找到最优路径,但是耗时较多,而且未体现真实游戏中的交互。为此选取RTS游戏中一种典型的攻防场景,提出基于人工势场的快速高效动态寻路方法,同时为了体现RTS中游戏单元之间的交互性,将模糊测度引入到势场寻路中。实验结果表明,采用人工势场法寻路较Dijkstra算法耗时少、路径平滑;而引入模糊测度体现了真实游戏中单元之间的交互影响作用,与真实的游戏场景更为接近。

In real-time strategy （RTS） games, path planning is one of the typical and important tasks for game players. To meet the requirement of real-time response, the game players need to find an offensive path quickly. Besides, there are often interactions among game units which will greatly influence the quality of path planning. Dijkstra algorithm is a traditional and widely used algorithm which can find an optimal path. However, this algorithm cannot meet the strict time limit in RTS games and does not consider the unit interactions. This paper selected a typical RTS game attack-de- fense scenario, and presented a fast and dynamic path-planning method based on artificial potential field. We also intro- duced the concept of fuzzy measure to describe the interaction of units. The experiment results show that the proposed method is more efficient and makes the selected game scenario closer to the real games.