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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Optimal Control using Composite Bernstein Approximants

In this work, we present composite Bernstein polynomials as a direct collocation method for approximating optimal control problems. An analysis of the convergence properties of composite Bernstein polynomials is provided, and beneficial properties of composite Bernstein polynomials for the solution of optimal control problems are discussed. The efficacy of the proposed approximation method is demonstrated through a bang-bang example. Lastly, we apply this method to a motion planning problem, offering a practical solution that emphasizes the ability of this method to solve complex optimal control problems.

Gage MacLin↗
NASA NTRS1998

On Managing the Use of Surrogates in General Nonlinear Optimization and MDO

This paper is concerned with a trust region approximation management framework (AMF) for solving the nonlinear programming problem in general and multidisciplinary optimization problems in particular The intent of the AMF methodology is to facilitate the solution of optimization problems with high-fidelity models. While such models are designed to approximate the physical phenomena they describe to a high degree of accuracy, their use in a repetitive procedure, for example, iterations of an optimization or a search algorithm, make such use prohibitively expensive. An improvement in design with lower-fidelity, cheaper models, however, does not guarantee a corresponding improvement for the higher-fidelity problem. The AMF methodology proposed here is based on a class of multilevel methods for constrained optimization and is designed to manage the use of variable-fidelity approximations or models in a systematic way that assures convergence to critical points of the original high-fidelity problem.

Alexandrov, Natalia M.↗
DOE OSTI2026

Control co-design under uncertainty for offshore wind farms: Optimizing grid integration, energy storage, and market participation

Offshore wind farms (OWFs) are set to significantly contribute to global decarbonization efforts. Developers often use a sequential approach to optimize design variables and market participation for grid-integrated offshore wind farms. However, this method can lead to sub-optimal system performance, and uncertainties associated with renewable resources are often overlooked in decision-making. Here, this paper proposes a control co-design approach, optimizing design and control decisions for integrating OWFs into the power grid while considering energy market and primary frequency market participation. Additionally, we introduce optimal sizing solutions for energy storage systems deployed onshore to enhance revenue for OWF developers over time. This framework addresses uncertainties related to wind resources and energy prices. We analyze five U.S. west-coast offshore wind farm locations and potential interconnection points, as identified by the Bureau of Ocean Energy Management (BOEM). Results show that optimized control co-design solutions can increase market revenue by 3.2% and provide flexibility in managing wind resource uncertainties.

Control Co-design↗
DOE OSTI2025

Quantifying the impact of precision errors on quantum approximate optimization algorithms

The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of analog precision errors on QAOA performance from the perspective of both algorithmic training and performance guarantees. Leveraging cumulant expansions, we recast the faulty QAOA as a control problem in which precision errors are expressed as multiplicative control noise and derive bounds on the performance of QAOA. We show using both analytical techniques and numerical simulations that fixed precision implementations of QAOA circuits are subject to an exponential degradation in performance dependent upon the number of optimal QAOA layers and magnitude of the precision error. Despite this significant reduction, we show that it is possible to mitigate precision errors in QAOA via digitization of the variational parameters at the cost of increasing circuit depth.

quantum algorithms↗
NASA NTRS1995

Design of High-Accuracy Multiple Flyby Trajectories Using Constrained Optimization

The trajectory optimization technique described in this paper provides several distinct advantages over previous formulations. First, fully numerically integrated trajectory modeling is used. That is, no approximations to the trajectory are made and the inclusion of any level of complicated force models desired is allowed. Second, only trajectory propagation is used so there is no requirement for optimization. This is accomplished by the novel method of splitting the trajectory into independent legs, which are then subjected to constrained optimization. Third, each of the trajectory legs may be specified by any convenient set of parameters particularly useful for that leg. Any of these parameters may then be subject to constraints. Fourth, the nonlinear optimization problem is solved by solving a sequence of linear problems which converges to the optimal nonlinear solution. Fifth, the robustness of this formulation requires little or no user interaction with the optimization once a feasible problem has been posed.

flyby↗
NASA NTRS1987

Distributed computer system enhances productivity for SRB joint optimization

The Programming System for Structural Synthesis software package, which couples structural analysis and optimization, has been distributed over a network of work stations for use in Space Shuttle Solid Rocket Booster joint redesign optimization. Finite difference computing techniques were applied to the optimization gradients in parallel execution, allowing several work stations to simultaneously contribute to the problem's solution. An optimal joint shape was obtained which achieves minimum weight while keeping the gap between joints well closed and limiting structural stresses. The optimization cycle was reduced from two hours to one-half hour.

