Search NASA⌕ Search

SEARCH · Search NASA

Results for “Distributionally robust optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

TH-CD-209-04: Fuzzy Robust Optimization in Intensity-Modulated Proton Therapy Planning to Account for Range and Patient Setup Uncertainties

Purpose: We propose to apply a robust optimization model based on fuzzy-logic constraints in the intensity-modulated proton therapy (IMPT) planning subject to range and patient setup uncertainties. The purpose is to ensure the plan robustness under uncertainty and obtain the best trade-off between tumor dose coverage and organ-at-risk(OAR) sparing. Methods: Two IMPT plans were generated for 3 head-and-neck cancer patients: one used the planning target volume(PTV) method; the other used the fuzzy robust optimization method. In the latter method, nine dose distributions were computed - the nominal one and one each for ±3mm setup uncertainties along three cardinal axes and for ±3.5% range uncertainty. For tumors, these nine dose distributions were explicitly controlled by adding hard constraints with adjustable parameters. For OARs, fuzzy constraints that allow the dose to vary within a certain range were used so that the tumor dose distribution was guaranteed by minimum compromise of that of OARs. We rendered this model tractable by converting the fuzzy constraints to linear constraints. The plan quality was evaluated using dose-volume histogram(DVH) indices such as tumor dose coverage(D95%), homogeneity(D5%-D95%), plan robustness(DVH band at D95%), and OAR sparing like D1% of brain and D1% of brainstem. Results: Our model could yield clinically acceptable plans. The fuzzy-logic robust optimization method produced IMPT plans with comparable target dose coverage and homogeneity compared to the PTV method(unit: Gy[RBE]; average[min, max])(CTV D95%: 59 [52.7, 63.5] vs 53.5[46.4, 60.1], CTV D5% - D95%: 11.1[5.3, 18.6] vs 14.4[9.2, 21.5]). It also generated more robust plans(CTV DVH band at D95%: 3.8[1.2, 5.6] vs 11.5[6.2, 16.7]). The parameters of tumor constraints could be adjusted to control the tradeoff between tumor coverage and OAR sparing. Conclusion: The fuzzy-logic robust optimization generates superior IMPT with minimum compromise of OAR sparing. This research was supported by the National Cancer Institute Career Developmental Award K25CA168984, by the Fraternal Order of Eagles Cancer Research Fund Career Development Award, by The Lawrence W. and Marilyn W. Matteson Fund for Cancer Research, by Mayo Arizona State University Seed Grant, and by The Kemper Marley Foundation. eRA Person ID(s) for the Principal Investigator: 11017970 (Research Supported by National Institutes of Health)

60 APPLIED LIFE SCIENCES↗

Tuning Monotonic Basin Hopping: Improving the Efficiency of Stochastic Search as Applied to Low-Thrust Trajectory Optimization

