Search NASA⌕ Search

SEARCH · Search NASA

Results for “Point 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 1,441 records · Page 80

Performance of extended Lagrangian schemes for molecular dynamics simulations with classical polarizable force fields and density functional theory

Iterative energy minimization with the aim of achieving self-consistency is a common feature of Born-Oppenheimer molecular dynamics (BOMD) and classical molecular dynamics with polarizable force fields. In the former, the electronic degrees of freedom are optimized, while the latter often involves an iterative determination of induced point dipoles. The computational effort of the self-consistency procedure can be reduced by re-using converged solutions from previous time steps. However, this must be done carefully, as not to break time-reversal symmetry, which negatively impacts energy conservation. Self-consistent schemes based on the extended Lagrangian formalism, where the initial guesses for the optimized quantities are treated as auxiliary degrees of freedom, constitute one elegant solution. We report on the performance of two integration schemes with the same underlying extended Lagrangian structure, which we both employ in two radically distinct regimes—in classical molecular dynamics simulations with the AMOEBA polarizable force field and in BOMD simulations with the Onetep linear-scaling density functional theory (LS-DFT) approach. Furthermore, both integration schemes are found to offer significant improvements over the standard (unpropagated) molecular dynamics formulation in both the classical and LS-DFT regimes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Improved Scintillator Materials for Compact Electron Antineutrino Detectors

Developments in the fields of chemistry and materials science provide new components that hold the potential to improve the performance of liquid scintillation electron antineutrino detectors used for the monitoring of nuclear reactors. New compounds can provide for more efficient, stable, and safer operation of these detectors. Current detectors and their detector materials raise issues regarding size, quantum efficiency, stability, and spatial resolution for the vertex detection. For compact detectors (1 m{sup 3} active volume) improvement of these issues with existing liquid scintillation cocktails can be obtained by means of developing stable and efficient neutron capture agents. These agents comprise of boron or lithium containing coordination compounds, in addition advances in fluorescence detection technologies and optimization of solvent characteristics can improve the overall efficiency. Focus points of the new detector material design are to enable a compact, robust, and direction sensitive electron antineutrino detector.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Optimal trajectories based on linear equations

The Principal results of a recent theory of fuel optimal space trajectories for linear differential equations are presented. Both impulsive and bounded-thrust problems are treated. A new form of the Lawden Primer vector is found that is identical for both problems. For this reason, starting iteratives from the solution of the impulsive problem are highly effective in the solution of the two-point boundary-value problem associated with bounded thrust. These results were applied to the problem of fuel optimal maneuvers of a spacecraft near a satellite in circular orbit using the Clohessy-Wiltshire equations. For this case two-point boundary-value problems were solved using a microcomputer, and optimal trajectory shapes displayed. The results of this theory can also be applied if the satellite is in an arbitrary Keplerian orbit through the use of the Tschauner-Hempel equations. A new form of the solution of these equations has been found that is identical for elliptical, parabolic, and hyperbolic orbits except in the way that a certain integral is evaluated. For elliptical orbits this integral is evaluated through the use of the eccentric anomaly. An analogous evaluation is performed for hyperbolic orbits.

Carter, Thomas E.↗

NIF Ignition Target 3D Point Design

We have developed an input file for running 3D NIF hohlraums that is optimized such that it can be run in 1-2 days on parallel computers. We have incorporated increasing levels of automation into the 3D input file: (1) Configuration controlled input files; (2) Common file for 2D and 3D, different types of capsules (symcap, etc.); and (3) Can obtain target dimensions, laser pulse, and diagnostics settings automatically from NIF Campaign Management Tool. Using 3D Hydra calculations to investigate different problems: (1) Intrinsic 3D asymmetry; (2) Tolerance to nonideal 3D effects (e.g. laser power balance, pointing errors); and (3) Synthetic diagnostics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Phase-Space Geometry and Optimal State Preparation in Quantum Metrology with Collective Spins

We revisit well-known protocols in quantum metrology using collective spins and propose a unifying picture for optimal state preparation based on a semiclassical description in phase space. We show how this framework allows for quantitative predictions of the timescales required to prepare various metrologically useful states, and that these predictions remain accurate even for moderate system sizes, surprisingly far from the classical limit. Furthermore, this framework allows us to build a geometric picture that relates optimal (exponentially fast) entangled probe preparation to the existence of separatrices connecting saddle points in phase space. We illustrate our results with the paradigmatic examples of the two-axis countertwisting and twisting-and-turning Hamiltonians, where we provide analytical expressions for all the relevant optimal timescales. Finally, we propose a generalization of these models to include p-body collective interaction (or p-order twisting), beyond the usual case of p = 2. Using our geometric framework, we prove a no-go theorem for the local optimality of these models for p > 2.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Controlling Metastable Native Point-Defect Populations in Cu(In,Ga)Se 2 and Cu 2 ZnSnSe 4 Materials and Solar Cells through Voltage-Bias Annealing

