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 1,603 records · Page 89

Deep Learning–Assisted Multiobjective Optimization of Geological CO 2 Storage Performance under Geomechanical Risks

In geological CO 2 storage, designing the optimal well control strategy for CO 2 injection to maximize CO 2 storage while minimizing the associated geomechanical risks is not trivial. This challenge arises due to pressure buildup, CO 2 plume migration, the highly nonlinear nature of geomechanical responses to rock-fluid interaction, and the high computational cost associated with coupled flow and geomechanics simulations. In this paper, we introduce a novel optimization framework to address these challenges. The optimization problem is formulated as follows: maximize total CO 2 storage while minimizing geomechanical risks by adjusting the injection schedules within bounded constraints. The geomechanical risks are primarily driven by injection-induced pressure build-up, which is characterized by ground displacement and the induced microseismicity. We used the Fourier neural operator (FNO)-based deep learning model to construct surrogate models, replacing the time-consuming coupled flow and geomechanics simulations for evaluating the aforementioned objective functions. The developed surrogate models have been incorporated into a multiobjective optimization framework through a genetic algorithm to reduce the computational burden. The proposed optimization framework reduces the computational cost from approximately 2,400 hours, when using objective function evaluations based on physics-based simulations, to around 20 minutes. A set of Pareto-optimal solutions of the proposed workflow yields nontrivial optimal decisions, reducing the microseismicity potential and the vertical displacement. This Pareto front highlights the optimal trade-offs between CO 2 storage amount, safety, and ground displacement, emphasizing the need for careful optimization and management of injection strategies to achieve a balanced outcome. The novelty of this work is twofold. First, we demonstrate the importance of incorporating the minimization of the geomechanical risks as objective functions into the CO 2 storage optimization workflow to mitigate the potential risk of induced microseismicity and ground displacement. Second, we leverage the FNO-based surrogate models to optimize a real-field CO 2 storage operation.

42 ENGINEERING↗

Topology optimization of additively manufactured fluidic components free of internal support structures

This report integrates projection-based approaches for implementing overhang constraints with fluid topology optimization to design additively manufactured fluidic components that do not require internal support structures. Internal support structures are challenging, potentially impossible to remove in complex fluid networks, yet would degrade fluidic performance if left within the part. This presents a major challenge in coupling topology optimization with additive manufacturing in the design of fluid components. The proposed approach leverages past work in overhang constraints for solid mechanics, including projection formulations and adjoint sensitivity analysis, and considers incompressible Navier–Stokes equations for laminar fluid flow. The approach is demonstrated on 2D and 3D fluid topology optimization problems to minimize pressure drop and constrain mass flow rates in pipes and manifolds. Resulting designs are crisp, logical, satisfy performance constraints, and satisfy overhang constraints, eliminating the need for internal support structures.

42 ENGINEERING↗

Managing Wildfire Risk and Promoting Equity through Optimal Configuration of Networked Microgrids

As climate change increases the risk of large-scale wildfires, wildfire ignitions from electric power lines are a growing concern. To mitigate the wildfire ignition risk, many electric utilities de-energize power lines to prevent electric faults and failures. These preemptive power shutoffs are effective in reducing ignitions, but they could result in wide-scale power outages. Advanced technology, such as networked microgrids, can help reduce the size of the resulting power outages; however, even microgrid technology might not be sufficient to supply power to everyone, thus forcing hard questions about how to prioritize the provision of power among customers. In this paper, we present an optimization problem that configures networked microgrids to manage wildfire risk while maximizing the power served to customers; however, rather than simply maximizing the amount of power served in kilowatts, our formulation also considers the ability of customers to cope with power outages, as measured by social vulnerability, and it discourages the disconnection of particularly vulnerable customer groups. To test our model, we leverage a synthetic but realistic distribution feeder, along with publicly available social vulnerability indices and satellite-based wildfire risk map data, to quantify the parameters in our optimal decision-making model. Our case study results demonstrate the benefits of networked microgrids in limiting load shed and promoting equity during scenarios with high wildfire risk.

distribution systems↗

Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.

Space Networking↗

Quantum adiabatic machine learning by zooming into a region of the energy surface

Recent work has shown that quantum annealing for machine learning, referred to as QAML, can perform comparably to state-of-the-art machine learning methods with a specific application to Higgs boson classification. Here, we propose QAML-Z, an algorithm that iteratively zooms in on a region of the energy surface by mapping the problem to a continuous space and sequentially applying quantum annealing to an augmented set of weak classifiers. Results on a programmable quantum annealer show that QAML-Z matches classical deep neural network performance at small training set sizes and reduces the performance margin between QAML and classical deep neural networks by almost 50% at large training set sizes, as measured by area under the receiver operating characteristic curve. The significant improvement of quantum annealing algorithms for machine learning and the use of a discrete quantum algorithm on a continuous optimization problem both opens a class of problems that can be solved by quantum annealers and suggests the approach in performance of near-term quantum machine learning towards classical benchmarks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparison of Traditional Design Nonlinear Programming Optimization and Stochastic Methods for Structural Design

