An improved A* algorithm for searching the minimum dose path in nuclear facilities

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.

[1]  Jiejin Cai,et al.  The path-planning in radioactive environment of nuclear facilities using an improved particle swarm optimization algorithm , 2018 .

[2]  Yong-kuo Liu,et al.  A sampling-based method with virtual reality technology to provide minimum dose path navigation for occupational workers in nuclear facilities , 2017 .

[3]  Zhongkun Liu,et al.  Minimum dose method for walking-path planning of nuclear facilities , 2015 .

[4]  Michael Lewis,et al.  Game Engine Virtual Reality with CaveUT , 2005, Computer.

[5]  Minjun Peng,et al.  Dynamic minimum dose path-searching method for virtual nuclear facilities , 2016 .

[6]  Jiejin Cai,et al.  Probabilistic roadmap method for path-planning in radioactive environment of nuclear facilities , 2018, Progress in Nuclear Energy.

[7]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8]  Minjun Peng,et al.  DL-RRT* algorithm for least dose path Re-planning in dynamic radioactive environments , 2019, Nuclear Engineering and Technology.

[9]  Inna Sharf,et al.  Sampling-based A* algorithm for robot path-planning , 2014, Int. J. Robotics Res..

[10]  Fei Xie,et al.  Path-planning research in radioactive environment based on particle swarm algorithm , 2014 .

[11]  Xiao Cui,et al.  A*-based Pathfinding in Modern Computer Games , 2011 .

[12]  Minjun Peng,et al.  Walking path-planning method for multiple radiation areas , 2016 .

[13]  Silas C. Augusto,et al.  Virtual environments simulation for dose assessment in nuclear plants , 2009 .

[14]  Mohammad A. Jaradat,et al.  A localized navigation algorithm for Radiation Evasion for nuclear facilities. Part II: Optimizing the “Nearest Exit” Criterion , 2013 .

[15]  Abdul-Qadim Alzalloum,et al.  Application of shortest path algorithms to find paths of minimum radiation dose , 2010 .

[16]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[17]  Graeme Fairweather,et al.  On the extrapolation of Galerkin methods for parabolic problems , 1974 .

[18]  Mohammad A. Jaradat,et al.  A localized navigation algorithm for radiation evasion for nuclear facilities: Optimizing the “Radiation Evasion” criterion: Part I , 2013 .