Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal Control Problem”

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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
NASA NTRS2007

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

Multi-Objective Flight Control for Drag Minimization and Load Alleviation of High-Aspect Ratio Flexible Wing Aircraft

As aircraft wings become much more flexible due to the use of light-weight composites material, adverse aerodynamics at off-design performance can result from changes in wing shapes due to aeroelastic deflections. Increased drag, hence increased fuel burn, is a potential consequence. Without means for aeroelastic compensation, the benefit of weight reduction from the use of light-weight material could be offset by less optimal aerodynamic performance at off-design flight conditions. Performance Adaptive Aeroelastic Wing (PAAW) technology can potentially address these technical challenges for future flexible wing transports. PAAW technology leverages multi-disciplinary solutions to maximize the aerodynamic performance payoff of future adaptive wing design, while addressing simultaneously operational constraints that can prevent the optimal aerodynamic performance from being realized. These operational constraints include reduced flutter margins, increased airframe responses to gust and maneuver loads, pilot handling qualities, and ride qualities. All of these constraints while seeking the optimal aerodynamic performance present themselves as a multi-objective flight control problem. The paper presents a multi-objective flight control approach based on a drag-cognizant optimal control method. A concept of virtual control, which was previously introduced, is implemented to address the pair-wise flap motion constraints imposed by the elastomer material. This method is shown to be able to satisfy the constraints. Real-time drag minimization control is considered to be an important consideration for PAAW technology. Drag minimization control has many technical challenges such as sensing and control. An initial outline of a real-time drag minimization control has already been developed and will be further investigated in the future. A simulation study of a multi-objective flight control for a flight path angle command with aeroelastic mode suppression and drag minimization demonstrates the effectiveness of the proposed solution. In-flight structural loads are also an important consideration. As wing flexibility increases, maneuver load and gust load responses can be significant and therefore can pose safety and flight control concerns. In this paper, we will extend the multi-objective flight control framework to include load alleviation control. The study will focus initially on maneuver load minimization control, and then subsequently will address gust load alleviation control in future work.

Aerolasticity↗
DOE OSTI2023

Deep Sigma Point Processes-Assisted Chance-Constrained Power System Transient Stability Preventive Control

Here this paper proposes a deep sigma point processes (DSPP)-assisted chance-constrained power system transient stability preventive control method to deal with uncertain renewable energy and loads-induced stability risk. The traditional transient stability-constrained preventive control is reformulated as a chance-constrained optimization problem. To deal with the computational bottleneck of the time-domain simulation-based probabilistic transient stability assessment, the DSPP is developed. DSPP is a parametric Bayesian approach that allows us to predict system transient stability with high computational efficiency while accurately quantifying the confidence intervals of the predictions that can be used to inform system instability risk. To this end, with a given preset confidence probability, we embed DSPP into the primal dual interior point method to help solve the chance-constrained preventive control problem, where the corresponding Jacobian and Hessian matrices are derived. Comparison results with other existing methods show that the proposed method can significantly speed up preventive control while maintaining high accuracy and convergence

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1988

Minimax optimal control for atmospheric fly-through trajectories

Necessary conditions for minimax problems with isolated or flat maxima are presented. Some relevant properties concerning the peak heating rate and the peak deceleration during atmospheric entry are discussed. As application of the theory, the problem of minimizing the peak heating rate of a skip trajectory is solved with special emphasis on the discussion of the continuity of the lift control at the point where the maximum occurs along the trajectory.

Lu, P.↗
NASA NTRS1973

The preview control problem with application to man-machine system analysis

The preview control problem is formulated in a general form and its solution is obtained. The analytical tool used is discrete stochastic optimal control theory. Aiming the application to manual control situations with preview, time delay, observation noise, motor noise, etc. were included in formulating the problem. Manual preview control experiments were performed to qualitatively check the validity of the model, and it was found that the mechanism of the manual control problem was explained by the developed model.

Tomizuka, M.↗
DOE OSTI2025

Harnessing the power of gradient-based simulations for multi-objective optimization in particle accelerators

