Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization applications”

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 649 records · Page 36

Method for minimizing the cost/Watt of complete photovoltaic systems and applications

The paper describes an optimization method and some applications in which the design criterion for every part of a photovoltaic system is the minimum power cost for the complete system. The various parts of a photovoltaic system are grouped so that all costs fall into four classes: fabrication steps of the active solar cells; steps associated with the collector array and its complete structure; power-handling elements such as switchgear, storage, etc.; and fixed costs that do not vary directly with any of the system parts, such as factory-level overhead. It is assumed that the total collector area is independent of any of the optimization processes. A general equation is found to be capable of optimizing all parts of a system, although the cell and array steps are basically different from the power-handling elements. It is shown that the optimization of any step in the system requires inclusion of the properties of the other parts of the system.

Redfield, D.↗

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N " M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.

97 MATHEMATICS AND COMPUTING↗

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N$\gg$M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.

97 MATHEMATICS AND COMPUTING↗

Display analysis with the optimal control model of the human operator

Application of the optimal control model of the human operator to problems in display analysis is discussed. Those aspects of the model pertaining to the operator-display interface and to operator information processing are reviewed and discussed. The techniques are then applied to the analysis of advanced display/control systems for a Terminal Configured Vehicle. Model results are compared with those obtained in a large, fixed-base simulation.

Baron, S.↗

Efficient Optimization of Low-Thrust Spacecraft Trajectories

A paper describes a computationally efficient method of optimizing trajectories of spacecraft driven by propulsion systems that generate low thrusts and, hence, must be operated for long times. A common goal in trajectory-optimization problems is to find minimum-time, minimum-fuel, or Pareto-optimal trajectories (here, Pareto-optimality signifies that no other solutions are superior with respect to both flight time and fuel consumption). The present method utilizes genetic and simulated-annealing algorithms to search for globally Pareto-optimal solutions. These algorithms are implemented in parallel form to reduce computation time. These algorithms are coupled with either of two traditional trajectory- design approaches called "direct" and "indirect." In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. The indirect approach involves the primer-vector theory (introduced in 1963), in which the thrust control problem is transformed into a co-state control problem and the initial values of the co-state vector are optimized. In application to two example orbit-transfer problems, this method was found to generate solutions comparable to those of other state-of-the-art trajectory-optimization methods while requiring much less computation time.

Lee, Seungwon↗

Structural design optimization with survivability dependent constraints application: Primary wing box of a multi-role fighter

The superior survivability of a multirole fighter is dependent upon balanced integration of technologies for reduced vulnerability and susceptability. The objective is to develop a methodology for structural design optimization with survivability dependent constraints. The design criteria for optimization will be survivability in a tactical laser environment. The following analyses are studied to establish a dependent design relationship between structural weight and survivability: (1) develop a physically linked global design model of survivability variables; and (2) apply conventional constraints to quantify survivability dependent design. It was not possible to develop an exact approach which would include all aspects of survivability dependent design, therefore guidelines are offered for solving similar problems.

Dolvin, Douglas J.↗

Demonstrating solarpilot ’s Python Application Programmable Interface Through Heliostat Optimal Aimpoint Strategy Use Case

solarpilot is a software package that generates solar field layouts and characterizes the optical performance of concentrating solar power (CSP) tower systems. solarpilot was developed by the National Renewable Energy Laboratory (NREL) as a stand-alone desktop application but has also been incorporated into NREL’s System Advisor Model (SAM) in a simplified format. Prior means for user interaction with solarpilot have included the application’s graphical interface, the SAM routines with limited configurability, and through a built-in scripting language called “LK.” This article presents a new, full-featured, python-based application programmable interface (API) for solarpilot, which we hereafter refer to as CoPylot. CoPylot enables python users to perform detailed CSP tower analysis utilizing either the Hermite expansion technique (analytical) or the SolTrace ray-tracing engine. CoPylot’s enables CSP researchers to perform analysis that was previously not possible through solarpilot’s existing interfaces. This article discusses the capabilities of CoPylot and presents a use case wherein we populate a model that obtains optimal solar field aiming strategies.

14 SOLAR ENERGY↗

Optimum structural design of robotic manipulators with fiber reinforced composite materials

