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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 325 records · Page 18

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Pipeline Hydrogen Decarbonization and Repurposing Analyzers (P-HyDRAs)

The Pipeline Hydrogen Decarbonization and Repurposing Analyzers (P-HyDRAs) are a set of prototype computational tools for simulating and optimizing midstream natural gas pipeline system operations subject to location and time-dependent hydrogen blending. The models can accurately resolve dynamic gas flows through large-scale pipeline networks using non-ideal gas equations of state. The codes can be used as decision support for planning and design decisions involving intra-day energy flow schedules as well as spatiotemporal economic values of natural gas, hydrogen, and net energy delivered to consumers while ensuring that pipeline hydraulic limitations, gas compressor station constraints, operational factors, and pre-existing shipping contracts are satisfied. The inputs to the codes are a model of the pipeline system as well as time-series data that specify boundary conditions on the network. For optimization, the code module requires price and quantity offers for natural gas and hydrogen and price and quantity bids for energy, which are used as time-dependent constraints in an optimal control problem. The outputs are time-series data that provide a predictive simulation of gas flows, mass fractions, and pressures, or with additional degrees of freedom give an approximately optimal solution for gas injections/withdrawals, compressor settings, and sensitivities to the objective function that provide locational values of energy.

Zlotnik, Anatoly↗

NASA NTRS2018

A Novel Multi-Spacecraft Interplanetary Global Trajectory Optimization Transcription

As the frontier of space exploration continues to advance, so does the design complexity of future interplanetary missions. One avenue of this increasing complexity includes a class of designs known as "Distributed Spacecraft Missions"; missions where multiple spacecraft coordinate to perform shared objectives. Current approaches for the global trajectory optimization of these Multi-Vehicle Missions (MVMs) are prone to shortcomings including laborious iterative design, considerable human-in-the-loop effort, treatment of the multi-vehicle problem as multiple separate trajectory optimization subproblems (resulting in suboptimal solutions where the whole is less than the sum of its parts), and poor handling of coordination objectives and constraints. There are only a handful of software platforms in existence capable of fully-automated, rapid, interplanetary mission and systems global optimization including the Parallel Global Multiobjective Optimizer (PaGMO), the Gravity Assisted Low-thrust Local Optimization Program (GALLOP), and the Evolutionary Mission Trajectory Generator (EMTG). However, none of these tools is capable of performing such tasks for MVM designs. The work outlined in this paper lays the groundwork for a technique to begin addressing these shortcomings. We present a fully-automated technique which frames interplanetary MVMs as Multi-Objective, Multi-Agent Hybrid Optimal Control Problems (MOMA HOCP). First, the basic functionality of this technique is validated on the single-vehicle problem of reproducing the Cassini interplanetary cruise.

Interplanetary↗

NASA NTRS1983

Orbit structure of Hamiltonian systems arising from Lie transformation group actions

This paper associates the Riccati group and its group action on linear-quadratic optimal control problems to the action of a Lie transformation group on a set of Hamiltonian matrices. In this Lie theoretic setting results are presented concerning the associated orbit structure and the structure of the group itself. These results are of importance in understanding the solution structure of matrix Riccati differential equations, and thus also of importance in linear-quadratic optimal control.

Garzia, M. R.↗

NASA NTRSDate not supplied

Optimal Control Allocation for Distributed Electric Propulsion in A Series/Parallel Partial Hybrid Powertrain

The SUbsonic Single Aft eNgine (SUSAN) Electrofan is a NASA concept transport aircraft representative of technology anticipated for a 2040 entry-into-service date. The powertrain consists of a single thrust-producing geared turbofan engine with generators driving a series/parallel partial hybrid power/propulsion system. The architecture includes 16 underwing contrarotating fans, eight on each side. The distributed fans can be used by the flight control system to augment or replace the rudder function. This paper sets up the optimal control problem of setpoint determination for individual wingfans in the distributed propulsion system, accounting for electrical string efficiencies, saturations, and failures. The solution minimizes power consumption while maintaining thrust and torque on the airframe for maneuvering. Additionally, thrust that would have been lost due to temporary fan speed or power saturation is optimally redistributed to maintain overall desired thrust and torque on the aircraft. A simulation of a coordinated turn utilizing the distributed electric propulsion for yaw rate control in a multiple wingfan failure scenario demonstrates the robustness of the powertrain design to failures and helps define its limitations.

