Search NASA⌕ Search

SEARCH · Search NASA

Results for “solution 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,027 records · Page 57
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Bayesian optimization algorithms for accelerator physics

Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations. The effectiveness of optimization algorithms in discovering ideal solutions for complex challenges with limited resources often determines the problem complexity these methods can address. The accelerator physics community has recognized the advantages of Bayesian optimization algorithms, which leverage statistical surrogate models of objective functions to effectively address complex optimization challenges, especially in the presence of noise during accelerator operation and in resource-intensive physics simulations. In this review article, we offer a conceptual overview of applying Bayesian optimization techniques toward solving optimization problems in accelerator physics. We begin by providing a straightforward explanation of the essential components that make up Bayesian optimization techniques. We then give an overview of current and previous work applying and modifying these techniques to solve accelerator physics challenges. Finally, we explore practical implementation strategies for Bayesian optimization algorithms to maximize their performance, enabling users to effectively address complex optimization challenges in real-time beam control and accelerator design. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗
NASA NTRS1967

Computer program for mass optional solutions of some endpoint trajectory problems

Optimization of trajectories for propellant comsumption is achieved by incorporating a coast arc device into a three-dimensional fixed end-point steepest ascent computer program. It calculates a trajectory between any two points in space defined by initial and final position vectors, without restrictions on thrust or orbit characteristics.

Bennett, A. G.↗
DOE OSTI2024

Strategically designed metal-free deep-ultraviolet birefringent crystals with superior optical properties

Finding new birefringent materials with deep-ultraviolet (DUV, λ < 200 nm) transparency is urgent, as current commercial materials cannot meet the rapidly growing demands in related application fields. Herein, three guanidinium-based compounds, C(NH 2 ) 3 CH 3 SO 3 , β-C(NH 2 ) 3 Cl, and γ-C(NH 2 ) 3 Cl, all featuring [C(NH 2 ) 3 ·X] ∞ (X = CH 3 SO 3 and Cl) pseudo layers, were designed through structural motif tailoring. Theoretical calculations indicate that these metal-free compounds all possess broad bandgaps (6.49–6.71 eV, HSE06) and remarkable birefringence (cal. 0.166–0.211 @ 1064 nm). Centimeter-sized C(NH 2 ) 3 CH 3 SO 3 crystals have been grown using a feasible aqua-solution method. Subsequently, to further optimize the properties, β/γ-C(NH 2 ) 3 Cl was remolded by further tailoring the [C(NH 2 ) 3 ] + cationic unit and the acceptor Cl - anion, and then the fourth compound NH 2 COF was theoretically constructed. Interestingly, NH 2 COF exhibits the desired coexistence of a wider bandgap (7.87 eV, HSE06) and giant birefringence (cal. 0.241 @ 1064 nm) attributed to its higher density of well-aligned birefringence-active groups (BAGs). Furthermore, among these four designed compounds, C(NH 2 ) 3 CH 3 SO 3 has been experimentally synthesized and exhibits a short UV cutoff edge. Centimeter-sized crystals have been grown using a feasible aqueous solution method. This study provides an effective strategy to optimize the density of BAGs for large birefringence and offers valuable insights into the strategic design of metal-free DUV birefringent crystals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRSDate not supplied

Mixed Integer Linear Programming in Planning

This project, Activity Planning with Resources for the Exploration of Space (APRES), uses a mixed-integer linear program (MILP) to solve planning problems. This work enables APRES to interpret a model file and output a solution with improved human readability. A plan model is optimized using a MILP solver and the best solution is taken. Once a plan is generated, it is parsed allowing it to retain only desired information and modified for swift human readability.

Christina Erwin↗
NASA NTRS1990

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↗
NASA NTRS1985

An optimized rotation-axis model-following controller for STS orbiter attitude maneuvers

This paper describes a new controller for automatic attitude maneuvers of the Space Shuttle Orbiter. The controller incorporates a new solution algorithm for partially linearized, fuel-optimal maneuvers for RCS jet controlled spacecraft. These solutions provide model trajectories and jet commands that are easily tracked using a feed-forward, feedback controller structure. The result is a substantial performance improvement over the current Orbiter attitude maneuver controller. The paper discusses optimal maneuvers for this type of vehicle, giving detail of the solution algorithm. Closed-loop controller design and implementation is discussed. Detailed performance results are presented.

Redding, D. C.↗
NASA NTRS2017

Fast Optimization for Aircraft Descent and Approach Trajectory

