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 955 records · Page 53

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↗

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↗

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↗

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↗

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↗

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↗

Model-predictive optimal control of ferrofluidic microrobots in three-dimensional space

Ferrofluid microrobots have emerged as promising tools for minimally invasive medical procedures. Their unique properties to navigate complex fluids and reach otherwise inaccessible regions of the human body have enabled new applications in targeted drug delivery, tissue engineering, and diagnostics. Here, this paper proposes a model-predictive controller for the external magnetic manipulation of ferrofluid microrobots in three dimensions (3D). The internal optimization routine of the controller determines appropriate changes in the applied electromagnetic field to minimize the deviation between the actual and desired trajectories of the microrobot. A linear system governing locomotion is derived and used as the equality constraints of the optimization problems associated with the feedback index. In addition to ferrofluid droplets, the controller presented in this work may be applied to other magnetically-pulled microrobots. Several experiments are performed to validate the controller and showcase its ability to adapt to changes in system parameters such as the desired tracking trajectory and the size, orientation, deformation, and velocity of the microrobot. The accuracy of the controller is analyzed for each experiment, and the average error is found to be within 0.25 mm for small velocities. An additional experiment is performed to demonstrate significant improvement over a PID controller that is optimally tuned using Bayesian optimization. The results presented in this paper suggest that the proposed control algorithm could enable new microrobotic capabilities in minimally invasive medical procedures, lab-on-a-chip applications, and microfluidics.

60 APPLIED LIFE SCIENCES↗

Recent progress of quantum annealing

We review the recent progress of quantum annealing. Quantum annealing was proposed as a method to solve generic optimization problems. Recently a Canadian company has drawn a great deal of attention, as it has commercialized a quantum computer based on quantum annealing. Although the performance of quantum annealing is not sufficiently understood, it is likely that quantum annealing will be a practical method both on a conventional computer and on a quantum computer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route toward a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted-sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting-qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges—relevant to signed, unsigned, modular and non-modular versions—that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.

Computational models↗

WE-FG-207B-05: Iterative Reconstruction Via Prior Image Constrained Total Generalized Variation for Spectral CT

Purpose: To investigate iterative reconstruction via prior image constrained total generalized variation (PICTGV) for spectral computed tomography (CT) using fewer projections while achieving greater image quality. Methods: The proposed PICTGV method is formulated as an optimization problem, which balances the data fidelity and prior image constrained total generalized variation of reconstructed images in one framework. The PICTGV method is based on structure correlations among images in the energy domain and high-quality images to guide the reconstruction of energy-specific images. In PICTGV method, the high-quality image is reconstructed from all detector-collected X-ray signals and is referred as the broad-spectrum image. Distinct from the existing reconstruction methods applied on the images with first order derivative, the higher order derivative of the images is incorporated into the PICTGV method. An alternating optimization algorithm is used to minimize the PICTGV objective function. We evaluate the performance of PICTGV on noise and artifacts suppressing using phantom studies and compare the method with the conventional filtered back-projection method as well as TGV based method without prior image. Results: On the digital phantom, the proposed method outperforms the existing TGV method in terms of the noise reduction, artifacts suppression, and edge detail preservation. Compared to that obtained by the TGV based method without prior image, the relative root mean square error in the images reconstructed by the proposed method is reduced by over 20%. Conclusion: The authors propose an iterative reconstruction via prior image constrained total generalize variation for spectral CT. Also, we have developed an alternating optimization algorithm and numerically demonstrated the merits of our approach. Results show that the proposed PICTGV method outperforms the TGV method for spectral CT.

60 APPLIED LIFE SCIENCES↗

The Target-Matrix Optimization Paradigm for High-Order Meshes

