Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal Control”

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,207 records · Page 67
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

TEAM Project Review, Year 2

This report summarizes our research activities within the TEAM project between December 2020 and December 2021, funded by the ASCR Advanced Research in Quantum Computing program. During the reporting period the LLNL-MSU team has made progress on several fronts. An overarching goal of the team is to provide a comprehensive suite of software tools that can be used for the Characterize-Optimize-Compute loop needed to implement and execute algorithms on quantum devices. We are concurrently developing lightweight solvers that can be used on desktop computers to find optimal control pulses and to characterize small quantum systems (consisting of a few transmons and cavities). However, desktop computers are insufficient for simulating and characterizing larger quantum systems. We have therefore also developed parallel, distributed memory, simulators and optimization solvers, both for open and closed quantum systems. These parallel solvers have, for example, been used to study quantum optimal control for pure-state preparation, utilizing 1000’s of cores on a modern high-performance computing (HPC) platform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRSDate not supplied

Maximum-Likelihood Parameter Estimation for High-Contrast Wavefront Sensing & Control

Stellar coronagraphs use closed-loop focal-plane wavefront sensing and control algorithms to create high-contrast dark zones suitable for imaging exoplanets and exozodiacal dust clouds around nearby stars. At present, the deepest contrast has been achieved using model-based algorithms, which use the predicted focal-plane influence of the coronagraph's deformable mirrors to drive diffracted starlight toward zero over time in an optimal control framework. However, model-based algorithms are susceptible to model mismatch, wherein a departure of the coronagraph's true optical characteristics from the model predictions causes reduced control loop performance. Here, we report on a technique for maximum-likelihood estimation of the wavefront control Jacobian matrix and noise statistics of the coronagraph focal-plane electric field from data acquired in situ during closed-loop wavefront control operations. By empirically tuning the Jacobian and noise properties in a statistically rigorous fashion, the maximum-likelihood approach mitigates model mismatch and recovers near-optimal control loop performance.

coronagraphy↗
DOE OSTI2024

Leveraging Multitime Hamilton–Jacobi PDEs for Certain Scientific Machine Learning Problems

Hamilton-Jacobi partial differential equations (HJ PDEs) have deep connections with a wide range of fields, including optimal control, differential games, and imaging sciences. By considering the time variable to be a higher dimensional quantity, HJ PDEs can be extended to the multi-time case. In this paper, we establish a novel theoretical connection between specific optimization problems arising in machine learning and the multi-time Hopf formula, which corresponds to a representation of the solution to certain multi-time HJ PDEs. Through this connection, we increase the interpretability of the training process of certain machine learning applications by showing that when we solve these learning problems, we also solve a multi-time HJ PDE and, by extension, its corresponding optimal control problem. As a first exploration of this connection, we develop the relation between the regularized linear regression problem and the Linear Quadratic Regulator (LQR). We then leverage our theoretical connection to adapt standard LQR solvers (namely, those based on the Riccati ordinary differential equations) to design new training approaches for machine learning. Lastly, we provide some numerical examples that demonstrate the versatility and possible computational advantages of our Riccati-based approach in the context of continual learning, post-training calibration, transfer learning, and sparse dynamics identification.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1972

An Optimization study on a hybrid computer

The maximum principle is applied to minimum-time optimal-control problems, and an optimization algorithm is presented which can be implemented on a hybrid computer. The state and adjoint equations are set up on ASTRAC 2, a high-speed analog computer capable of 1000 differential equation solutions per second. The optimization algorithm is implemented on a PDP-9, an 18-bit, digital computer. The optimization scheme has global and local search phases and uses a vector optimization criterion. Second and third-order bang-bang control systems are studied as examples.

Gonzalez, R. S.↗
NASA NTRS1980

Implicit model following and parameter identification of unstable aircraft