Our contribution describes the influence of low-temperature annealing with and without applied voltage bias on thin-film Cu 2 ZnSnSe 4 (CZTSe), Cu(In,Ga)Se 2 (CIGS), and CdS material properties and solar cell performance. In order to quantify the effects of cation disorder on CZTSe device performance, completed devices were annealed under open-circuit conditions at various temperatures from 110 degrees C to 215 degrees C and subsequently quenched. Measurements on these devices document systematic, reversible changes in solar-cell performance consistent with a reduction in CZTSe band tails at lower annealing temperatures. CIGS and CZTSe solar cells were also annealed at various temperatures (200 degrees C for CIGS and 110 degrees C-215 degrees C for CZTSe) and subsequently quenched with continuously applied voltage bias to explore the effects of non-equilibrium annealing conditions. For both absorbers, large reversible changes in device characteristics correlated with the magnitude and sign of the applied voltage bias were observed. For CZTSe devices, the voltage-bias annealing (VBA) produced reversible changes in open-circuit voltage (VOC) from 289 meV to 446 meV. For CIGS solar cells, even larger changes were observed in device performance: photovoltaic (PV) conversion efficiency of the CIGS device varied from below 3% to above 15%, with corresponding changes in CIGS hole density of about three orders of magnitude. Findings from these VBA experiments are interpreted in terms of changes to the metastable point-defect populations that control key properties in the absorber layers, and in the CdS buffer layer. Computational device modeling was performed to assess the impacts of cation disorder on the CZTSe VOC deficit, and to elucidate the effects of VBA treatments on metastable point defect populations in CZTSe, CIGS, and CdS. Our results indicate that band tails impose important limitations on CZTSe device performance. Device modeling results also indicate that non-equilibrium processing conditions including the effects of voltage bias can dramatically alter point-defect-mediated opto-electronic properties of semiconductors. Implications for optimization of PV materials and connections to long-term stability of PV devices are discussed.

14 SOLAR ENERGY↗

Exploring Transfers Between Earth-Moon Halo Orbits via Multi-Objective Reinforcement Learning

Multi-Reward Proximal Policy Optimization, a multi-objective deep reinforcement learning algorithm, is used to examine the design space of low-thrust trajectories for a SmallSat transferring between two libration point orbits in the Earth-Moon system. Using Multi-Reward Proximal Policy Optimization, multiple policies are simultaneously and efficiently trained on three distinct trajectory design scenarios. Each policy is trained to create a unique control scheme based on the trajectory design scenario and assigned reward function: a unique combination of weights scaling competing objectives that guide the spacecraft to the target mission orbit, incentivize faster flight times, and penalize propellant mass usage. Then, the policies are evaluated on the same set of perturbed initial conditions in each scenario to generate the propellant mass usages, flight times, and state discontinuities from a reference trajectory for each control scheme. This solution space of low-thrust trajectories for a SmallSat is used to examine the multi-objective trade space for the trajectory design scenario. By autonomously constructing the solution space, insights into the required propellant mass, flight time, and transfer geometry are rapidly achieved.

Christopher J Sullivan↗

Adapting Dismantling and Decommissioning Strategies to a Variety of Nuclear Fuel Cycle Facilities - 12237

AREVA has accumulated over 20 years of experience in managing and operating fuel cycle facilities Decontamination and Decommissioning (D and D) projects of many different types and a variety of scales, both as facility owner (at La Hague for example) and as prime contractor to external customers such as the French Atomic Energy Commission (at Marcoule). A specific Business Unit was created in 2008 to capitalize on this experience and to concentrate - in one division - the specific skills required to be successful and cost effective in decommissioning projects. Indeed one of the key lessons learned in the past decades is that decommissioning is a significantly different business as compared to normal operations of a nuclear facility. Almost all the functions of a project need to be viewed from a different angle, challenged and adapted consequently in order to optimize costs and schedule. Three examples follow to illustrate the point: Safety management needs to take into account the ever changing configuration of a plant under D and D (a quite new situation for the authorities). Production of waste is significantly different in term of volume, activities, conditioning and disposal path. Technology is important but technical issues are often less critical than good management and planning. Further examples and lessons learned are developed through reviewing the projects experience basis. AREVA has a long and vast experience in the cleanup and dismantling of a number of very large and complex nuclear facilities. This effort focused initially on AREVA's own plants and is expanding now to other customers. The setup of a specific Business Unit in 2008 to takeover this business allowed concentration of the skills and the lessons learned in a dedicated division so as to provide the best means to optimize safety, performance, costs and schedules. Indeed transitioning from operations to D and D of a nuclear facility is a quantum leap. The assistance from specialized teams can bring significant cost savings. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Recursive Branching Simulated Annealing Algorithm

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

