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 595 records · Page 33

Qubit control noise spectroscopy with optimal suppression of dephasing

Here, we extend quantum noise spectroscopy (QNS) of amplitude control noise to settings where dephasing noise or detuning errors make significant contributions to qubit dynamics. Previous approaches to characterize amplitude noise are limited by their vulnerability to low-frequency dephasing noise and static detuning errors, which can overwhelm the target control noise signal and introduce bias into estimates of the amplitude noise spectrum. To overcome this problem, we leverage optimal control to identify a family of amplitude control waveforms that optimally suppress low-frequency dephasing noise and detuning errors, while maintaining the spectral concentration in the amplitude filter essential for spectral estimation. The waveforms found via numerical optimization have surprisingly simple analytic forms, consisting of oscillating sine waves obeying particular amplitude and frequency constraints. In numerically simulated QNS experiments, these waveforms demonstrate superior robustness, enabling accurate estimation of the amplitude noise spectrum in regimes where existing approaches are biased by low-frequency dephasing noise and detuning errors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

The problem of low-thrust trajectory optimization in highly perturbed dynamics is a stressing case for many optimization tools. Highly nonlinear dynamics and continuous thrust are each, separately, non-trivial problems in the field of optimal control, and when combined, the problem is even more difficult. This paper de-scribes a fast, robust method to design a trajectory in the CRTBP (circular restricted three body problem), beginning with no or very little knowledge of the system. The approach is inspired by the SQP (sequential quadratic programming) algorithm, in which a general nonlinear programming problem is solved via a sequence of quadratic problems. A few key simplifications make the algorithm presented fast and robust to initial guess: a quadratic cost function, neglecting the line search step when the solution is known to be far away, judicious use of end-point constraints, and mesh refinement on multiple shooting with fixed-step integration.In comparison to the traditional approach of plugging the problem into a “black-box” NLP solver, the methods shown converge even when given no knowledge of the solution at all. It was found that the only piece of information that the user needs to provide is a rough guess for the time of flight, as the transfer time guess will dictate which set of local solutions the algorithm could converge on. This robustness to initial guess is a compelling feature, as three-body orbit transfers are challenging to design with intuition alone. Of course, if a high-quality initial guess is available, the methods shown are still valid.We have shown that endpoints can be efficiently constrained to lie on 3-body repeating orbits, and that time of flight can be optimized as well. When optimizing the endpoints, we must make a trade between converging quickly on sub-optimal endpoints or converging more slowly on end-points that are arbitrarily close to optimal. It is easy for the mission design engineer to adjust this trade based on the problem at hand.The biggest limitation to the algorithm at this point is that multi-revolution transfers (greater than 2 revolutions) do not work nearly as well. This restriction comes in because the relationship between node 1 and node N becomes increasingly nonlinear as the angular distance grows. Trans-fers with more than about 1.5 complete revolutions generally require the line search to improve convergence. Future work includes: Comparison of this algorithm with other established tools; improvements to how multiple-revolution transfers are handled; parallelization of the Jacobian computation; in-creased efficiency for the line search; and optimization of many more trajectories between a variety of 3-body orbits.

Parrish, Nathan L.↗

Deep reinforcement learning to discover multi-fuel injection strategies for compression ignition engines

Over the past several decades, regulation of compression ignition engine emissions has become increasingly stringent as concern about the environmental and health implications of these emissions has grown. These changing constraints have led to a series of new, alternative fuel injection strategies that aim to maintain power output while reducing in-cylinder generated emissions by operating in the low-temperature combustion (LTC) regime. These advanced injection strategies are created and retuned for individual combinations of engine geometry, fuel, and emissions constraints. Deep reinforcement learning has been shown to be an effective alternative to traditional optimization approaches for highly combinatorial control problems, such as discovering the optimal injection schedules for compression ignition engines. In this study, we deploy a previously presented deep reinforcement learning framework to iteratively optimize a series of engine geometries over a range of increasingly strict NO x emissions regulations. We then examine the resulting injection schedules. We discuss the potential for using this deep reinforcement learning framework for fuel selection screening and for discovering unique injection strategies for different engine geometries and future emissions standards.

