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 235 records · Page 13

Dual structural-control optimization of large space structures

A new approach is proposed for solving dual structural-control optimization problems for high-order flexible space structures where reduced-order structural models are employed. For a given initial structural dessign, a quadratic control cost is minimized subject to a constant-mass constraint. The sensitivity of the optimal control cost with respect to the stuctural design variables is then determined and used to obtain successive structural redesigns using a contrained gradient optimization algorithm. This process is repeated until the constrained control cost sensitivity becomes negligible. A numerical example is presented which demonstrates that this new approach effectively addresses the problem of dual optimization for potentially very high-order structures.

Messac, A.↗

Assimilating partial observation to enhance feedback control of stochastic dynamical systems

Here, in this paper, we present a novel methodology to tackle feedback optimal control problems in scenarios where the exact state of the controlled process is unknown. It integrates data assimilation techniques and optimal control solvers to manage partial observation of the state process, a common occurrence in practical scenarios. Traditional stochastic optimal control methods assume full state observation, which is often not feasible in real-world fluid dynamics control problems. Our approach underscores the significance of utilizing observational data to inform control policy design. Specifically, we introduce a kernel learning backward stochastic differential equation (SDE) filter to enhance data assimilation efficiency and propose a sample-wise stochastic optimization method within the stochastic maximum principle framework. We demonstrate the efficacy and accuracy of our method in the control of advection-diffusion-reaction flow problem and the Dubins airplane maneuvering problem with model uncertainty.

data driven↗

Optimization problems governed by systems of PDEs with uncertainties

This paper reviews current theoretical and numerical approaches to optimization problems governed by partial differential equations (PDEs) that depend on random variables or random fields. Such problems arise in many engineering, science, economics and societal decision-making tasks. This paper focuses on problems in which the governing PDEs are parametrized by the random variables/fields, and the decisions are made at the beginning and are not revised once uncertainty is revealed. Examples of such problems are presented to motivate the topic of this paper, and to illustrate the impact of different ways to model uncertainty in the formulations of the optimization problem and their impact on the solution. A linear–quadratic elliptic optimal control problem is used to provide a detailed discussion of the set-up for the risk-neutral optimization problem formulation, study the existence and characterization of its solution, and survey numerical methods for computing it. Different ways to model uncertainty in the PDE-constrained optimization problem are surveyed in an abstract setting, including risk measures, distributionally robust optimization formulations, probabilistic functions and chance constraints, and stochastic orders. Furthermore, approximation-based optimization approaches and stochastic methods for the solution of the large-scale PDE-constrained optimization problems under uncertainty are described. Some possible future research directions are outlined.