We address problem of on-line scheduling of the aircraft descent and approach trajectory. We formulate a general multiphase optimal control problem for optimization of the descent trajectory and review available methods of its solution. We develop a fast algorithm for solution of this problem using two key components: (i) fast inference of the dynamical and control variables of the descending trajectory from the low dimensional flight profile data and (ii) efficient local search for the resulting reduced dimensionality non-linear optimization problem. We compare the performance of the proposed algorithm with numerical solution obtained using optimal control toolbox General Pseudospectral Optimal Control Software. We present results of the solution of the scheduling problem for aircraft descent using novel fast algorithm and discuss its future applications.

Luchinsky, Dmitry G.↗
DOE OSTI2026

Technoeconomic Design Optimization for Fast Reactors. Part I: Workflow Development and Case Study for Small LFR District Energy Application

The nuclear industry is developing small reactor designs that can target a variety of deployment locations and energy products. Smaller nuclear designs have traditionally struggled to handle the steep trade-offs between size and cost that have historically incentivized large reactors. This motivates computational optimization of small reactors to minimize costs and quantify the trade-off between size and cost. In this paper, the cost/size trade-off for a small fast reactor is derived using a multi-objective genetic algorithm optimization, with steady-state, transient, and cost analysis of the fast reactor being performed. Specifically, the method is demonstrated on a small 10- to 120-MW(thermal) U-Pu-Zr–fueled lead-cooled fast reactor with a 10-year core life for district energy applications, which can have a thermal load compatible with this range. The results reinforced that fast reactor cores at the lower end of this power range suffer cost penalties due to critical mass considerations. It was found that high power density cores with strong reactivity swings and many control rods were favored over designing to minimize reactivity swing. Furthermore, this contrasts with some traditional configurations designed using engineering judgment and demonstrates that optimizers can find nontraditional but realistic solutions, along with demonstrating the value of incorporating cost functions into whole-reactor design optimization.

Fast reactor↗
DOE OSTI2025

hdsullivan/ResSR

This is the official implementation of ResSR [1]. ResSR is a computationally efficient MSI-SR method that achieves high-quality reconstructions by using a closed-form spectral decomposition along with a spatial residual correction. ResSR applies singular value decomposition to identify correlations across spectral bands, uses pixel-wise computation to upsample the MSI, and then applies a residual correction process to correct the high-spatial frequency components of the upsampled bands. While ResSR is formulated as the solution to a spatially-coupled optimization problem, we use pixel-wise regularization and derive an approximate closed-form solution, resulting in a pixel-wise algorithm with a dramatic reduction in computation that achieves state-of-the-art reconstructions. [1] Duba-Sullivan, H., Reid, E. J., Voisin, S., Bouman, C. A., & Buzzard, G. T. (2024). ResSR: A Computationally Efficient Residual Approach to Super-Resolving Multispectral Images. arXiv preprint arXiv:2408.13225.