Here, we describe a framework for controlling and improving the quality of high-order finite element meshes based on extensions of the Target-Matrix Optimization Paradigm (TMOP) of [P. Knupp, Eng. Comput., 28 (2012), pp. 419--429]. This approach allows high-order applications to have a very precise control over local mesh quality, while still improving the mesh globally. We address the adaption of various TMOP components to the settings of general isoparametric element mappings, including the mesh quality metric in 2D and 3D, the selection of sample points and the solution of the resulting mesh optimization problem. We also investigate additional practical concerns, such as tangential relaxation and restricting the deviation from the original mesh. The benefits of the new high-order TMOP algorithms are illustrated on a number of test problems and examples from a high-order arbitrary Lagrangian--Eulerian (ALE) application [BLAST: High-order curvilinear finite elements for shock hydrodynamics, http://www.llnl.gov/CASC/blast]. Our implementation is freely available in an open-source library form [MFEM: Modular parallel finite element methods library, http://mfem.org].

97 MATHEMATICS AND COMPUTING↗

Higher-order factorization machine for accurate surrogate modeling in material design

Efficient and robust optimization is important in material science for identifying optimal structural parameters and enhancing material performance. Surrogate-based active learning algorithms have recently gained great attention for their ability to efficiently navigate large, high-dimensional design spaces. Among surrogate models, 2 nd -order factorization machine (FM) models are widely employed as the surrogate model in active learning algorithms due to their balance between simplicity and effectiveness. However, their quadratic nature limits their capacity to capture complex, higher-order interactions among variables, often leading to suboptimal solutions. To overcome this limitation, we propose an active learning scheme integrating a 3 rd -order FM model, capable of modeling three-variable interactions and more intricate relationships in material systems. We comprehensively evaluate the surrogate modeling performance of the 3 rd -order FM case using various objective functions. Furthermore, we examine the optimization reliability and efficiency of the 3 rd -order FM-based active learning in a real-world material design task (e.g., nanophotonic structures for transparent radiative cooling). Our study shows that the 3 rd -order FM outperforms the 2 nd -order model in both surrogate accuracy and optimization performance, highlighting higher-order models’ promises for material design and optimization problems.

Factorization machine↗

Identifying finite-time coherent sets from limited quantities of Lagrangian data

A data-driven procedure for identifying the dominant transport barriers in a time-varying flow from limited quantities of Lagrangian data is presented. Our approach partitions state space into coherent pairs, which are sets of initial conditions chosen to minimize the number of trajectories that “leak” from one set to the other under the influence of a stochastic flow field during a pre-specified interval in time. In practice, this partition is computed by solving an optimization problem to obtain a pair of functions whose signs determine set membership. From prior experience with synthetic, “data rich” test problems, and conceptually related methods based on approximations of the Perron-Frobenius operator, we observe that the functions of interest typically appear to be smooth. We exploit this property by using the basis sets associated with spectral or “mesh-free” methods, and as a result, our approach has the potential to more accurately approximate these functions given a fixed amount of data. In practice, this could enable better approximations of the coherent pairs in problems with relatively limited quantities of Lagrangian data, which is usually the case with experimental geophysical data. We apply this method to three examples of increasing complexity: The first is the double gyre, the second is the Bickley Jet, and the third is data from numerically simulated drifters in the Sulu Sea.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Modulation and DM Filter Design for a High Switching Frequency Single-Stage Microinverter

This paper presents an optimal modulation and systematic filter design approach for a single-stage dual-active-bridge (DAB) based dc-ac microinverter to achieve improved differential-mode (DM) noise performance for electromagnetic interference (EMI) tests. As DM filters contribute significantly to the overall converter volume, the main objective of this work is to leverage the degrees of freedom in the DAB converters to effectively attenuate the EMI noise. In addition, the DM filter design method needs to ensure near unity power factor converter operation. To achieve these targets, this paper analyzes three modulation strategies based on fixed or variable switching frequency operation where the different control modulation variables are varied to find the simulated DM noise spectrum. Based on the required DM attenuation, a constrained optimization problem is formulated to determine minimal DM filter parameters. Simulation results show that a spread spectrum approach with variable switching frequency is shown to minimize the DM EMI attenuation effort by spreading the noise profile. A fully GaN 400 W hardware prototype demonstrated the spread-sprectrum approach.

14 SOLAR ENERGY↗