Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “program optimizations”

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,333 records · Page 74

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↗

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↗

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.↗

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↗

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↗

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↗

A technique for locating function roots and for satisfying equality constraints in optimization

A new technique for locating simultaneous roots of a set of functions is described. The technique is based on the property of the Kreisselmeier-Steinhauser function which descends to a minimum at each root location. It is shown that the ensuing algorithm may be merged into any nonlinear programming method for solving optimization problems with equality constraints.

Sobieszczanski-Sobieski, Jaroslaw↗

A technique for locating function roots and for satisfying equality constraints in optimization

A new technique for locating simultaneous roots of a set of functions is described. The technique is based on the property of the Kreisselmeier-Steinhauser function which descends to a minimum at each root location. It is shown that the ensuing algorithm may be merged into any nonlinear programming method for solving optimization problems with equality constraints.

Sobieszczanski-Sobieski, J.↗

Optimization of wall assembly for DOE Efficient New Homes Program in HUD’s Climate Zones 2 and 3

Manufactured homes provide affordable housing for over 20 million Americans. The U.S. Department of Energy’s Efficient New Homes (ENH) program has introduced new energy certification requirements that manufacturers can optionally target to ensure outstanding levels of energy savings, comfort, health, and durability. In collaboration with Clayton Homes (under User Agreement (NN-23-1469)), Oak Ridge National Laboratory evaluated multiple wall assembly options to meet ENH requirements in HUD Climate Zones 2 and 3, with a target maximum cost premium of 5%. After analyzing thermal performance, cost, and manufacturability, insulated structural sheathing was identified as the most practical and effective solution. A full-scale manufactured home prototype demonstrated that this approach meets energy performance goals with minimal disruption to existing manufacturing processes and a cost premium of less than 10% with a path to further lower costs, offering a promising path forward for more efficient manufactured housing.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Sensitivity Analysis and Optimization of Enclosure Radiation with Applications to Crystal Growth

In engineering, simulation software is often used as a convenient means for carrying out experiments to evaluate physical systems. The benefit of using simulations as 'numerical' experiments is that the experimental conditions can be easily modified and repeated at much lower cost than the comparable physical experiment. The goal of these experiments is to 'improve' the process or result of the experiment. In most cases, the computational experiments employ the same trial and error approach as their physical counterparts. When using this approach for complex systems, the cause and effect relationship of the system may never be fully understood and efficient strategies for improvement never utilized. However, it is possible when running simulations to accurately and efficiently determine the sensitivity of the system results with respect to simulation to accurately and efficiently determine the sensitivity of the system results with respect to simulation parameters (e.g., initial conditions, boundary conditions, and material properties) by manipulating the underlying computations. This results in a better understanding of the system dynamics and gives us efficient means to improve processing conditions. We begin by discussing the steps involved in performing simulations. Then we consider how sensitivity information about simulation results can be obtained and ways this information may be used to improve the process or result of the experiment. Next, we discuss optimization and the efficient algorithms which use sensitivity information. We draw on all this information to propose a generalized approach for integrating simulation and optimization, with an emphasis on software programming issues. After discussing our approach to simulation and optimization we consider an application involving crystal growth. This application is interesting because it includes radiative heat transfer. We discuss the computation of radiative new factors and the impact this mode of heat transfer has on our approach. Finally, we will demonstrate the results of our optimization.

Tiller, Michael M.↗

STS Derived Exploration Launch Operations

A key aspect of the new space exploration programs will be the approach to optimize launch operations. A STS Derived Launch Vehicle (SDLV) Program can provide a cost effective, low risk, and logical step to launch all of the elements of the exploration program. Many benefits can be gained by utilizing the synergy of a common launch site as an exploration spaceport as well as evolving the resources of the current Space Shuttle Program (SSP) to meet the challenges of the Vision for Space Exploration. In particular, the launch operation resources of the SSP can be transitioned to the exploration program and combined with the operations efficiencies of unmanned EELVs to obtain the best of both worlds, resulting in lean launch operations for crew and cargo missions of the exploration program. The SDLV Program would then not only capture the extensive human space flight launch operations knowledge, but also provide for the safe fly-out of the SSP through continuity of system critical skills, manufacturing infrastructure, and ability to maintain and attract critical skill personnel. Thus, a SDLV Program can smoothly transition resources from the SSP and meet the transportation needs to continue the voyage of discovery of the space exploration program.

Best, Joel↗