Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Optimization algorithms”

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,261 records · Page 70
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Near minimum-time maneuvers of large space structures using parameter optimization

Near minimum-time attitude maneuvers for large, inherently-flexible space structures with finite fuel supplies are investigated. The open loop maneuver is determined with the Sequential Quadratic Programming (SQP) algorithm, which optimizes a bang-off-bang control parameter set for the given maneuver. Torque smoothing is used to prevent discontinuities in the control which would excite the flexible structure. Additional system dynamics such as thruster inefficiency, spring forces and pressure leaks are identified from preliminary experiments on the ASTREX test article.

Carter, M. T.↗
DOE OSTI2022

Learning Optimal Multigrid Smoothers via Neural Networks

Multigrid methods are one of the most efficient techniques for solving large sparse linear systems arising from partial differential equations (PDEs) and graph Laplacians from machine learning applications. One of the key components of multigrid is smoothing, which aims at reducing high-frequency errors on each grid level. However, finding optimal smoothing algorithms is problem-dependent and can impose challenges for many problems. In this paper, we propose an efficient adaptive framework for learning optimized smoothers from operator stencils in the form of convolutional neural networks (CNNs). Here, the CNNs are trained on small-scale problems from a given type of PDEs based on a supervised loss function derived from multigrid convergence theories and can be applied to large-scale problems of the same class of PDEs. Numerical results on anisotropic rotated Laplacian problems and variable coefficient diffusion problems demonstrate improved convergence rates and solution time compared with classical hand-crafted relaxation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Harnessing Quantum Information Science for Enhancing Sensors in Harsh Fossil Energy Environments

The main goals of this project are to utilize real-time quantum dynamics simulations and quantum optimal control algorithms to (1) harness near-surface nitrogen vacancy (NV) centers to detect chemical analytes in harsh fossil energy environments, and (2) design optimally constructed electromagnetic fields for initializing these near-surface NV center spins for efficient sensor performance and detectivity.

20 FOSSIL-FUELED POWER PLANTS↗
NASA NTRS1999

Energetic Neutral Atom Imaging at Low Altitudes from the Swedish Microsatellite Astrid: Extraction of the Equatorial Ion Distribution

Energetic neutral atom (ENA) images obtained by the ENA imager on- board the Astrid satellite in the polar cap at 1000 km during a moderate magnetic storm (Dst greater than or equal to 80 nT) on 8 February 1995 are simulated using a parameterized model of the equatorial ion distribution and a six-component Chamberlain exo-sphere with parameters from the MSISE-90 model. By changing the ion parameters until a matching ENA image is obtained one can extract the equatorial ion distribution. Four consecutive images from different view points several of minutes apart are simulated assuming H(+) and O(+), respectively, as parent ions. The optimal set of parameters is extracted by minimizing the chi(exp 2) difference between simulated and observed ENA image using Powell's minimization algorithm. The optimal equatorial model ion distribution consists of O(+) peaked in around dusk. The lower intensity of fluxes obtained from vantage points closer to the pole is an effect of the loss cone of the parent ion distribution being empty.

Brandt, Pontus C:son↗
NASA NTRSDate not supplied

Efficient Global Optimization with Gradient Finish for Design Under Uncertainty

The Efficient Global Optimization (EGO) algorithm is extended to include a gradient-descent-based finish upon reaching a threshold value of the expected improvement function. Emphasis is placed on efficient evaluation of local gradients using Kriging models during the gradient-based finish to enable application to design under uncertainty (DUU) problems. The modified algorithm is applied to both the well-known Rosenbrock function and a more challenging hypersonic inlet design under uncertainty problem. Results demonstrate improvement in locating the global optimum compared to the classical implementation of EGO, as well as a reduced number of true function evaluations compared to pure gradient-based algorithms. For the Rosenbrock function, a global optimum is returned using an average of 12% fewer function calls than a gradient-based optimizer with comparable tolerances. For the design under uncertainty problem, a global optimum is found using an average of 75% fewer function calls than a gradient-based optimizer. Global Pareto fronts of multiobjective DUU problems are obtained at little additional cost after a single optimization is complete.