Structural design generated by traditional method, optimization method and the stochastic design concept are compared. In the traditional method, the constraints are manipulated to obtain the design and weight is back calculated. In design optimization, the weight of a structure becomes the merit function with constraints imposed on failure modes and an optimization algorithm is used to generate the solution. Stochastic design concept accounts for uncertainties in loads, material properties, and other parameters and solution is obtained by solving a design optimization problem for a specified reliability. Acceptable solutions were produced by all the three methods. The variation in the weight calculated by the methods was modest. Some variation was noticed in designs calculated by the methods. The variation may be attributed to structural indeterminacy. It is prudent to develop design by all three methods prior to its fabrication. The traditional design method can be improved when the simplified sensitivities of the behavior constraint is used. Such sensitivity can reduce design calculations and may have a potential to unify the traditional and optimization methods. Weight versus reliabilitytraced out an inverted-S-shaped graph. The center of the graph corresponded to mean valued design. A heavy design with weight approaching infinity could be produced for a near-zero rate of failure. Weight can be reduced to a small value for a most failure-prone design. Probabilistic modeling of load and material properties remained a challenge.

Patnaik, Surya N.↗

Automating Genetic Algorithm Mutations for Molecules Using a Masked Language Model

Inspired by the evolution of biological systems, genetic algorithms have been applied to generate solutions for optimization problems in a variety of scientific and engineering disciplines. For a given problem, a suitable genome representation must be defined along with a mutation operator to generate subsequent generations. Unlike natural systems which display a variety of complex rearrangements (e.g. mobile genetic elements), mutation for genetic algorithms commonly utilizes only random point-wise changes. Furthermore, generalizing beyond point-wise mutations poses a key difficulty as useful genome rearrangements depend on the representation and problem domain. To move beyond the limitations of manually defined point-wise changes, here we propose the use of techniques from masked language models to automatically generate mutations. As a first step, common subsequences within a given population are used to generate a vocabulary. The vocabulary is then used to tokenize each genome. A masked language model is trained on the tokenized data in order to generate possible rearrangements (i.e. mutations). In order to illustrate the proposed strategy, we use string representations of molecules and use a genetic algorithm to optimize for drug-likeness and synthesizability. Finally, our results show that moving beyond random point-wise mutations accelerates genetic algorithm optimization.

59 BASIC BIOLOGICAL SCIENCES↗

An Approach to Reasoning Service Migration in Data and Reasoning Fabric (DRF) Implementation

In this paper we consider service placement problem for Data and Reasoning Fabric (DRF) enabled airspace operations assuming a fixed cloud/edge infrastructure with allocated computing, storage and power resources, where cloud/edge servers, and communication stations are in a wired connected network, while vehicles use a wireless network for communication. The objective is to automatically select the best location for the requested service execution, which achieves minimum cost while satisfying the user quality of service (QoS) and available resources constraints. To this end, we estimate for each potential location the response time, consumed energy and total cost; formulate an optimization problem for cost minimization given the users QoS constraints and network infrastructure limitations; and solve it using nonlinear programming tools. The approach is applied to trajectory re-planning use case to handle a no-fly zone contingency in real time.

Vahram Stepanyan↗

Quantum key distribution with finite resources: Secret key rates via Renyi entropies

A realistic quantum key distribution (QKD) protocol necessarily deals with finite resources, such as the number of signals exchanged by the two parties. We derive a bound on the secret key rate which is expressed as an optimization problem over Renyi entropies. Under the assumption of collective attacks by an eavesdropper, a computable estimate of our bound for the six-state protocol is provided. This bound leads to improved key rates in comparison to previous results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Practical algorithms for multivariate rational approximation

We present two approaches for computing rational approximations to multivariate functions, motivated by their effectiveness as surrogate models for high-energy physics (HEP) applications. Our first approach builds on the Stieltjes process to efficiently and robustly compute the coefficients of the rational approximation. Our second approach is based on an optimization formulation that allows us to include structural constraints on the rational approximation (in particular, constraints demanding the absence of singularities), resulting in a semi-infinite optimization problem that we solve using an outer approximation approach. We present results for synthetic and real-life HEP data, and we compare the approximation quality of our approaches with that of traditional polynomial approximations.

97 MATHEMATICS AND COMPUTING↗

Gear optimization

