Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematical 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 541 records · Page 30

Structural sizing considerations for large space platforms

Structural optimization studies are made using mathematical programming techniques to examine minimum mass structural proportions of deployable and erectable tetrahedral truss platforms subject to the integrated effects of practical design requirements. Considerations integrated into the optimization process are: 1) lowest natural frequencies of the platform and individual platform components (struts); 2) packaging constraints imposed by the Shuttle cargo bay capacity; 3) initial curvature of the struts; 4) column buckling of the struts due to gravity gradient, orbital transfer, strut length tolerance, or design loads; and 5) practical lower limits for strut diameter and wall thickness. Ultra-low mass designs are shown to be possible with strut proportions much more slender than those conventionally used for earthbound application.

Heard, W. L., Jr.↗

Improving Simulated Annealing by Replacing Its Variables with Game-Theoretic Utility Maximizers

The game-theory field of Collective INtelligence (COIN) concerns the design of computer-based players engaged in a non-cooperative game so that as those players pursue their self-interests, a pre-specified global goal for the collective computational system is achieved as a side-effect. Previous implementations of COIN algorithms have outperformed conventional techniques by up to several orders of magnitude, on domains ranging from telecommunications control to optimization in congestion problems. Recent mathematical developments have revealed that these previously developed algorithms were based on only two of the three factors determining performance. Consideration of only the third factor would instead lead to conventional optimization techniques like simulated annealing that have little to do with non-cooperative games. In this paper we present an algorithm based on all three terms at once. This algorithm can be viewed as a way to modify simulated annealing by recasting it as a non-cooperative game, with each variable replaced by a player. This recasting allows us to leverage the intelligent behavior of the individual players to substantially improve the exploration step of the simulated annealing. Experiments are presented demonstrating that this recasting significantly improves simulated annealing for a model of an economic process run over an underlying small-worlds topology. Furthermore, these experiments reveal novel small-worlds phenomena, and highlight the shortcomings of conventional mechanism design in bounded rationality domains.

Wolpert, David H.↗

Applied Mathematics at the U.S. Department of Energy: Past, Present and a View to the Future

Over the past half-century, the Applied Mathematics program in the U.S. Department of Energy's Office of Advanced Scientific Computing Research has made significant, enduring advances in applied mathematics that have been essential enablers of modern computational science. Motivated by the scientific needs of the Department of Energy and its predecessors, advances have been made in mathematical modeling, numerical analysis of differential equations, optimization theory, mesh generation for complex geometries, adaptive algorithms and other important mathematical areas. High-performance mathematical software libraries developed through this program have contributed as much or more to the performance of modern scientific computer codes as the high-performance computers on which these codes run. The combination of these mathematical advances and the resulting software has enabled high-performance computers to be used for scientific discovery in ways that could only be imagined at the program's inception. Our nation, and indeed our world, face great challenges that must be addressed in coming years, and many of these will be addressed through the development of scientific understanding and engineering advances yet to be discovered. The U.S. Department of Energy (DOE) will play an essential role in providing science-based solutions to many of these problems, particularly those that involve the energy, environmental and national security needs of the country. As the capability of high-performance computers continues to increase, the types of questions that can be answered by applying this huge computational power become more varied and more complex. It will be essential that we find new ways to develop and apply the mathematics necessary to enable the new scientific and engineering discoveries that are needed. In August 2007, a panel of experts in applied, computational and statistical mathematics met for a day and a half in Berkeley, California to understand the mathematical developments required to meet the future science and engineering needs of the DOE. It is important to emphasize that the panelists were not asked to speculate only on advances that might be made in their own research specialties. Instead, the guidance this panel was given was to consider the broad science and engineering challenges that the DOE faces and identify the corresponding advances that must occur across the field of mathematics for these challenges to be successfully addressed. As preparation for the meeting, each panelist was asked to review strategic planning and other informational documents available for one or more of the DOE Program Offices, including the Offices of Science, Nuclear Energy, Fossil Energy, Environmental Management, Legacy Management, Energy Efficiency & Renewable Energy, Electricity Delivery & Energy Reliability and Civilian Radioactive Waste Management as well as the National Nuclear Security Administration. The panelists reported on science and engineering needs for each of these offices, and then discussed and identified mathematical advances that will be required if these challenges are to be met. A review of DOE challenges in energy, the environment and national security brings to light a broad and varied array of questions that the DOE must answer in the coming years. A representative subset of such questions includes: (1) Can we predict the operating characteristics of a clean coal power plant? (2) How stable is the plasma containment in a tokamak? (3) How quickly is climate change occurring and what are the uncertainties in the predicted time scales? (4) How quickly can an introduced bio-weapon contaminate the agricultural environment in the US? (5) How do we modify models of the atmosphere and clouds to incorporate newly collected data of possibly of new types? (6) How quickly can the United States recover if part of the power grid became inoperable? (7) What are optimal locations and communication protocols for sensing devices in a remote-sensing network? (8) How can new materials be designed with a specified desirable set of properties? In comparing and contrasting these and other questions of importance to DOE, the panel found that while the scientific breadth of the requirements is enormous, a central theme emerges: Scientists are being asked to identify or provide technology, or to give expert analysis to inform policy-makers that requires the scientific understanding of increasingly complex physical and engineered systems. In addition, as the complexity of the systems of interest increases, neither experimental observation nor mathematical and computational modeling alone can access all components of the system over the entire range of scales or conditions needed to provide the required scientific understanding.

