Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Program 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,243 records · Page 69
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

Configuring Airspace Sectors with Approximate Dynamic Programming

In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.

Bloem, Michael↗
DOE OSTI2018

Optimizing Storage Operation for a Probabilistic Locational Marginal Pricing Forecast: Preprint

This paper explores the applicability of using dynamic programing (DP) and approximate dynamic programming (ADP) based methods for optimal dispatch of utility scale energy storage systems (ESS). In this study, the effectiveness of these approaches have been tested using the IEEE 13 node test feeder with distributed photovoltaics (PVs) and a utility scale storage system. In this work, a co-simulation based approach has been used to setup the experiment to be able to implement detailed ESS and network models. The results obtained from DP/ADP runs have been compared with three other control strategies both myopic and intelligent. Simulations results show that DP/ADP algorithms are a good candidate for optimal EES dispatch in terms of both solution quality and execution time.

25 ENERGY STORAGE↗
DOE OSTI2014

SU-E-T-258: Parallel Optimization of Beam Configurations for CyberKnife Treatments

Purpose: The CyberKnife delivers a large number of beams originating at different non-planar positions and with different orientation. We study how much the quality of treatment plans depends on the beams considered during plan optimization. Particularly, we evaluate a new approach to search for optimal treatment plans in parallel by running optimization steps concurrently. Methods: So far, no deterministic, complete and efficient method to select the optimal beam configuration for robotic SRS/SBRT is known. Considering a large candidate beam set increases the likelihood to achieve a good plan, but the optimization problem becomes large and impractical to solve. We have implemented an approach that parallelizes the search by solving multiple linear programming problems concurrently while iteratively resampling zero weighted beams. Each optimization problem contains the same set of constraints but different variables representing candidate beams. The search is synchronized by sharing the resulting basis variables among the parallel optimizations. We demonstrate the utility of the approach based on an actual spinal case with the objective to improve the coverage. Results: The objective function is falling and reaches a value of 5000 after 49, 31, 25 and 15 iterations for 1, 2, 4, and 8 parallel processes. This corresponds to approximately 97% coverage in 77%, 59%, and 36% of the mean number of iterations with one process for 2, 4, and 8 parallel processes, respectively. Overall, coverage increases from approximately 91.5% to approximately 98.5%. Conclusion: While on our current computer with uniform memory access the reduced number of iterations does not translate into a similar speedup, the approach illustrates how to effectively parallelize the search for the optimal beam configuration. The experimental results also indicate that for complex geometries the beam selection is critical for further plan optimization.

07 ISOTOPE AND RADIATION SOURCES↗
NASA NTRS1988

Computer-aided design analysis of 57-mm, angular-contact, cryogenic turbopump bearings

The Space Shuttle main engine high-pressure oxygen turbopumps have not experienced the sevice life required of them. This insufficiency has been due in part to the shortened life of the bearings. To improve the life of the existing turbopump bearings, an effort is under way to investigate bearing modifications that could be retrofitted into the present bearing cavity. Several bearing parameters were optimized using the computer program SHABERTH, which performs a thermomechanical simulation of a load support system. The computer analysis showed that improved bearing performance is feasible if low friction coefficients can be attained. Bearing geometries were optimized considering heat generation, equilibrium temperatures, and relative life. Thermal gradients through the bearings were found to be lower with liquid lubrication than with solid film lubrication, and a liquid oxygen coolant flowrate of approximately 4.0 kg/s was found to be optimal. This paper describes the analytical modeling used to determine these feasible modifications to improve bearing performance.

Armstrong, Elizabeth S.↗
NASA NTRS1988

Bearing optimization for SSME HPOTP application

The space shuttle main engine (SSME) high-pressure oxygen turbopumps (HPOTP) have not experienced the service life required of them. To improve the life of the existing turbopump bearings, modifications to the bearings that could be retrofitted into the present bearing cavity are being investigated. Several bearing parameters were optimized using the computer program SHABERTH, which performs a thermomechanical simulation of a load support system. The computer analysis showed that improved bearing performance is feasible if low friction coefficients can be attained. Bearing geometries were optimized considering heat generation, equilibrium temperatures, and relative life. Two sets of curvatures were selected from the optimization: an inner-raceway curvature of 0.54, an outer-raceway curvature of 0.52, and an inner-raceway curvature of 0.55, an outer-raceway curvature of 0.53. A contact angle of 16 deg was also selected. Thermal gradients through the bearings were found to be lower with liquid lubrication than with solid film lubrication. As the coolant flowrate through the bearing increased, the ball temperature decreased but at a continuously decreasing rate. The optimum flowrate was approximately 4 kg/s. The analytical modeling used to determine these feasible modifications to improve bearing performance is described.

Armstrong, Elizabeth S.↗
DOE OSTI2024

Quantum optimization algorithms: Energetic implications

