论文标题
脱机网格的覆盖范围守卫计划中的守卫计划
Offline Grid-Based Coverage path planning for guards in games
论文作者
论文摘要
详尽覆盖范围的算法方法在视频游戏中具有应用，从而实现了自动游戏水平探索。当前的设计使用简单的启发式方法，通常会导致性能或表现出不自然的行为。在本文中，我们引入了一种新型算法，用于覆盖2D多边形（带有孔）区域。我们假设地图布局的先验知识并使用基于网格的世界表示。在几种情况下，从简单的布局到实际游戏中使用的更复杂地图的实验分析显示出良好的性能。这项工作是为非玩家字符构建更有效的覆盖路径计划算法的第一步。
Algorithmic approaches to exhaustive coverage have application in video games, enabling automatic game level exploration. Current designs use simple heuristics that frequently result in poor performance or exhibit unnatural behaviour. In this paper, we introduce a novel algorithm for covering a 2D polygonal (with holes) area. We assume prior knowledge of the map layout and use a grid-based world representation. Experimental analysis over several scenarios ranging from simple layouts to more complex maps used in actual games show good performance. This work serves as an initial step towards building a more efficient coverage path planning algorithm for non-player characters.
