Search NASA⌕ Search

SEARCH · Search NASA

Results for “physical 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 829 records · Page 46

Nonlinear controller for nonlinear wave energy converters

The present invention is directed to a nonlinear controller for nonlinear wave energy converters (WECs). As an example of the invention, a nonlinear dynamic model is developed for a geometrically right-circular cylinder WEC design for the heave-only motion, or a single degree-of-freedom (DOF). The linear stiffness term is replaced by a nonlinear cubic hardening spring term to demonstrate the performance of a nonlinear WEC as compared to an optimized linear WEC. By exploiting the nonlinear physics in the nonlinear controller, equivalent power and energy capture, as well as simplified operational performance is observed for the nonlinear cubic hardening spring controller when compared to an optimized linear controller.

Wilson, David G.↗

Automated Adversary-in-the-Loop Cyber-Physical Defense Planning

Security of cyber-physical systems (CPS) continues to pose new challenges due to the tight integration and operational complexity of the cyber and physical components. To address these challenges, this article presents a domain-aware, optimization-based approach to determine an effective defense strategy for CPS in an automated fashion—by emulating a strategic adversary in the loop that exploits system vulnerabilities, interconnection of the CPS, and the dynamics of the physical components. Our approach builds on an adversarial decision-making model based on a Markov Decision Process (MDP) that determines the optimal cyber (discrete) and physical (continuous) attack actions over a CPS attack graph. The defense planning problem is modeled as a non-zero-sum game between the adversary and defender. We use a model-free reinforcement learning method to solve the adversary’s problem as a function of the defense strategy. We then employ Bayesian optimization (BO) to find an approximate best-response for the defender to harden the network against the resulting adversary policy. This process is iterated multiple times to improve the strategy for both players. We demonstrate the effectiveness of our approach on a ransomware-inspired graph with a smart building system as the physical process. Numerical studies show that our method converges to a Nash equilibrium for various defender-specific costs of network hardening.

97 MATHEMATICS AND COMPUTING↗

Descriptor Aided Bayesian Optimization for Many-Level Qualitative Variables With Materials Design Applications

Abstract Engineering design often involves qualitative and quantitative design variables, which requires systematic methods for the exploration of these mixed-variable design spaces. Expensive simulation techniques, such as those required to evaluate optimization objectives in materials design applications, constitute the main portion of the cost of the design process and underline the need for efficient search strategies—Bayesian optimization (BO) being one of the most widely adopted. Although recent developments in mixed-variable Bayesian optimization have shown promise, the effects of dimensionality of qualitative variables have not been well studied. High-dimensional qualitative variables, i.e., with many levels, impose a large design cost as they typically require a larger dataset to quantify the effect of each level on the optimization objective. We address this challenge by leveraging domain knowledge about underlying physical descriptors, which embody the physics of the underlying physical phenomena, to infer the effect of unobserved levels that have not been sampled yet. We show that physical descriptors can be intuitively embedded into the latent variable Gaussian process approach—a mixed-variable GP modeling technique—and used to selectively explore levels of qualitative variables in the Bayesian optimization framework. This physics-informed approach is particularly useful when one or more qualitative variables are high dimensional (many-level) and the modeling dataset is small, containing observations for only a subset of levels. Through a combination of mathematical test functions and materials design applications, our method is shown to be robust to certain types of incomplete domain knowledge and significantly reduces the design cost for problems with high-dimensional qualitative variables.

Engineering↗

The Road to the Higgs in $p\bar{p}$ collisions at $\sqrt{s}$= 1.96 TeV