Trajectory optimization methods using MBH have become well developed during the past decade. An essential component of MBH is a controlled random search through the multi-dimensional space of possible solutions. Historically, the randomness has been generated by drawing RVs from a uniform probability distribution. Here, we investigate the generating the randomness by drawing the RVs from Cauchy and Pareto distributions, chosen because of their characteristic long tails. We demonstrate that using Cauchy distributions (as first suggested by Englander significantly improves MBH performance, and that Pareto distributions provide even greater improvements. Improved performance is defined in terms of efficiency and robustness, where efficiency is finding better solutions in less time, and robustness is efficiency that is undiminished by (a) the boundary conditions and internal constraints of the optimization problem being solved, and (b) by variations in the parameters of the probability distribution. Robustness is important for achieving performance improvements that are not problem specific. In this work we show that the performance improvements are the result of how these long-tailed distributions enable MBH to search the solution space faster and more thoroughly. In developing this explanation, we use the concepts of sub-diffusive, normally-diffusive, and super-diffusive RWs originally developed in the field of statistical physics.

mission design↗

Tuning Monotonic Basin Hopping: Improving the Efficiency of Stochastic Search as Applied to Low-Thrust Trajectory Optimization

Trajectory optimization methods using monotonic basin hopping (MBH) have become well developed during the past decade [1, 2, 3, 4, 5, 6]. An essential component of MBH is a controlled random search through the multi-dimensional space of possible solutions. Historically, the randomness has been generated by drawing random variable (RV)s from a uniform probability distribution. Here, we investigate the generating the randomness by drawing the RVs from Cauchy and Pareto distributions, chosen because of their characteristic long tails. We demonstrate that using Cauchy distributions (as first suggested by J. Englander [3, 6]) significantly improves monotonic basin hopping (MBH) performance, and that Pareto distributions provide even greater improvements. Improved performance is defined in terms of efficiency and robustness. Efficiency is finding better solutions in less time. Robustness is efficiency that is undiminished by (a) the boundary conditions and internal constraints of the optimization problem being solved, and (b) by variations in the parameters of the probability distribution. Robustness is important for achieving performance improvements that are not problem specific. In this work we show that the performance improvements are the result of how these long-tailed distributions enable MBH to search the solution space faster and more thoroughly. In developing this explanation, we use the concepts of sub-diffusive, normally-diffusive, and super-diffusive random walks (RWs) originally developed in the field of statistical physics.

autonomous↗

Chance-Constrained Guidance With Non-Convex Constraints

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of failure) is below a user-specified bound known as the risk bound. An example problem is to drive a car to a destination as fast as possible while limiting the probability of an accident to 10(exp -7). This framework allows users to trade conservatism against performance by choosing the risk bound. The more risk the user accepts, the better performance they can expect.

FROM↗

Stochastic Programming Approach for Resource Selection under Demand Uncertainty

Cost-efficient selection and scheduling of a subset of geographically distributed resources to meet the demands of a scientific workflow is a challenging problem. The problem is exacerbated by uncertainties in demand and availability of resources. In this paper, we present a stochastic optimization based framework for robust decision making in the selection of distributed resources over a planning horizon under demand uncertainty. We present a novel two-stage stochastic programming model for resource selection, and implement an L-shaped decomposition algorithm to solve this model. A Sample Average Approximation algorithm is integrated to enable stochastic optimization to solve problems with a large number of scenarios. Using the metric of stochastic solution, we demonstrate up to 30% cost reduction relative to solutions without explicit consideration of demand uncertainty for a 24-month problem. We also demonstrate up to 54% cost reduction relative to a previously developed solution for a 36-month problem. We further argue that the composition of resources selected is superior to solutions computed without explicit consideration of uncertainties. Given the importance of resource selection and scheduling of complex scientific workflows, especially in the context of commercial cloud computing, we believe that our novel stochastic programming framework will benefit many researchers as well as users of distributed computing resources.

scientific workflows, task scheduling, optimizatio↗

Selective robust optimization: A new intensity-modulated proton therapy optimization strategy

Purpose: To develop a new robust optimization strategy for intensity-modulated proton therapy as an important step in translating robust proton treatment planning from research to clinical applications. Methods: In selective robust optimization, a worst-case-based robust optimization algorithm is extended, and terms of the objective function are selectively computed from either the worst-case dose or the nominal dose. Two lung cancer cases and one head and neck cancer case were used to demonstrate the practical significance of the proposed robust planning strategy. The lung cancer cases had minimal tumor motion less than 5 mm, and, for the demonstration of the methodology, are assumed to be static. Results: Selective robust optimization achieved robust clinical target volume (CTV) coverage and at the same time increased nominal planning target volume coverage to 95.8%, compared to the 84.6% coverage achieved with CTV-based robust optimization in one of the lung cases. In the other lung case, the maximum dose in selective robust optimization was lowered from a dose of 131.3% in the CTV-based robust optimization to 113.6%. Selective robust optimization provided robust CTV coverage in the head and neck case, and at the same time improved controls over isodose distribution so that clinical requirements may be readily met. Conclusions: Selective robust optimization may provide the flexibility and capability necessary for meeting various clinical requirements in addition to achieving the required plan robustness in practical proton treatment planning settings.

