Efficient proton arc optimization and delivery through energy layer pre-selection and post-filtering.

BACKGROUND: Proton arc therapy (PAT) has emerged as a promising approach for improving dose distribution, but also enabling simpler and faster treatment delivery in comparison to conventional proton treatments. However, the delivery speed achievable in proton arc relies on dedicated algorithms, which currently do not generate plans with a clear speed-up and sometimes even result in increased delivery time. PURPOSE: This study aims to address the challenge of minimizing delivery time through a hybrid method combining a fast geometry-based energy layer (EL) pre-selection with a dose-based EL filtering, and comparing its performance to a baseline approach without filtering. METHODS: Three methods of EL filtering were developed: unrestricted, switch-up (SU), and switch-up gap (SU gap) filtering. The unrestricted method filters the lowest weighted EL while the SU gap filtering removes the EL around a new SU to minimize the gantry rotation braking. The SU filtering removes the lowest weighted group of EL that includes a SU. These filters were combined with the RayStation dynamic proton arc optimization framework energy layer selection and spot assignment (ELSA). Four bilateral oropharyngeal and four lung cancer patients' data were used for evaluation. Objective function values, target coverage robustness, organ-at-risk doses and normal tissue complication probability evaluations, as well as comparisons to intensity-modulated proton therapy (IMPT) plans, were used to assess plan quality. RESULTS: The SU gap filtering algorithm performed best in five out of the eight cases, maintaining plan quality within tolerance while reducing beam delivery time, in particular for the oropharyngeal cohort. It achieved up to approximately 22% and 15% reduction in delivery time for oropharyngeal and lung treatment sites, respectively. The unrestricted filtering algorithm followed closely. In contrast, the SU filtering showed limited improvement, suppressing one or two SU without substantial delivery time shortening. Robust target coverage was kept within 1% of variation compared to the PAT baseline plan while organs-at-risk doses slightly decreased or kept about the same for all patients. CONCLUSIONS: This study provides insights to accelerate PAT delivery without compromising plan quality. These advancements could enhance treatment efficiency and patient throughput.

The proton arc therapy treatment planning problem is NP-Hard.

Proton arc therapy (PAT) is an advanced radiotherapy technique using charged particles in which the radiation device rotates continuously around the patient while irradiating the tumor. Compared to conventional, fixed-angle beam delivery mode, proton arc therapy has the potential to further improve the quality of cancer treatment by delivering accurate radiation dose to tumors while minimizing damage to surrounding healthy tissues. However, the computational complexity of treatment planning in PAT raises challenges as to its effective implementation. In this paper, we demonstrate that designing a PAT plan through algorithmic methods is a NP-hard problem (in fact, NP-complete), where the problem size is determined by the number of discrete irradiation angles from which the radiation can be delivered. This finding highlights the inherent complexity of PAT treatment planning and emphasizes the need for efficient algorithms and heuristics to address the challenges associated with optimizing the delivery of radiation doses in this context.

Technical note: Beamlet-free optimization for Monte-Carlo-based treatment planning in proton therapy.

BACKGROUND: Dose calculation and optimization algorithms in proton therapy treatment planning often have high computational requirements regarding time and memory. This can hinder the implementation of efficient workflows in clinics and prevent the use of new, elaborate treatment techniques aiming to improve clinical outcomes like robust optimization, arc, and adaptive proton therapy. PURPOSE: A new method, namely, the beamlet-free algorithm, is presented to address the aforementioned issue by combining Monte Carlo dose calculation and optimization into a single algorithm and omitting the calculation of the time-consuming and costly dose influence matrix. METHODS: The beamlet-free algorithm simulates the dose in proton batches of randomly chosen spots and evaluates their relative impact on the objective function at each iteration. Based on the approximated gradient, the spot weights are then updated and used to generate a new spot probability distribution. The beamlet-free method is compared against a conventional, beamlet-based treatment planning algorithm on a brain case and a prostate case. RESULTS: The beamlet-free algorithm maintained a comparable plan quality while largely reducing the dependence of computation time and memory usage on the number of spots. CONCLUSION: The implementation of a beamlet-free treatment planning algorithm for proton therapy is feasible and capable of achieving treatment plans of comparable quality to conventional methods. Its efficient usage of computational resources and low spot dependence makes it a promising method for large plans, robust optimization, and arc proton therapy.

