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 703 records · Page 39

An optimal control strategy for collision avoidance of mobile robots in non-stationary environments

An optimal control formulation of the problem of collision avoidance of mobile robots in environments containing moving obstacles is presented. Collision avoidance is guaranteed if the minimum distance between the robot and the objects is nonzero. A nominal trajectory is assumed to be known from off-line planning. The main idea is to change the velocity along the nominal trajectory so that collisions are avoided. Furthermore, time consistency with the nominal plan is desirable. A numerical solution of the optimization problem is obtained. Simulation results verify the value of the proposed strategy.

Kyriakopoulos, K. J.↗

Robustified time-optimal control of uncertain structural dynamic systems

A new approach for computing open-loop time-optimal control inputs for uncertain linear dynamical systems is developed. In particular, the single-axis, rest-to-rest maneuvering problem of flexible spacecraft in the presence of uncertainty in model parameters is considered. Robustified time-optimal control inputs are obtained by solving a parameter optimization problem subject to robustness constraints. A simple dynamical system with a rigid-body mode and one flexible mode is used to illustrate the concept.

Liu, Qiang↗

Optimization of Systems with Uncertainty: Initial Developments for Performance, Robustness and Reliability Based Designs

This paper presents a study on the optimization of systems with structured uncertainties, whose inputs and outputs can be exhaustively described in the probabilistic sense. By propagating the uncertainty from the input to the output in the space of the probability density functions and the moments, optimization problems that pursue performance, robustness and reliability based designs are studied. Be specifying the desired outputs in terms of desired probability density functions and then in terms of meaningful probabilistic indices, we settle a computationally viable framework for solving practical optimization problems. Applications to static optimization and stability control are used to illustrate the relevance of incorporating uncertainty in the early stages of the design. Several examples that admit a full probabilistic description of the output in terms of the design variables and the uncertain inputs are used to elucidate the main features of the generic problem and its solution. Extensions to problems that do not admit closed form solutions are also evaluated. Concrete evidence of the importance of using a consistent probabilistic formulation of the optimization problem and a meaningful probabilistic description of its solution is provided in the examples. In the stability control problem the analysis shows that standard deterministic approaches lead to designs with high probability of running into instability. The implementation of such designs can indeed have catastrophic consequences.

Crespo, Luis G.↗

Evolutionary Computing for Low-thrust Navigation

The development of new mission concepts requires efficient methodologies to analyze, design and simulate the concepts before implementation. New mission concepts are increasingly considering the use of ion thrusters for fuel-efficient navigation in deep space. This paper presents parallel, evolutionary computing methods to design trajectories of spacecraft propelled by ion thrusters and to assess the trade-off between delivered payload mass and required flight time. The developed methods utilize a distributed computing environment in order to speed up computation, and use evolutionary algorithms to find globally Pareto-optimal solutions. The methods are coupled with two main traditional trajectory design approaches, which are 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. In the indirect approach, a thrust control problem is transformed into a costate control problem, and the initial values of the costate vector are optimized. The developed methods are applied to two problems: 1) an orbit transfer around the Earth and 2) a transfer between two distance retrograde orbits around Europa, the closest to Jupiter of the icy Galilean moons. The optimal solutions found with the present methods are comparable to other state-of-the-art trajectory optimizers and to analytical approximations for optimal transfers, while the required computational time is several orders of magnitude shorter than other optimizers thanks to an intelligent design of control vector discretization, advanced algorithmic parameterization, and parallel computing.

optimization↗

Towards sub-optimal stochastic control of partially observable stochastic systems

A class of multidimensional stochastic control problems with noisy data and bounded controls encountered in aerospace design is examined. The emphasis is on suboptimal design, the optimality being taken in quadratic mean sense. To that effect the problem is viewed as a stochastic version of the Lurie problem known from nonlinear control theory. The main result is a separation theorem (involving a nonlinear Kalman-like filter) suitable for Lurie-type approximations. The theorem allows for discontinuous characteristics. As a byproduct the existence of strong solutions to a class of non-Lipschitzian stochastic differential equations in dimensions is proven.

