Application of shortest path algorithms to find paths of minimum radiation dose

Presented here is the use of two path-optimization algorithms, Dijkstra's Algorithm, and the Bellman-Ford Algorithm, to find paths through radiologically contaminated environments such that the accumulated dose is minimal. Such paths will be very useful for personnel whose job requires them to navigate through contaminated areas such as nuclear facility workers and emergency response personnel who need to respond to events which occur in nuclear facilities. The modified algorithms are coded in Matlab. Preliminary calculations are carried out to test convergence as a function of number of grid points used. Impact of other parameters in the algorithm on results is also evaluated. Several models of contaminated areas are developed and minimum dose paths are determined. These models include both continuous as well as discrete radiation fields, and ranged in complexity from simple hypothetical models, to real models of contaminated areas in currently operational nuclear power plants such as the LaSalle Nuclear Power Station and the Clinton Power Station. Minimal dose path is also determined in a room where the radiation field is determined using MCNP transport code. In order to solve these real complex models, the capability to maneuver around obstacles was added to the algorithm. It was also proposed in this thesis to integrate the minimal dose paths into virtual reality models of the contaminated areas for personnel training purposes. A virtual 3D interactive model of a LaSalle Nuclear Power Plant room was developed and its minimal path solution was added to this VR model. An MCNP model of a contaminated room was also solved and its minimal dose path calculated.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Nuclear Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2010

Author dc:creator

• Alzalloum, Abdul-Qadim

Contributors dc:contributor

• Uddin, Rizwan

• Dijkstra
• Bellman-Ford
• Shortest Path Algorithms
• Path of Minimum Radiation Dose
• Path Minimization Algorithms
• Minimize Radiation Dose

Statement dc:rights

• © 2009 by Abdul-Qadim Alzalloum. All rights reserved.

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/14665

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/14665