基于改进A^(*)算法的路径规划在海战兵棋推演中的应用

Application of Path Planning Based on Improved A^(*) Algorithm in War Gaming of Naval Warfare

为满足海战兵棋推演中多目标路径规划的需求,解决传统A^(*)算法无法在兵棋推演中直接运用的问题,提出一种可供类似兵棋推演环境参考、基于改进A*算法的路径规划方法。建立一种映射机制,实现了A^(*)算法在兵棋推演环境中的初步运用。构建一种既能满足多目标需求又能保证生成最优路径的估价函数。为验证算法有效性,在实际推演平台上进行了相关实验。结果表明,改进A^(*)算法可较好地统筹多个决策目标之间的关系,有效提升路径方案的质量,解决使用A^(*)算法在海战兵棋推演中进行最优路径规划的实际问题。

A path planning method based on improved A^(*) algorithm is proposed, which can be used as a reference for similar war gaming environment.The proposed method is to meet the needs of multi-objective path planning in war gaming of naval warfare and solve the problem that traditional A^(*) algorithm cannot be directly used in war gaming.A mapping mechanism is constructed to realize the preliminary application of A^(*) algorithm in war gaming environment,and an evaluation function is constructed to improve the A^(*) algorithm,which can not only meet the multi-objective needs,but also ensure the generation of the optimal path.In order to verify the effectiveness of the improved A^(*) algorithm,the experiment was carried out on a war gaming platform of naval warfare.The result shows that the proposed method can be used to coordinate the relationship between multiple decision indicators well,effectively improve the quality of path scheme,and solve the practical problem of using A* algorithm to carry out the optimal path planning in war gaming of naval warfare.