Bi-criteria Pareto optimization to balance irradiation time and dosimetric objectives in proton arc therapy.

Objective. Proton arc therapy (PAT) is a new delivery technique that exploits the continuous rotation of the gantry to distribute the therapeutic dose over many angular windows instead of using a few static fields, as in conventional (intensity-modulated) proton therapy. Although coming along with many potential clinical and dosimetric benefits, PAT has also raised a new optimization challenge. In addition to the dosimetric goals, the beam delivery time (BDT) needs to be considered in the objective function. Considering this bi-objective formulation, the task of finding a good compromise with appropriate weighting factors can turn out to be cumbersome.Approach. We have computed Pareto-optimal plans for three disease sites: a brain, a lung, and a liver, following a method of iteratively choosing weight vectors to approximate the Pareto front with few points. Mixed-integer programming (MIP) was selected to state the bi-criteria PAT problem and to find Pareto optimal points with a suited solver.Main results. The trade-offs between plan quality and beam irradiation time (staticBDT) are investigated by inspecting three plans from the Pareto front. The latter are carefully picked to demonstrate significant differences in dose distribution and delivery time depending on their location on the frontier. The results were benchmarked against IMPT and SPArc plans showing the strength of degrees of freedom coming along with MIP optimization.Significance. This paper presents for the first time the application of bi-criteria optimization to the PAT problem, which eventually permits the planners to select the best treatment strategy according to the patient conditions and clinical resources available.

Treatment planning in arc proton therapy: Comparison of several optimization problem statements and their corresponding solvers.

Arc proton therapy (ArcPT) is an emerging modality in cancer treatments. It delivers the proton beams following a sequence of irradiation angles while the gantry is continuously rotating around the patient. Compared to conventional proton treatments (intensity modulated proton therapy, IMPT), the number of beams is significantly increased bringing new degrees of freedom that leads to potentially better cancer care. However, the optimization of such treatment plans becomes more complex and several alternative statements of the problem can be considered and compared in order to solve the ArcPT problem. Three such problem statements, distinct in their mathematical formulation and properties, are investigated and applied to solving the ArcPT optimization problem. They make use of (i) fast iterative shrinkage-thresholding algorithm (FISTA), (ii) local search (LS) and (iii) mixed-integer programming (MIP). The treatment plans obtained with those methods are compared among them, but also with IMPT and an existing state-of-the-art method: Spot-Scanning Proton Arc (SPArc). MIP stands out at low scale problems both in terms of dose quality and time delivery efficiency. FISTA shows high dose quality but experiences difficulty to optimize the energy sequence while LS is mostly the antagonist. This detailed study describes independent approaches to solve the ArcPT problem and depending on the clinical case, one should be cautiously picked rather than the other. This paper gives the first formal definition of the problem at stake, as well as a first reference benchmark. Finally, empirical conclusions are drawn, based on realistic assumptions.

A portable muon telescope based on small and gas-tight resistive plate chambers.

We report on the first steps in the development of a small-size muon telescope based on glass resistive plate chambers with small active area (16 × 16 cm2). The long-term goal of this project is to focus on applications of muography where the telescope may have to be operated underground and/or inside small rooms, and in challenging logistic situations. Driving principles in our design are therefore compact size, light weight, gas tightness and robustness. The first data-taking experiences have been encouraging, and we elaborate on the lessons learnt and future directions for development.This article is part of the Theo Murphy meeting issue 'Cosmic-ray muography'.