Abstract Particle accelerator operation requires simultaneous optimization of multiple objectives. Multi-objective optimization (MOO) is particularly challenging due to trade-offs between the objectives. Evolutionary algorithms, such as genetic algorithms (GAs), have been leveraged for many optimization problems, however, they do not apply to complex control problems by design. This paper demonstrates the power of differentiability for solving MOO problems in particle accelerators using a deep differentiable reinforcement learning (DDRL) algorithm. We compare the DDRL algorithm with model-free reinforcement learning (MFRL), GA, and Bayesian optimization (BO) for simultaneous optimization of heat load and trip rates in the continuous electron beam accelerator facility. The underlying problem enforces strict constraints on both individual states and actions as well as cumulative (global) constraints on energy requirements of the beam. Using historical accelerator data, we develop a physics-based surrogate model which is differentiable and allows for back-propagation of gradients. The results are evaluated in the form of a Pareto-front with two objectives. We show that the DDRL outperforms MFRL, BO, and GA on high dimensional problems.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Exponential Decay in the Sensitivity Analysis of Nonlinear Dynamic Programming

In this report, we study the sensitivity of discrete-time dynamic programs with nonlinear dynamics and objective to perturbations in the initial conditions and reference parameters. Under uniform controllability and boundedness assumptions for the problem data, we prove that the directional derivative of the optimal state and control at time $k$, $x^*_k$, and $u^*_k$, with respect to the reference signal at time $i$, $d_i$, will have exponential decay in terms of $|k-i|$ with a decay rate $\rho$ independent of the temporal horizon length. The key technical step is to prove that a version of the convexification approach proposed by Verschueren et al. can be applied to the KKT conditions and results in a convex quadratic program with uniformly bounded data. In turn, Riccati techniques can be further employed to obtain the sensitivity result, borne from the observation that the directional derivatives are solutions of quadratic programs with structure similar to the KKT conditions themselves. We validate our findings with numerical experiments on a small nonlinear, nonconvex, dynamic program.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1973

Investigation of halo satellite orbit control

Calculations are given for Halo satellite orbit control. Previous truncated analytical descriptions were limited and lead to an acceleration error averaging about .000001, which is the 'cost' of a very tight control to the nominal path. The stationkeeping problem is posed so as to permit a looser, optimal three-axis control.

Breakwell, J. V.↗
NASA NTRS1978

Quasi-optimal control of a moving-base simulator

The optimal control of a degree-of-freedom moving-base simulator is considered. The quasi-optimal control method due to Friedland was utilized. The problem, in broad terms, was to determine a control law for moving the simulator cab so that its motion would: (1) best approximate the desired aircraft response, and (2) not exceed the limited translational capability of the simulator. A variety of optimal responses were obtained by the method which emphasized different features of the response which were thought to be important in motion perception. Examples of such results are given, and the considerations important in initial subjective evaluations by experienced flight personnel are discussed.

Stewart, E. C.↗
DOE OSTI2024

Reinforcement learning applied to dilute combustion control for increased fuel efficiency

To reduce the modeling burden for control of spark-ignition engines, reinforcement learning (RL) has been applied to solve the dilute combustion limit problem. Q-learning was used to identify an optimal control policy to adjust the fuel injection quantity in each combustion cycle. A physics-based model was used to determine the relevant states of the system used for training the control policy in a data-efficient manner. The cost function was chosen such that high cycle-to-cycle variability (CCV) at the dilute limit was minimized while maintaining stoichiometric combustion as much as possible. Experimental results demonstrated a reduction of CCV after the training period with slightly lean combustion, contributing to a net increase in fuel conversion efficiency of 1.33%. To ensure stoichiometric combustion for three-way catalyst compatibility, a second feedback loop based on an exhaust oxygen sensor was incorporated into the fuel quantity controller using a slow proportional-integral (PI) controller. The closed-loop experiments showed that both feedback loops can cooperate effectively, maintaining stoichiometric combustion while reducing combustion CCV and increasing fuel conversion efficiency by 1.09%. Finally, a modified cost function was proposed to ensure stoichiometric combustion with a single controller. In addition, the learning period was shortened by half to evaluate the RL algorithm performance on limited training time. Experimental results showed that the modified cost function could achieve the desired CCV targets, however, the learning time was reduced by half and the fuel conversion efficiency increased only by 0.30%.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

Iterative Linearization for Phasor-Defined Optimal Power Dispatch

Optimal power flow (OPF) problems, which dispatch power targets to controllable generating units across a network, must generally account for non-convex constraints on power flow. Furthermore, adapting those problems so as to make them solvable with convex optimization techniques is an area of much academic and operational interest. In this paper, we present a method for solving OPF as a quadratic program by iteratively refining and re-initializing a linearized model of power flow based on the outputs of an associated nonlinear solver. The linear model on which we demonstrate this method is an adapted version of an approximation designed for use with unbalanced distribution networks. As an important benefit, the model allows for the explicit inclusion of nodal voltage phasor values in both the OPF problem's objective and its constraints, which opens the door to the idea of phasor-based control (PBC) design. We show in simulations on the IEEE 13-node test feeder that our method quickly converges to a set of phasor targets that are sufficiently precise for use in operations at the distribution level.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression

Dynamic optimization problems arise in many applications including flow control, full waveform inversion, and medical imaging. These problems are plagued by significant computational challenges. One such challenge — and the focus of this work — is the memory limitation induced by the size of the underlying dynamical system. In particular, the entire dynamic trajectory is required for derivative computation and therefore must be stored or recomputed using, e.g., checkpointing. Although recent work demonstrated the use of adaptive randomized sketching to overcome the memory challenge, that work only applies to smooth unconstrained problems, prohibiting its use for nonsmooth regularized and constrained problems. The inclusion of nonsmooth regularizers and constraints is critical as they often arise in an attempt to preserve certain physical properties or to promote sparsity. To solve these problems, we introduce a trust-region algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function that leverages randomized sketching to compress the dynamical system trajectories and adaptively adjust the sketch rank to satisfy a gradient inexactness condition. We prove convergence of this algorithm and demonstrate that it achieves substantial memory reduction on three discretized PDE-constrained optimization applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Control-Affine Schrödinger Bridge and Generalized Bohm Potential

From a stochastic control perspective, the Schrödinger bridge is a density-valued continuous curve parameterized by time that connects a given pair of initial and terminal probability densities via minimum effort controlled Brownian motion. The control-affine Schrödinger bridge extends this idea to a generic control-affine Itô diffusion, possibly with an additive state cost. Here, in this letter, we recast the necessary conditions of optimality for the control-affine Schrödinger bridge problem as a two point boundary value problem for a quantum mechanical Schrödinger PDE with complex potential. This complex-valued potential is a generalization of the real-valued Bohm potential in quantum mechanics. Our derived potential is akin to the optical potential in nuclear physics where the real part of the potential encodes elastic scattering (transmission of wave function), and the imaginary part encodes inelastic scattering (absorption of wave function). The key takeaway is that the process noise that drives the evolution of probability densities induces an absorbing medium in the evolution of wave function. These results make new connections between control theory and non-equilibrium statistical mechanics through the lens of quantum mechanics.

Markov processes↗
NASA NTRS1985

Direct computation of optimal control of forced linear system

It is known that the optimal control of a forced linear system may be reduced to that of tracking the system without forces. The solution of the tracking problem is available via the costate variables method. This procedure is computationally expensive for large order systems. It requires solution of matrix Riccati equation and two final value problems. An alternate approach is outlined for the direct computation of the optimal control. Instead of Riccati equation, a matrix Volterra integral must be solved. For this purpose two computational schemes are described, and an illustrative example is given. The results compare favorably with the classical solution. This alternative approach may be especially useful for the control of large space structure where large order models are required.

Utku, S.↗
NASA NTRS2013

Mixed-Strategy Chance Constrained Optimal Control

This paper presents a novel chance constrained optimal control (CCOC) algorithm that chooses a control action probabilistically. A CCOC problem is to find a control input that minimizes the expected cost while guaranteeing that the probability of violating a set of constraints is below a user-specified threshold. We show that a probabilistic control approach, which we refer to as a mixed control strategy, enables us to obtain a cost that is better than what deterministic control strategies can achieve when the CCOC problem is nonconvex. The resulting mixed-strategy CCOC problem turns out to be a convexification of the original nonconvex CCOC problem. Furthermore, we also show that a mixed control strategy only needs to "mix" up to two deterministic control actions in order to achieve optimality. Building upon an iterative dual optimization, the proposed algorithm quickly converges to the optimal mixed control strategy with a user-specified tolerance.

Ono, Masahiro↗
NASA NTRS1991

Research on inverse, hybrid and optimization problems in engineering sciences with emphasis on turbomachine aerodynamics: Review of Chinese advances

Advances in inverse design and optimization theory in engineering fields in China are presented. Two original approaches, the image-space approach and the variational approach, are discussed in terms of turbomachine aerodynamic inverse design. Other areas of research in turbomachine aerodynamic inverse design include the improved mean-streamline (stream surface) method and optimization theory based on optimal control. Among the additional engineering fields discussed are the following: the inverse problem of heat conduction, free-surface flow, variational cogeneration of optimal grid and flow field, and optimal meshing theory of gears.

Liu, Gao-Lian↗