Distributed Electric Propulsion↗

NASA NTRSDate not supplied

Optimal Control Allocation for Distributed Electric Propulsion in A Series/Parallel Partial Hybrid Powertrain

Distributed Electric Propulsion↗

NASA NTRS1975

The effects of stability augmentation on the gust response of a STOL aircraft during a curved manual approach

The task of investigating the effect of SAS was formulated as two optimal control problems for stochastic systems: (1) to compute SAS gains with a rate model in the performance index algorithm; and (2) to calculate the pilot gains and system gust response using an optimal pilot model. Both problems were solved to yield reasonable low gains for the pilot and SAS, and the lateral directional mode poles and the longitudinal short period poles could be placed accurately by the model matching algorithm. Of the longitudinal (SAS) poles achieved, the vertical rms path error was least for the unaugmented poles. The lateral rms path error was an order of magnitude larger than the vertical error and showed a plus or minus 50 percent variation with SAS. It increased with dutch roll frequency and damping, and it decreased most significantly with increased roll stability. The variation in lateral error with bank angle for curved flight was also a significant function of the augmented poles.

Porter, M. B., Jr.↗

NASA NTRS1992

Aerodynamic design and optimization in one shot

This paper describes an efficient numerical approach for the design and optimization of aerodynamic bodies. As in classical optimal control methods, the present approach introduces a cost function and a costate variable (Lagrange multiplier) in order to achieve a minimum. High efficiency is achieved by using a multigrid technique to solve for all the unknowns simultaneously, but restricting work on a design variable only to grids on which their changes produce nonsmooth perturbations. Thus, the effort required to evaluate design variables that have nonlocal effects on the solution is confined to the coarse grids. However, if a variable has a nonsmooth local effect on the solution in some neighborhood, it is relaxed in that neighborhood on finer grids. The cost of solving the optimal control problem is shown to be approximately two to three times the cost of the equivalent analysis problem. Examples are presented to illustrate the application of the method to aerodynamic design and constraint optimization.

Ta'asan, Shlomo↗

DOE OSTI2022

Binary Optimal Control of Single-Flux-Quantum Pulse Sequences

We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta (SFQ) control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. Here we model this process as an binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of O(p log(p)), where p is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelity’s better than 99.9%, in ≈ 25 trust-region iterations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2020

TEAM project review, year 1

This note summarizes our research activities within the TEAM project between October 2019 and November 2020, funded by the ASCR Advanced Research in Quantum Computing program. Three research efforts have begun during the review period. The first effort, resulting in the JuQBox software, implemented a novel algorithm for optimal control in closed quantum systems based on symplectic time integration and exact calculations of the gradient of the discretized objective function. In our second effort, resulting in a code called Quandary, we consider the optimal control problem for open quantum systems. Here the evolution of the quantum system is modeled by the Lindblad master equation. In this code, we are considering both the realization of quantum gates as well as the optimal reset problem in which a general mixed quantum state is driven towards its ground state. In our third research effort we have begun the development of computational software for what we call Lindblad learning, i.e. the process of characterizing the equations governing our quantum computing hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control

Here, we study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domain into a set of overlapping subdomains, and solves all subproblems defined over subdomains in parallel. The convergence is attained by updating primal-dual information at the boundaries of overlapping subdomains. We show that the algorithm exhibits local linear convergence, and that the convergence rate improves exponentially with the overlap size. We also establish global convergence results for a general quadratic programming, which enables the application of the Schwarz scheme inside second-order optimization algorithms (e.g., sequential quadratic programming). The theoretical foundation of our convergence analysis is a sensitivity result of nonlinear OCPs, which we call "exponential decay of sensitivity" (EDS). Intuitively, EDS states that the impact of perturbations at domain boundaries (i.e., initial and terminal time) on the solution decays exponentially as one moves into the domain. Here, we expand a previous analysis available in the literature by showing that EDS holds for both primal and dual solutions of nonlinear OCPs, under uniform second-order sufficient condition, controllability condition, and boundedness condition. We conduct experiments with a quadrotor motion planning problem and a partial differential equations (PDE) control problem to validate our theory, and show that the approach is significantly more efficient than alternating direction method of multipliers and as efficient as the centralized interior-point solver.