The use of formal numerical optimization methods for the design of gears is investigated. To achieve this, computer codes were developed for the analysis of spur gears and spiral bevel gears. These codes calculate the life, dynamic load, bending strength, surface durability, gear weight and size, and various geometric parameters. It is necessary to calculate all such important responses because they all represent competing requirements in the design process. The codes developed here were written in subroutine form and coupled to the COPES/ADS general purpose optimization program. This code allows the user to define the optimization problem at the time of program execution. Typical design variables include face width, number of teeth and diametral pitch. The user is free to choose any calculated response as the design objective to minimize or maximize and may impose lower and upper bounds on any calculated responses. Typical examples include life maximization with limits on dynamic load, stress, weight, etc. or minimization of weight subject to limits on life, dynamic load, etc. The research codes were written in modular form for easy expansion and so that they could be combined to create a multiple reduction optimization capability in future.

Vanderplaats, G. N.↗

Phase field method to optimize dielectric devices for electromagnetic wave propagation

We discuss a phase field method for shape optimization in the context of electromagnetic wave propagation. The proposed method has the same functional capabilities as the level set method for shape optimization. The first advantage of the method is the simplicity of computation, since extra operations such as re-initialization of functions are not required. The second is compatibility with the topology optimization method due to the similar domain representation and the sensitivity analysis. Structural shapes are represented by the phase field function defined in the design domain, and this function is optimized by solving a time-dependent reaction diffusion equation. The artificial double-well potential function used in the equation is derived from sensitivity analysis. We study four types of 2D or 2.5D (axisymmetric) optimization problems. Two are the classical problems of photonic crystal design based on the Bloch theory and photonic crystal wave guide design, and two are the recent topics of designing dielectric left-handed metamaterials and dielectric ring resonators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gamma-Ray Point-Source Localization and Sparse Image Reconstruction using Poisson Likelihood

Gamma-ray imaging trys to reconstruct the spatial and intensity distribution of gamma-emitting radionuclides from a set of measurements. Wholly, this problem is solved by discretizing the spatial dimensions and employing the maximum likelihood expectation maximization (ML-EM) algorithm, with or without some form of regularization. While the generality of this formulation enables use in a wide variety of scenarios, it is susceptible to overfitting, limited by the discretization of spatial coordinates, and can be computationally expensive. We present a novel approach to 3D gamma-ray image reconstruction for scenarios where sparsity may be assumed, for example radiological source search. In this work we first formulate a point-source localization (PSL) approach as an optimization problem where both position and source intensity are continuous variables. We then extend and generalize this formulation to an iterative algorithm called additive point-source localization (APSL) for sparse parametric image reconstruction. A set of simulated source search scenarios using a single non-directional detector are considered, finding improved image accuracy and computational efficiency with APSL over traditional grid-based methods.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SU-G-JeP1-02: A New Intra-Fractional Prostate Motion Tracking Method in Volumetric Modulated Arc Therapy (VMAT) Via 2D/3D Registration

Purpose: Intra-fractional prostate motion leads uncertainty on delivered dose in radiotherapy and may cause significant dose deviation from the planned dose distribution. This is especially a concern in scenarios with a high dose per fraction and hence a long delivery time, e.g. stereotactic body radiotherapy. Knowledge about intra-fractional prostate motion is valuable to address this problem, e.g. by reconstructing delivered dose and performing adaptation. This study proposes a new approach to determine intra-fractional prostate motion in VMAT via 2D/3D maker registration. Methods: At our institution, each patient has three markers implanted in the prostate. During treatment delivery, kV triggered images were taken every three seconds to acquire 2D projection of 3D anatomy at the direction orthogonal to the therapeutic beam. Projected marker locations were identified on each projection image using template matching with geometric constraints. 3D prostate translation and rotation for each triggered image were obtained by solving an optimization problem, such that the calculated marker locations match the measured ones. Inter-image motion smoothness was employed as a constraint. We tested this method in simulation studies with five realistic prostate motion trajectories acquired via Calypso and in real phantom experiments. Results: For the simulation case, the motion range for these patients was 0.5∼6.0 mm. Root mean square (RMS) error of calculated motion along left-right (LR), anterior-posterior (AP) and cranial-caudal (CC) directions were 0.26mm, 0.36mm, and 0.016mm, respectively. The motion range in the phantom study along LR, AP, and CC directions were 15mm, 20mm and 10mm. The mean RMS errors along these directions were 1.99mm, 1.37mm and 0.22mm. Conclusion: A new prostate motion tracking algorithm based on kV triggered images has been developed and validated. Clinically acceptable accuracy has been achieved.

60 APPLIED LIFE SCIENCES↗