High-speed robotic arms with advanced structural characteristics can be fabricated from optimally tailored fiber reinforced composites. An integrated design methodology is presented for the optimal structural synthesis of composite robotic manipulators. Optimum configurations of ply angles and ply thicknesses are predicted for maximum structural end-effector stiffness and maximum end-effector load carrying capacity, without altering the geometric dimensions of the links. Multiple posture finite element-based static performance criteria are implemented. A new finite element has been developed for the modeling of tubular composite links. Unique features are the inclusion of shear effects and coupling between stretching and flexure. Numerical solutions are obtained via an efficient optimization algorithm. Applications to an existing SCARA-class manipulator illustrate the effectiveness of the method and demonstrate the dramatic influence of the multi-postural design criteria on the optimal design. For a filament wound structure using a high strength carbon fiber in a thermoplastic matrix, the resultant optimum ply configurations have increased the specific stiffness and specific load capacity by factors of 1.5 and 16, respectively, in comparison to identically sized aluminum links.

Saravanos, D. A.↗

Optimization by decomposition in structural and multidisciplinary applications

An algorithm for a general, multilevel structural optimization by substructuring is derived, based on the linear decomposition concept that is rooted in the Bellman's Optimality Criterion enhanced with the optimum sensitivity derivatives used as a means to account for coupling among the subproblems, each of which is limited to optimization of a substructure. The algorithm applies also to those multidisciplinary problems whose subproblems form a hierarchy similar to that of substructures. In systems where the subproblems communicate with each other at the same level, the decomposition becomes non-hierarchic and the system may be optimized as a whole based on the derivatives of the system behavior with respect to the design variables computed by a method that bypasses finite differencing on the system analysis. When a multidisciplinary system includes a structure as its part, a hybrid, hierarchic/non-hierarchic decomposition applies. Numerical examples and references to computational experience accumulated to date illustrate the discussion.

Sobieszczanski-Sobieski, Jaroslaw↗

Error Analysis and Selection of Optimal Excitation Parameters for the Sensing of CO2 and O2 from Space for ASCENDS Applications

Simulation studies to optimize sensing of CO2 and O2 from space are described. Uncertainties in line-by-line calculations unaccounted for in previous studies identified. Multivariate methods are employed for measurement wavelengths selection. The Active Sensing of CO2 Emissions over Nights, Days, and Seasons (ASCENDS) recommended by NRC Decadal Survey has a stringent accuracy requirements of 0.5% or better in XCO2 retrievals. NASA LaRC and its partners are investigating the use of the 1.57 m band of CO2 and the 1.26-1.27 m band of oxygen for XCO2 measurements. As part of these efforts, we are carrying out simulation studies using a lidar modeling framework being developed at NASA LaRC to predict the performance of our proposed ASCENDS mission implementation [1]. Our study is aimed at predicting the sources and magnitudes of errors anticipated in XCO2 retrievals for further error minimization through the selection of optimum excitation parameters and development of better retrieval methods.

Pliutau, Denis↗

Westinghouse waste simulation and optimization software tool

Applications for dynamic simulation can be found in virtually all areas of process engineering. The tangible benefits of using dynamic simulation can be seen in tighter design, smoother start-ups and optimized operation. Thus, proper implementation of dynamic simulation can deliver substantial benefits. These benefits are typically derived from improved process understanding. Simulation gives confidence in evidence based decisions and enables users to try out lots of 'what if' scenarios until one is sure that a decision is the right one. In radioactive waste treatment tasks different kinds of waste with different volumes and properties have to be treated, e.g. from NPP operation or D and D activities. Finding a commercially and technically optimized waste treatment concept is a time consuming and difficult task. The Westinghouse Waste Simulation and Optimization Software Tool will enable the user to quickly generate reliable simulation models of various process applications based on equipment modules. These modules can be built with ease and be integrated into the simulation model. This capability ensures that this tool is applicable to typical waste treatment tasks. The identified waste streams and the selected treatment methods are the basis of the simulation and optimization software. After implementing suitable equipment data into the model, process requirements and waste treatment data are fed into the simulation to finally generate primary simulation results. A sensitivity analysis of automated optimization features of the software generates the lowest possible lifecycle cost for the simulated waste stream. In combination with proven waste management equipments and integrated waste management solutions, this tool provides reliable qualitative results that lead to an effective planning and minimizes the total project planning risk of any waste management activity. It is thus the ideal tool for designing a waste treatment facility in an optimum manner, taking account of the detailed waste stream and specific requirements. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Smarter building start – A distributed solution

