A Dynamic Programming Approach to Adaptive Fractionation
Jagdish Ramakrishnan, David Craft, Thomas Bortfeld, and John N., Tsitsiklis

TL;DR
This paper explores a dynamic programming framework for adaptive fractionation in radiation therapy, demonstrating near-optimal heuristic methods that significantly reduce dose to organs at risk compared to standard methods.
Contribution
It introduces a DP-based approach to evaluate and develop near-optimal heuristics for adaptive fractionation, providing guidance for complex, high-dimensional problems.
Findings
Heuristic policies achieve 5-85% dose reduction to OAR.
DP algorithm characterizes optimal policy structure.
Dose reduction is greater with more fractions and larger fraction size deviations.
Abstract
We conduct a theoretical study of various solution methods for the adaptive fractionation problem. The two messages of this paper are: (i) dynamic programming (DP) is a useful framework for adaptive radiation therapy, particularly adaptive fractionation, because it allows us to assess how close to optimal different methods are, and (ii) heuristic methods proposed in this paper are near-optimal, and therefore, can be used to evaluate the best possible benefit of using an adaptive fraction size. The essence of adaptive fractionation is to increase the fraction size when the tumor and organ-at-risk (OAR) are far apart (a "favorable" anatomy) and to decrease the fraction size when they are close together. Given that a fixed prescribed dose must be delivered to the tumor over the course of the treatment, such an approach results in a lower cumulative dose to the OAR when compared to that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