Since the dawn of quantum computing (QC), theoretical developments like Shor's algorithm proved the conceptual superiority of QC over traditional computing. However, such quantum supremacy claims are difficult to achieve in practice because of the technical challenges of realizing noiseless qubits. In the near future, QC applications will need to rely on noisy quantum devices that offload part of their work to classical devices. One way to achieve this is by using parameterized quantum circuits in optimization or even in machine learning tasks. The energy requirements of quantum algorithms have not yet been studied extensively. Here in this article, we explore several optimization algorithms using both theoretical insights and numerical experiments to understand their impact on energy consumption. Specifically, we highlight why and how algorithms like quantum natural gradient descent, simultaneous perturbation stochastic approximations or circuit learning methods, are at least 2x to 4x more energy efficient than their classical counterparts; why feedback-based quantum optimization is energy-inefficient; and how techniques like Rosalin can improve the energy efficiency of other algorithms by a factor of ≥2 0 x. Finally, we use the NchooseK high-level programming model to run optimization problems on both gate-based quantum computers and quantum annealers. Empirical data indicate that these optimization problems run faster, have better success rates, and consume less energy on quantum annealers than on their gate-based counterparts.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

Computation of near-minimum-time maneuvers of flexible structures by parameter optimization

Near-minimum-time attitude maneuvers of space structures as well as ground based test articles are considered. Switching nature of the controls for rigid body maneuvers are illustrated using a control-cube and a critical control axis of rotation. The presence of torque smoothing and where appropriate, gravitational effects and connections to other bodies are explicitly included in the mathematical models of the systems to be optimized. A maximum fuel consumption constraint is included besides the required terminal conditions on attitude and angular velocities. The switch times, maximum thrust magnitudes, and smoothing parameters are determined using the Sequential Quadratic Programming method for parameter optimization. Results indicating attitude and angular velocity histories, thruster forces, and structural vibrations are presented for three, four, and five switch maneuvers, as well as maneuvers that involve large coasting arcs.

Vadali, S. R.↗
DOE OSTI2015

Autotuning algorithmic choice for input sensitivity

A daunting challenge faced by program performance autotuning is input sensitivity, where the best autotuned configuration may vary with different input sets. This paper presents a novel two-level input learning algorithm to tackle the challenge for an important class of autotuning problems, algorithmic autotuning. Here, the new approach uses a two-level input clustering method to automatically refine input grouping, feature selection, and classifier construction. Its design solves a series of open issues that are particularly essential to algorithmic autotuning, including the enormous optimization space, complex influence by deep input features, high cost in feature extraction, and variable accuracy of algorithmic choices. Experimental results show that the new solution yields up to a 3x speedup over using a single configuration for all inputs, and a 34x speedup over a traditional one-level method for addressing input sensitivity in program optimizations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Adaptive critic design-based reinforcement learning approach in controlling virtual inertia-based grid-connected inverters

In this report, an adaptive critic design (ACD) approach is proposed to control the phase and voltage of a grid-connected virtual synchronous generator (VSG). The penetration of fast responding inertia-less power converters significantly affect the stability of the power system, especially weak systems such as micro grids. The concept of virtual inertia addresses this concern by virtually emulating the behavior of a synchronous generator. However, the conventional VSG is designed based on two conditions: (i) fixed operating point and (ii) inductive grid connections. The performance of VSGs in low-voltage semi-resistive microgrids is far from optimal. To overcome the aforementioned concerns, a heuristic dynamic programing (HDP) approach is proposed to optimally control grid-connected VSGs. The neural-network-based inherence of the HDP enables the proposed technique to adapt to any impedance angle. The HDP controller includes two subnetworks: (i) the action network that controls the system optimally and (ii) the critic network, which evaluates the effectiveness of the action network. The simulation and experimental results are provided to evaluate the effectiveness of the proposed technique. As shown, the HDP-based approach illustrates a better performance in comparison with the conventional PI-based VSG in various operating conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation

In this work, we consider the problem of designing a cloak for waves described by the Helmholtz equation from an integer programming point of view. The problem can be modeled as a PDE-constrained optimization problem with integer-valued control inputs that are distributed in the computational domain. A first-discretize-then-optimize approach results in a large-scale mixed-integer nonlinear program that is in general intractable because of the large number of integer variables that arise from the discretization of the domain. Instead, we propose an efficient algorithm that is able to approximate the local infima of the underlying nonconvex infinite-dimensional problem arbitrarily close without the need to solve the discretized finite-dimensional integer programs to optimality. We optimize only the continuous relaxations of the approximations for local minima and then apply the sum-up rounding methodology to obtain integer-valued controls. If the solutions of the discretized continuous relaxations converge to a local minimizer of the continuous relaxation, then the resulting discrete-valued control sequence converges weakly \(^*\) in \(L^\infty\) to the same local minimizer. These approximation properties follow under suitable refinements of the involved discretization grids. Our results use familiar concepts arising from the analytical properties of the underlying PDE and complement previous results, derived from a topology optimization point of view.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Exploring the benefits of utilizing small modular device for sustainable and flexible shale gas water management