99 GENERAL AND MISCELLANEOUS↗

graphenv: a Python library for reinforcement learning on graph search spaces

Many important and challenging problems in combinatorial optimization (CO) can be expressed as graph search problems, in which graph vertices represent full or partial solutions and edges represent decisions that connect them. Graph structure not only introduces strong relational inductive biases for learning (Battaglia et al., 2018) - in this context, by providing a way to explicitly model the value of transitioning (along edges) between one search state (vertex) and the next - but lends itself to problems both with and without clearly defined algebraic structure. For example, classic CO problems on graphs such as the Traveling Salesman Problem (TSP) can be expressed as either pure graph search or integer programs. Other problems, however, such as molecular optimization, do no have concise algebraic formulations and yet are readily implemented as a graph search (V. et al., 2022; Zhou et al., 2019). Such "model-free" problems constitute a large fraction of modern reinforcement learning (RL) research owing to the fact that it is often much easier to write a forward simulation that expresses all of the state transitions and rewards, than to write down the precise mathematical expression of the full optimization problem. In the case of molecular optimization, for example, one can use domain knowledge alongside existing software libraries to model the effect of adding a single bond or atom to an existing but incomplete molecule, and let the RL algorithm build a model of how good a given decision is by "experiencing" the simulated environment many times through. In contrast, a model-based mathematical formulation that fully expresses all the chemical and physical constraints is intractable. In recent years, RL has emerged as an effective paradigm for optimizing searches over graphs and led to state-of-the-art heuristics for games like Go and chess, as well as for classical CO problems such as the TSP. This combination of graph search and RL, while powerful, requires non-trivial software to execute, especially when combining advanced state representations such as Graph Neural Networks (GNN) with scalable RL algorithms.

97 MATHEMATICS AND COMPUTING↗

Time complexity and gate complexity