Ruzicka, G. J.↗

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗

Control-System Design Program

Control-theory design package, Optimal Regulator Algorithms for Control of Linear Systems (ORACLS), developed to aid in design of controllers and optimal filters for systems modeled by linear, time-invariant differential and difference equations. Optimal linear quadratic regulator theory, Linear-Quadratic-Gaussian (LQG) problem, most widely accepted method of determining optimal control policy. Provides for solution to time-in-variant continuous or discrete LQG problems. Attractive to control-system designer providing rigorous tool for dealing with multi-input and multi-output dynamic systems in continuous and discrete form. CDO version written in FORTRAN IV. VAX version written in FORTRAN 77.

Frisch, Harold P.↗

A Modern Load Relief Guidance Scheme for Space Launch Vehicles

Launch vehicle load relief algorithms are concerned with realizing a reduction of transient bending moments near maximum dynamic pressure. Traditional approaches to load relief typically use inner-loop acceleration feedback to reduce the wind-induced angle of attack. When implemented in the inner loop, load relief bandwidth is necessarily limited by the achievable stability margins, and when acceleration feedback is employed, by the uncertainty associated with structural modes that couple with the body-mounted accelerometer. The structure of inner loop load relief increases the dimensionality of the flight control gain and filter optimization problem. Most importantly, classical load relief laws do not take advantage of high-rate and high-accuracy GPS-aided inertial velocity data that is readily available from modern strap down IMUs. In this paper, a novel load relief guidance scheme is described that uses direct angle-of-attack feedback in a clever mechanization. The steering commands are determined by examining the wind-perturbed dynamics of a launch vehicle with respect to a gravity turn ascent trajectory. An angle of attack estimate is derived from GPS-aided inertial data and pre-launch range wind measurements, and it is shown that a reduction worst-case rigid-body loads can be realized without requiring air data. The algorithm also includes a high-rate navigation data preprocessing scheme that operates directly on the IMU delta-theta and delta-velocity measurements in order to produce a filtered acceleration estimate at the vehicle center of mass. The outer-loop guidance scheme simplifies the design process for the classical inner-loop autopilot. Algorithm performance is demonstrated using Monte Carlo analysis of a representative liquid booster in a production high fidelity launch vehicle simulation.

NESC↗

A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations

Many applications require minimizing the sum of smooth and nonsmooth functions. For example, basis pursuit denoising problems in data science require minimizing a measure of data misfit plus an $\ell^1$-regularizer. Similar problems arise in the optimal control of partial differential equations (PDEs) when sparsity of the control is desired. Here, we develop a novel trust-region method to minimize the sum of a smooth nonconvex function and a nonsmooth convex function. Our method is unique in that it permits and systematically controls the use of inexact objective function and derivative evaluations. When using a quadratic Taylor model for the trust-region subproblem, our algorithm is an inexact, matrix-free proximal Newton-type method that permits indefinite Hessians. We prove global convergence of our method in Hilbert space and demonstrate its efficacy on three examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗

Learning Sequential Distribution System Restoration via Graph-Reinforcement Learning

We report a distribution service restoration algorithm as a fundamental resilient paradigm for system operators provides an optimally coordinated, resilient solution to enhance the restoration performance. The restoration problem is formulated to coordinate distribution generators and controllable switches optimally. A model-based control scheme is usually designed to solve this problem, relying on a precise model and resulting in low scalability. To tackle these limitations, this work proposes a graph-reinforcement learning framework for the restoration problem. We link the power system topology with a graph convolutional network, which captures the complex mechanism of network restoration in power networks and understands the mutual interactions among controllable devices. Latent features over graphical power networks produced by graph convolutional layers are exploited to learn the control policy for network restoration using deep reinforcement learning. The solution scalability is guaranteed by modeling distributed generators as agents in a multi-agent environment and a proper pre-training paradigm. Comparative studies on IEEE 123-node and 8500-node test systems demonstrate the performance of the proposed solution.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Neuroevolution Application to Collaborative and Heuristics-Based Connected and Autonomous Vehicle Cohort Simulation at Uncontrolled Intersection

