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 1,531 records · Page 85
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

The L sub 1 finite element method for pure convection problems

The least squares (L sub 2) finite element method is introduced for 2-D steady state pure convection problems with smooth solutions. It is proven that the L sub 2 method has the same stability estimate as the original equation, i.e., the L sub 2 method has better control of the streamline derivative. Numerical convergence rates are given to show that the L sub 2 method is almost optimal. This L sub 2 method was then used as a framework to develop an iteratively reweighted L sub 2 finite element method to obtain a least absolute residual (L sub 1) solution for problems with discontinuous solutions. This L sub 1 finite element method produces a nonoscillatory, nondiffusive and highly accurate numerical solution that has a sharp discontinuity in one element on both coarse and fine meshes. A robust reweighting strategy was also devised to obtain the L sub 1 solution in a few iterations. A number of examples solved by using triangle and bilinear elements are presented.

Jiang, Bo-Nan↗
NASA NTRS1991

The L sub 1 finite element method for pure convection problems

The least squares (L sub 2) finite element method is introduced for 2-D steady state pure convection problems with smooth solutions. It is proven that the L sub 2 method has the same stability estimate as the original equation, i.e., the L sub 2 method has better control of the streamline derivative. Numerical convergence rates are given to show that the L sub 2 method is almost optimal. This L sub 2 method was then used as a framework to develop an iteratively reweighted L sub 2 finite element method to obtain a least absolute residual (L sub 1) solution for problems with discontinuous solutions. This L sub 1 finite element method produces a nonoscillatory, nondiffusive and highly accurate numerical solution that has a sharp discontinuity in one element on both coarse and fine meshes. A robust reweighting strategy was also devised to obtain the L sub 1 solution in a few iterations. A number of examples solved by using triangle and bilinear elements are presented.

Jiang, Bo-Nan↗
NASA NTRS1993

Robust controller design for flexible structures using normalized coprime factor plant descriptions

Stabilization is a fundamental requirement in the design of feedback compensators for flexible structures. The search for the largest neighborhood around a given design plant for which a single controller produces closed-loop stability can be formulated as an H(sub infinity) control problem. The use of normalized coprime factor plant descriptions, in which the plant perturbations are defined as additive modifications to the coprime factors, leads to a closed-form expression for the maximum neighborhood boundary allowing optimal and suboptimal H(sub infinity) compensators to be computed directly without the usual gamma iteration. A summary of the theory on robust stabilization using normalized coprime factor plant descriptions is presented, and the application of the theory to the computation of robustly stable compensators for the phase version of the Control-Structures Interaction (CSI) Evolutionary Model is described. Results from the application indicate that the suboptimal version of the theory has the potential of providing the bases for the computation of low-authority compensators that are robustly stable to expected variations in design model parameters and additive unmodeled dynamics.

Armstrong, Ernest S.↗
NASA NTRS1982

Statistical analysis of piloted simulation of real time trajectory optimization algorithms

A simulation of time-optimal intercept algorithms for on-board computation of control commands is described. The effects of three different display modes and two different computation modes on the pilots' ability to intercept a moving target in minimum time were tested. Both computation modes employed singular perturbation theory to help simplify the two-point boundary value problem associated with trajectory optimization. Target intercept time was affected by both the display and computation modes chosen, but the display mode chosen was the only significant influence on the miss distance.

Price, D. B.↗
NASA NTRS2021

Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC)