We formulate and investigate the simplest version of time-optimal quantum computation theory (TO-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions. This version of TO-QCT is also considered as optimality by sub-Riemannian geodesic length. The work has two aims: One is to develop a TO-QCT itself based on a physically natural concept of time, and the other is to pursue the possibility of using TO-QCT as a tool to estimate the complexity in conventional gate-optimal quantum computation theory (GO-QCT). In particular, we investigate to what extent is true the following statement: Time complexity is polynomial in the number of qubits if and only if gate complexity is also. In the analysis, we relate TO-QCT and optimal control theory (OCT) through fidelity-optimal computation theory (FO-QCT); FO-QCT is equivalent to TO-QCT in the limit of unit optimal fidelity, while it is formally similar to OCT. We then develop an efficient numerical scheme for FO-QCT by modifying Krotov's method in OCT, which has a monotonic convergence property. We implemented the scheme and obtained solutions of FO-QCT and of TO-QCT for the quantum Fourier transform and a unitary operator that does not have an apparent symmetry. The former has a polynomial gate complexity and the latter is expected to have an exponential one which is based on the fact that a series of generic unitary operators has an exponential gate complexity. The time complexity for the former is found to be linear in the number of qubits, which is understood naturally by the existence of an upper bound. The time complexity for the latter is exponential in the number of qubits. Thus, both the targets seem to be examples satisfyng the preceding statement. The typical characteristics of the optimal Hamiltonians are symmetry under time reversal and constancy of one-qubit operation, which are mathematically shown to hold in fairly general situations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improving Simulated Annealing by Recasting it as a Non-Cooperative Game

The game-theoretic field of COllective INtelligence (COIN) concerns the design of computer-based players engaged in a non-cooperative game so that as those players pursue their self-interests, a pre-specified global goal for the collective computational system is achieved "as a side-effect". Previous implementations of COIN algorithms have outperformed conventional techniques by up to several orders of magnitude, on domains ranging from telecommunications control to optimization in congestion problems. Recent mathematical developments have revealed that these previously developed game-theory-motivated algorithms were based on only two of the three factors determining performance. Consideration of only the third factor would instead lead to conventional optimization techniques like simulated annealing that have little to do with non-cooperative games. In this paper we present an algorithm based on all three terms at once. This algorithm can be viewed as a way to modify simulated annealing by recasting it as a non-cooperative game, with each variable replaced by a player. This recasting allows us to leverage the intelligent behavior of the individual players to substantially improve the exploration step of the simulated annealing. Experiments are presented demonstrating that this recasting improves simulated annealing by several orders of magnitude for spin glass relaxation and bin-packing.

Wolpert, David↗

Accumulated approximation: A new method for structural optimization by iterative improvement

A new method for the solution of non-linear mathematical programming problems in the field of structural optimization is presented. It is an iterative scheme which for each iteration refines the approximation of objective and constraint functions by accumulating the function values of previously visited design points. The method has proven to be competitive for a number of well-known examples of which one is presented here. Furthermore because of the accumulation strategy, the method produces convergence even when the sensitivity analysis is inaccurate.

Rasmussen, John↗

Comprehensive Energy Assessment: EE and RE Project Optimization Modeling for United States Pacific Command (USPACOM) American Recovery and Reinvestment Act (ARRA) FEMP Technical Assistance

This report summarizes a study and corresponding model development conducted in support of the United States Pacific Command (USPACOM) as part of the Federal Energy Management Program (FEMP) American Reinvestment and Recovery Act (ARRA). This research was aimed at developing a mathematical programming framework and accompanying optimization methodology in order to simultaneously evaluate energy efficiency (EE) and renewable energy (RE) opportunities. Once developed, this research then demonstrated this methodology at a USPACOM installation - Camp H.M. Smith, Hawaii. We believe this is the first time such an integrated, joint EE and RE optimization methodology has been constructed and demonstrated.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Air breathing engine/rocket trajectory optimization

This research has focused on improving the mathematical models of the air-breathing propulsion systems, which can be mated with the rocket engine model and incorporated in trajectory optimization codes. Improved engine simulations provided accurate representation of the complex cycles proposed for advanced launch vehicles, thereby increasing the confidence in propellant use and payload calculations. The versatile QNEP (Quick Navy Engine Program) was modified to allow treatment of advanced turboaccelerator cycles using hydrogen or hydrocarbon fuels and operating in the vehicle flow field.

Smith, V. K., III↗

Optimal air-breathing launch vehicle design

A generalized two-point boundary problem methodology, similar to techniques used in deterministic optimal control studies, is applied to the design and flight analysis of a two-stage air-breathing launch vehicle. Simultaneous consideration is given to configuration and trajectory by treating geometry, dynamic discontinuities, and time-dependent flight variables all as controls to be optimized with respect to a single mathematical performance measure. While minimizing fuel consumption, inequality constraints are applied to dynamic pressure and specific force. The optimal system fuel consumption and staging Mach number are found to vary little with changes in the inequality constraints due to substantial geometry and trajectory adjustments. Staging, from an air-breathing first stage to a rocket-powered second stage, consistently occurs near Mach 3.5. The dynamic pressure bound has its most pronounced effects on vehicle geometry, particularly the air-breathing propulsion inlet area, and on the first-stage altitude profile. The specific force has its greatest influence on the second-stage thrust history.

Hattis, P. D.↗

Expansion and orthogonalization of measured modes for structure identification

The purpose was to investigate a new simultaneous expansion/orthogonalization method in comparison with two previously published expansion methods and a widely used orthogonalization technique. Each expansion method uses data from an analytical model of the structure to complete the estimate of the mode shape vectors. Berman and Nagy used Guyan expansion in their work with improving analytical models. In this method, modes are expanded one at a time, producing a set not orthogonal with respect to the mass matrix. Baruch and Bar Itzhack's optimal orthogonalization procedure was used to subsequently adjust the expanded modes. A second expansion technique was presented by O'Callahan, Avitabile, and Reimer and separately by Kammer. Again, modes are expanded individually and orthogonalized after expansion with the same optimal technique as above. Finally, a simultaneous expansion/orthogonalization method was developed from the orthogonal Procrustes problem of computational mathematics. In this method modes are optimally expanded as a set and orthogonal with respect to the mass matrix as a result. Two demonstation problems were selected for the comparison of the methods described. The first problem is an 8 degree of freedom spring-mass problem first presented by Kabe. Several conditions were examined for expansion method including the presence of errors in the measured data and in the analysis models. As a second demonstration problem, data from tests of laboratory scale model truss structures was expanded for system identification. Tests with a complete structure produced a correlated analysis model and the stiffness and mass matrices. Tests of various damaged configurations produced measured data for 6 modes at 14 dof locations.

Smith, Suzanne Weaver↗

Network Optimization of the Electrosynthesis of Chemicals from CO2

Carbon dioxide electroreduction (ECO2R) is gaining attention due to its capacity to mitigate CO2 emissions while using electricity that would otherwise be curtailed. Its foreseeable industrial implementation requires of holistic methods to assess the technological and economic performance of ECO2R processes and integrate them in current chemical supply chains and power systems. Here, we combine techno-economic assessment and mathematical programming to find the optimal paths to electroreduce CO2 into valuable chemicals under variable electricity prices. The proposed approach is tested with a case study addressing the CO2 capture from flue gas or direct air and its electricity-powered reduction into carbon monoxide, formic acid or multi-carbon compounds. The results obtained demonstrate the ability of the framework to build ECO2R networks and provide operation profiles that respond to fluctuating electricity prices.

carbon dioxide↗

Aerodynamic Improvement of a Compact Centrifugal Compressor

For the example of the JetCat P-200RX turbojet engine, optimization of the diffuser and straightening unit of a compact centrifugal compressor is considered, on the basis of a mathematical model of viscous turbulent air flow. The goal of optimization is to increase the isentropic (adiabatic) efficiency of the compressor.

42 ENGINEERING↗

The Mathematics of Navigating the Solar System

In navigating spacecraft throughout the solar system, the space navigator relies on three academic disciplines - optimization, estimation, and control - that work on mathematical models of the real world. Thus, the navigator determines the flight path that will consume propellant and other resources in an efficient manner, determines where the craft is and predicts where it will go, and transfers it onto the optimal trajectory that meets operational and mission constraints. Mission requirements, for example, demand that observational measurements be made with sufficient precision that relativity must be modeled in collecting and fitting (the estimation process) the data, and propagating the trajectory. Thousands of parameters are now determined in near real-time to model the gravitational forces acting on a spacecraft in the vicinity of an irregularly shaped body. Completing these tasks requires mathematical models, analyses, and processing techniques. Newton, Gauss, Lambert, Legendre, and others are justly famous for their contributions to the mathematics of these tasks. More recently, graduate students participated in research to update the gravity model of the Saturnian system, including higher order gravity harmonics, tidal effects, and the influence of the rings. This investigation was conducted for the Cassini project to incorporate new trajectory modeling features in the navigation software. The resulting trajectory model will be used in navigating the 4-year tour of the Saturnian satellites. Also, undergraduate students are determining the ephemerides (locations versus time) of asteroids that will be used as reference objects in navigating the New Millennium's Deep Space 1 spacecraft autonomously.

Hintz, Gerald↗

Structural efficiency studies of corrugated compression panels with curved caps and beaded webs

Curved cross-sectional elements are employed in structural concepts for minimum-mass compression panels. Corrugated panel concepts with curved caps and beaded webs are optimized by using a nonlinear mathematical programming procedure and a rigorous buckling analysis. These panel geometries are shown to have superior structural efficiencies compared with known concepts published in the literature. Fabrication of these efficient corrugation concepts became possible by advances made in the art of superplastically forming of metals. Results of the mass optimization studies of the concepts are presented as structural efficiency charts for axial compression.

Davis, R. C.↗

Stability and optimal control theory of hereditary systems with applications from oscillating flying vehicles, mechanical systems, and robotics

The author derives an equation determining the dynamics of the deterministic model of a flying vehicle. He next examines a simplified mechanical problem whose optimal feedback control strategy is investigated. From there robotics are incorporated into the mathematical model to develop an equation describing optimal control of the dynamics.

Chukwu, Ethelbert Nwakuche↗

STUDY OF THE DESIGN REPRESENTATION METHODS FOR THE OPTIMIZATION OF MULTI-LAYER COMPOSITE STRUCTURES

The purpose of multi-layer composite structure optimization is to find the optimal composite layout, such that superior structure performances and lightweight can be achieved. However, the existing optimization methods have a low efficiency when applied to the multi-component, multi-layer composite structure. Such low efficiency is caused by the high dimensionality and the inherent shortcomings of the existing design representation methods. In this work, two composite layout representation methods are compared to better understand their impacts on optimization. The root cause of the low efficiency is identified, and its influences are also quantified using three metrics. Furthermore, a new Representation-Switch Optimization (RSO) strategy is proposed. This strategy improves the search efficiency by switching the design representation methods during the optimization process. Three benchmark studies, two mathematical examples and one real engineering example, are conducted to demonstrate the impact of design representation methods on the optimization results, as well as the effectiveness of the proposed optimization strategy.

Xu, Hongyi↗

Outcomes and Insights From Simplified Analytic Trajectory Optimization for a Tethered Underwater Kite

This letter formulates and solves a periodic trajectory optimization problem for a tethered underwater kite. The goal is to maximize the average mechanical power harvested by the kite. The type of kite considered in this letter extracts electricity from ocean currents by moving cross-current as its reel away from its base station, and consumes electricity to reel back. The problem of optimizing this kite’s trajectory is challenging due to the high dimensionality and nonlinearity of its dynamics. To tackle this challenge, the literature often separates the problem into two subproblems focusing on optimizing the cross-current and the reel-in/reel-out components of the trajectory, respectively, which may be sub-optimal. In contrast, this letter solves for the combined cross-current and reel-in/reel-out trajectory by linearizing the dynamics of the kite around a zero-power reference equilibrium trajectory in spherical coordinates. This allows the trajectory optimization problem to be solved analytically for simple sinusoidal input perturbations from equilibrium. Here we use linear quadratic regulation to enable the nonlinear kite model to track the optimized trajectory. The result is a computationally efficient approach that achieves an attractive Loyd factor of 19.9%, while providing important insights into the nature of the optimal trajectory.

42 ENGINEERING↗