Rogers, James L., Jr.↗
NASA NTRS2011

Closed-Form and Numerically-Stable Solutions to Problems Related to the Optimal Two-Impulse Transfer Between Specified Terminal States of Keplerian Orbits

The first part of the paper presents some closed-form solutions to the optimal two-impulse transfer between fixed position and velocity vectors on Keplerian orbits when some constraints are imposed on the magnitude of the initial and final impulses. Additionally, a numerically-stable gradient-free algorithm with guaranteed convergence is presented for the minimum delta-v two-impulse transfer. In the second part of the paper, cooperative bargaining theory is used to solve some two-impulse transfer problems when the initial and final impulses are carried by different vehicles or when the goal is to minimize the delta-v and the time-of-flight at the same time.

Senent, Juan↗
NASA NTRS1976

Characteristics of the boundary-layer equations of the minimum time-to-climb problem

In many singular perturbation solutions of optimal control problems, the most difficult numerical task is to solve the boundary-layer equations. However, these equations have a special structure that may often be used to expedite their solution. This paper begins by noting the general nature of the boundary-layer equations for optimal control problems. These results are then applied to the aircraft minimum time-to-climb problem. A specific numerical example is considered to illustrate the characteristics of the solution of the boundary-layer equations for this problem.

Ardema, M. D.↗
NASA NTRS1974

On the design of optimal input signals in system identification

The problem of designing optimal inputs in the identification of multi-input multi-output linear systems with unknown time-varying parameters is considered using a Bayesian approach. A sensitivity index gives a measure of performance for the closed-loop system inputs. The computation of the optimal closed-loop mappings is shown to be a nontrivial exercise in stochastic control with no analytic solution, but optimal open-loop and affine laws yield much more tractable problems. For time-invariant systems, the sensitivity index considered is shown to be equivalent to the trace of the (strictly positive definite) information matrix associated with the system. Numerical examples are given. A Kalman filter is used to estimate the parameters. A necessary condition for the Kalman filter not to diverge when applying linear feedback is also given.

Lopez-Toledo, A. A.↗
NASA NTRS1994

Improving Learning Performance Through Rational Resource Allocation

This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning cost and show that the problem of efficient learning can be cast as a resource optimization problem. Solutions found in this way can be significantly more efficient than the best solutions that do not account for these factors. We introduce a heuristic learning algorithm that approximately solves this optimization problem and document its performance improvements on synthetic and real-world problems.

resource optimization↗
NASA NTRS1971

Comparison of a discrete steepest ascent method with the continuous steepest ascent method for optimal programing

A discrete steepest ascent method which allows controls which are not piecewise constant (for example, it allows all continuous piecewise linear controls) was derived for the solution of optimal programming problems. This method is based on the continuous steepest ascent method of Bryson and Denham and new concepts introduced by Kelley and Denham in their development of compatible adjoints for taking into account the effects of numerical integration. The method is a generalization of the algorithm suggested by Canon, Cullum, and Polak with the details of the gradient computation given. The discrete method was compared with the continuous method for an aerodynamics problem for which an analytic solution is given by Pontryagin's maximum principle, and numerical results are presented. The discrete method converges more rapidly than the continuous method at first, but then for some undetermined reason, loses its exponential convergence rate. A comparsion was also made for the algorithm of Canon, Cullum, and Polak using piecewise constant controls. This algorithm is very competitive with the continuous algorithm.

Childs, A. G.↗
NASA NTRS1990

Optimal orbital rendezvous using high and low thrust

Optimal control theory is used to examine a specific class of spacecraft trajectory problems where high- and low-thrust propulsion systems are utilized. These problems assume a spacecraft is in an established orbit about a planet. It is desired to execute an intercept of a pre-determined position in space in a specified amount of time using an optimal high-thrust program. The spacecraft then returns to the original orbit station using the low-thrust propulsion system in an optimal fashion. A minimum fuel solution is sought using the linearized equations of motion, known as the CW equations, which simplify the necessary computations. Solutions are obtained for problems with a fixed final time. However, for the time-open case, the optimal solution is for the final time to be infinite. With a weighted function of the final time in the performance index, a limited range of optimal single impulse solutions for the time -open case can also be found.

Prussing, John E.↗
NASA NTRS1992

A hybrid approach to near-optimal launch vehicle guidance