With the rapid growth in the capabilities of smaller satellites, satellite architectures that replace a single, extremely capable spacecraft with multiple, cheaper ones are gaining in popularity. Unfortunately, the orbit design process for constellations can be significantly more involved, especiallywhen the relative placement of the individual spacecraft within the constellation is not constrained by mission and/or science objectives. Optimizing a satellite constellation in the presence of multiple, competing objectives is a highly complex problem to which many traditional mathematical optimization methods cannot be applied and few tools exist to help mission designers search for promising candidate mission designs. The Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC) has been created to search for near-optimal constellation design options. GenETOC combines a modified version of the Non-dominated Sorting Genetic Algorithm II (NSGA II) with STK Components libraries (a 3rdparty .NET package created by Analytical Graphics Inc.) to create a framework that enables a mission designer to generate a simulation that models the design problem and obtain a family of potential, near-optimal solutions that can be investigated more in detail. GenETOC was developed in C# using the .NET framework with Windows Presentation Foundation (WPF) serving as the framework from which to create the graphical user interface (GUI). GenETOC user inputs can be categorized into three major data components: definition of the problem (areas of interest, satellite decision parameters, and sensor configurations), definition of performance objectives, and specification of the genetic algorithm (GA) parameters. In the problem definition component, the user is prompted to define the areas of interest against which the performance metrics will be computed, define the sensor parameters and attach them to specific spacecraft, select which satellite orbital parameters will be added to the decision space of the GA, and specify the range of desired values for each optimization parameter. For performance objectives, the user is presented with a list of available coverage and revisit performance based calculation options from which two metrics are chosen to serve as the objective functions that the GA will use to evaluate solutions during the optimization process. Finally, the definition of the GA parameters provides user control over the number of generations (number of optimization iterations), the population size (number of candidate constellations created in each generation), and the adaptive mutation and crossover threshold values (control parameters for how frequently each process occurs during the optimization). GenETOC has been extensively tested to verify the individual components of the optimization process. The GA has been tested against a suite of GA test problems to confirm convergence to the known two and three-dimensional Pareto fronts. The coverage and revisit performance metrics obtained in GenETOC are compared with STK desktop scenarios, confirming the constellations are being appropriately modeled within GenETOC simulations. A walkthrough of a simple, example problem is provided to illustrate the workings of GenETOC and to demonstrate the output available to the mission designer.

mission design↗
DOE OSTI2026

Photoinduced Electron-Transfer Distance Is Controlled by the Driving Force in Solid-State Organic Donor-Acceptor Systems

Understanding how short-range electron transfer generates photocurrent in organic solar cells and what photochemical driving force is needed to maximize efficiencies has been an immensely difficult problem. Here we show how these questions are intertwined: the driving force controls the average charge-transfer distance, skipping the shortest-range states in the optimal case. Using photoinduced absorption-detected magnetic resonance, we measure average charge-separation distances in dilute donor–acceptor blends as a function of driving force, and compare these with free charge yields measured by time-resolved microwave conductivity. We find that the largest driving forces show the shortest charge-separation distances, explaining their suppressed free-carrier generation. These results support a long-range electron-transfer model, wherein the driving force controls the initial delocalization of the electron–hole pair. The minimum driving force required for efficient charge separation (and minimal voltage losses) is ultimately set by the dielectric constant of the material.

14 SOLAR ENERGY↗
DOE OSTI2024

A Measurement-Based Adaptive Voltage Regulation Method Considering Topology Changes

This paper proposes an online adaptive data-driven distributed energy resource (DER) dispatch optimization method for voltage control considering topology changes. By using a local sensitivity factor (LSF)-enabled voltage control, traditional DER control can be reformulated into a linear programming (LP) problem, leading to faster computation speeds. Power injection alteration and topology changes are two common operational changes in the distribution network that can affect the LSF and voltage control performance. To address this issue, a robust estimation method is developed to adjust the sensitivity matrix at each time step for the time-varying power injection changes. When topology changes occur, only the allocated predominant LSF submatrices are updated based on measurement data, allowing for a fast adaptation to the system reconfiguration. Results obtained from a real distribution feeder in Southern California demonstrate its robustness as compared to traditional volt-var control and constant LSF matrix dispatch control methods.

DERs↗
DOE OSTI2022

Quantum optimization of maximum independent set using Rydberg atom arrays

Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally investigate quantum algorithms for solving the maximum independent set problem. We use a hardware-efficient encoding associated with Rydberg blockade, realize closed-loop optimization to test several variational algorithms, and subsequently apply them to systematically explore a class of graphs with programmable connectivity. We find that the problem hardness is controlled by the solution degeneracy and number of local minima, and we experimentally benchmark the quantum algorithm’s performance against classical simulated annealing. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions in the deep circuit regime and analyze its origins.

Science & Technology - Other Topics↗
DOE OSTI2020

Electricity Pricing aware Deep Reinforcement Learning based Intelligent HVAC Control