Duba-Sullivan, Haley [Oak Ridge National Laborator↗
NASA NTRS1986

Numerical difficulties associated with using equality constraints to achieve multi-level decomposition in structural optimization

There has been recent interest in multidisciplinary multilevel optimization applied to large engineering systems. The usual approach is to divide the system into a hierarchy of subsystems with ever increasing detail in the analysis focus. Equality constraints are usually placed on various design quantities at every successive level to ensure consistency between levels. In many previous applications these equality constraints were eliminated by reducing the number of design variables. In complex systems this may not be possible and these equality constraints may have to be retained in the optimization process. In this paper the impact of such a retention is examined for a simple portal frame problem. It is shown that the equality constraints introduce numerical difficulties, and that the numerical solution becomes very sensitive to optimization parameters for a wide range of optimization algorithms.

Thareja, R.↗
NASA NTRS1994

A Numerical Comparison of Barrier and Modified Barrier Methods for Large-Scale Bound-Constrained Optimization

When a classical barrier method is applied to the solution of a nonlinear programming problem with inequality constraints, the Hessian matrix of the barrier function becomes increasingly ill-conditioned as the solution is approached. As a result, it may be desirable to consider alternative numerical algorithms. We compare the performance of two methods motivated by barrier functions. The first is a stabilized form of the classical barrier method, where a numerically stable approximation to the Newton direction is used when the barrier parameter is small. The second is a modified barrier method where a barrier function is applied to a shifted form of the problem, and the resulting barrier terms are scaled by estimates of the optimal Lagrange multipliers. The condition number of the Hessian matrix of the resulting modified barrier function remains bounded as the solution to the constrained optimization problem is approached. Both of these techniques can be used in the context of a truncated-Newton method, and hence can be applied to large problems, as well as on parallel computers. In this paper, both techniques are applied to problems with bound constraints and we compare their practical behavior.

Nash, Stephen G.↗
NASA NTRS1983

Closed-form solutions for feedback control with terminal constraints

The problem of closed-loop control of maneuvers between two states for linear dynamical systems, subject to an arbitrarily specified terminal state, is considered. The feedback controller design is based on finite-time quadratic regulator theory. Closed-form expressions for the optimal control law are developed. Solutions are presented for both conventional and smoothed control profiles with fixed and/or free end condition problems. In the maneuvers using control-rate penalties, smooth profiles are generated throughout the maneuvers, in the sense that the initial condition jump discontinuities have been eliminated. Several examples involving large-angle maneuvers of a spacecraft are demonstrated. Results include control maneuvers from one state to another such as rest to rest and spin to rest, which effectively justify the solutions developed in this paper.

Juang, J.-N.↗
NASA NTRS2018

Solution of Ordinary Differential Equations in Gradient-Based Multidisciplinary Design Optimization

A gradient-based approach to multidisciplinary design optimization enables efficient scalability to large numbers of design variables. However, the need for derivatives causes difficulties when integrating ordinary differential equations (ODEs) in models. To simplify this, we propose the use of the general linear methods framework, which unifies all Runge-Kutta and linear multistep methods. This approach enables rapid implementation of integration methods without the need to differentiate each one, even in a gradient-based optimization context. We also develop a new parallel time integration algorithm that enables vectorization across time steps. We present a set of benchmarking results using a stiff ODE, a non-stiff nonlinear ODE, and an orbital dynamics ODE, and compare integration methods. In a modular gradient-based multidisciplinary design optimization context, we find that the new parallel time integration algorithm with high-order implicit methods, especially Gauss-Legendre collocation, is the best choice for a broad range of problems.

Hwang, John T.↗
NASA NTRS1992

An inverse dynamics approach to trajectory optimization and guidance for an aerospace plane

The optimal ascent problem for an aerospace planes is formulated as an optimal inverse dynamic problem. Both minimum-fuel and minimax type of performance indices are considered. Some important features of the optimal trajectory and controls are used to construct a nonlinear feedback midcourse controller, which not only greatly simplifies the difficult constrained optimization problem and yields improved solutions, but is also suited for onboard implementation. Robust ascent guidance is obtained by using combination of feedback compensation and onboard generation of control through the inverse dynamics approach. Accurate orbital insertion can be achieved with near-optimal control of the rocket through inverse dynamics even in the presence of disturbances.

Lu, Ping↗
NASA NTRS1972

Control system estimation and design for aerospace vehicles with time delay

The problems of estimation and control of discrete, linear, time-varying systems are considered. Previous solutions to these problems involved either approximate techniques, open-loop control solutions, or results which required excessive computation. The estimation problem is solved by two different methods, both of which yield the identical algorithm for determining the optimal filter. The partitioned results achieve a substantial reduction in computation time and storage requirements over the expanded solution, however. The results reduce to the Kalman filter when no delays are present in the system. The control problem is also solved by two different methods, both of which yield identical algorithms for determining the optimal control gains. The stochastic control is shown to be identical to the deterministic control, thus extending the separation principle to time delay systems. The results obtained reduce to the familiar optimal control solution when no time delays are present in the system.

Allgaier, G. R.↗
NASA NTRS1984

Alternative gravity-assist sequences for the ISEE-3 escape trajectory

The International Sun-Earth Explorer-3 (ISEE-3) was moved from its mission halo orbit upstream of the earth's magnetosphere on June 10, 1982. Multiple lunar swingby maneuvers were then used to shape the trajectory for extensive exploration of the distant geomagnetic tail and finally to place the spacecraft on a course that will intercept the comet Giacobini-Zinner on September 11, 1985. With this new mission objective, the spacecraft was renamed the International Cometary Explorer (ICE). A double-lunar-swingby control technique involving five passes by the moon was eventually implemented to accomplish this, but in the process of finding this solution several feasible, though less optimal, alternative trajectory sequences implementing the same procedure were discovered. This paper provides a descriptive comparison of these very different orbital profiles and serves to illustrate the utility and great flexibility of this orbital control procedure. Targeting methodology for finding constrained solutions in this space is also presented.

Muhonen, D.↗