Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimized”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Fuzzy set applications in engineering optimization: Multilevel fuzzy optimization

A formulation for multilevel optimization with fuzzy objective functions is presented. With few exceptions, formulations for fuzzy optimization have dealt with a one-level problem in which the objective is the membership function of a fuzzy set formed by the fuzzy intersection of other sets. In the problem examined here, the goal set G is defined in a more general way, using an aggregation operator H that allows arbitrary combinations of set operations (union, intersection, addition) on the individual sets Gi. This is a straightforward extension of the standard form, but one that makes possible the modeling of interesting evaluation strategies. A second, more important departure from the standard form will be the construction of a multilevel problem analogous to the design decomposition problem in optimization. This arrangement facilitates the simulation of a system design process in which different components of the system are designed by different teams, and different levels of design detail become relevant at different time stages in the process: global design features early, local features later in the process.

Diaz, Alejandro R.↗
NASA NTRS1991

Supercomputer optimizations for stochastic optimal control applications

Supercomputer optimizations for a computational method of solving stochastic, multibody, dynamic programming problems are presented. The computational method is valid for a general class of optimal control problems that are nonlinear, multibody dynamical systems, perturbed by general Markov noise in continuous time, i.e., nonsmooth Gaussian as well as jump Poisson random white noise. Optimization techniques for vector multiprocessors or vectorizing supercomputers include advanced data structures, loop restructuring, loop collapsing, blocking, and compiler directives. These advanced computing techniques and superconducting hardware help alleviate Bellman's curse of dimensionality in dynamic programming computations, by permitting the solution of large multibody problems. Possible applications include lumped flight dynamics models for uncertain environments, such as large scale and background random aerospace fluctuations.

Chung, Siu-Leung↗
NASA NTRS1991

Polynomial optimization techniques for activity scheduling. Optimization based prototype scheduler

Polynomial optimization techniques for activity scheduling (optimization based prototype scheduler) are presented in the form of the viewgraphs. The following subject areas are covered: agenda; need and viability of polynomial time techniques for SNC (Space Network Control); an intrinsic characteristic of SN scheduling problem; expected characteristics of the schedule; optimization based scheduling approach; single resource algorithms; decomposition of multiple resource problems; prototype capabilities, characteristics, and test results; computational characteristics; some features of prototyped algorithms; and some related GSFC references.

Reddy, Surender↗
NASA NTRS1992

Structural optimization of large structural systems by optimality criteria methods

The fundamental concepts of the optimality criteria method of structural optimization are presented. The effect of the separability properties of the objective and constraint functions on the optimality criteria expressions is emphasized. The single constraint case is treated first, followed by the multiple constraint case with a more complex evaluation of the Lagrange multipliers. Examples illustrate the efficiency of the method.

Berke, Laszlo↗
NASA NTRS1991

H2-optimal control with generalized state-space models for use in control-structure optimization

Several advances are provided solving combined control-structure optimization problems. The author has extended solutions from H2 optimal control theory to the use of generalized state space models. The generalized state space models preserve the sparsity inherent in finite element models and hence provide some promise for handling very large problems. Also, expressions for the gradient of the optimal control cost are derived which use the generalized state space models.

Wette, Matt↗
NASA NTRS1995

Multiple burn fuel-optimal orbit transfers: Numerical trajectory computation and neighboring optimal feedback guidance

This report describes current work in the numerical computation of multiple burn, fuel-optimal orbit transfers and presents an analysis of the second variation for extremal multiple burn orbital transfers as well as a discussion of a guidance scheme which may be implemented for such transfers. The discussion of numerical computation focuses on the use of multivariate interpolation to aid the computation in the numerical optimization. The second variation analysis includes the development of the conditions for the examination of both fixed and free final time transfers. Evaluations for fixed final time are presented for extremal one, two, and three burn solutions of the first variation. The free final time problem is considered for an extremal two burn solution. In addition, corresponding changes of the second variation formulation over thrust arcs and coast arcs are included. The guidance scheme discussed is an implicit scheme which implements a neighboring optimal feedback guidance strategy to calculate both thrust direction and thrust on-off times.

Chuang, C.-H.↗
NASA NTRS2009

Local-in-Time Adjoint-Based Method for Optimal Control/Design Optimization of Unsteady Compressible Flows