Recently, deep reinforcement learning (DRL) based intelligent control of Heating, Ventilation, and Air Conditioning (HVAC) has gained a lot of attention due to DRL's ability to optimally control HVAC for minimizing operational cost while maintaining resident's comfort. The success of such DRL-based techniques largely depends on the articulation of the problem in terms of states, actions, and reward function. Inclusion of the electricity pricing information in the problem formulation can play an important role in saving the cost of HVAC operation. However, less attention has been given in the literature on formulating well-crafted state features based on electricity pricing. In this work, we propose an approach for training the DRL model with a specific focus on feature engineering based on electricity pricing. During training, we generate random but sufficiently realistic electricity price signals so that the pre-trained DRL model is robust and adaptive to the dynamic and variable electricity prices. The validation results are encouraging and show the potential of ≈12%-15% savings in the one day cost of HVAC operation, proving the usefulness of including electricity pricing related features as state features.

Kurte, Kuldeep↗
DOE OSTI2019

Application and Evaluation of Surrogate Models for Radiation Source Search

Surrogate models are increasingly required for applications in which first-principles simulation models are prohibitively expensive to employ for uncertainty analysis, design, or control. They can also be used to approximate models whose discontinuous derivatives preclude the use of gradient-based optimization or data assimilation algorithms. We consider the problem of inferring the 2D location and intensity of a radiation source in an urban environment using a ray-tracing model based on Boltzmann transport theory. Whereas the code implementing this model is relatively efficient, extension to 3D Monte Carlo transport simulations precludes subsequent Bayesian inference to infer source locations, which typically requires thousands to millions of simulations. Additionally, the resulting likelihood exhibits discontinuous derivatives due to the presence of buildings. To address these issues, we discuss the construction of surrogate models for optimization, Bayesian inference, and uncertainty propagation. Specifically, we consider surrogate models based on Legendre polynomials, multivariate adaptive regression splines, radial basis functions, Gaussian processes, and neural networks. We detail strategies for computing training points and discuss the merits and deficits of each method.

Cook, Jared A.↗
NASA NTRS1984

Number and placement of control system components considering possible failures

One of the first questions facing the designer of the control system for a large space structure is how many components actuators and sensors - to specify and where to place them on the structure. This paper presents a methodology which is intended to assist the designer in making these choices. A measure of controllability is defined which is a quantitative indication of how well the system can be controlled with a given set of actuators. Similarly, a measure of observability is defined which is a quantitative indication of how well the system can be observed with a given set of sensors. Then the effect of component unreliability is introduced by computing the average expected degree of controllability (observability) over the operating lifetime of the system accounting for the likelihood of various combinations of component failures. The problem of component location is resolved by optimizing this performance measure over the admissible set of locations. The variation of this optimized performance measure with number of actuators (sensors) is helpful in deciding how many components to use.

Vander Velde, W. E.↗
NASA NTRS1988

On Hilbert-Schmidt norm convergence of Galerkin approximation for operator Riccati equations

An abstract approximation framework for the solution of operator algebraic Riccati equations is developed. The approach taken is based on a formulation of the Riccati equation as an abstract nonlinear operator equation on the space of Hilbert-Schmidt operators. Hilbert-Schmidt norm convergence of solutions to generic finite dimensional Galerkin approximations to the Riccati equation to the solution of the original infinite dimensional problem is argued. The application of the general theory is illustrated via an operator Riccati equation arising in the linear-quadratic design of an optimal feedback control law for a 1-D heat/diffusion equation. Numerical results demonstrating the convergence of the associated Hilbert-Schmidt kernels are included.

Rosen, I. G.↗
NASA NTRS1990

Time optimal feedback control of discrete systems with bounded inputs

Deadbeat control theory gives a feedback solution to the time optimal control of discrete time systems. Experience has shown the results to be impractical because they ignore bounds on the actuator strength. This paper develops two algorithms for generating time optimal control in feedback form for discrete systems with bounded controls. The results are also applicable for generating recovery regions and the set of reachable states. For multiple control problems a method of generating sublayers is developed which decreases off-line and on-line computational effort. Two algorithms are presented with somewhat different computational and storage requirements. The algorithms are practical within certain dimension constraints, and are natural for implementation with parallel processing.

Chen, Xin↗
NASA NTRS1998

A Web-Based Monitoring System for Multidisciplinary Design Projects