33 ADVANCED PROPULSION SYSTEMS↗

Optimal damper location in the vibration control of large space structures

The problem of finding the optimal location of active dampers for the vibration control of space structures is investigated. The optimal location is where maximum damping can be introduced to a particular vibration mode. To this end, classical root locus techniques are used to study the effect on eigenvalues of placing a damper on an undamped structure. An efficient formulation is derived which avoids the solution of the damped eigenvalue problem. Based on the observation of the results for a free-free beam model, a Minimum Constrained Frequency Criterion (MCFC) for locating the optimal damper location is proposed.

Wang, B. P.↗

Astrodynamics 1975; Conference, Nassau, Bahamas, July 28-30, 1975, Technical Papers

Articles are grouped under four headings: (1) dynamics and control of satellites; (2) satellite mission analysis; (3) Aeros-B and Symphonie satellite engineering problems; (4) optimization and control techniques applied to solar space heating and cooling of buildings. Topics covered include: communications and earth survey satellite systems, a system of two counter-orbiting satellites measuring GRT-predicted nodal drag, statistical mechanics studies of the spatial density function of orbiting space junk, attitude control of satellites, nutation dampers, low thrust inertial guidance and ascent inertial guidance, a shuttle-launched multi-comet intercept mission, preflight and in-flight analysis of the Atmosphere Explorer (AE-C) satellite, and launch-encounter strategy for the Mariner 1977 Jupiter-Saturn mission. Individual items are announced in this issue.

Powers, W. F.↗

Users manual for the Variable dimension Automatic Synthesis Program (VASP)

A dictionary and some problems for the Variable Automatic Synthesis Program VASP are submitted. The dictionary contains a description of each subroutine and instructions on its use. The example problems give the user a better perspective on the use of VASP for solving problems in modern control theory. These example problems include dynamic response, optimal control gain, solution of the sampled data matrix Ricatti equation, matrix decomposition, and pseudo inverse of a matrix. Listings of all subroutines are also included. The VASP program has been adapted to run in the conversational mode on the Ames 360/67 computer.

White, J. S.↗

On optimal control of hybrid dynamical systems using complementarity constraints

Optimal control for switch-based dynamical systems is a challenging problem in the process control literature. In this study, we model these systems as hybrid dynamical systems with finite number of unknown switching points and reformulate them using non-smooth and non-convex complementarity constraints as a mathematical program with complementarity constraints (MPCC). We utilize a moving finite element based strategy to discretize the differential equation system to accurately locate the unknown switching points at the finite element boundary and achieve high-order accuracy at intermediate non-collocation points. We propose a globalization approach to solve the discretized MPCC problem using a mixed NLP/MILP-based strategy to converge to a non-spurious first-order optimal solution. The method is tested on three dynamic optimization examples, including a gas–liquid tank model and an optimal control problem with a sliding mode solution.

97 MATHEMATICS AND COMPUTING↗

Guidance analysis of the aeroglide plane change maneuver as a turning point problem

The development of guidance approximations for the atmospheric (aeroglide) portion of the minimum fuel, orbital plane change, trajectory optimization problem is described. Asymptotic methods are used to reduce the two point, boundary value, optimization problem to a turning point problem from the bank angle control. The turning point problem solution, which yields an approximate optimal control policy, is given in terms of parabolic cylinder functions, which are tabulated, and integral expressions, which must be numerically computed. Comparisons of the former, over their region of validity, with optimal control solutions show good qualitative agreement. Additional work and analysis is needed to compute the guidance approximation work.

Gracey, Christopher↗

Optimal Output Trajectory Redesign for Invertible Systems