Bolcar, Matthew↗

An optimal output feedback gain variation scheme for the control of plants exhibiting gross parameter changes

A concept for optimally designing output feedback controllers for plants whose dynamics exhibit gross changes over their operating regimes was developed. This was to formulate the design problem in such a way that the implemented feedback gains vary as the output of a dynamical system whose independent variable is a scalar parameterization of the plant operating point. The results of this effort include derivation of necessary conditions for optimality for the general problem formulation, and for several simplified cases. The question of existence of a solution to the design problem was also examined, and it was shown that the class of gain variation schemes developed are capable of achieving gain variation histories which are arbitrarily close to the unconstrained gain solution for each point in the plant operating range. The theory was implemented in a feedback design algorithm, which was exercised in a numerical example. The results are applicable to the design of practical high-performance feedback controllers for plants whose dynamics vary significanly during operation. Many aerospace systems fall into this category.

Moerder, Daniel D.↗

OPTIMIZATION OF INTERNAL HEAT EXCHANGERS FOR HYDROGEN STORAGE TANKS UTILIZING METAL HYDRIDES

Two detailed, unit-cell models, a transverse fin design and a longitudinal fin design, of a combined hydride bed and heat exchanger are developed in COMSOL{reg_sign} Multiphysics incorporating and accounting for heat transfer and reaction kinetic limitations. MatLab{reg_sign} scripts for autonomous model generation are developed and incorporated into (1) a grid-based and (2) a systematic optimization routine based on the Nelder-Mead downhill simplex method to determine the geometrical parameters that lead to the optimal structure for each fin design that maximizes the hydrogen stored within the hydride. The optimal designs for both the transverse and longitudinal fin designs point toward closely-spaced, small cooling fluid tubes. Under the hydrogen feed conditions studied (50 bar), a 25 times improvement or better in the hydrogen storage kinetics will be required to simultaneously meet the Department of Energy technical targets for gravimetric capacity and fill time. These models and methodology can be rapidly applied to other hydrogen storage materials, such as other metal hydrides or to cryoadsorbents, in future work.

08 HYDROGEN↗

Tula: Optimizing Time, Cost, and Generalization in Distributed Large-Batch Training

Distributed training increases the number of batches processed per iteration either by scaling-out (adding more nodes) or scaling-up (increasing the batch-size). However, the largest configuration does not necessarily yield the best performance. Horizontal scaling introduces additional communication overhead, while vertical scaling is constrained by computation cost and device memory limits. Thus, simply increasing the batch-size leads to diminishing returns: training time and cost decrease initially but eventually plateaus, creating a knee-point in the time/cost vs. batch-size pareto curve. The optimal batch-size therefore depends on the underlying model, data and available compute resources. Large batches also suffer from worse model quality due to the well-known “generalization gap”. In this paper, we present Tula, an online service that automatically optimizes time, cost, and convergence quality for large-batch training of convolutional models. It combines parallel-systems modeling with statistical performance prediction to identify the optimal batchsize. Tula predicts training time and cost within 7.5−14% error across multiple models, and achieves up to 20× overall speedup and improves test accuracy by ≈9% on average over standard large-batch training on various vision tasks, thus successfully mitigating the generalization gap and accelerating training at the same time.

Tyagi, Sahil [ORNL] (ORCID:0009000783144745)↗

Factoring Algebraic Error for Relative Pose Estimation

We address the problem of estimating the relative pose, i.e. translation and rotation, of two calibrated cameras from image point correspondences. Our approach is to factor the nonlinear algebraic pose error functional into translational and rotational components, and to optimize translation and rotation independently. This factorization admits subproblems that can be solved using direct methods with practical guarantees on global optimality. That is, for a given translation, the corresponding optimal rotation can directly be determined, and vice versa. We show that these subproblems are equivalent to computing the least eigenvector of second- and fourth-order symmetric tensors. When neither translation or rotation is known, alternating translation and rotation optimization leads to a simple, efficient, and robust algorithm for pose estimation that improves on the well-known 5- and 8-point methods.

99 GENERAL AND MISCELLANEOUS↗

Assessment of Energy Storage Alternatives in the Puget Sound Energy System Volume 2: Energy Storage Evaluation Tool

This volume presents the battery storage evaluation tool developed at Pacific Northwest National Laboratory (PNNL), which is used to evaluate benefits of battery storage for multiple grid applications, including energy arbitrage, balancing service, capacity value, distribution system equipment deferral, and outage mitigation. This tool is based on the optimal control strategies to capture multiple services from a single energy storage device. In this control strategy, at each hour, a look-ahead optimization is first formulated and solved to determine battery base operating point. The minute by minute simulation is then performed to simulate the actual battery operation. This volume provide background and manual for this evaluation tool.