Optimization↗
NASA NTRS1985

Time optimal robotic manipulator motions and work places for point to point tasks

High productivity requires that manipulators perform complex tasks quickly. Recently, optimal control algorithms have been developed which enable manipulators to move quickly, but only for simple motions. A method is presented here which combines simple time optimal motions in an optimal manner to yield the minimum time motions for an important class of complex manipulator tasks composed of point to point moves, such as assembly, electronic component insertion and spot welding. This method can also be used to design manipulator actions and work places so that tasks can be completd in minimum time. The method has been implemented in a CAD software package. Examples are presented which show the methods effectiveness.

Dubowsky, S.↗
NASA NTRSDate not supplied

Supervisory On-line Optimal Control of an Electric Power Microgrid Design for Lunar Habitation

The following article describes an optimal control algorithm for the operation and study of an electric microgrid designed to power a lunar habitat. A photovoltaic (PV) generator powers the habitat and the presence of predictable lunar eclipses necessitates a system to prioritize and control loads within the microgrid. The algorithm consists of a reduced order model (ROM) that describes the microgrid, a discretization of the equations that result from the ROM, and an optimization formulation that controls the microgrid’s behavior. In order to validate this approach, the paper presents results from simulation based on lunar eclipse information and a schedule of intended loads.

Joseph Young↗
DOE OSTI2022

Numerical gate synthesis for quantum heuristics on bosonic quantum processors

There is a recent surge of interest and insights regarding the interplay of quantum optimal control and variational quantum algorithms. We study the framework in the context of qudits which are, for instance, definable as controllable electromagnetic modes of a superconducting cavity system coupled to a transmon. By employing recent quantum optimal control approaches described in (Petersson and Garcia, 2021), we showcase control of single-qudit operations up to eight states, and two-qutrit operations, mapped respectively onto a single mode and two modes of the resonator. We discuss the results of numerical pulse engineering on the closed system for parametrized gates useful to implement Quantum Approximate Optimization Algorithm (QAOA) for qudits. The results show that high fidelity ( > 0.99) is achievable with sufficient computational effort for most cases under study, and extensions to multiple modes and open, noisy systems are possible. The tailored pulses can be stored and used as calibrated primitives for a future compiler in circuit quantum electrodynamics (cQED) systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Noise-Induced Transition in Optimal Solutions of Variational Quantum Algorithms

Variational quantum algorithms are widely considered a promising class of near-team algorithms that may demonstrate a practical quantum advantage in problems of scientific interest. One of the major obstacles to a scalable realization is the difficulty in optimizing the noisy cost function.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Optimizing Perovskite Thin‐Film Parameter Spaces with Machine Learning‐Guided Robotic Platform for High‐Performance Perovskite Solar Cells

Abstract Simultaneously optimizing the processing parameters of functional thin films remains a challenge. The design and utilization of a fully automated platform called SPINBOT is presented for the engineering of solution‐processed functional thin films. The SPINBOT is capable of performing experiments with high sampling variability through the unsupervised processing of hundreds of substrates with exceptional experimental control. Through the iterative optimization process enabled by the Bayesian optimization (BO) algorithm, the SPINBOT explores an intricate parameter space, continuously improving the quality and reproducibility of the produced thin films. This machine learning (ML)‐guided reliable SPINBOT platform enables the acceleration of the optimization process of perovskite solar cells via a simple photoluminescence characterization of films. As a result, this study arrives at an optimal film that, when processed into a solar cell in an ambient atmosphere, immediately yields a champion power conversion efficiency (PCE) of 21.6% with satisfactory performance reproducibility. The unsealed devices retain 90% of their initial efficiency after 1100 h of continuous operation at 60–65 °C under metal‐halide lamps. It is anticipated that the integration of robotic platforms with the intelligent algorithm will facilitate the widespread adoption of effective autonomous experimentation to address the evolving needs and constraints within the materials science research community.