Artificial intelligence is gaining tremendous attractiveness and showing great success in solving various problems, such as simplifying optimal control derivation. This work focuses on the application of Neuroevolution to the control of Connected and Autonomous Vehicle (CAV) cohorts operating at uncontrolled intersections. The proposed method implementation’s simplicity, thanks to the inclusion of heuristics and effective real-time performance are demonstrated. The resulting architecture achieves nearly ideal operating conditions in keeping the average speeds close to the speed limit. It achieves twice as high mean speed throughput as a controlled intersection, hence enabling lower travel time and mitigating energy inefficiencies from stop-and-go vehicle dynamics. Low deviation from the road speed limit is hence continuously sustained for cohorts of at most 50 m long. This limitation can be mitigated with additional lanes that the cohorts can split into. The concept also allows the testing and implementation of fast-turning lanes by simply replicating and reconnecting the control architecture at each new road crossing, enabling high scalability for complex road network analysis. The controller is also successfully validated within a high-fidelity vehicle dynamic environment, showing its potential for driverless vehicle control in addition to offering a new traffic control simulation model for future autonomous operation studies.

Jacquelin, Frederic (ORCID:0000000183154344)↗

The reverse Goddard problem.

Fuel-time optimal retrothrust control for vertical and gravity turn ballistic trajectories of soft landing nonlifting bodies based on Pontryagin principle

Bejczy, A. K.↗

Simulation of low thrust guidance problems

The determination of optimal rocket control profiles and the guidance procedures used to approximate these profiles have received much attention. Simple guidance procedures have sufficed for the Apollo flights. A modified version of the linear tangent guidance law is developed which can be used for a low-thrust orbital maneuvering system such as the space shuttle. The modification allows the estimation of gravity over long thrusting arcs which is necessary for low thrust systems.

Dawkins, G. S.↗

Optimal large angle maneuvers with simultaneous shape control/vibration arrest

A relaxation method is demonstrated which reliably solves the nonlinear two point boundary value problem which arises when optimal control theory is applied to determination of large angle maneuvers of flexible spacecraft. The basic ideas are summarized and several idealized maneuvers are determined. The emphasis is upon demonstrating the basic ideas and practical aspects of the methodology.

Turner, J. D.↗

Algorithm for fuel conservative horizontal capture trajectories

A real time algorithm for computing constant altitude fuel-conservative approach trajectories for aircraft is described. The characteristics of the trajectory computed were chosen to approximate the extremal trajectories obtained from the optimal control solution to the problem and showed a fuel difference of only 0.5 to 2 percent for the real time algorithm in favor of the extremals. The trajectories may start at any initial position, heading, and speed and end at any other final position, heading, and speed. They consist of straight lines and a series of circular arcs of varying radius to approximate constant bank-angle decelerating turns. Throttle control is maximum thrust, nominal thrust, or zero thrust. Bank-angle control is either zero or aproximately 30 deg.

Neuman, F.↗

Optimal quasi-static shape control for large aerospace antennae

In this paper, an on-line control approach which will adjust the steady-state shape of a large antenna arbitarily close to any achievable desired profile is proposed. The method makes use of distributed parameter system theory and allows refocusing using a limited number of control actuators and sensors. The controller gains are calculated by approximating the solution to an infinite-dimensional optimal quasi-static control problem. A very general convergence result for such quasi-static controllers is proved and applied to the antenna controller to show convergence, using any Galerkin (finite-element) approximation method.

Balas, M. J.↗