Heinkenschloss, Matthias [Rice Univ., Houston, TX ↗

Discrete approximations to optimal trajectories using direct transcription and nonlinear programming

A recently developed method for solving optimal trajectory problems uses a piecewise-polynomial representation of the state and control variables, enforces the equations of motion via a collocation procedure, and thus approximates the original calculus-of-variations problem with a nonlinear-programming problem, which is solved numerically. This paper identifies this method as a direct transcription method and proceeds to investigate the relationship between the original optimal-control problem and the nonlinear-programming problem. The discretized adjoint equation of the collocation method is found to have deficient accuracy, and an alternate scheme which discretizes the equations of motion using an explicit Runge-Kutta parallel-shooting approach is developed. Both methods are applied to finite-thrust spacecraft trajectory problems, including a low-thrust escape spiral, a three-burn rendezvous, and a low-thrust transfer to the moon.

Enright, Paul J.↗

Riccati group invariants of linear hamiltonian systems

The action of the Riccati group on the Riccati differential equation is associated with the action of a subgroup of the symplectic group on a set of hamiltonian matrices. Within this framework various sets of canonical forms are developed for the matrix coefficients of the Riccati differential equation. The canonical forms presented are valid for arbitrary Kronecker indices, and it is shown that the Kronecker indices are invariants for this group action. These canonical forms are useful for studying problems arising in the areas of optimal decentralized control and the spectral theory of optimal control problems.

Garzia, M. R.↗

Digital program for solving the linear stochastic optimal control and estimation problem

A computer program is described which solves the linear stochastic optimal control and estimation (LSOCE) problem by using a time-domain formulation. The LSOCE problem is defined as that of designing controls for a linear time-invariant system which is disturbed by white noise in such a way as to minimize a performance index which is quadratic in state and control variables. The LSOCE problem and solution are outlined; brief descriptions are given of the solution algorithms, and complete descriptions of each subroutine, including usage information and digital listings, are provided. A test case is included, as well as information on the IBM 7090-7094 DCS time and storage requirements.

Geyser, L. C.↗

Relaxed Multibang Regularization for the Combinatorial Integral Approximation

Multibang regularization and combinatorial integral approximation decompositions are two actively researched techniques for integer optimal control. In this work, we consider a class of polyhedral functions that arise particularly as convex lower envelopes of multibang regularizers and show that they have beneficial properties with respect to regularization of relaxations of integer optimal control problems. We extend the algorithmic framework of the combinatorial integral approximation such that a subsequence of the computed discrete-valued controls converges to the infimum of the regularized integer control problem.

97 MATHEMATICS AND COMPUTING↗

Neighboring optimal guidance theory and computer program

Developments of the linear quadratic optimal control problem are discussed. The theory is applicable to the development of neighboring optimal feedback guidance gains, and is useful as a tool for synthesizing feedback control laws. A computer program which requires only the pertinent matrices of the linear quadratic problem is described.

Powers, W. F.↗

Multi-Commodity Traffic Signal Control and Routing With Connected Vehicles

We report a real-time traffic management policy that integrates traffic signal control and multi-commodity routing of connected vehicles in networks with multiple destinations is developed. The proposed policy is based on a multi-commodity formulation of the store-and-forward model and assumes all vehicles are able to exchange information with the infrastructure. Vehicles share information about their current location and final destination. Based on this information, the strategy determines both optimized signal timings at every intersection and vehicle-specific routing information at every link of the network. The control actions, i.e., signal times and routing information, are updated at every cycle and delivered by a finite horizon optimal control problem cast into a rolling horizon framework. The underlying optimization problem is convex, and thus the method is suitable for real-time operation in large networks. The method is validated via a micro-simulation study in networks with up to twenty intersections and, in all simulations, outperforms a real-time traffic-responsive signal control strategy that is based on a single-commodity store-and-forward model. The scalable computation effort for increasing network sizes and prediction horizon confirms the computational efficiency of the method.

42 ENGINEERING↗

OTIS 3.2 Software Released

Trajectory, mission, and vehicle engineers concern themselves with finding the best way for an object to get from one place to another. These engineers rely upon special software to assist them in this. For a number of years, many engineers have used the OTIS program for this assistance. With OTIS, an engineer can fully optimize trajectories for airplanes, launch vehicles like the space shuttle, interplanetary spacecraft, and orbital transfer vehicles. OTIS provides four modes of operation, with each mode providing successively stronger optimization capability. The most powerful mode uses a mathematical method called implicit integration to solve what engineers and mathematicians call the optimal control problem. OTIS 3.2, which was developed at the NASA Glenn Research Center, is the latest release of this industry workhorse and features new capabilities for parameter optimization and mission design. OTIS stands for Optimal Control by Implicit Simulation, and it is implicit integration that makes OTIS so powerful at solving trajectory optimization problems. Why is this so important? The optimization process not only determines how to get from point A to point B, but it can also determine how to do this with the least amount of propellant, with the lightest starting weight, or in the fastest time possible while avoiding certain obstacles along the way. There are numerous conditions that engineers can use to define optimal, or best. OTIS provides a framework for defining the starting and ending points of the trajectory (point A and point B), the constraints on the trajectory (requirements like "avoid these regions where obstacles occur"), and what is being optimized (e.g., minimize propellant). The implicit integration method can find solutions to very complicated problems when there is not a lot of information available about what the optimal trajectory might be. The method was first developed for solving two-point boundary value problems and was adapted for use in OTIS. Implicit integration usually allows OTIS to find solutions to problems much faster than programs that use explicit integration and parametric methods. Consequently, OTIS is best suited to solving very complicated and highly constrained problems.

Riehl, John P.↗

Optimum impulsive midcourse guidance with control dependent errors.

The problem of determining the optimum guidance policy for an interplanetary spacecraft is treated as a stochastic optimal control problem. An algorithm for computing the optimum velocity correction and the optimum execution time (with allowance for correction-dependent errors) is derived in the case of a single midcourse correction. The performance index was chosen to be an upper bound for the probability that the mission fails, and it is defined as a function of the maximum allowable velocity correction and the maximum allowable deviation of the terminal state. Numerical results obtained for a Jupiter fly-by mission indicate that the execution errors have a significant influence on the performance index, but an acceptably small upper bound on the probability of mission failure can be obtained for sufficiently small execution errors.

Tapley, B. D.↗

Optimal take-off trajectories in the presence of windshear

The present consideration of takeoff trajectory optimization in eight different fundamental problems involving wind shears assumes that the power setting is held at the maximum value, and that the aircraft is controlled with respect to angle-of-attack. While the first three problems are least-squares ones of the Bolza type, the remaining five are minimax problems of the Chebyshev type which can be converted to Bolza type by means of suitable transformations. All problems are solved on the basis of the dual sequential gradient-restoration algorithm for optimal control problems. The trajectory solutions obtained are superior to constant angle-of-attack trajectories.

Miele, A.↗

Active rejection of persistent disturbances in flexible space structures

A dynamic compensator for active rejection of persistent disturbances in flexible space structures is designed on the principle of the H(infinity)-optimization of the sensitivity transfer function matrix. A general state space solution is formulated to the multiinput multioutput H(infinity)-optimal control problem, allowing the use of the H(infinity)-optimal synthesis algorithm for the state-space models of space structures that result from model order reduction. Disturbances encountered in flexible space structures, such as shuttle docking, are investigated using the high-mode and the reduced-order models of a cantilevered two-bay truss, demonstrating the applicability of the H(infinity)-optimal approach.

Hwang, Cheng-Neng↗

Significance of the dihedral-effect for a combat aircraft in rapid fuselage-reorientation maneuvers

In the quest for understanding problems of supermaneuverability for combat aircraft, a study is presented about the role the dihedral-effect can have in fuselage-reorientation maneuvers that involve high angles of attack. A mathematical model for attitude maneuvers is developed, which accurately represents the High Angle-of-Attack Research Vehicle, including thrust-vectoring generated propulsive moments. The fuselage-reorientation problem is posed as an unconstrained time-optimal control problem. Results for a few families of extremal trajectories are obtained, and the global role of the dihedral effect in the course of the corresponding maneuvers is discussed. In addition, a detailed case-study is presented for an extremal trajectory which utilizes the dihedral effect with considerable benefit.

Bocvarov, Spiro↗

Optimal trajectories for an aerospace plane. Part 2: Data, tables, and graphs

Data, tables, and graphs relative to the optimal trajectories for an aerospace plane are presented. A single-stage-to-orbit (SSTO) configuration is considered, and the transition from low supersonic speeds to orbital speeds is studied for a single aerodynamic model (GHAME) and three engine models. Four optimization problems are solved using the sequential gradient-restoration algorithm for optimal control problems: (1) minimization of the weight of fuel consumed; (2) minimization of the peak dynamic pressure; (3) minimization of the peak heating rate; and (4) minimization of the peak tangential acceleration. The above optimization studies are carried out for different combinations of constraints, specifically: initial path inclination that is either free or given; dynamic pressure that is either free or bounded; and tangential acceleration that is either free or bounded.

Miele, Angelo↗