This paper evaluates a proposed hybrid analytical/numerical approach to launch-vehicle guidance for ascent to orbit injection. The feedback-guidance approach is based on a piecewise nearly analytic zero-order solution evaluated using a collocation method. The zero-order solution is then improved through a regular perturbation analysis, wherein the neglected dynamics are corrected in the first-order term. For real-time implementation, the guidance approach requires solving a set of small dimension nonlinear algebraic equations and performing quadrature. Assessment of performance and reliability are carried out through closed-loop simulation for a vertically launched 2-stage heavy-lift capacity vehicle to a low earth orbit. The solutions are compared with optimal solutions generated from a multiple shooting code. In the example the guidance approach delivers over 99.9 percent of optimal performance and terminal constraint accuracy.

Leung, Martin S. K.↗
NASA NTRSDate not supplied

A Physics-Based Work-Energy Formulation for Real-Time Trajectory Guidance of A Lunar Lander

Throughout the years, many researchers have calculated and optimized trajectory solutions for lunar landing systems by employing sophisticated mathematical methods, that include: Hamilton’s Principle of Variation, Pontryagin’s maximum principle, and well known convex-optimization techniques among others. Many of these approaches typically require expensive computational resources to achieve convergence in the solution. In an effort to reduce complexity and the computational load required to obtain real-time guidance commands, a simple physics-based work-energy approach has been formulated. This approach is based on the dissipation of the mechanical energy of the vehicle to its final desired energy state required to achieve a safe landing. The rocket engine(s) employed during landing (among other maneuvers) dissipates mechanical energy by both doing work against the velocity vector of the vehicle (thus defining the trajectory path), and by jettisoning mass. Therefore, by solving the energy dissipation problem at every step of the maneuver, a much simpler formulation that naturally and quickly attains convergence is obtained. This formulation is not limited to approach, landing, and divert maneuvers, but in principle it can be employed during de-orbiting, braking burn, ascent, as well as orbit insertion.

Guidance↗
NASA NTRSDate not supplied

A Physics-Based Work-Energy Formulation for Real-Time Trajectory Guidance of a Lunar Lander

Throughout the years, many researchers have calculated and optimized trajectory solutions for lunar landing systems by employing sophisticated mathematical methods, that include: Hamilton’s Principle of Variation, Pontryagin’s maximum principle, and well known convex-optimization techniques among others. Many of these approaches typically require expensive computational resources to achieve convergence in the solution. In an effort to reduce complexity and the computational load required to obtain real-time guidance commands, a simple physics-based work-energy approach has been formulated. This approach is based on the dissipation of the mechanical energy of the vehicle to its final desired energy state required to achieve a safe landing. The rocket engine(s) employed during landing (among other maneuvers) dissipates mechanical energy by both doing work against the velocity vector of the vehicle (thus defining the trajectory path), and by jettisoning mass. Therefore, by solving the energy dissipation problem at every step of the maneuver, a much simpler formulation that naturally and quickly attains convergence is obtained. This formulation is not limited to approach, landing, and divert maneuvers, but in principle it can be employed during de-orbiting, braking burn, ascent, as well as orbit insertion.

Guidance↗
NASA NTRS2018

Affine Generalized Inverse for Optimal Control Allocation

This research is a follow on to the "Optimal Control Prediction Method for Control Allocation" paper in which the Prediction Method iterative algorithm was introduced. Previously, the Prediction Method was shown to provide optimal control allocation solutions over the entire Attainable Moment Set for the Moore-Penrose and the generalized (weighted) inverse. As an extension to the Prediction Method, this paper introduces a family of Moore Penrose Affine Generalized Inverses, applicable for all moments, which compute control allocation solutions using a constant matrix and fixed null-space vector. The Moore-Penrose Affine Generalized Inverse is proven to yield equivalent solutions to those of the Prediction Method and therefore is guaranteed to yield Moore-Penrose optimal control allocation solutions. While the Prediction Method is applicable for any moment along an a priori specified moment direction, the Affine Generalized Inverse is shown to yield optimal control allocation solutions in a neighborhood of the given moment which is not restricted to a specified moment direction. Furthermore, the Affine Generalized Inverse is shown to provide the time derivative of optimal control allocation solutions and to facilitate maintaining solutions within control effector rate limitations. The Moore-Penrose Affine Generalized Inverse is broadened to encompass any arbitrary (weighted) Affine Generalized Inverse. Finally, a method of creating a moment lookup table is outlined to utilize the Affine Generalized Inverse as an offline control allocation solution for all moments in the Attainable Moment Set.

Acheson, Michael J.↗