Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization problems”

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 901 records · Page 50

Heuristic optimization of the scanning path of particle therapy beams

Quasidiscrete scanning is a delivery strategy for proton and ion beam therapy in which the beam is turned off when a slice is finished and a new energy must be set but not during the scanning between consecutive spots. Different scanning paths lead to different dose distributions due to the contribution of the unintended transit dose between spots. In this work an algorithm to optimize the scanning path for quasidiscrete scanned beams is presented. The classical simulated annealing algorithm is used. It is a heuristic algorithm frequently used in combinatorial optimization problems, which allows us to obtain nearly optimal solutions in acceptable running times. A study focused on the best choice of operational parameters on which the algorithm performance depends is presented. The convergence properties of the algorithm have been further improved by using the next-neighbor algorithm to generate the starting paths. Scanning paths for two clinical treatments have been optimized. The optimized paths are found to be shorter than the back-and-forth, top-to-bottom (zigzag) paths generally provided by the treatment planning systems. The gamma method has been applied to quantify the improvement achieved on the dose distribution. Results show a reduction of the transit dose when the optimized paths are used. The benefit is clear especially when the fluence per spot is low, as in the case of repainting. The minimization of the transit dose can potentially allow the use of higher beam intensities, thus decreasing the treatment time. The algorithm implemented for this work can optimize efficiently the scanning path of quasidiscrete scanned particle beams. Optimized scanning paths decrease the transit dose and lead to better dose distributions.

61 RADIATION PROTECTION AND DOSIMETRY↗

SU-E-T-21: A Novel Sampling Algorithm to Reduce Intensity-Modulated Radiation Therapy (IMRT) Optimization Time

Purpose: The IMRT optimization problem requires substantial computer time to find optimal dose distributions because of the large number of variables and constraints. Voxel sampling reduces the number of constraints and accelerates the optimization process, but usually deteriorates the quality of the dose distributions to the organs. We propose a novel sampling algorithm that accelerates the IMRT optimization process without significantly deteriorating the quality of the dose distribution. Methods: We included all boundary voxels, as well as a sampled fraction of interior voxels of organs in the optimization. We selected a fraction of interior voxels using a clustering algorithm, that creates clusters of voxels that have similar influence matrix signatures. A few voxels are selected from each cluster based on the pre-set sampling rate. Results: We ran sampling and no-sampling IMRT plans for de-identified head and neck treatment plans. Testing with the different sampling rates, we found that including 10% of inner voxels produced the good dose distributions. For this optimal sampling rate, the algorithm accelerated IMRT optimization by a factor of 2–3 times with a negligible loss of accuracy that was, on average, 0.3% for common dosimetric planning criteria. Conclusion: We demonstrated that a sampling could be developed that reduces optimization time by more than a factor of 2, without significantly degrading the dose quality.

60 APPLIED LIFE SCIENCES↗

STreCH

Symbolic regression software that formulates a symbolic regression problem as a mixed-integer nonlinear optimization problem, and solves it using a sequential tree construction heuristic

Leyffer, Sven↗

PARMOO

ParMOO is a Python library for solving multiobjective simulation optimization problems, while exploiting problem structure. ParMOO stands for "parallel multiobjective optimization".

WILD, STEFAN↗

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N " M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.

97 MATHEMATICS AND COMPUTING↗

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N$\gg$M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.

97 MATHEMATICS AND COMPUTING↗

Robust Resilient Signal Reconstruction under Adversarial Attacks

We consider the problem of signal reconstruction for a system under sparse signal corruption by a malicious agent. The reconstruction problem follows the standard error coding problem that has been studied extensively in the literature. We include a new challenge of robust estimation of the attack support. The problem is then cast as a constrained optimization problem merging promising techniques in the area of deep learning and estimation theory. A pruning algorithm is developed to reduce the "false positive" uncertainty of data-driven attack localization results, thereby improving the probability of correct signal reconstruction. Sufficient conditions for the correct reconstruction and the associated reconstruction error bounds are obtained for both exact and inexact attack support estimation. Moreover, a simulation of a water distribution system is presented to validate the proposed techniques.

Robust, Signal reconstruction, Resilient estimator↗

Boundary shape identification problems in two-dimensional domains related to thermal testing of materials

The identification of the geometrical structure of the system boundary for a two-dimensional diffusion system is reported. The domain identification problem treated here is converted into an optimization problem based on a fit-to-data criterion and theoretical convergence results for approximate identification techniques are discussed. Results of numerical experiments to demonstrate the efficacy of the theoretical ideas are reported.

Banks, H. T.↗

Boundary shape identification problems in two-dimensional domains related to thermal testing of materials

The identification of the geometrical structure of the system boundary for a two-dimensional diffusion system is reported. The domain identification problem treated here is converted into an optimization problem based on a fit-to-data criterion and theoretical convergence results for approximate identification techniques are discussed. Ressults of numerical experiments to demonstrate the efficacy of the theoretical ideas are reported.