Presented is a series of analyses which are central to the search for a low-mass Higgs boson. A search for $ZZ$ production in the $ZZ\rightarrow\ell^{}\ell^{+}\nu\bar{\nu}$ channel is introduced then the successful combination of this analysis with with the $ZZ\rightarrow\ell^+\ell^-\ell'^+\ell'^-$ search to produce the first observation of the $ZZ$ process at a hadron collider is then detailed. The final analysis presented is the search for the Higgs in the $ZH\rightarrow\nu\bar{\nu}b\bar{b}$ channel and the interpretation as a $ZZ\rightarrow\nu\bar{\nu}b\bar{b}$ search in order to validate the techniques. Common themes are discussed, such as multivariate techniques and instrumental backgrounds from energy measurement fluctuations and the tools used to combat them. The formalism of the statistical analysis of the final selected sample is introduced generally and demonstrated in the context of the above mentioned searches. The optimization of the selection through the identification of poorly reconstructed leptons is included as well as the utilization of b-quark identifying tools. Some space is given to jet reconstruction/identification and the Level 1 Calorimeter Trigger. The efficient identification and calibration of jets is central to many physics analysis especially in the low mass higgs search. Another key component of the $ZH\rightarrow\nu\bar{\nu}b\bar{b}$ search is the proficient identification of jets and an imbalance of transverse energy in the first level of the triggering system. Therefore, the Level 1 Calorimeter Trigger, designed to achieve this, is a necessary component for a sensitive $ZH\rightarrow\nu\bar{\nu}b\bar{b}$ search.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Overview of Security and Privacy in Cyber-Physical Systems

Cyber-physical systems (CPS) are used across domains to enable process optimization and previously unachievable functionality. The combination of networked digital systems and analog physical processes creates unique characteristics that change how security theory is applied. Neither cyber nor physical security concepts alone can protect CPS because the crossover effects can introduce unexpected vulnerabilities. Physical attacks may allow access to critical assets resulting in damage or compromise of information being processed by the device, while cyber attacks may cause physical malfunctions resulting in real-world consequences. Therefore, security and privacy are key concerns for CPS design, development, and operation. In this chapter, we discuss how CPS security and privacy differ from that of pure cyber or physical systems and what may be done to secure these systems. Our goal is to help designers of emerging CPS to build more secure, privacy-enhanced products in the future.

Cyber-physical systems, security, privacy↗

Dynamic calibration of differential equations using machine learning, with application to turbulence models

We present a methodology for calibration of parametric ordinary and partial differential equation models, using off-the-shelf software for back-propagation in Neural Networks (NN). As a prototypical example, we consider calibration of a Reynolds-averaged Navier-Stokes (RANS) turbulence closure model, against ground truth data from direct numerical simulations (DNS) of two different turbulent flows. Numerical time integration is represented as a custom NN, where only the RANS model parameters are trainable. A loss function is defined to quantify the mismatch between the NN prediction and the ground truth over a predefined, finite time integration window. This loss function is then minimized using a gradient descent method utilizing the back-propagation algorithm. Furthermore, this dynamic approach to training is to be contrasted with a static approach, wherein a least square regression estimate for parameters is obtained in the limit of an infinitesimal time integration window. In a first test of static and dynamic approaches against ground truth data generated by the model, the former proves to be significantly faster and more accurate than the latter at recovering the parameters. When both calibration approaches are tested against DNS data, for which it is known that the model cannot achieve a perfect fit, the static approach yields a good prediction only for short times, while the dynamic approach results in physical and stable predictions over the entire integration window. After optimization of the dynamic approach for time step, spatial resolution, stability, and physics-based constraints, we obtain a 50% improvement of outcomes over those obtained from the existing, manually calibrated set of parameters, demonstrating the merits of this systematic and automated procedure.

97 MATHEMATICS AND COMPUTING↗

A two-dimensional numerical study of the magneto-Rayleigh–Taylor instability with FLASH: Application to the staged Z-pinch concept