60 APPLIED LIFE SCIENCES↗

PTV-based IMPT optimization incorporating planning risk volumes vs robust optimization

Purpose: Robust optimization leads to intensity-modulated proton therapy (IMPT) plans that are less sensitive to uncertainties and superior in terms of organs-at-risk (OARs) sparing, target dose coverage, and homogeneity compared to planning target volume (PTV)-based optimized plans. Robust optimization incorporates setup and range uncertainties, which implicitly adds margins to both targets and OARs and is also able to compensate for perturbations in dose distributions within targets and OARs caused by uncertainties. In contrast, the traditional PTV-based optimization considers only setup uncertainties and adds a margin only to targets but no margins to the OARs. It also ignores range uncertainty. The purpose of this work is to determine if robustly optimized plans are superior to PTV-based plans simply because the latter do not assign margins to OARs during optimization. Methods: The authors retrospectively selected from their institutional database five patients with head and neck (H and N) cancer and one with prostate cancer for this analysis. Using their original images and prescriptions, the authors created new IMPT plans using three methods: PTV-based optimization, optimization based on the PTV and planning risk volumes (PRVs) (i.e., 'PTV+PRV-based optimization'), and robust optimization using the 'worst-case' dose distribution. The PRVs were generated by uniformly expanding OARs by 3 mm for the H and N cases and 5 mm for the prostate case. The dose-volume histograms (DVHs) from the worst-case dose distributions were used to assess and compare plan quality. Families of DVHs for each uncertainty for all structures of interest were plotted along with the nominal DVHs. The width of the 'bands' of DVHs was used to quantify the plan sensitivity to uncertainty. Results: Compared with conventional PTV-based and PTV+PRV-based planning, robust optimization led to a smaller bandwidth for the targets in the face of uncertainties {l_brace}clinical target volume [CTV] bandwidth: 0.59 [robust], 3.53 [PTV+PRV], and 3.53 [PTV] Gy (RBE){r_brace}. It also resulted in higher doses to 95% of the CTV {l_brace}D{sub 95%}: 60.8 [robust] vs 59.3 [PTV+PRV] vs 59.6 [PTV] Gy (RBE){r_brace}, smaller D{sub 5%} (doses to 5% of the CTV) minus D{sub 95%} {l_brace}D{sub 5%}- D{sub 95%}: 13.2 [robust] vs 17.5 [PTV+PRV] vs 17.2 [PTV] Gy (RBE){r_brace}. At the same time, the robust optimization method irradiated OARs less {l_brace}maximum dose to 1 cm{sup 3} of the brainstem: 48.3 [robust] vs 48.8 [PTV+PRV] vs 51.2 [PTV] Gy (RBE); mean dose to the oral cavity: 22.3 [robust] vs 22.9 [PTV+PRV] vs 26.1 [PTV] Gy (RBE); maximum dose to 1% of the normal brain: 66.0 [robust] vs 68.0 [PTV+PRV] vs 69.3 [PTV] Gy (RBE){r_brace}. Conclusions: For H and N cases studied, OAR sparing in PTV+PRV-based optimization was inferior compared to robust optimization but was superior compared to PTV-based optimization; however, target dose robustness and homogeneity were comparable in the PTV+PRV-based and PTV-based optimizations. The same pattern held for the prostate case. The authors' data suggest that the superiority of robust optimization is not due simply to its inclusion of margins for OARs, but that this is due mainly to the ability of robust optimization to compensate for perturbations in dose distributions within target volumes and normal tissues caused by uncertainties.

60 APPLIED LIFE SCIENCES↗

Robust optimization of intensity modulated proton therapy

