Abstract Nuclear power plant workers are inevitably exposed to radiation during routine maintenance work. Therefore, optimization of the walking-path is necessary to reduce the exposure radiation. However, the complex environment of nuclear power plants makes it hard to find the path with the minimum cumulative radiation dose. An improved A* algorithm is proposed in this paper, and it is more advantageous than the traditional A* algorithm. It can not only be suitable for more complicated environments but also obtain a more optimized path. Through the Unity 3D platform, which is an efficient game engine, the simulation experiments are performed based on the environment of a virtual factory. The simulation results show that the improved A* algorithm for searching the minimum dose path is more reliable and more effective. It provides a route with a lower cumulative dose, and the path length is appropriate. In the complex environment, the cumulative dose calculated by the improved algorithm is much smaller than that calculated by the traditional algorithm. Improved A* algorithm has a strong anti-interference ability and performs well in complex environments. It can provide path-planning for nuclear facility staff to reduce radiation exposure.

中文翻译：

---

一种用于搜索核设施最小剂量路径的改进A*算法

摘要 核电站工作人员在日常维护工作中不可避免地会受到辐射。因此，有必要优化步行路径以减少暴露辐射。然而，核电站复杂的环境使得很难找到累积辐射剂量最小的路径。本文提出了一种改进的A*算法，它比传统的A*算法更有优势。它不仅可以适用于更复杂的环境，而且可以获得更优化的路径。通过Unity 3D平台，这是一个高效的游戏引擎，基于虚拟工厂的环境进行模拟实验。仿真结果表明，改进的A*算法搜索最小剂量路径更可靠、更有效。它提供了一条累积剂量较低的路径，路径长度合适。在复杂环境下，改进算法计算的累积剂量比传统算法计算的要小得多。改进后的A*算法抗干扰能力强，在复杂环境下表现良好。它可以为核设施工作人员提供路径规划，以减少辐射暴露。