.We study local-in-time adjoint-based methods for minimization of ow matching functionals subject to the 2-D unsteady compressible Euler equations. The key idea of the local-in-time method is to construct a very accurate approximation of the global-in-time adjoint equations and the corresponding sensitivity derivative by using only local information available on each time subinterval. In contrast to conventional time-dependent adjoint-based optimization methods which require backward-in-time integration of the adjoint equations over the entire time interval, the local-in-time method solves local adjoint equations sequentially over each time subinterval. Since each subinterval contains relatively few time steps, the storage cost of the local-in-time method is much lower than that of the global adjoint formulation, thus making the time-dependent optimization feasible for practical applications. The paper presents a detailed comparison of the local- and global-in-time adjoint-based methods for minimization of a tracking functional governed by the Euler equations describing the ow around a circular bump. Our numerical results show that the local-in-time method converges to the same optimal solution obtained with the global counterpart, while drastically reducing the memory cost as compared to the global-in-time adjoint formulation.

Yamaleev, N. K.↗
NASA NTRS2015

Rapid Generation of Optimal Asteroid Powered Descent Trajectories Via Convex Optimization

Mission proposals that land on asteroids are becoming popular. However, in order to have a successful mission the spacecraft must reliably and softly land at the intended landing site. The problem under investigation is how to design a fuel-optimal powered descent trajectory that can be quickly computed on-board the spacecraft, without interaction from ground control. An optimal trajectory designed immediately prior to the descent burn has many advantages. These advantages include the ability to use the actual vehicle starting state as the initial condition in the trajectory design and the ease of updating the landing target site if the original landing site is no longer viable. For long trajectories, the trajectory can be updated periodically by a redesign of the optimal trajectory based on current vehicle conditions to improve the guidance performance. One of the key drivers for being completely autonomous is the infrequent and delayed communication between ground control and the vehicle. Challenges that arise from designing an asteroid powered descent trajectory include complicated nonlinear gravity fields, small rotating bodies and low thrust vehicles.

Pinson, Robin↗
DOE OSTI2020

A Real-Time Optimization with Warm-Start of Multiperiod AC Optimal Power Flows

We present a real-time optimization strategy based on warm-start for solving a moving horizon of multi period AC optimal power flow (ACOPF) problems. In each horizon, ACOPFs are temporally interlinked via generator ramp constraints, and we assume that each horizon needs to be solved every few seconds or minutes. We introduce two approximate tracking schemes that closely follow a solution path consisting of strongly regular points. We present theoretical results bounding the tracking error by the square of the parameter changes between time periods. Experimental results for networks of sizes up to 9K buses show a fast computation time while maintaining a good solution quality, thus making our approach well suited for real-time circumstances.

moving horizon↗
DOE OSTI2023

Noise Optimization for MKIDs with Different Design Geometries and Material Selections

The separation and optimization of noise components is critical to microwave-kinetic inductance detector (MKID) development. We analyze the effect of several changes to the lumped-element inductor and interdigitated capacitor geometry on the noise performance of a series of MKIDs intended for millimeter-wavelength experiments. We extract the contributions from two-level system noise in the dielectric layer, the generation-recombination noise intrinsic to the superconducting thin-film, and system white noise from each detector noise power spectrum and characterize how these noise components depend on detector geometry, material, and measurement conditions such as driving power and temperature. We observe a reduction in the amplitude of two-level system noise with both an elevated sample temperature and an increased gap between the fingers within the interdigitated capacitors for both aluminum and niobium detectors. We also verify the expected reduction of the generation-recombination noise and associated quasiparticle lifetime with reduced inductor volume. This study also iterates over different materials, including aluminum, niobium, and aluminum manganese, and compares the results with an underlying physical model.

generation-recombination noise↗
DOE OSTI2023

Minimizing Optimal Transport for Functions with Fixed-Size Nodal Sets