Purpose: Intensity modulated proton therapy (IMPT) is highly sensitive to range uncertainties and uncertainties caused by setup variation. The conventional inverse treatment planning of IMPT optimized based on the planning target volume (PTV) is not often sufficient to ensure robustness of treatment plans. In this paper, a method that takes the uncertainties into account during plan optimization is used to mitigate the influence of uncertainties in IMPT. Methods: The authors use the so-called ''worst-case robust optimization'' to render IMPT plans robust in the face of uncertainties. For each iteration, nine different dose distributions are computed--one each for {+-} setup uncertainties along anteroposterior (A-P), lateral (R-L) and superior-inferior (S-I) directions, for {+-} range uncertainty, and the nominal dose distribution. The worst-case dose distribution is obtained by assigning the lowest dose among the nine doses to each voxel in the clinical target volume (CTV) and the highest dose to each voxel outside the CTV. Conceptually, the use of worst-case dose distribution is similar to the dose distribution achieved based on the use of PTV in traditional planning. The objective function value for a given iteration is computed using this worst-case dose distribution. The objective function used has been extended to further constrain the target dose inhomogeneity. Results: The worst-case robust optimization method is applied to a lung case, a skull base case, and a prostate case. Compared with IMPT plans optimized using conventional methods based on the PTV, our method yields plans that are considerably less sensitive to range and setup uncertainties. An interesting finding of the work presented here is that, in addition to reducing sensitivity to uncertainties, robust optimization also leads to improved optimality of treatment plans compared to the PTV-based optimization. This is reflected in reduction in plan scores and in the lower normal tissue doses for the same coverage of the target volume when subjected to uncertainties. Conclusions: The authors find that the worst-case robust optimization provides robust target coverage without sacrificing, and possibly even improving, the sparing of normal tissues. Our results demonstrate the importance of robust optimization. The authors assert that all IMPT plans should be robustly optimized.

61 RADIATION PROTECTION AND DOSIMETRY↗

TU-E-213-03: Tools for Ensuring Quality and Safety

Purpose: To develop the first 4D robust optimization (RO) method accounting for respiratory motion and evaluate its potential to improve plan robustness and optimality compared to 3D RO and PTV-based optimization. Methods: A set of 4D CT images are used to track respiratory motion and deformation of tumors and organs. For each of 10 respiration phases, dose distributions for nine different uncertainty scenarios including the nominal one, those incorporating ±5mm setup uncertainties long x, y and z directions and ±3.5% range uncertainties are calculated. All 90 dose distributions are simultaneously optimized to achieve full dose coverage of 10 CTVs and sparing of normal structures. ITV-based 3D RO and PTV-based optimization based on the average CT are also carried for the same patient using same dose volume constrains. After optimization, 4D robustness evaluation was performed for all resulting plans. The CTV coverage and the sparing of normal tissue in 10 phases are evaluated and compared among the three methods. The widths of DVH bands represent the robustness of dose distributions in the structures. Results: For one patient studied so far, the worst case CTV coverage by the prescription dose among all 90 scenarios is: 99% for 4D RO; 88.9% for 3D RO, and 85.2% for PTV based optimization. 4D RO also results in best robustness with the narrowest DVH’ bandwidths for the CTV. 4D and 3D RO have similar organ sparing while PTV based optimization results in worst organ sparing. Conclusion: 4D robust optimization which accounts for anatomy motion and deformation in the optimization process, significantly improves plan robustness and achieves higher quality treatment plans for lung cancer patients. The method is being evaluated for multiple patients with different tumor and motion characteristics.

60 APPLIED LIFE SCIENCES↗

Data-Driven Robust RVFLNs Modeling of a Blast Furnace Iron-Making Process Using Cauchy Distribution Weighted M-Estimation

