Fast approximate delivery of fluence maps: the VMAT case
Marleen Balvert, David Craft

TL;DR
This paper introduces a mathematical programming approach to optimize the trade-off between delivery time and fluence map accuracy in VMAT, extending previous methods to full arc treatment planning.
Contribution
It extends a single-map optimization method to full arc VMAT planning, enabling trade-off analysis between delivery time and plan quality.
Findings
Shorter delivery times result in larger leaf openings.
The method produces a continuum of plans between coarse and narrow field approaches.
Trade-off curves help in choosing between plan quality and solution time.
Abstract
In this article we provide a method to generate the trade-off between delivery time and fluence map matching quality for volumetric modulated arc therapy (VMAT). At the heart of our method lies a mathematical programming model that, for a given duration of delivery, optimizes leaf trajectories and dose rates such that the desired fluence map is reproduced as well as possible. This model was presented for the single map case in a companion paper (Fast approximate delivery of fluence maps: the single map case). The resulting large-scale, non-convex optimization problem was solved using a heuristic approach. The single-map approach cannot directly be applied to the full arc case due to the large increase in model size, the issue of allocating delivery times to each of the arc segments, and the fact that the ending leaf positions for one map will be the starting leaf positions for the next…
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.