Given a desired output trajectory, inversion-based techniques find input-state trajectories required to exactly track the output. These inversion-based techniques have been successfully applied to the endpoint tracking control of multijoint flexible manipulators and to aircraft control. The specified output trajectory uniquely determines the required input and state trajectories that are found through inversion. These input-state trajectories exactly track the desired output; however, they might not meet acceptable performance requirements. For example, during slewing maneuvers of flexible structures, the structural deformations, which depend on the required state trajectories, may be unacceptably large. Further, the required inputs might cause actuator saturation during an exact tracking maneuver, for example, in the flight control of conventional takeoff and landing aircraft. In such situations, a compromise is desired between the tracking requirement and other goals such as reduction of internal vibrations and prevention of actuator saturation; the desired output trajectory needs to redesigned. Here, we pose the trajectory redesign problem as an optimization of a general quadratic cost function and solve it in the context of linear systems. The solution is obtained as an off-line prefilter of the desired output trajectory. An advantage of our technique is that the prefilter is independent of the particular trajectory. The prefilter can therefore be precomputed, which is a major advantage over other optimization approaches. Previous works have addressed the issue of preshaping inputs to minimize residual and in-maneuver vibrations for flexible structures; Since the command preshaping is computed off-line. Further minimization of optimal quadratic cost functions has also been previously use to preshape command inputs for disturbance rejection. All of these approaches are applicable when the inputs to the system are known a priori. Typically, outputs (not inputs) are specified in tracking problems, and hence the input trajectories have to be computed. The inputs to the system are however, difficult to determine for non-minimum phase systems like flexible structures. One approach to solve this problem is to (1) choose a tracking controller (the desired output trajectory is now an input to the closed-loop system and (2) redesign this input to the closed-loop system. Thus we effectively perform output redesign. These redesigns are however, dependent on the choice of the tracking controllers. Thus the controller optimization and trajectory redesign problems become coupled; this coupled optimization is still an open problem. In contrast, we decouple the trajectory redesign problem from the choice of feedback-based tracking controller. It is noted that our approach remains valid when a particular tracking controller is chosen. In addition, the formulation of our problem not only allows for the minimization of residual vibration as in available techniques but also allows for the optimal reduction fo vibrations during the maneuver, e.g., the altitude control of flexible spacecraft. We begin by formulating the optimal output trajectory redesign problem and then solve it in the context of general linear systems. This theory is then applied to an example flexible structure, and simulation results are provided.

Devasia, S.↗

Integrated controls-structures optimization of a large space structure

General-purpose control and structural codes are applied to a large detailed structural model including objective and constraint functions derived from actual design specifications. The approach is to divide the problem into a controls optimization step, a structural optimization step, and a system level coordination step. The objective is to minimize mass and power consumption with constraints on vibration characteristics, strength, and damping. This decomposition and optimization approach significantly enhances the design of a structure based on the COFS-I Mast Flight System, which is selected as a demonstration problem.

Pasula, S. L.↗

Electro-optical processor for optimal control

An iterative optical processor has been developed for applications in the optimal control of advanced sensor systems. The processor is designed for the realization of the Richardson algorithm on bipolar data, using as input a linear array of LEDs. The usefulness of the processor has been demonstrated by the solution of the linear quadratic regulator problem for the optimal control signals of the F100 turbofan engine. In this case study, the algebraic Riccati equation matrix was solved by the use of a modified Kleinman algorithm along with the Richardson algorithm applied to a system of linear algebraic equations. Preliminary experimental results demonstrate the gradual convergence of the processor.

Casasent, D.↗

Reliability of Fault Tolerant Control Systems

This paper reports Part II of a two part effort that is intended to delineate the relationship between reliability and fault tolerant control in a quantitative manner. Reliability properties peculiar to fault-tolerant control systems are emphasized, such as the presence of analytic redundancy in high proportion, the dependence of failures on control performance, and high risks associated with decisions in redundancy management due to multiple sources of uncertainties and sometimes large processing requirements. As a consequence, coverage of failures through redundancy management can be severely limited. The paper proposes to formulate the fault tolerant control problem as an optimization problem that maximizes coverage of failures through redundancy management. Coverage modeling is attempted in a way that captures its dependence on the control performance and on the diagnostic resolution. Under the proposed redundancy management policy, it is shown that an enhanced overall system reliability can be achieved with a control law of a superior robustness, with an estimator of a higher resolution, and with a control performance requirement of a lesser stringency.

Wu, N. Eva↗

Two neural network algorithms for designing optimal terminal controllers with open final time

Multilayer neural networks, trained by the backpropagation through time algorithm (BPTT), have been used successfully as state-feedback controllers for nonlinear terminal control problems. Current BPTT techniques, however, are not able to deal systematically with open final-time situations such as minimum-time problems. Two approaches which extend BPTT to open final-time problems are presented. In the first, a neural network learns a mapping from initial-state to time-to-go. In the second, the optimal number of steps for each trial run is found using a line-search. Both methods are derived using Lagrange multiplier techniques. This theoretical framework is used to demonstrate that the derived algorithms are direct extensions of forward/backward sweep methods used in N-stage optimal control. The two algorithms are tested on a Zermelo problem and the resulting trajectories compare favorably to optimal control results.

Plumer, Edward S.↗

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints

We approach the problem of parallelizing state-of-the-art nonlinear programming optimization algorithms.Specifically, we focus on parallelizing quasi-Newton interior-point methods that use limited-memory secant Hessian approximations. Such interior-point methods are known to have better convergence properties and to be more effective on large-scale problems than gradient-based and derivative-free optimization algorithms. We target nonlinear and potentially nonconvex optimization problems with an arbitrary number of bound constraints and a small number of general equality and inequality constraints on the optimization variables. These problems occur for example in the form of optimal control, optimal design, and inverse problems governed by ordinary or partial differential equations, whenever they are expressed in a “reduced-space” optimization approach. We introduce and analyze the time and space complexity of a decomposition method for solving the quasi-Newton linear systems that leverages the fact that the quasi-Newton Hessian matrix has a small number of dense blocks that border a low-rank update of a diagonal matrix. This enables an efficient parallelization on memory-distributed computers of the iterations of the optimization algorithm, a state-of-the-art filter line-search interior-point algorithm by Wächter et. al. We illustrate the efficiency of the proposed method by solving structural topology optimization problems on up to 4608 cores on a parallel machine.

97 MATHEMATICS AND COMPUTING↗

Formulations and applications of large structure actuator and sensor placements

A new approach based on the steady-state solutions of the optimal control and estimation problems is presented to study respectively the actuator and sensor locations for large flexible structures. A simple and computer-implementable formulation for minimizing the steady state optimal cost function and the state estimation error inherent in the estimation process is given. In conjunction with the new approach, two criteria are established relating the actuator and the sensor placement optimalities respectively to the minimums of the optimal cost function and the state estimation error. To illustrate the concepts of this paper, we present the results of some numerical and analytical studies on the actuator and the sensor locations of several simple flexible beam modes.

Juang, J.-N.↗

Robust Path Planning and Feedback Design Under Stochastic Uncertainty

Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.

autonomuys vehicles↗

Optimal guidance and propulsion control for transatmospheric vehicles

Problems associated with on-board trajectory optimization and with the synthesis of guidance laws are addressed for ascent to LEO of an air-breathing, single-stage-to-orbit vehicle. A multimode propulsion system is assumed which incorporates turbojet, ramjet, scramjet, and rocket engines. An energy-state approximation is applied to a four-state dynamic model for flight of a point mass over a spherical nonrotating earth. An algorithm for generating fuel-optimal climb profiles is derived via singular perturbation theory. This algorithm results from application of the minimum principle to a low-order dynamic model that includes general functional dependence on angle of attack and a normal component of thrust. Switching conditions are derived which, under appropriate assumptions, govern optimal transition from one propulsion mode to another. The use of bank angle to modulate the magnitude of the vertical component of lift is shown to improve the index performance. Numerical results illustrate the nature of the resulting fuel-optimal climb paths.

Corban, J. E.↗