Consider the class of zero-mean functions with fixed L ∞ and L 1 norms and exactly N ϵ N nodal points. Which functions f minimize W p (f + ,f – ), the Wasserstein distance between the measures whose densities are the positive and negative parts? We provide a complete solution to this minimization problem on the line and the circle, which provides sharp constants for previously proven “uncertainty principle”-type inequalities, i.e., lower bounds on N • W p (f + ,f – ). We further show that, while such inequalities hold in many metric measure spaces, they are no longer sharp when the non-branching assumption is violated; indeed, for metric star-graphs, the optimal lower bound on W p (f + ,f – ) is not inversely proportional to the size of the nodal set, N. Here, based on similar reductions, we make connections between the analogous problem of minimizing W p (f + ,f – ) for f defined on Ω C R d with an equivalent optimal domain partition problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Residuals-based distributionally robust optimization with covariate information

We consider data-driven approaches that integrate a machine learning prediction model within distributionally robust optimization (DRO) given limited joint observations of uncertain parameters and covariates. Our framework is flexible in the sense that it can accommodate a variety of regression setups and DRO ambiguity sets. We investigate asymptotic and finite sample properties of solutions obtained using Wasserstein, sample robust optimization, and phi-divergence-based ambiguity sets within our DRO formulations, and explore cross-validation approaches for sizing these ambiguity sets. Through numerical experiments, we validate our theoretical results, study the effectiveness of our approaches for sizing ambiguity sets, and illustrate the benefits of our DRO formulations in the limited data regime even when the prediction model is misspecified.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Recent advances and challenges in optimization models for expansion planning of power systems and reliability optimization

Optimization models for expansion planning of power systems aim to determine capacities, investment timing, and location of power systems to satisfy the power demands while minimizing the total cost. The models have become complex in recent years to reflect both regulations on conventional energy sources and the increasing penetration of renewable energy sources (RES). This paper reviews the basic concepts and optimization models for expansion planning of power systems. We first explain the definition and features of generation expansion planning (GEP), transmission expansion planning (TEP), and generation and transmission expansion planning (GTEP). To address the computational challenges of large-scale expansion planning problems, we review several simplifications including temporal and spatial aggregation, and decomposition methods. This paper also addresses power system reliability defined as the probability of satisfying the load demand while withstanding failures of components. Finally, the goal of this paper is to provide a research overview, discuss trends in expansion planning of power systems, and suggest directions for future research.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Nuclear–Electronic Orbital QM/MM Approach: Geometry Optimizations and Molecular Dynamics

Hybrid quantum mechanical/molecular mechanical (QM/MM) methods allow simulations of chemical reactions in atomistic solvent and heterogeneous environments such as proteins. Herein, the nuclear–electronic orbital (NEO) QM/MM approach is introduced to enable the quantization of specified nuclei, typically protons, in the QM region using a method such as NEO-density functional theory (NEO-DFT). This approach includes proton delocalization, polarization, anharmonicity, and zero-point energy in geometry optimizations and dynamics. Expressions for the energies and analytical gradients associated with the NEO-QM/MM method, as well as the previously developed polarizable continuum model (NEO-PCM), are provided. Geometry optimizations of small organic molecules hydrogen bonded to water in either dielectric continuum solvent or explicit atomistic solvent illustrate that aqueous solvation can strengthen hydrogen-bonding interactions for the systems studied, as indicated by shorter intermolecular distances at the hydrogen-bond interface. We then performed a real-time direct dynamics simulation of a phenol molecule in explicit water using the NEO-QM/MM method. Furthermore, these developments and initial examples provide the foundation for future studies of nuclear–electronic quantum dynamics in complex chemical and biological environments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

On Distribution Grid Optimal Power Flow Development and Integration

Due to changes in electric distribution grid operation, new operation regimes have been recommended. Distribution grid optimal power flow (DOPF) has received tremendous attention in the research community, yet it has not been fully adopted across the utility industry. Our paper recognizes this problem and suggests a development and integration procedure for DOPF. We propose development of DOPF as a three step procedure of 1) processing the grid, 2) obtaining a tractable solution, and 3) implementing multiple solution algorithms and benchmarking them to improve application reliability. For the integration of DOPF, we demonstrate how a DOPF federate may be developed that can be integrated in a co-simulation environment to mimic the real-world conditions and hence improve its practicality to be deployed in the field. To demonstrate the efficacy of the proposed methods, tests on IEEE 123 bus system are performed where the usage of tractable formulation in DOPF algorithm development and its comparison to the benchmark solution are demonstrated.

Hanif, Sarmad↗