A significant focus of research and new technologies for reducing energy use in buildings is on operating the systems more efficiently during the times when the systems are active. However, there is a large potential for energy savings in determining the periods when the systems should or should not be active. This scheduling aspect of operation is often overlooked even though relatively simple solutions can unlock substantial energy savings. In this paper we describe a smart building start (SBS) algorithm that considers multiple zones in a building to determine individual schedules for room controllers as well as the central systems based on solving a simple optimization problem. Application of the SBS algorithm to multiple interconnected systems enables a staggered start-up that minimizes peak loads and also ensures comfort is within a target range with minimal system run time. The SBS algorithm extends the capability of traditional optimal start and is designed to be simple to deploy and robust. Simulation results as well as results from tests in a real building with a VAV system are presented. The presented algorithm is applicable to any type of building with a zonal or multi-zone HVAC system. To function, it needs to be able to change setpoints in rooms and monitor room temperatures, as well as, if desired, turn the central system on or off.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems

Historically, centrally computed algorithms have been the primary means of power system optimization and control. With increasing penetrations of distributed energy resources requiring optimization and control of power systems with many controllable devices, distributed algorithms have been the subject of significant research interest. Here, this paper surveys the literature of distributed algorithms with applications to optimization and control of power systems. In particular, this paper reviews distributed algorithms for offline solution of optimal power flow (OPF) problems as well as online algorithms for real-time solution of OPF, optimal frequency control, optimal voltage control, and optimal wide-area control problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Transcriptomic Network Analysis of Cyanobacterial-Methylotroph Interactions in Coculture and Axenic Conditions

A previous study demonstrated the potential for Cyanobacterial-Methylotroph cocultures to facilitate biogas processing as well as to be used in other biotechnological applications. To advance this technology, we investigated potential interactions between Cyanobacterium stanieri HL-69 (HL69) and Methylotuvimicrobium alkaliphilum 20Z (20Z) by inferring and analyzing gene co-expression networks under co-culture and axenic conditions. Five different co-expression networks were examined. These networks were inferred using gene expression profiles for 20Z axenic condition, HL-69 axenic, HL-69, 20Z coculture, HL-69 coculture, and cross-species HL-69-20Z coculture. Through the analysis of node (gene) betweenness and node normalized degree values in all five network cases, we compared adjustments in gene expression between growth conditions (axenic vs co-culture) as well as identify biological functions relevant to interspecies interactions. This analysis was done to distinguish between gene interactions within an organism and gene interactions between two organisms. Moreover, for all five cases we investigated two different network cutoff levels of 3,000 and 10,000. By shedding light on inter- and intra- species interactions, we hope to gain a better understanding of how these two organisms interact. This research will allow the investigation of further biotechnological applications of coculture systems and optimization of such applications for biotechnological purposes.

59 BASIC BIOLOGICAL SCIENCES↗

Recent Experiences in Multidisciplinary Analysis and Optimization, part 2

The papers presented at the NASA Symposium on Recent Experiences in Multidisciplinary Analysis and Optimization held at NASA Langley Research Center, Hampton, Virginia, April 24 to 26, 1984 are given. The purposes of the symposium were to exchange information about the status of the application of optimization and the associated analyses in industry or research laboratories to real life problems and to examine the directions of future developments.

Sobieski, J.↗

DXT: Darshan eXtended Tracing

As modern supercomputers evolve to exascale, their I/O subsystems are becoming increasingly complex, making optimization of I/O for scientific applications a daunting task. Although I/O profiling tools facilitate the process of optimizing application I/O performance, legacy profiling tools lack flexibility in their level of detail and ability to correlate traces with other sources of data. Additionally, a lack of robust trace analysis tools makes it difficult to derive actionable insights from large-scale I/O traces. Darshan is an HPC I/O characterization tool that records statistics in a lightweight manner that makes it appropriate for full-time production deployment. However, Darshan’s default characterization mechanism records information at a fixed granularity. We augment Darshan by proposing Darshan eXtended Tracing (DXT) for more detailed profiling of I/O software stacks. DXT enables users and administrators to vary the level of fidelity captured by Darshan at run time without modifying or recompiling applications. This capability facilitates systematic analysis on the I/O behavior of applications and can provide useful application kernel I/O traces to help advance parallel I/O research. We have demonstrated the power of DXT by obtaining a wide range of useful statistics for multiple case studies, and we further show that DXT is able to do so same with negligible overhead.

97 MATHEMATICS AND COMPUTING↗