Optimal operation of a practical blast furnace (BF) ironmaking process depends largely on a good measurement of molten iron quality (MIQ) indices. However, measuring the MIQ online is not feasible using the available techniques. In this paper, a novel data-driven robust modeling is proposed for online estimation of MIQ using improved random vector functional-link networks (RVFLNs). Since the output weights of traditional RVFLNs are obtained by the least squares approach, a robustness problem may occur when the training dataset is contaminated with outliers. This affects the modeling accuracy of RVFLNs. To solve this problem, a Cauchy distribution weighted M-estimation based robust RFVLNs is proposed. Since the weights of different outlier data are properly determined by the Cauchy distribution, their corresponding contribution on modeling can be properly distinguished. Thus robust and better modeling results can be achieved. Moreover, given that the BF is a complex nonlinear system with numerous coupling variables, the data-driven canonical correlation analysis is employed to identify the most influential components from multitudinous factors that affect the MIQ indices to reduce the model dimension. Finally, experiments using industrial data and comparative studies have demonstrated that the obtained model produces a better modeling and estimating accuracy and stronger robustness than other modeling methods.

42 ENGINEERING↗

Arbitrage and Capacity Firming in Coordination with Day-Ahead Bidding of a Hybrid PV Plant: Preprint

A hybrid PV plant (HPP) combines a photovoltaic (PV) plant with a battery energy storage system (BESS), which is considered a promising step towards the future of renewable power plants by the U.S. Department of Energy. When the renewable penetration reaches a significant level, a hybrid PV plant can bid in as a controllable thermal plant in the future electricity market. In this study, a bidding and BESS scheduling model is proposed for the HPP. The robust optimization (RO) technique has been utilized to identify the worst-case scenario of uncertainties during the bidding process. To address the overly conservative issue of the single-stage RO, we have decoupled the BESS schedule for arbitrage and PV capacity firming by a two-stage RO formulation. By comparing the output of single-stage RO and two-stage RO, the two-stage RO bids and schedules in a more aggressive manner, which increases the income of HPP. Also, the penalty of under-generation is considered in our model so that the day-ahead bidding decision and arbitrage schedules can be adjusted based on the potential UNDER-GENERATION penalty. Because the proposed model is non-convex and contains multi-stages, the Column-and-Constraint Generation (C&CG) algorithm is applied to the model as the solution. The proposed model has shown better economic performance compared to a state-of-art single-stage bidding method in case studies.

BESS scheduling↗

Optimal Eco-Driving Control of Connected and Autonomous Vehicles Through Signalized Intersections

This article focuses on the speed planning problem for connected and automated vehicles (CAVs) communicating to traffic lights. The uncertainty of traffic signal timing for signalized intersections on the road is considered. The eco-driving problem is formulated as a data-driven chance-constrained robust optimization problem. Effective red-light duration (ERD) is defined as a random variable, and describes the feasible passing time through the signalized intersections. Usually, the true probability distribution for ERD is unknown. Consequently, a data-driven approach is adopted to formulate chance constraints based on empirical sample data. This incorporates robustness into the eco-driving control problem with respect to uncertain signal timing. Dynamic programming (DP) is employed to solve the optimization problem. The simulation results demonstrate that the proposed method can generate optimal speed reference trajectories with 40% less vehicle fuel consumption, while maintaining the arrival time at a similar level compared to a modified intelligent driver model (IDM). The proposed control approach significantly improves the controller's robustness in the face of uncertain signal timing, without requiring to know the distribution of the random variable a priori.

33 ADVANCED PROPULSION SYSTEMS↗

SU-F-T-208: An Efficient Planning Approach to Posterior Fossa Tumor Bed Boosts Using Proton Pencil Beam Scanning in Fixed-Beam Room

