Optimizing radiation exposure in dynamic radioactive environments: Dynamic ACO-RRT* path planning algorithm

Abstract

Radioactive environments are often dynamic for various reasons, such as the dismantling of nuclear facilities, leakage of radiation sources, and nuclear accidents. Path planning in a dynamic radioactive environment is one of the important issues in radiation protection for nuclear facility workers. In traditional dynamic optimal path planning, there are phenomena, in which the optimal path is not found within the allowable time or the quality of the path searched within the allowable time is low. To solve this problem, we propose a hybrid algorithm that combines meta-heuristic and sample-based algorithms, called dynamic ant colony optimization-rapidly exploring random tree star (ACO-RRT*). A low-level grid optimal path consisting of grid vertices is obtained by the ACO algorithm, and then it is further refined by the RRT* algorithm. At every instant of environmental change, the vertices of the grid optimal path are divided into vertices with and without samples, and new samples are generated only around vertices without samples. Sampling optimization is performed only around the grid optimal path using new samples and already existing samples. Simulations in a virtual radioactive environment showed that the proposed algorithm reduces computational costs and improves the quality of the optimal path compared to traditional algorithms.

Keywords

• ant colony optimization
• dynamic path planning
• radiation protection
• rapidly exploring random tree star