Clinical Experience of Automated SBRT Paraspinal and Other Metastatic Tumor Planning With Constrained Hierarchical Optimization

Automated planning of stereotactic spine re-irradiation using cumulative dose limits

Background and Purpose

The lack of dedicated tools in commercial planning systems currently restricts efficient review and planning for re-irradiation. The aim of this study was to develop an automated re-irradiation planning framework based on cumulative doses.

Materials and Methods

We performed a retrospective study of 14 patients who received spine SBRT re-irradiation near a previously irradiated treatment site. A fully-automated workflow, DART (Dose Accumulation-based Re-irradiation Tool), was implemented within Eclipse by leveraging a combination of a dose accumulation script and a proprietary automated optimization algorithm. First, we converted the prior treatment dose into equivalent dose in 2 Gy fractions (EQD2) and mapped it to the current anatomy, utilizing deformable image registration. Subsequently, the intersection of EQD2 isodose lines with relevant organs at risk defines a series of optimization structures. During plan optimization, the residual allowable dose at a specified tissue tolerance was treated as a hard constraint.

Results

All DART plans met institutional physical and cumulative constraints and passed plan checks by qualified medical physicists. DART demonstrated significant improvements in target coverage over clinical plans, with an average increase in PTV D99% and V100% of 2.3 Gy [range -0.3-7.7 Gy] and 3.4 % [range -0.4 %-7.6 %] (p < 0.01, paired t-test), respectively. Moreover, high-dose spillage (>105 %) outside the PTV was reduced by up to 7 cm3. The homogeneity index for DART plans was improved by 19 % (p < 0.001).

Conclusions

DART provides a powerful framework to achieve more tailored re-irradiation plans by accounting for dose distributions from the previous treatments. The superior plan quality could improve the therapeutic ratio for re-irradiation patients.

Automated and Clinically Optimal Treatment Planning for Cancer Radiotherapy

Each year, approximately 18 million new cancer cases are diagnosed worldwide, and about half must be treated with radiotherapy. A successful treatment requires treatment planning with the customization of penetrating radiation beams to sterilize cancerous cells without harming nearby normal organs and tissues. This process currently involves extensive manual tuning of parameters by an expert planner, making it a time-consuming and labor-intensive process, with quality and immediacy of critical care dependent on the planner's expertise. To improve the speed, quality, and availability of this highly specialized care, Memorial Sloan Kettering Cancer Center developed and applied advanced optimization tools to this problem (e.g., using hierarchical constrained optimization, convex approximations, and Lagrangian methods). This resulted in both a greatly improved radiotherapy treatment planning process and the generation of reliable and consistent high-quality plans that reflect clinical priorities. These improved techniques have been the foundation of high-quality treatments and have positively impacted over 4,000 patients to date, including numerous patients in severe pain and in urgent need of treatment who might have otherwise required longer hospital stays or undergone unnecessary surgery to control the progression of their disease. We expect that the wide distribution of the system we developed will ultimately impact patient care more broadly, including in resource-constrained countries.

Deep learning auto-segmentation and automated treatment planning for trismus risk reduction in head and neck cancer radiotherapy

Background and Purpose

Reducing trismus in radiotherapy for head and neck cancer (HNC) is important. Automated deep learning (DL) segmentation and automated planning was used to introduce new and rarely segmented masticatory structures to study if trismus risk could be decreased.

Materials and Methods

Auto-segmentation was based on purpose-built DL, and automated planning used our in-house system, ECHO. Treatment plans for ten HNC patients, treated with 2 Gy × 35 fractions, were optimized (ECHO₀). Six manually segmented OARs were replaced with DL auto-segmentations and the plans re-optimized (ECHO₁). In a third set of plans, mean doses for auto-segmented ipsilateral masseter and medial pterygoid (MI_Mean, MPI_Mean), derived from a trismus risk model, were implemented as dose-volume objectives (ECHO₂). Clinical dose-volume criteria were compared between the two scenarios (ECHO₀vs. ECHO₁; ECHO₁vs. ECHO₂; Wilcoxon signed-rank test; significance: p < 0.01).

Results

Small systematic differences were observed between the doses to the six auto-segmented OARs and their manual counterparts (median: ECHO₁ = 6.2 (range: 0.4, 21) Gy vs. ECHO₀ = 6.6 (range: 0.3, 22) Gy; p = 0.007), and the ECHO₁ plans provided improved normal tissue sparing across a larger dose-volume range. Only in the ECHO₂ plans, all patients fulfilled both MI_Mean and MPI_Mean criteria. The population median MI_Mean and MPI_Mean were considerably lower than those suggested by the trismus model (ECHO₀: MI_Mean = 13 Gy vs. ≤42 Gy; MPI_Mean = 29 Gy vs. ≤68 Gy).

Conclusions

Automated treatment planning can efficiently incorporate new structures from DL auto-segmentation, which results in trismus risk sparing without deteriorating treatment plan quality. Auto-planning and deep learning auto-segmentation together provide a powerful platform to further improve treatment planning.

Solving the volumetric modulated arc therapy (VMAT) problem using a sequential convex programming method

The volumetric modulated arc therapy (VMAT) problem is highly non-convex and much more difficult than the fixed-field intensity modulated radiotherapy optimization problem. To solve it efficiently, we propose a sequential convex programming algorithm that solves a sequence of convex optimization problems. Beginning by optimizing the aperture weights of many (72) evenly distributed beams using the beam's eye view of the target from each direction as the initial aperture shape, the search space is constrained to allowing the leaves to move within a pre-defined step-size. A convex approximation problem is introduced and solved to optimize the leaf positions and the aperture weights within the search space. The algorithm is equipped with both local and global search strategies, whereby a global search is followed by a local search: a large step-size results in a global search with a less accurate convex approximation, followed by a small step-size local search with an accurate convex approximation. The performance of the proposed algorithm is tested on three patients with three different disease sites (paraspinal, prostate and oligometastasis). The algorithm generates VMAT plans comparable to the ideal 72-beam fluence map optimized plans (i.e. IMRT plans before leaf sequencing) in 14 iterations and 36 mins on average. The algorithm is also tested on a small down-sampled prostate case for which we could computationally afford to obtain the ground-truth by solving the non-convex mixed-integer optimization problem exactly. This general algorithm is able to produce results essentially equivalent to the ground-truth but 12 times faster. The algorithm is also scalable and can handle real clinical cases, whereas the ground-truth solution using mixed-integer optimization can only be obtained for highly down-sampled cases.