Banks, H. T.↗

Neural-Network Processor Would Allocate Resources

Global optimization problems solved quickly. Neural-network processor optimizes allocation of M resources among N expenditures according to cost of pairing each resource with each expenditure and subject to limit on number of resources feeding into each expenditure and/or limit on number of expenditures to which each resource allocated. One cell performs several analog and digital functions. Potential applications include assignment of jobs, scheduling, dispatching, and planning of military maneuvers.

Eberhardt, Silvio P.↗

Minimum-fuel rescue trajectories for the Extravehicular Excursion Unit

The problem of determining minimum-fuel trajectories for rescuing astronauts or equipment which become separated from a Space Station is addressed. Using the Clohessy-Wiltshire equations of relative motion and assuming impulsive Delta-Vs, the minimum-fuel rescue problem is shown to be a parameter optimization problem. Minimum-fuel rescue trajectories are found for seventeen test cases using a recursive quadratic programming algorithm. The results are analyzed and general rules for astronaut rescue and equipment retrieval are developed.

Fowler, W. T.↗

Aerodynamic shape optimization using sensitivity analysis on third-order Euler equations

Two major advancements of an aerodynamic optimization method with two design variables are described. The first is represnted by an improved flow prediction method that uses the third-order accurate discretization of the Euler equations. This method makes it possible to predict the flowfield of a perturbed shape which generates shocks and other large gradients without intermediate CFD analysis. The second advancement is the use of every surface grid point as a design variable in the aerodynamic shape optimization problem. The improved algorithm is demonstrated by optimizing the ramp shape of a scramjet-afterbody configuration for maximum axial thrust. It is concluded that the improved flow-field prediction method eliminates most of the flow analysis and a priori guessing of all possible shapes from which the optimum is to be selected.

Baysal, Oktay↗

Robust control of systems with real parameter uncertainty and unmodelled dynamics

Two significant contributions have been made during this research period in the research 'Robust Control of Systems with Real Parameter Uncertainty and Unmodelled Dynamics' under NASA Research Grant NAG-1-1102. They are: (1) a fast algorithm for computing the optimal H(sub infinity) norm for the four-block, the two block, or the one-block optimal H(sub infinity) optimization problem; and (2) a construction of an optimal H infinity controller without numerical difficulty. In using GD (Glover and Doyle) or DGKF (Doyle, Glover, Khargonekar, and Francis) approach to solve the standard H infinity norm which required bisection search. In this research period, we developed a very fast iterative algorithm for this computation. Our algorithm was developed based on hyperbolic interpolations which is much faster than any existing algorithm. The lower bound of the parameter, gamma, in the H infinity Riccati equation for solution existence is shown to be the square root of the supremum over all frequencies of the maximum eigenvalue of a given transfer matrix which can be computed easily. The lower band of gamma such that the H infinity Riccati equation has positive semidefinite solution can be also obtained by hyperbolic interpolation search. Another significant result in this research period is the elimination of the numerical difficulties arising in the construction of an optimal H infinity controller by directly applying the Glover and Doyle's state-space formulas. With the fast iterative algorithm for the computation of the optimal H infinity norm and the reliable construction of an optimal H infinity controller, we are ready to apply these tools in the design of robust controllers for the systems with unmodelled uncertainties. These tools will be also very useful when we consider systems with structured uncertainties.

Chang, Bor-Chin↗

A parametric sensitivity study for single-stage-to-orbit hypersonic vehicles using trajectory optimization

The class of hypersonic vehicle configurations with single stage-to-orbit (SSTO) capability reflect highly integrated airframe and propulsion systems. These designs are also known to exhibit a large degree of interaction between the airframe and engine dynamics. Consequently, even simplified hypersonic models are characterized by tightly coupled nonlinear equations of motion. In addition, hypersonic SSTO vehicles present a major system design challenge; the vehicle's overall mission performance is a function of its subsystem efficiencies including structural, aerodynamic, propulsive, and operational. Further, all subsystem efficiencies are interrelated, hence, independent optimization of the subsystems is not likely to lead to an optimum design. Thus, it is desired to know the effect of various subsystem efficiencies on overall mission performance. For the purposes of this analysis, mission performance will be measured in terms of the payload weight inserted into orbit. In this report, a trajectory optimization problem is formulated for a generic hypersonic lifting body for a specified orbit-injection mission. A solution method is outlined, and results are detailed for the generic vehicle, referred to as the baseline model. After evaluating the performance of the baseline model, a sensitivity study is presented to determine the effect of various subsystem efficiencies on mission performance. This consists of performing a parametric analysis of the basic design parameters, generating a matrix of configurations, and determining the mission performance of each configuration. Also, the performance loss due to constraining the total head load experienced by the vehicle is evaluated. The key results from this analysis include the formulation of the sizing problem for this vehicle class using trajectory optimization, characteristics of the optimal trajectories, and the subsystem design sensitivities.