A transformation in the s-plane is described which has utility in implicit model-following optimal control design application and in estimation or parameter identification problems. The objective of the transformation is, for the control problem, to achieve an unstable closed-loop system, and, for the estimation problem, to alleviate algorithm convergence problems that may arise in identifying unstable systems. For the control problem, the transformation is a shift along the real (sigma) axis of the plant and model poles and zeros. This transformation is shown to be equivalent to a modified performance index but offers the advantage of compatibility with existing optimal control solution algorithms. For the estimation problem, the data are multiplied by an exponential function and the assumed measurement and process noise covariances are appropriately modified. Examples of both control and estimation applications are presented.

Lebacqz, J. V.↗
NASA NTRS1981

Optimal digital control of multirate systems

Many digitally controlled aerospace systems have widely separated time constants and thus can benefit from the use of two or more sample rates. In this paper, the analysis and synthesis of multirate systems is accomplished by creating an equivalent single rate system and applying existing techniques. The optimal steady state solution of the single rate system is obtained by eigenvector decomposition and then used to compute the periodic solution to the Riccati equation of the original multirate system. An example shows when multirate analysis is necessary and the penalty of various levels of approximations to the exact multirate solution.

Amit, N.↗
NASA NTRS1990

Stochastic ordering properties and optimal routing control for a class of finite capacity queueing systems

The problem of routing jobs to parallel queues with identical exponential servers and unequal finite buffer capacities is considered. Stochastic ordering and weak majorization properties on critical performance measures are established by means of event-driven inductions. In particular, it is shown that the intuitive 'join the shortest non-full queue' (SNQ) policy is optimal with respect to an overall function that accounts for holding and blocking costs. Moreover, the buffer allocation problem is solved by proving the intuitive result that, for a fixed total buffer capacity, the optimal allocation scheme is the one in which the difference between the maximum and minimum queue capacities is minimized, i.e., becomes either 0 or 1.

Towsley, Don↗
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 NTRS1972

Control system optimization studies. Volume 2: High frequency cutoff filter analysis

The problem of digital implementation of a cutoff filter is approached with consideration to word length, sampling rate, accuracy requirements, computing time and hardware restrictions. Computing time and hardware requirements for four possible programming forms for the linear portions of the filter are determined. Upper bounds for the steady state system output error due to quantization for digital control systems containing a digital network programmed both in the direct form and in the canonical form are derived. This is accomplished by defining a set of error equations in the z domain and then applying the final value theorem to the solution. Quantization error was found to depend upon the digital word length, sampling rate, and system time constants. The error bound developed may be used to estimate the digital word length and sampling rate required to achieve a given system specification. From the quantization error accumulation, computing time and hardware point of view, and the fact that complex poles and zeros must be realized, the canonical form of programming seems preferable.

Fong, M. H.↗
NASA NTRS1989

Computational complexities and storage requirements of some Riccati equation solvers

The linear optimal control problem of an nth-order time-invariant dynamic system with a quadratic performance functional is usually solved by the Hamilton-Jacobi approach. This leads to the solution of the differential matrix Riccati equation with a terminal condition. The bulk of the computation for the optimal control problem is related to the solution of this equation. There are various algorithms in the literature for solving the matrix Riccati equation. However, computational complexities and storage requirements as a function of numbers of state variables, control variables, and sensors are not available for all these algorithms. In this work, the computational complexities and storage requirements for some of these algorithms are given. These expressions show the immensity of the computational requirements of the algorithms in solving the Riccati equation for large-order systems such as the control of highly flexible space structures. The expressions are also needed to compute the speedup and efficiency of any implementation of these algorithms on concurrent machines.

Utku, Senol↗
NASA NTRS1993

On the existence of touch points for first-order state inequality constraints

The appearance of touch points in state constrained optimal control problems with general vector-valued control is studied. Under the assumption that the Hamiltonian is regular, touch points for first-order state inequalities are shown to exist only under very special conditions. In many cases of practical importance these conditions can be used to exclude touch points a priori without solving an optimal control problem. The results are demonstrated on a simple example.

Seywald, Hans↗
NASA NTRS2020

Squash-Box Feasibility Driven Differential Dynamic Programming