42 ENGINEERING↗

NASA NTRS1992

Sufficient conditions for a local minimum of the Bolza problem with a scalar terminal point constraint

Sufficient conditions for a weak relative minimum for a form of the Bolza problem of variational calculus are derived. Testing of the second-order conditions requires the backward integration of fewer matrix elements than in the case of most previously published sets of conditions. The derivation is felt to be more complete and straightforward than previous derivations. The variational problem considered is relatively simple, with just a scalar constraint to implicitly or explicitly determine the final time, in order to avoid the complexities associated with controllability considerations. Sufficient conditions for a local minimum for more general optimal control problems can be approached by building upon the derivation and results presented here.

Wood, Lincoln J.↗

NASA NTRS2002

A Nonlinear, Human-Centered Approach to Motion Cueing with a Neurocomputing Solver

This paper discusses the continuation of research into the development of new motion cueing algorithms first reported in 1999. In this earlier work, two viable approaches to motion cueing were identified: the coordinated adaptive washout algorithm or 'adaptive algorithm', and the 'optimal algorithm'. In this study, a novel approach to motion cueing is discussed that would combine features of both algorithms. The new algorithm is formulated as a linear optimal control problem, incorporating improved vestibular models and an integrated visual-vestibular motion perception model previously reported. A control law is generated from the motion platform states, resulting in a set of nonlinear cueing filters. The time-varying control law requires the matrix Riccati equation to be solved in real time. Therefore, in order to meet the real time requirement, a neurocomputing approach is used to solve this computationally challenging problem. Single degree-of-freedom responses for the nonlinear algorithm were generated and compared to the adaptive and optimal algorithms. Results for the heave mode show the nonlinear algorithm producing a motion cue with a time-varying washout, sustaining small cues for a longer duration and washing out larger cues more quickly. The addition of the optokinetic influence from the integrated perception model was shown to improve the response to a surge input, producing a specific force response with no steady-state washout. Improved cues are also observed for responses to a sway input. Yaw mode responses reveal that the nonlinear algorithm improves the motion cues by reducing the magnitude of negative cues. The effectiveness of the nonlinear algorithm as compared to the adaptive and linear optimal algorithms will be evaluated on a motion platform, the NASA Langley Research Center Visual Motion Simulator (VMS), and ultimately the Cockpit Motion Facility (CMF) with a series of pilot controlled maneuvers. A proposed experimental procedure is discussed. The results of this evaluation will be used to assess motion cueing performance.

Telban, Robert J.↗

NASA NTRS2006

Algorithms for Maneuvering Spacecraft Around Small Bodies

A document describes mathematical derivations and applications of autonomous guidance algorithms for maneuvering spacecraft in the vicinities of small astronomical bodies like comets or asteroids. These algorithms compute fuel- or energy-optimal trajectories for typical maneuvers by solving the associated optimal-control problems with relevant control and state constraints. In the derivations, these problems are converted from their original continuous (infinite-dimensional) forms to finite-dimensional forms through (1) discretization of the time axis and (2) spectral discretization of control inputs via a finite number of Chebyshev basis functions. In these doubly discretized problems, the Chebyshev coefficients are the variables. These problems are, variously, either convex programming problems or programming problems that can be convexified. The resulting discrete problems are convex parameter-optimization problems; this is desirable because one can take advantage of very efficient and robust algorithms that have been developed previously and are well established for solving such problems. These algorithms are fast, do not require initial guesses, and always converge to global optima. Following the derivations, the algorithms are demonstrated by applying them to numerical examples of flyby, descent-to-hover, and ascent-from-hover maneuvers.

Acikmese, A. Bechet↗

NASA NTRS2002

Closed-Loop Endoatmospheric Ascent Guidance

This paper will present a complete formulation of the optimal control problem for atmospheric ascent of rocket powered launch vehicles subject to usual load constraints and final condition constraints. We shall demonstrate that the classical finite difference method for two-point-boundary-value-problems (TPBVP) is suited for solving the ascent trajectory optimization problem in real time, therefore closed-loop optimal endoatmospheric ascent guidance becomes feasible. Numerical simulations with a the vehicle data of a reusable launch vehicle will be provided.

Lu, Ping↗

NASA NTRS2010