Growing shale gas extraction in recent years has triggered wide discussions on the associated freshwater requirement and wastewater management. Many optimization approaches have been developed for shale gas water management; however, most of the studies assumed permanent utilization of wastewater treatment facilities with fixed capacities. Considering the rapidly declining characteristics of shale gas wastewater production, these treatment facilities could remain largely underutilized after the first few months/years of production, making them less economically attractive. To maximize the capacity utilization of treatment facilities and further improve the economic performance of shale gas development, this study develops a systematic optimization framework, where the capacity strategy of conventional treatment facilities and utilization of the recent concept of modular manufacturing are both considered for flexible shale gas water management. The proposed mixed-integer linear programming (MILP) model simultaneously optimizes the design and planning of integrated shale gas and water supply chain, with a focus on capacity planning for both large-scale conventional treatment facilities and small-scale modular devices. A series of Marcellus-based case studies are performed to illustrate the applicability of the proposed model and provide general insights into the trade-offs between the multiple types of treatment facilities. The optimization results reveal that the combinatorial utilization of conventional facilities and modular devices for wastewater treatment (66% by conventional facilities and 34% by modular devices) brings 9.3% more reused water for other well development and 6.2% savings in water-related costs, compared to flexible management of only conventional facilities. Furthermore, this work suggests that taking modular device as auxiliary equipment for shale gas water management is most beneficial to increase the capacity utilization of treatment facilities and achieve a more economic and sustainable shale gas production system.

04 OIL SHALES AND TAR SANDS↗
NASA NTRS1987

Single step optimization of manipulator maneuvers with variable structure control

One step ahead optimization has been recently proposed for spacecraft attitude maneuvers as well as for robot manipulator maneuvers. Such a technique yields a discrete time control algorithm implementable as a sequence of state-dependent, quadratic programming problems for acceleration optimization. Its sensitivity to model accuracy, for the required inversion of the system dynamics, is shown in this paper to be alleviated by a fast variable structure control correction, acting between the sampling intervals of the slow one step ahead discrete time acceleration command generation algorithm. The slow and fast looping concept chosen follows that recently proposed for optimal aiming strategies with variable structure control. Accelerations required by the VSC correction are reserved during the slow one step ahead command generation so that the ability to overshoot the sliding surface is guaranteed.

Chen, N.↗
DOE OSTI2023

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2004

Autonomous Guidance of Agile Small-scale Rotorcraft

This report describes a guidance system for agile vehicles based on a hybrid closed-loop model of the vehicle dynamics. The hybrid model represents the vehicle dynamics through a combination of linear-time-invariant control modes and pre-programmed, finite-duration maneuvers. This particular hybrid structure can be realized through a control system that combines trim controllers and a maneuvering control logic. The former enable precise trajectory tracking, and the latter enables trajectories at the edge of the vehicle capabilities. The closed-loop model is much simpler than the full vehicle equations of motion, yet it can capture a broad range of dynamic behaviors. It also supports a consistent link between the physical layer and the decision-making layer. The trajectory generation was formulated as an optimization problem using mixed-integer-linear-programming. The optimization is solved in a receding horizon fashion. Several techniques to improve the computational tractability were investigate. Simulation experiments using NASA Ames 'R-50 model show that this approach fully exploits the vehicle's agility.

Mettler, Bernard↗
DOE OSTI2019

PHANOTATE: a novel approach to gene identification in phage genomes

Motivation: Currently there are no tools specifically designed for annotating genes in phages. Several tools are available that have been adapted to run on phage genomes, but due to their underlying design, they are unable to capture the full complexity of phage genomes. Phages have adapted their genomes to be extremely compact, having adjacent genes that overlap and genes completely inside of other longer genes. This non-delineated genome structure makes it difficult for gene prediction using the currently available gene annotators. Here we present PHANOTATE, a novel method for gene calling specifically designed for phage genomes. Although the compact nature of genes in phages is a problem for current gene annotators, we exploit this property by treating a phage genome as a network of paths: where open reading frames are favorable, and overlaps and gaps are less favorable, but still possible. We represent this network of connections as a weighted graph, and use dynamic programing to find the optimal path. Results: We compare PHANOTATE to other gene callers by annotating a set of 2133 complete phage genomes from GenBank, using PHANOTATE and the three most popular gene callers. We found that the four programs agree on 82% of the total predicted genes, with PHANOTATE predicting more genes than the other three. We searched for these extra genes in both GenBank’s non-redundant protein database and all of the metagenomes in the sequence read archive, and found that they are present at levels that suggest that these are functional protein-coding genes. Availability and implementation: https://github.com/deprekate/PHANOTATE. Supplementary information: Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