Shortest Path Optimisation of the CyberKnife treatment in Radiotherapy

Bachelor thesis (2017)

Authors

J. Mühlsteff Electrical Engineering, Mathematics and Computer Science

Contributors

M. Keijzer (mentor)
S Breedveld (mentor)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2017 Joris Mühlsteff
More Info
expand_more

Published Date

06-07-2017

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

In the history of medicine, different treatments for cancer have been developed, such as radiotherapy, surgery and chemotherapy. However, nowadays more than 50% of the people diagnosed with cancer, undergo a radiotherapy treatment. One of the devices used for the treatment is the CyberKnife: a robotic radiodurgery system that can move around the patient using 102 virtually placed nodes. For the treatment of a patient, usually around 25 nodes are used, which result in a certain plan quality for the patient. The aim of this project is to find shorter paths than the existing ones, without significantly degrading the plan quality. This is done by using Dijkstra’s Algorithm, as well as incorporating Hamiltonian paths and the Traveling Salesman Problem. With these techniques, we developed the OPA (Optimal Path Algorithm): an algorithm that finds Hamiltonian paths through the nodes, combined with the iterated process of interchanging nodes with adjacent ones. With OPA, the traveltimes for the CyberKnife have been brought down by 38.6% on average without degrading the plan quality.

Files

BEP_verslag.pdf
(pdf | 1.94 Mb)
- Embargo expired in 06-07-2019