Aircraft Trajectory Optimization and Contrails Avoidance in the Presence of Winds

There are indications that persistent contrails can lead to adverse climate change, although the complete effect on climate forcing is still uncertain. A flight trajectory optimization algorithm with fuel and contrails models, which develops alternative flight paths, provides policy makers the necessary data to make tradeoffs between persistent contrails mitigation and aircraft fuel consumption. This study develops an algorithm that calculates wind-optimal trajectories for cruising aircraft while avoiding the regions of airspace prone to persistent contrails formation. The optimal trajectories are developed by solving a non-linear optimal control problem with path constraints. The regions of airspace favorable to persistent contrails formation are modeled as penalty areas that aircraft should avoid and are adjustable. The tradeoff between persistent contrails formation and additional fuel consumption is investigated, with and without altitude optimization, for 12 city-pairs in the continental United States. Without altitude optimization, the reduction in contrail travel times is gradual with increase in total fuel consumption. When altitude is optimized, a two percent increase in total fuel consumption can reduce the total travel times through contrail regions by more than six times. Allowing further increase in fuel consumption does not seem to result in proportionate decrease in contrail travel times.

Ng, Hok K.↗

NASA NTRS1990

Optimal finite-thrust spacecraft trajectories using collocation and nonlinear programming

A new method is described for the determination of optimal spacecraft trajectories in an inverse-square field using finite, fixed thrust. The method employs a recently developed optimization technique which uses a piecewise polynomial representation for the state and controls, and collocation, thus converting the optimal control problem into a nonlinear programming problem, which is solved numerically. This technique has been modified to provide efficient handling of those portions of the trajectory which can be determined analytically, i.e., the coast arcs. Among the problems that have been solved using this method are optimal rendezvous and transfer (including multirevolution cases) and optimal multiburn orbit insertion from hyperbolic approach.

Enright, Paul J.↗

NASA NTRS1990

Numerical approach of collision avoidance and optimal control on robotic manipulators

Collision-free optimal motion and trajectory planning for robotic manipulators are solved by a method of sequential gradient restoration algorithm. Numerical examples of a two degree-of-freedom (DOF) robotic manipulator are demonstrated to show the excellence of the optimization technique and obstacle avoidance scheme. The obstacle is put on the midway, or even further inward on purpose, of the previous no-obstacle optimal trajectory. For the minimum-time purpose, the trajectory grazes by the obstacle and the minimum-time motion successfully avoids the obstacle. The minimum-time is longer for the obstacle avoidance cases than the one without obstacle. The obstacle avoidance scheme can deal with multiple obstacles in any ellipsoid forms by using artificial potential fields as penalty functions via distance functions. The method is promising in solving collision-free optimal control problems for robotics and can be applied to any DOF robotic manipulators with any performance indices and mobile robots as well. Since this method generates optimum solution based on Pontryagin Extremum Principle, rather than based on assumptions, the results provide a benchmark against which any optimization techniques can be measured.

Wang, Jyhshing Jack↗

NASA NTRS1989

Autonomous spacecraft attitude control using magnetic torquing only

Magnetic torquing of spacecraft has been an important mechanism for attitude control since the earliest satellites were launched. Typically a magnetic control system has been used for precession/nutation damping for gravity-gradient stabilized satellites, momentum dumping for systems equipped with reaction wheels, or momentum-axis pointing for spinning and momentum-biased spacecraft. Although within the small satellite community there has always been interest in expensive, light-weight, and low-power attitude control systems, completely magnetic control systems have not been used for autonomous three-axis stabilized spacecraft due to the large computational requirements involved. As increasingly more powerful microprocessors have become available, this has become less of an impediment. These facts have motivated consideration of the all-magnetic attitude control system presented here. The problem of controlling spacecraft attitude using only magnetic torquing is cast into the form of the Linear Quadratic Regulator (LQR), resulting in a linear feedback control law. Since the geomagnetic field along a satellite trajectory is not constant, the system equations are time varying. As a result, the optimal feedback gains are time-varying. Orbit geometry is exploited to treat feedback gains as a function of position rather than time, making feasible the onboard solution of the optimal control problem. In simulations performed to date, the control laws have shown themselves to be fairly robust and a good candidate for an onboard attitude control system.

Musser, Keith L.↗