Purpose: A fixed-beam room could be underutilized in a multi-room proton center. We investigated the use of proton pencil beam scanning (PBS) on a fixed-beam as an alternative for posterior fossa tumor bed (PF-TB) boost treatments which were usually treating on a gantry with uniform scanning. Methods: Five patients were treated with craniospinal irradiation (CSI, 23.4 or 36.0 Gy(RBE)) followed by a PF-TB boost to 54 Gy(RBE) with proton beams. Three PF-TB boost plans were generated for each patient: (1) a uniform scanning (US) gantry plan with 4–7 posterior fields shaped with apertures and compensators (2) a PBS plan using bi-lateral and vertex fields with a 3-mm planning organ-at-risk volume (PRV) expansion around the brainstem and (3) PBS fields using same beam arrangement but replacing the PRV with robust optimization considering a 3-mm setup uncertainty. Results: A concave 54-Gy(RBE) isodose line surrounding the brainstem could be achieved using all three techniques. The mean V95% of the PTV was 99.7% (range: 97.6% to 100%) while the V100% of the PTV ranged from 56.3% to 93.1% depending on the involvement of the brainstem with the PTV. The mean doses received by 0.05 cm{sup 3} of the brainstem were effectively identical: 54.0 Gy(RBE), 53.4 Gy(RBE) and 53.3 Gy(RBE) for US, PBS optimized with PRV, and PBS optimized with robustness plans respectively. The cochlea mean dose increased by 23% of the prescribed boost dose in average from the bi-lateral fields used in the PBS plan. Planning time for the PBS plan with PRV was 5–10 times less than the US plan and the robustly optimized PBS plan. Conclusion: We have demonstrated that a fixed-beam with PBS can deliver a dose distribution comparable to a gantry plan using uniform scanning. Planning time can be reduced substantially using a PRV around the brainstem instead of robust optimization.

60 APPLIED LIFE SCIENCES↗

Using spatial information about recurrence risk for robust optimization of dose-painting prescription functions

Purpose: To develop a robust method for deriving dose-painting prescription functions using spatial information about the risk for disease recurrence. Methods: Spatial distributions of radiobiological model parameters are derived from distributions of recurrence risk after uniform irradiation. These model parameters are then used to derive optimal dose-painting prescription functions given a constant mean biologically effective dose. Results: An estimate for the optimal dose distribution can be derived based on spatial information about recurrence risk. Dose painting based on imaging markers that are moderately or poorly correlated with recurrence risk are predicted to potentially result in inferior disease control when compared the same mean biologically effective dose delivered uniformly. A robust optimization approach may partially mitigate this issue. Conclusions: The methods described here can be used to derive an estimate for a robust, patient-specific prescription function for use in dose painting. Two approximate scaling relationships were observed: First, the optimal choice for the maximum dose differential when using either a linear or two-compartment prescription function is proportional to R, where R is the Pearson correlation coefficient between a given imaging marker and recurrence risk after uniform irradiation. Second, the predicted maximum possible gain in tumor control probability for any robust optimization technique is nearly proportional to the square of R.

61 RADIATION PROTECTION AND DOSIMETRY↗

Large-scale 3D geoelectromagnetic modeling using parallel adaptive high-order finite element method

Here, we have investigated the use of the adaptive high-order finite-element method (FEM) for geoelectromagnetic modeling. Because high-order FEM is challenging from the numerical and computational points of view, most published finite-element studies in geoelectromagnetics use the lowest order formulation. Solution of the resulting large system of linear equations poses the main practical challenge. We have developed a fully parallel and distributed robust and scalable linear solver based on the optimal block-diagonal and auxiliary space preconditioners. The solver was found to be efficient for high finite element orders, unstructured and nonconforming locally refined meshes, a wide range of frequencies, large conductivity contrasts, and number of degrees of freedom (DoFs). Furthermore, the presented linear solver is in essence algebraic; i.e., it acts on the matrix-vector level and thus requires no information about the discretization, boundary conditions, or physical source used, making it readily efficient for a wide range of electromagnetic modeling problems. To get accurate solutions at reduced computational cost, we have also implemented goal-oriented adaptive mesh refinement. The numerical tests indicated that if highly accurate modeling results were required, the high-order FEM in combination with the goal-oriented local mesh refinement required less computational time and DoFs than the lowest order adaptive FEM.

58 GEOSCIENCES↗

Accounting for the tongue-and-groove effect using a robust direct aperture optimization approach