Magnetically driven implosions involving a liner collapsing onto a target are inherently vulnerable to the magneto-Rayleigh–Taylor instability (MRTI). Among the various approaches proposed to achieve fusion conditions within the target, the staged Z-pinch (SZP) concept employs a high-Z liner, the advantages of which remain an active area of investigation. Consequently, ongoing design optimization efforts are essential, while critical physical processes such as magnetic field (B-field) diffusion and radiation transport increase the complexity of required simulations. In this study, we utilize the new capabilities of the FLASH code to simulate in 2D, for the first time using this code, staged Z-pinch configurations (designated SZP1 and SZP1*), focusing on their stability. First, a comparison of simulation results with theoretical predictions of MRTI growth provide new insights into the often-overlooked influences of high mesh resolution and initial perturbation seeding on instability dynamics. These findings then lead to a discussion on potential improvements for future SZP experiments. These include the use of an axial B-field stabilization and the optimization of radiation transport processes during the implosion. The results presented herein establish the framework for simulating multi-dimensional Z pinches using the FLASH code and pave the way for the development of innovative experimental configurations leveraging its advanced simulation capabilities.

Adaptive mesh refinement↗

Optimizing for an arbitrary perfect entangler. II. Application

The difficulty of an optimization task in quantum information science depends on the proper mathematical expression of the physical target. In this paper we demonstrate the power of optimization functionals targeting an arbitrary perfect two-qubit entangler, which allow generation of a maximally entangled state from some initial product state. We show for two quantum information platforms of current interest, i.e., nitrogen vacancy centers in diamond and superconducting Josephson junctions, that an arbitrary perfect entangler can be reached faster and with higher fidelity than both specific two-qubit gates and local equivalence classes of two-qubit gates. Our results are obtained using two independent optimization approaches, underscoring the critical role of the optimization target.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Control of a Degenerate PDE for Surface Shape

Controlling the shapes of surfaces provides a novel way to direct self-assembly of colloidal particles on those surfaces and may be useful for material design. This motivates the investigation of an optimal control problem for surface shape in this paper. Specifically, we consider an objective (tracking) functional for surface shape with the prescribed mean curvature equation in graph form as a state constraint. The control variable is the prescribed curvature. We prove existence of an optimal control, and using improved regularity estimates, we show sufficient differentiability to make sense of the first order optimality conditions. This allows us to rigorously compute the gradient of the objective functional for both the continuous and discrete (finite element) formulations of the problem. Numerical results are shown to illustrate the minimizers and optimal controls on different domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A multitree approach for global solution of ACOPF problems using piecewise outer approximations

Electricity markets rely on the rapid solution of the optimal power flow (OPF) problem to determine generator power levels and set nodal prices. Traditionally, the OPF problem has been formulated using linearized, approximate models, ignoring nonlinear alternating current (AC) physics. These approaches do not guarantee global optimality or even feasibility in the real ACOPF problem. We introduce an outer-approximation approach to solve the ACOPF problem to global optimality based on alternating solution of upper- and lower-bounding problems. The lower-bounding problem is a piecewise relaxation based on strong second-order cone relaxations of the ACOPF, and these piecewise relaxations are selectively refined at each major iteration through increased variable domain partitioning. Our approach is able to efficiently solve all but one of the test cases considered to an optimality gap below 0.1%. This approach opens the door for global solution of MINLP problems with AC power flow equations.

42 ENGINEERING↗

Online Robot Dead Reckoning Localization Using Maximum Relative Entropy Optimization With Model Constraints

The principle of Maximum relative Entropy optimization was analyzed for dead reckoning localization of a rigid body when observation data of two attached accelerometers was collected. Model constraints were derived from the relationships between the sensors. The experiment's results confirmed that accelerometers each axis' noise can be successfully filtered utilizing dependency between channels and the dependency between time series data. Dependency between channels was used for a priori calculation, and a posteriori distribution was derived utilizing dependency between time series data. There was revisited data of autocalibration experiment by removing the initial assumption that instantaneous rotation axis of a rigid body was known. Performance results confirmed that such an approach could be used for online dead reckoning localization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enabling Real-time Scattering Data Analysis with Scalable Optimization [Slides]