25 ENERGY STORAGE↗

James Webb Space Telescope (JWST) Stationkeeping Monte Carlo Simulations

The James Webb Space Telescope (JWST) will launch in 2018 into a Libration Point Orbit (LPO) around the Sun-EarthMoon (SEM) L2 point, with a planned mission lifetime of 11 years. This paper discusses our approach to Stationkeeping (SK) maneuver planning to determine an adequate SK delta-V budget. The SK maneuver planning for JWST is made challenging by two factors: JWST has a large Sunshield, and JWST will be repointed regularly producing significant changes in Solar Radiation Pressure (SRP). To accurately model SRP we employ the Solar Pressure and Drag (SPAD) tool, which uses ray tracing to accurately compute SRP force as a function of attitude. As an additional challenge, the future JWST observation schedule will not be known at the time of SK maneuver planning. Thus there will be significant variation in SRP between SK maneuvers, and the future variation in SRP is unknown. We have enhanced an earlier SK simulation to create a Monte Carlo simulation that incorporates random draws for uncertainties that affect the budget, including random draws of the observation schedule. Each SK maneuver is planned to optimize delta-V magnitude, subject to constraints on spacecraft pointing. We report the results of the Monte Carlo simulations and discuss possible improvements during flight operations to reduce the SK delta-V budget.

Monte Carlo↗

Duct liner optimization for turbomachinery noise sources

An acoustical field theory for axisymmetric, multisectioned lined ducts with uniform flow profiles was combined with a numerical minimization algorithm to predict optimal liner configurations having one, two, and three sections. Source models studied include a point source located on the axis of the duct and rotor/outlet-stator viscous wake interaction effects for a typical research compressor operating at an axial flow Mach number of about 0.4. For this latter source, optimal liners for equipartition-of energy, zero-phase, and least-attenuated-mode source variations were also calculated and compared with exact results. It is found that the potential benefits of liner segmentation for the attenuation of turbomachinery noise is greater than would be predicted from point source results. Furthermore, effective liner design requires precise knowledge of the circumferential and radial modal distributions.

Lester, H. C.↗

Automatic Segmentation of Building Envelope Point Cloud Data Using Machine Learning

About 50% of buildings in the US were constructed before energy codes were introduced. Modular overclad panel retrofits, in which a new envelope is constructed over the existing building, are a promising solution given that it minimizes occupant disruption and shortens construction time at the jobsite. Current state-of-the-art retrofit panel layout and dimensioning consists of three steps: 1) 3D point cloud data generation of the building envelope using commonly available surveying equipment, 2) manual segmentation of 3D point cloud data by a trained professional to identify and dimension window openings, door openings, and other architectural features, and 3) modular panel layout optimization and dimensioning by an architect or engineer. Among these steps, the second one remains the most difficult and costly because it is very labor-intensive. We propose a methodology to automatically label 3D point cloud data to reduce the time and expense spent in manual segmentation. Machine learning methods were employed to classify the point cloud data into distinct groups, each of which corresponds to different features of the building envelope. After classification, a segmentation algorithm was developed to perform boundary detection and separate the components of the façade. Finally, the algorithm returns the relative positions and dimensions of the features in the building envelope. The measurements obtained with the proposed automated method were compared against the actual dimensions to determine the overall algorithm accuracy. The proposed algorithm can then be used to reduce manual efforts for 3D point cloud labeling before modular panel layout optimization is performed.

Maldonado Puente, Bryan↗

Stationkeeping Monte Carlo Simulation for the James Webb Space Telescope

The James Webb Space Telescope (JWST) is scheduled to launch in 2018 into a Libration Point Orbit (LPO) around the Sun-Earth/Moon (SEM) L2 point, with a planned mission lifetime of 10.5 years after a six-month transfer to the mission orbit. This paper discusses our approach to Stationkeeping (SK) maneuver planning to determine an adequate SK delta-V budget. The SK maneuver planning for JWST is made challenging by two factors: JWST has a large Sunshield, and JWST will be repointed regularly producing significant changes in Solar Radiation Pressure (SRP). To accurately model SRP we employ the Solar Pressure and Drag (SPAD) tool, which uses ray tracing to accurately compute SRP force as a function of attitude. As an additional challenge, the future JWST observation schedule will not be known at the time of SK maneuver planning. Thus there will be significant variation in SRP between SK maneuvers, and the future variation in SRP is unknown. We have enhanced an earlier SK simulation to create a Monte Carlo simulation that incorporates random draws for uncertainties that affect the budget, including random draws of the observation schedule. Each SK maneuver is planned to optimize delta-V magnitude, subject to constraints on spacecraft pointing. We report the results of the Monte Carlo simulations and discuss possible improvements during flight operations to reduce the SK delta-V budget.

Stationkeepting↗