Purpose: Traditionally, the tongue-and-groove effect due to the multileaf collimator architecture in intensity-modulated radiation therapy (IMRT) has typically been deferred to the leaf sequencing stage. The authors propose a new direct aperture optimization method for IMRT treatment planning that explicitly incorporates dose calculation inaccuracies due to the tongue-and-groove effect into the treatment plan optimization stage. Methods: The authors avoid having to accurately estimate the dosimetric effects of the tongue-and-groove architecture by using lower and upper bounds on the dose distribution delivered to the patient. They then develop a model that yields a treatment plan that is robust with respect to the corresponding dose calculation inaccuracies. Results: Tests on a set of ten clinical head-and-neck cancer cases demonstrate the effectiveness of the new method in developing robust treatment plans with tight dose distributions in targets and critical structures. This is contrasted with the very loose bounds on the dose distribution that are obtained by solving a traditional treatment plan optimization model that ignores tongue-and-groove effects in the treatment planning stage. Conclusions: A robust direct aperture optimization approach is proposed to account for the dosimetric inaccuracies caused by the tongue-and-groove effect. The experiments validate the ability of the proposed approach in designing robust treatment plans regardless of the exact consequences of the tongue-and-groove architecture.

60 APPLIED LIFE SCIENCES↗

Robust PET-guided intensity-modulated radiation therapy

Purpose: Functional image guided intensity-modulated radiation therapy has the potential to improve cancer treatment quality by basing treatment parameters such as heterogeneous dose distributions information derived from imaging. However, such heterogeneous dose distributions are subject to imaging uncertainty. In this paper, the authors develop a robust optimization model to design plans that are desensitized to imaging uncertainty. Methods: Starting from the pretreatment fluorodeoxyglucose-positron emission tomography scans, the authors use the raw voxel standard uptake values (SUVs) as input into a series of intermediate functions to transform the SUV into a desired dose. The calculated desired doses were used as an input into a robust optimization model to generate beamlet intensities. For each voxel, the authors assume that the true SUV cannot be observed but instead resides in an interval centered on the nominal (i.e., observed) SUV. Then the authors evaluated the nominal and robust solutions through a simulation study. The simulation considered the effect of the true SUV being different from the nominal SUV on the quality of the treatment plan. Treatment plans were compared on the metrics of objective function value and tumor control probability (TCP). Results: Computational results demonstrate the potential for improvements in tumor control probability and deviation from the desired dose distribution compared to a nonrobust model while maintaining acceptable tissue dose. Conclusions: Robust optimization can help design treatment plans that are more stable in the presence of image value uncertainties.

60 APPLIED LIFE SCIENCES↗

WE-AB-209-01: A Monte Carlo-Based Method to Include Random Errors in Robust Optimization

Purpose: To develop an efficient method to implement random set-up errors and organ motion in robust optimization for proton therapy treatment planning. Methods: The plans were created with an in-house robust optimizer, coupled with a super-fast Monte Carlo (MC) engine (less than 1 minute for final dose). MC simulates random errors by shifting randomly the starting point of each particle, according to their probability distribution. Such strategy assumes a sufficient number of treatment fractions. Two strategies are presented: 1) Full robust optimization with beamlets that already include the effect of random errors and 2) Mixed robust optimization, where the nominal beamlets are involved but a correction term C modifies the prescription. Starting from C=0, the method alternates optimization of the spot weights with the nominal beamlets and updates of C, with C=Drandom-Dnominal and where Drandom results from a regular MC computation (without pre-computed beamlets) that simulates random errors. Updates of C can be triggered as often as necessary by running the MC engine with the last corrected values for the spot weights as input. The method was applied to lung and prostate cases. For both patients the range error was set to 3%, systematic setup error to 5mm and standard deviation for random errors to 5 mm. Comparison between full robust optimization and the mixed strategy (with 3 updates of C) is presented. Results: Target coverage was far below the clinical constraints (D{sub 95} > 95% of the prescribed dose) for plans where random errors were not simulated, especially for lung case. However, by using the proposed strategies the plans achieved a target coverage above clinical constraints. Conclusion: Full robust optimization gives better results than the mixed strategy, but the latter can be useful in cases where a MC engine is not available or too computationally intensive for beamlets calculation.

60 APPLIED LIFE SCIENCES↗