14 SOLAR ENERGY↗
DOE OSTI2021

Searching for Dwarf Galaxies in Gaia DR2 Phase-space Data Using Wavelet Transforms

We present a wavelet-based algorithm to identify dwarf galaxies in the Milky Way in Gaia DR2 data. Our algorithm detects overdensities in 4D position–proper-motion space, making it the first search to explicitly use velocity information to search for dwarf galaxy candidates. We optimize our algorithm and quantify its performance by searching for mock dwarfs injected into Gaia DR2 data and for known Milky Way satellite galaxies. Comparing our results with previous photometric searches, we find that our search is sensitive to undiscovered systems at Galactic latitudes |b| > 20° and with half-light radii larger than the 50% detection efficiency threshold for Pan-STARRS1 (PS1) at (i) absolute magnitudes of –7 < M V < –3 and distances of 32 kpc < D < 64 kpc, and (ii) M V < –4 and 64 kpc < D < 128 kpc. Based on these results, we predict that our search is expected to discover 5 ± 2 new satellite galaxies: four in the PS1 footprint and one outside the Dark Energy Survey and PS1 footprints. We apply our algorithm to the Gaia DR2 data set and recover ~830 high-significance candidates, out of which we identify a "gold standard" list of ~200 candidates based on cross-matching with potential candidates identified in a preliminary search using Gaia EDR3 data. All of our candidate lists are publicly distributed for future follow-up studies. Here, we show that improvements in astrometric measurements provided by Gaia EDR3 increase the sensitivity of this technique; we plan to continue to refine our candidate list using future data releases.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1994

Large-Scale Numerical Simulations of Human Motion

This paper examines the feasibility of using massively-parallel and vector-processing supercomputers to solve large-scale optimal control problems for human movement. Specifically, we compare the computational expense of determining the optimal controls for the single support phase of walking using a conventional serial machine (a Silicon Graphics Personal Iris 4D25 workstation), a MIMD parallel machine (an Intel iPSC/860 comprising 128 processors), and a parallel-vector-processing machine (a Cray Y-MP 8/864). With the human body modeled as a 14 degree-of-freedom linkage actuated by 46 musculotendinous units, computation of the optimal controls for walking could take up to 3 months of CPU time on the Iris. Both the Cray Y-MP and the Intel iPSC/860 are able to reduce this time to practical levels. The optimal control solution for walking can be found with about 77 hours of CPU time on the Cray, and with about 88 hours of CPU time on the Intel. Although the overall speeds of the Cray and the Intel were found to be similar, the unique capabilities of each machine are best suited to different parts of the optimal control algorithm used. The Intel performed best in the calculation of the derivatives of the performance criterion and the constraints. In contrast, the Cray performed best during parameter optimization of the controls. These results suggest that the ideal computer architecture for solving very large-scale optimal control problems is a hybrid system in which a vector-processing machine is integrated into the communication network of a MIMD parallel machine.

Anderson, Frank C.↗
NASA NTRS2000

Optimization of Microelectronic Devices for Sensor Applications

The NASA/JPL goal to reduce payload in future space missions while increasing mission capability demands miniaturization of active and passive sensors, analytical instruments and communication systems among others. Currently, typical system requirements include the detection of particular spectral lines, associated data processing, and communication of the acquired data to other systems. Advances in lithography and deposition methods result in more advanced devices for space application, while the sub-micron resolution currently available opens a vast design space. Though an experimental exploration of this widening design space-searching for optimized performance by repeated fabrication efforts-is unfeasible, it does motivate the development of reliable software design tools. These tools necessitate models based on fundamental physics and mathematics of the device to accurately model effects such as diffraction and scattering in opto-electronic devices, or bandstructure and scattering in heterostructure devices. The software tools must have convenient turn-around times and interfaces that allow effective usage. The first issue is addressed by the application of high-performance computers and the second by the development of graphical user interfaces driven by properly developed data structures. These tools can then be integrated into an optimization environment, and with the available memory capacity and computational speed of high performance parallel platforms, simulation of optimized components can proceed. In this paper, specific applications of the electromagnetic modeling of infrared filtering, as well as heterostructure device design will be presented using genetic algorithm global optimization methods.