In today's competitive environment, both industry and government agencies are under pressure to reduce the time and cost of multidisciplinary design projects. New tools have been introduced to assist in this process by facilitating the integration of and communication among diverse disciplinary codes. One such tool, a framework for multidisciplinary computational environments, is defined as a hardware and software architecture that enables integration, execution, and communication among diverse disciplinary processes. An examination of current frameworks reveals weaknesses in various areas, such as sequencing, displaying, monitoring, and controlling the design process. The objective of this research is to explore how Web technology, integrated with an existing framework, can improve these areas of weakness. This paper describes a Web-based system that optimizes and controls the execution sequence of design processes; and monitors the project status and results. The three-stage evolution of the system with increasingly complex problems demonstrates the feasibility of this approach.

Rogers, James L.↗
NASA NTRS2005

A Comparative Study of Probability Collectives Based Multi-agent Systems and Genetic Algorithms

We compare Genetic Algorithms (GA's) with Probability Collectives (PC), a new framework for distributed optimization and control. In contrast to GA's, PC-based methods do not update populations of solutions. Instead they update an explicitly parameterized probability distribution p over the space of solutions. That updating of p arises as the optimization of a functional of p. The functional is chosen so that any p that optimizes it should be p peaked about good solutions. The PC approach works in both continuous and discrete problems. It does not suffer from the resolution limitation of the finite bit length encoding of parameters into GA alleles. It also has deep connections with both game theory and statistical physics. We review the PC approach using its motivation as the information theoretic formulation of bounded rationality for multi-agent systems. It is then compared with GA's on a diverse set of problems. To handle high dimensional surfaces, in the PC method investigated here p is restricted to a product distribution. Each distribution in that product is controlled by a separate agent. The test functions were selected for their difficulty using either traditional gradient descent or genetic algorithms. On those functions the PC-based approach significantly outperforms traditional GA's in both rate of descent, trapping in false minima, and long term optimization.

Huang, Chien-Feng↗
NASA NTRS1986

Optimization and acceleration guidance of flight trajectories in a windshear

Guidance strategies for near-optimum performance in a wind shear are examined. The takeoff problem is considered with reference to flight in a vertical plane; the presence of a downdraft is assumed. Trajectories for optimum performance in a wind shear are determined for different wind shear models and intensities. Numerical experiments with the optimum control approach lead to the conclusion that, for weak to moderate shear/downdraft combinations, the optimal trajectory is characterized by a monotonic climb, and for severe shear/downdraft combinations, it is characterized by an initial climb, followed by a nearly horizontal flight, followed by renewed climbing after the aircraft has passed through the shear region. An acceleration guidance scheme based on relative acceleration is presented in both analytical form and feedback control form. Numerical results with this scheme result in trajectories close to the optimum and considerably superior to those arising from alternative guidance schemes.

Miele, A.↗
DOE OSTI2021

Disjunctive linear separation conditions and mixed-integer formulations for aircraft conflict resolution

In this paper, we address the aircraft conflict resolution problem in air traffic control. We introduce new mixed-integer programming formulations for aircraft conflict resolution with speed, heading and altitude control which are based on disjunctive linear separation conditions. We first examine the two-dimensional aircraft conflict resolution problem with speed and heading control represented as continuous decision variables. We show that the proposed disjunctive linear separation conditions are equivalent to the classical nonlinear conditions for aircraft separation. Further, we characterise conflict-free trajectories based on aircraft velocity bounds and propose a simple pre-processing algorithm to identify aircraft pairs which are either always conflict-free, or which cannot be separated using speed and heading control only. We then incorporate altitude control and propose a lexicographic optimisation formulation that aims to minimise the number of flight level changes before resolving outstanding conflicts via two-dimensional velocity control. The proposed mixed-integer programming formulations are nonconvex, and we propose convex relaxations, decomposition methods and constraint generation algorithms to solve the two-dimensional and lexicographic optimisation formulations to guaranteed optimality. Numerical experiments on four types of conflict resolution benchmarking instances are conducted to test the performance of the proposed mixed-integer formulations. Further, the proposed method is compared against two benchmarks based on state-of-the-art approaches for the aircraft conflict resolution problem. Our numerical results show that the proposed method largely outperforms both benchmarks in terms of runtime and is able to solve significantly more instances to global optimality.

97 MATHEMATICS AND COMPUTING↗