Diffraction experiments produce datasets with rich multidimensional physics information such as microstructure, equations of state, crystal structure, elastoplastic properties, and other key inputs to LANL mission-essential multiphysics models. This information is typically extracted through a process called Rietveld refinement, which involves selecting appropriate models of the instrument, crystal structure, and microstructure, identifying suitable starting values, and then fitting often hundreds of model parameters using a sequence of empirical parameter turnon/off sequences within a non-global gradient-based optimization. Extensive user expertise is required to properly setup a refinement, identify appropriate models, and select initial parameter values close to truth, such that the refinement will yield parameter values that are optimally predictive. This is a very tedious manual process performed far after the beamline campaign has ended. As facilities have become capable of generating larger volumes of data, the limitation in throughput due to Rietveld refinement has led to a dramatic increase in unanalyzed data as opposed to an intended increase in new science. In our FY22 TED, we demonstrated an integrated toolset providing near real-time automated Rietveld analysis. If this toolset can be optimized to provide automated Rietveld analysis in real-time, this could alleviate the bottleneck in unanalyzed diffraction data, aid in decision-making during experiments, and increase efficiency of the facility.

74 ATOMIC AND MOLECULAR PHYSICS↗

Atmospheric Emitted Radiance Interferometer Optimal Estimation (AERIoe) Value-Added Product Report

The Atmospheric Emitted Radiance Interferometer (AERI) Optimal Estimation (AERIoe) algorithm (Turner and Löhnert 2014, Turner and Blumberg 2019) retrieves boundary-layer profiles of temperature and water vapor mixing ratio, together with cloud properties for a single-layer cloud (i.e., LWP, effective radius), from AERI-observed infrared radiance spectra and other measurements. The current AERIoe Value-Added Product (VAP) uses version 2.8 of David Turner's code, which uses additional inputs to constrain the retrieval including surface meteorology, microwave radiometer brightness temperatures at any number of frequencies (the U.S. Department of Energy Atmospheric Radiation Measurement [ARM] user facility typically used observations at 23.8 and 30.0 GHz), and Rapid Refresh numerical weather prediction model output. The method is a physical iterative retrieval that uses the optimal estimation framework (Rodgers 2000), so a full error covariance of the solution and the information content (in the form of degrees of freedom for signal) is provided for each retrieval.

54 ENVIRONMENTAL SCIENCES↗

HPC4Mfg with Carbon Inc.

Continuous Liquid Interface Production (CLIP) is poised to bring additive manufacturing to multiple American manufacturing sectors owing to its unique combination of rapid print speeds and material options that resemble injection molding thermoplastics. In spite of these benefits, CLIP is still a maturing process. To improve our understanding and control of the process, this project developed a multi-physics computational model that encompasses the coupled chemical-physical processes of photopolymerization and fluid flow to predict part outcomes. A physically predictive model can enable rapid optimization of CLIP and reduce the current cycle time and waste associated with optimization by four-fold. Ultimately, this effort will help open the U.S. $400B plastic manufacturing industry to the key benefits of additive manufacturing, namely mass customization, unlimited design space, and a cost- and energy-effective path to mainstream manufacturing. In the course of the project we produced a model which coupled fluid-flow, species transport, and photochemistry to model the Carbon CLIP process. As the development proceeded, we validated the code against theory and experiments. The resulting code was transferred to Carbon, and we expect it to be a useful part of their modeling capability. Future work includes improvements to the fluid solver’s robustness and performance, along with the addition of additional physics models.

42 ENGINEERING↗

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗

Passive stabilization for large space systems

The optimal tuning of multiple tuned-mass dampers for the transient vibration damping of large space structures is investigated. A multidisciplinary approach is used. Structural dynamic techniques are applied to gain physical insight into absorber/structure interaction and to optimize specific cases. Modern control theory and parameter optimization techniques are applied to the general optimization problem. A design procedure for multi-absorber multi-DOF vibration damping problems is presented. Classical dynamic models are extended to investigate the effects of absorber placement, existing structural damping, and absorber cross-coupling on the optimal design synthesis. The control design process for the general optimization problem is formulated as a linear output feedback control problem via the development of a feedback control canonical form. The techniques are applied to sample micro-g and pointing problems on the NASA dual keel space station.

Sesak, J. R.↗

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