Robust Maneuvering Envelope Estimation Based on Reachability Analysis in an Optimal Control Formulation

This paper discusses an algorithm for estimating the safe maneuvering envelope of damaged aircraft. The algorithm performs a robust reachability analysis through an optimal control formulation while making use of time scale separation and taking into account uncertainties in the aerodynamic derivatives. Starting with an optimal control formulation, the optimization problem can be rewritten as a Hamilton- Jacobi-Bellman equation. This equation can be solved by level set methods. This approach has been applied on an aircraft example involving structural airframe damage. Monte Carlo validation tests have confirmed that this approach is successful in estimating the safe maneuvering envelope for damaged aircraft.

optimal control↗

Automated Hardware Design via Evolutionary Search

The goal of this research is to investigate the application of evolutionary search to the process of automated engineering design. Evolutionary search techniques involve the simulation of Darwinian mechanisms by computer algorithms. In recent years, such techniques have attracted much attention because they are able to tackle a wide variety of difficult problems and frequently produce acceptable solutions. The results obtained are usually functional, often surprising, and typically "messy" because the algorithms are told to concentrate on the overriding objective and not elegance or simplicity. advantages. First, faster design cycles translate into time and, hence, cost savings. Second, automated design techniques can be made to scale well and hence better deal with increasing amounts of design complexity. Third, design quality can increase because design properties can be specified a priori. For example, size and weight specifications of a device, smaller and lighter than the best known design, might be optimized by the automated design technique. The domain of electronic circuit design is an advantageous platform in which to study automated design techniques because it is a rich design space that is well understood, permitting human-created designs to be compared to machine- generated designs. developed for circuit design was to automatically produce high-level integrated electronic circuit designs whose properties permit physical implementation in silicon. This process entailed designing an effective evolutionary algorithm and solving a difficult multiobjective optimization problem. FY 99 saw many accomplishments in this effort.

Lohn, Jason D.↗

Fast intensity-modulated arc therapy based on 2-step beam segmentation

Purpose: Single or few arc intensity-modulated arc therapy (IMAT) is intended to be a time saving irradiation method, potentially replacing classical intensity-modulated radiotherapy (IMRT). The aim of this work was to evaluate the quality of different IMAT methods with the potential of fast delivery, which also has the possibility of adapting to the daily shape of the target volume. Methods: A planning study was performed. Novel double and triple IMAT techniques based on the geometrical analysis of the target organ at risk geometry (2-step IMAT) were evaluated. They were compared to step and shoot IMRT reference plans generated using direct machine parameter optimization (DMPO). Volumetric arc (VMAT) plans from commercial preclinical software (SMARTARC) were used as an additional benchmark to classify the quality of the novel techniques. Four cases with concave planning target volumes (PTV) with one dominating organ at risk (OAR), viz., the PTV/OAR combination of the ESTRO Quasimodo phantom, breast/lung, spine metastasis/spinal cord, and prostate/rectum, were used for the study. The composite objective value (COV) and other parameters representing the plan quality were studied. Results: The novel 2-step IMAT techniques with geometry based segment definition were as good as or better than DMPO and were superior to the SMARTARC VMAT techniques. For the spine metastasis, the quality measured by the COV differed only by 3%, whereas the COV of the 2-step IMAT for the other three cases decreased by a factor of 1.4-2.4 with respect to the reference plans. Conclusions: Rotational techniques based on geometrical analysis of the optimization problem (2-step IMAT) provide similar or better plan quality than DMPO or the research version of SMARTARC VMAT variants. The results justify pursuing the goal of fast IMAT adaptation based on 2-step IMAT techniques.

60 APPLIED LIFE SCIENCES↗

Frequency Recovery in Power Grids Using High-Performance Computing

Maintaining electric power system stability is paramount, especially in extreme contingencies involving unexpected outages of multiple generators or transmission lines that are typical during severe weather events. Such outages often lead to large supply-demand mismatches followed by subsequent system frequency deviations from their nominal value. The extent of frequency deviations is an important metric of system resilience, and its timely mitigation is a central goal of power system operation and control. This paper develops a novel nonlinear model predictive control (NMPC) method to minimize frequency deviations when the grid is affected by an unforeseen loss of multiple components. Our method is based on a novel multi-period alternating current optimal power flow (ACOPF) formulation that accurately models both nonlinear electric power flow physics and the primary and secondary frequency response of generator control mechanisms. We develop a distributed parallel Julia package for solving the large-scale nonlinear optimization problems that result from our NMPC method and thereby address realistic test instances on existing high-performance computing architectures. Our method demonstrates superior performance in terms of frequency recovery over existing industry practices, where generator levels are set based on the solution of single-period classical ACOPF models.

nonlinear model predictive control↗