A proposal on multi-agent static path planning strategy for minimizing radiation dose
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
To minimize the cumulative radiation dose, various path-finding approaches for single agent have been proposed. However, for emergence situations such as nuclear power plant accident, these methods cannot be effectively utilized for evacuating a large number of workers because no multi-agent method is valid to conduct the mission. In this study, a novel algorithm for solving the multi-agent path-finding problem is proposed using the conflict-based search approach and the objective function redefined in terms of the cumulative radiation dose. The proposed method can find multi paths that all agents arrive at the destinations with reducing the overall radiation dose. To verify the proposed method, three problems were defined. In the single-agent problem, the objective function proposed in this study reduces the cumulative dose by 82% compared with that of the shortest distance algorithm in experiment environment of this study. It was also verified in the two multi-agent problems that multi paths with minimized the overall radiation dose, in which all agents can reach the destination without collision, can be found. The method proposed in this study will contribute to establishing evacuation plans for improving the safety of workers in radiation-related facilities.
Abstract
To minimize the cumulative radiation dose, various path-finding approaches for single agent have been proposed. However, for emergence situations such as nuclear power plant accident, these methods cannot be effectively utilized for evacuating a large number of workers because no multi-agent method is valid to conduct the mission. In this study, a novel algorithm for solving the multi-agent path-finding problem is proposed using the conflict-based search approach and the objective function redefined in terms of the cumulative radiation dose. The proposed method can find multi paths that all agents arrive at the destinations with reducing the overall radiation dose. To verify the proposed method, three problems were defined. In the single-agent problem, the objective function proposed in this study reduces the cumulative dose by 82% compared with that of the shortest distance algorithm in experiment environment of this study. It was also verified in the two multi-agent problems that multi paths with minimized the overall radiation dose, in which all agents can reach the destination without collision, can be found. The method proposed in this study will contribute to establishing evacuation plans for improving the safety of workers in radiation-related facilities.
참고문헌 (13)
- Y. K. Liu, "Minimum dose method for walking-path planning of nuclear facilities", Ann. Nucl. Energy, 83, pp.161~171 (2015)
- Y. K. Liu, "Walking pathplanning method for multiple radiation areas", Ann. Nucl. Energy, 94, pp.808~813 (2016)
- N. Chao, "A sampling-based method with virtual reality technology to provide minimum dose path navigation for occupational workers in nuclear facilities", Prog. Nucl. Energy, 100, pp.22~32 (2017)
- N. Chao, "Grid-based RRT for minimum dose walking path-planning in complex radioactive environments", Ann. Nucl. Energy, 115, pp.73~82 (2018)
- Y. K. Liu, "Path-planning research in radioactive environment based on particle swarm algorithm", Prog. Nucl. Energy, 74, pp.184~192 (2014)
- Z. Wang, "The path-planning in radioactive environment of nuclear facilities using an improved particle swarm optimization algorithm", Nucl. Eng. Des, 326, pp.79~86 (2018)
- Z. Wang, "Probabilistic roadmap method for path-planning in radioactive environment of nuclear facilities", Prog. Nucl. Energy, 109, pp.113~120 (2018)
- M. K. Li, "Dynamic minimum dose path-searching method for virtual nuclear facilities", Prog. Nucl. Energy, 91, pp.1~8 (2016)
- N. Chao, "DL-RRT* algorithm for least dose path Re-planning in dynamic radioactive environments", Nucl. Eng. Technol, 51, pp.825~836 (2018)
- J. O. Adibeli, "Path planning in nuclear facility decommissioning: research status, challenges, and opportunities", Nucl. Eng. Technol, 53, pp.3505~3516 (2021)
- G. Sharon, "Conflict-based search for optimal multi-agent path finding", Artif. Intell, 219, pp.40~66 (2015)
- R. Stern, "Multi-agent path finding–an overview", Artif. Intell, 11866, pp.96~115 (2019)
- P. E. Hart, "A formal basis for the heuristic determination of minimum cost paths", IEEE, Trans. Syst. Sci. Cybernetics, 4, pp.100~107 (1968)