Pareto Optimal Projection Search (POPS): Automated Radiation Therapy Treatment Planning by Direct Search of the Pareto Surface
Charles Huang, Yong Yang, Neil Panjwani, Stephen Boyd, and Lei Xing

TL;DR
The paper introduces POPS, a novel automated radiation therapy planning algorithm that directly searches the Pareto front to produce clinically acceptable, optimal treatment plans, reducing planning time and variability.
Contribution
POPS is a new algorithm combining gradient-free search and Pareto projection, enabling fully automated, high-quality treatment planning without human intervention.
Findings
Produces Pareto optimal plans for prostate cases
Plans are clinically acceptable in dose conformity and organ sparing
Reduces active planning time and inter-planner variability
Abstract
Objective: Radiation therapy treatment planning is a time-consuming, iterative process with potentially high inter-planner variability. Fully automated treatment planning processes could reduce a planner's active treatment planning time and remove inter-planner variability, with the potential to tremendously improve patient turnover and quality of care. In developing fully automated algorithms for treatment planning, we have two main objectives: to produce plans that are 1) Pareto optimal and 2) clinically acceptable. Here, we propose the Pareto optimal projection search (POPS) algorithm, which provides a general framework for directly searching the Pareto front. Methods: Our POPS algorithm is a novel automated planning method that combines two main search processes: 1) gradient-free search in the decision variable space and 2) projection of decision variables to the Pareto front using…
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.