Cwik, Tom↗
NASA NTRS2005

Development and Application of Non-Linear Image Enhancement and Multi-Sensor Fusion Techniques for Hazy and Dark Imaging

The purpose of this research was to develop enhancement and multi-sensor fusion algorithms and techniques to make it safer for the pilot to fly in what would normally be considered Instrument Flight Rules (IFR) conditions, where pilot visibility is severely restricted due to fog, haze or other weather phenomenon. We proposed to use the non-linear Multiscale Retinex (MSR) as the basic driver for developing an integrated enhancement and fusion engine. When we started this research, the MSR was being applied primarily to grayscale imagery such as medical images, or to three-band color imagery, such as that produced in consumer photography: it was not, however, being applied to other imagery such as that produced by infrared image sources. However, we felt that it was possible by using the MSR algorithm in conjunction with multiple imaging modalities such as long-wave infrared (LWIR), short-wave infrared (SWIR), and visible spectrum (VIS), we could substantially improve over the then state-of-the-art enhancement algorithms, especially in poor visibility conditions. We proposed the following tasks: 1) Investigate the effects of applying the MSR to LWIR and SWIR images. This consisted of optimizing the algorithm in terms of surround scales, and weights for these spectral bands; 2) Fusing the LWIR and SWIR images with the VIS images using the MSR framework to determine the best possible representation of the desired features; 3) Evaluating different mixes of LWIR, SWIR and VIS bands for maximum fog and haze reduction, and low light level compensation; 4) Modifying the existing algorithms to work with video sequences. Over the course of the 3 year research period, we were able to accomplish these tasks and report on them at various internal presentations at NASA Langley Research Center, and in presentations and publications elsewhere. A description of the work performed under the tasks is provided in Section 2. The complete list of relevant publications during the research periods is provided in Section 5. This research also resulted in the generation of intellectual property.

Rahman, Zia-ur↗
DOE OSTI2022

A review of non-cognitive applications for neuromorphic computing

Abstract Though neuromorphic computers have typically targeted applications in machine learning and neuroscience (‘cognitive’ applications), they have many computational characteristics that are attractive for a wide variety of computational problems. In this work, we review the current state-of-the-art for non-cognitive applications on neuromorphic computers, including simple computational kernels for composition, graph algorithms, constrained optimization, and signal processing. We discuss the advantages of using neuromorphic computers for these different applications, as well as the challenges that still remain. The ultimate goal of this work is to bring awareness to this class of problems for neuromorphic systems to the broader community, particularly to encourage further work in this area and to make sure that these applications are considered in the design of future neuromorphic systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control

Here, we study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domain into a set of overlapping subdomains, and solves all subproblems defined over subdomains in parallel. The convergence is attained by updating primal-dual information at the boundaries of overlapping subdomains. We show that the algorithm exhibits local linear convergence, and that the convergence rate improves exponentially with the overlap size. We also establish global convergence results for a general quadratic programming, which enables the application of the Schwarz scheme inside second-order optimization algorithms (e.g., sequential quadratic programming). The theoretical foundation of our convergence analysis is a sensitivity result of nonlinear OCPs, which we call "exponential decay of sensitivity" (EDS). Intuitively, EDS states that the impact of perturbations at domain boundaries (i.e., initial and terminal time) on the solution decays exponentially as one moves into the domain. Here, we expand a previous analysis available in the literature by showing that EDS holds for both primal and dual solutions of nonlinear OCPs, under uniform second-order sufficient condition, controllability condition, and boundedness condition. We conduct experiments with a quadrotor motion planning problem and a partial differential equations (PDE) control problem to validate our theory, and show that the approach is significantly more efficient than alternating direction method of multipliers and as efficient as the centralized interior-point solver.

42 ENGINEERING↗