Optimal partial-arcs in VMAT treatment planning
Jeremiah Wala, Ehsan Salari, Wei Chen, David Craft

TL;DR
This paper introduces pmerge, an algorithm that automatically generates optimal partial-arc VMAT plans, significantly reducing treatment time while maintaining dose quality, especially for non-centralized targets.
Contribution
The paper presents pmerge, an extension of vmerge, which automatically identifies the most efficient partial-arc plans for VMAT treatment, improving delivery efficiency.
Findings
Partial-arc plans reduce treatment time by up to 40%.
Dose quality remains within 5% of original plans.
Angular fluence distribution predicts optimal arc start and end angles.
Abstract
Purpose: To improve the delivery efficiency of VMAT by extending the recently published VMAT treatment planning algorithm vmerge to automatically generate optimal partial-arc plans. Methods and materials: A high-quality initial plan is created by solving a convex multicriteria optimization problem using 180 equi-spaced beams. This initial plan is used to form a set of dose constraints, and a set of partial-arc plans is created by searching the space of all possible partial-arc plans that satisfy these constraints. For each partial-arc, an iterative fluence map merging and sequencing algorithm (vmerge) is used to improve the delivery efficiency. Merging continues as long as the dose quality is maintained above a user-defined threshold. The final plan is selected as the partial arc with the lowest treatment time. The complete algorithm is called pmerge. Results: Partial-arc plans are…
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.