Lovell, T. Alan↗

Actuator Placement Via Genetic Algorithm for Aircraft Morphing

This research continued work that began under the support of NASA Grant NAG1-2119. The focus of this effort was to continue investigations of Genetic Algorithm (GA) approaches that could be used to solve an actuator placement problem by treating this as a discrete optimization problem. In these efforts, the actuators are assumed to be "smart" devices that change the aerodynamic shape of an aircraft wing to alter the flow past the wing, and, as a result, provide aerodynamic moments that could provide flight control. The earlier work investigated issued for the problem statement, developed the appropriate actuator modeling, recognized the importance of symmetry for this problem, modified the aerodynamic analysis routine for more efficient use with the genetic algorithm, and began a problem size study to measure the impact of increasing problem complexity. The research discussed in this final summary further investigated the problem statement to provide a "combined moment" problem statement to simultaneously address roll, pitch and yaw. Investigations of problem size using this new problem statement provided insight into performance of the GA as the number of possible actuator locations increased. Where previous investigations utilized a simple wing model to develop the GA approach for actuator placement, this research culminated with application of the GA approach to a high-altitude unmanned aerial vehicle concept to demonstrate that the approach is valid for an aircraft configuration.

Crossley, William A.↗

An Information Theory Approach to Physical Domain Discovery

The project of physics discovery is often equivalent to finding the most concise description of a physical system. The description with optimum predictive capability for a dataset generated by a physical system is one that minimizes both predictive error on the dataset and the complexity of the description. The discovery of the governing physics of a system can therefore be viewed as a mathematical optimization problem. We outline here a method to optimize the description of arbitrarily complex physical systems by minimizing the entropy of the description of the system. The Recursive Domain Partitioning (RDP) procedure finds the optimum partitioning of each physical domain into subdomains, and the optimum predictive function within each subdomain. Penalty functions are introduced to limit the complexity of the predictive function within each domain. Examples are shown in 1D and 2D. In 1D, the technique effectively discovers the elastic and plastic regions within a stress-strain curve generated by simulations of amorphous carbon material, while in 2D the technique discovers the free-flow region and the inertially-obstructed flow region in the simulation of fluid flow across a plate.

Daniel Shea↗

Matrix Completion Using Alternating Minimization for Distribution System State Estimation: Preprint

This paper examines the problem of state estimation in power distribution systems under low-observability conditions. The recently proposed constrained matrix completion method which combines the standard matrix completion method and power flow constraints has been shown to be effective in estimating voltage phasors under low-observability conditions using single-snapshot information. However, the method requires solving a semidefinite programming (SDP) problem, which becomes computationally infeasible for large systems and if multiple-snapshot (time-series) information is used. This paper proposes an efficient algorithm to solve the constrained matrix completion problem with time-series data. This algorithm is based on reformulating the matrix completion problem as a bilinear (non-convex) optimization problem, and applying the alternating minimization algorithm to solve this problem. This paper proves the summable convergence of the proposed algorithm, and demonstrates its efficacy and scalability via IEEE 123-bus system and a real utility feeder system. This paper also explores the value of adding more data from the history in terms of computation time and estimation accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Multimodal Freight Energy Model for Emerging Freight Technology Analysis

While freight movement represents a small portion of the volume in the transportation sector, they are a critical contributor for energy consumed in that sector. To reduce logistics costs, energy consumption and negative environmental impact, emerging technologies, such as digitalization of logistics and alternative powertrain, have been developed and extended applications in freight. These trends are expected to grow and provide opportunities for greater efficiencies in freight movement and corresponding energy use. Still, the complexity of freight systems present challenges in evaluating these benefits, especially in the multimodal inter-city freight. Addressing the research need, this paper develops a multimodal freight energy modeling framework for the analysis of emerging freight technology scenarios. The framework is a bi-level optimization problem: network cost minimization problem (lower-level) and energy minimization problem (upper-level). The lower-level problem is a mode-path assignment problem in multimodal inter-city freight networks, where commodity-specific congestion effects on trans-shipment links are considered. For this model, an inverse modeling approach is applied to infer parameters of the lower-level model. The upper-level problem is designed to search for an optimal scenario that has the lowest energy consumption among different levels of technology applications. The proposed model is empirically tested to analyze truck load-pooling and multimodal load-pooling scenarios through stand-alone and mixed applications using freight shipments originating from or destined to the Chicago region. This framework can be used to explore the impact of emerging freight technologies on mode-path freight flow and energy consumption in the national multimodal freight network.

ADVANCED PROPULSION SYSTEMS↗