A reference-point-method-based online proton treatment plan re-optimization strategy and a novel solution to planning constraint infeasibility problem.

Objective . Propose a highly automated treatment plan re-optimization strategy suitable for online adaptive proton therapy. The strategy includes a rapid re-optimization method that generates quality replans and a novel solution that efficiently addresses the planning constraint infeasibility issue that can significantly prolong the re-optimization process. Approach . We propose a systematic reference point method (RPM) model that minimizes the l-infinity norm from the initial treatment plan in the daily objective space for online re-optimization. This model minimizes the largest objective value deviation among the objectives of the daily replan from their reference values, leading to a daily replan similar to the initial plan. Whether a set of planning constraints is feasible with respect to the daily anatomy cannot be known before solving the corresponding optimization problem. The conventional trial-and-error-based relaxation process can cost a significant amount of time. To that end, we propose an optimization problem that first estimates the magnitude of daily violation of each planning constraint. Guided by the violation magnitude and clinical importance of the constraints, the constraints are then iteratively converted into objectives based on their priority until the infeasibility issue is solved. Main results. The proposed RPM-based strategy generated replans similar to the offline manual replans within the online time requirement for six head and neck and four breast patients. The average target D 95 and relevant organ at risk sparing parameter differences between the RPM replans and clinical offline replans were -0.23, -1.62 Gy for head and neck cases and 0.29, -0.39 Gy for breast cases. The proposed constraint relaxation solution made the RPM problem feasible after one round of relaxation for all four patients who encountered the infeasibility issue. Significance . We proposed a novel RPM-based re-optimization strategy and demonstrated its effectiveness on complex cases, regardless of whether constraint infeasibility is encountered.