Recently, Differential Dynamic Programming (DDP) and other similar algorithms have become the solvers of choice when performing non-linear Model Predictive Control (nMPC) with modern robotic devices. The reason is that they have a lower computational cost per iteration when compared with off-the-shelf Non-Linear Programming (NLP) solvers, which enables its online operation. However, they cannot handle constraints, and are known to have poor convergence capabilities. In this paper, we propose a method to solve the optimal control problem with control bounds through a squashing function (i.e., a sigmoid, which is bounded by construction). It has been shown that a naive use of squashing functions damage the convergence rate. To tackle this, we first propose to add a quadratic barrier that avoids the difficulty of the plateau produced by the sigmoid. Second, we add an outer loop that adapts both the sigmoid and the barrier; it makes the optimal control problem with the squashing function converge to the original control-bounded problem. To validate our method, we present simulation results for different types of platforms including a multi-rotor, a biped, a quadruped and a humanoid robot.

Navarro, Angel Santamaria↗
NASA NTRS1972

Control system optimization studies. Volume 1: Payload deployment study

An analysis of the critical parameters involved in designing systems for spacecraft maneuvers involved in stationkeeping, docking, orbital assembly, satellite inspection and retrieval, and payload deployment is presented. The fixed base simulation was performed on a hybrid computer and includes a cathode ray tube display so that the maneuvers can be visually monitored by a pilot located in the active vehicle. Both automatic and manual control modes are included and the pilot can switch between the two modes as desired. A complete description of the hybrid simulation is provided and simulation results are described. Major digital subroutines, flow charts, and analog wiring diagrams are provided.

Heeschen, G. M.↗
NASA NTRS1987

Minimum time attitude slewing maneuvers of a rigid spacecraft

The problems of large-angle attitude maneuvers of a spacecraft have gained much consideration in recent years. The configurations of the spacecraft considered are: completely rigid, a combination of rigid and flexible parts, or gyrostat-type systems. The performance indices usually include minimum torque integration, power criterion, and frequency-shaped cost functionals. The minimum time slewing problem of a rigid spacecraft was examined. Optimal control theory (Maximum Principal) was applied to the slewing motion of a general rigid spacecraft. Control torque about all three axes was computed. The equations for the system are composed of the Euler dynamical equations in the spacecraft body axes and the quaternion kinematical equation. By introducing the costates for the quaternion and the angular velocity, the Hamiltonian of the system can be formed and the optimal control obtained. Finally the methods are applied to the SCOLE slewing motion. The control variables include three control moments on the Shuttle and two control forces on the reflector. Numerical results are discussed.

Li, Feiyue↗
NASA NTRS1993

On identified predictive control

Self-tuning control algorithms are potential successors to manually tuned PID controllers traditionally used in process control applications. A very attractive design method for self-tuning controllers, which has been developed over recent years, is the long-range predictive control (LRPC). The success of LRPC is due to its effectiveness with plants of unknown order and dead-time which may be simultaneously nonminimum phase and unstable or have multiple lightly damped poles (as in the case of flexible structures or flexible robot arms). LRPC is a receding horizon strategy and can be, in general terms, summarized as follows. Using assumed long-range (or multi-step) cost function the optimal control law is found in terms of unknown parameters of the predictor model of the process, current input-output sequence, and future reference signal sequence. The common approach is to assume that the input-output process model is known or separately identified and then to find the parameters of the predictor model. Once these are known, the optimal control law determines control signal at the current time t which is applied at the process input and the whole procedure is repeated at the next time instant. Most of the recent research in this field is apparently centered around the LRPC formulation developed by Clarke et al., known as generalized predictive control (GPC). GPC uses ARIMAX/CARIMA model of the process in its input-output formulation. In this paper, the GPC formulation is used but the process predictor model is derived from the state space formulation of the ARIMAX model and is directly identified over the receding horizon, i.e., using current input-output sequence. The underlying technique in the design of identified predictive control (IPC) algorithm is the identification algorithm of observer/Kalman filter Markov parameters developed by Juang et al. at NASA Langley Research Center and successfully applied to identification of flexible structures.

Bialasiewicz, Jan T.↗