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,675 records · Page 93

Optimization applications in aircraft engine design and test

Starting with the NASA-sponsored STAEBL program, optimization methods based primarily upon the versatile program COPES/CONMIN were introduced over the past few years to a broad spectrum of engineering problems in structural optimization, engine design, engine test, and more recently, manufacturing processes. By automating design and testing processes, many repetitive and costly trade-off studies have been replaced by optimization procedures. Rather than taking engineers and designers out of the loop, optimization has, in fact, put them more in control by providing sophisticated search techniques. The ultimate decision whether to accept or reject an optimal feasible design still rests with the analyst. Feedback obtained from this decision process has been invaluable since it can be incorporated into the optimization procedure to make it more intelligent. On several occasions, optimization procedures have produced novel designs, such as the nonsymmetric placement of rotor case stiffener rings, not anticipated by engineering designers. In another case, a particularly difficult resonance contraint could not be satisfied using hand iterations for a compressor blade, when the STAEBL program was applied to the problem, a feasible solution was obtained in just two iterations.

Pratt, T. K.↗

Runway Operations Planning: A Two-Stage Solution Methodology

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. Thus, Runway Operations Planning (ROP) is a critical component of airport operations planning in general and surface operations planning in particular. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, may be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. Generating optimal runway operations plans was approached in with a 'one-stage' optimization routine that considered all the desired objectives and constraints, and the characteristics of each aircraft (weight class, destination, Air Traffic Control (ATC) constraints) at the same time. Since, however, at any given point in time, there is less uncertainty in the predicted demand for departure resources in terms of weight class than in terms of specific aircraft, the ROP problem can be parsed into two stages. In the context of the Departure Planner (OP) research project, this paper introduces Runway Operations Planning (ROP) as part of the wider Surface Operations Optimization (SOO) and describes a proposed 'two stage' heuristic algorithm for solving the Runway Operations Planning (ROP) problem. Focus is specifically given on including runway crossings in the planning process of runway operations. In the first stage, sequences of departure class slots and runwy crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program. Preliminary results from the algorithm implementation on real-world traffic data are included.

Anagnostakis, Ioannis↗

Nonlinear control of the minimum safety factor in tokamaks by optimal allocation of spatially moving electron cyclotron current drive

The minimum value of the safety factor profile is related to the magnetohydrodynamic (MHD) stability of the plasma confined in a tokamak. Therefore, active control of the minimum safety factor may mitigate MHD instabilities that can degrade or even terminate plasma confinement. Typically, in most tokamak scenarios, the minimum safety factor evolves spatially with time, i.e., the location at which the safety factor achieves the minimum value changes with time. In addition to the inherent nonlinearities in the minimum safety factor evolution, its spatial variation makes the control design challenging. In particular, complexity in control design may arise from the need for time-dependent nonlinear models that account for spatial variation of the minimum safety factor. Furthermore, the minimum safety factor may drift to locations where the actuator authority is low. The problem of minimum safety factor control with target location tracking and moving electron cyclotron current drive (ECCD) is addressed in this work. A nonlinear time-dependent model that incorporates the spatial variation of the minimum safety factor is presented. A nonlinear controller based on optimal feedback linearization is developed to track a target minimum safety factor. The proposed controller treats the ECCD position as a controllable variable. In other words, the controller prescribes the ECCD position (in addition to the non-inductive powers) in real time based on an optimal criterion that is defined a priori. This work also presents the steps necessary to integrate the minimum safety factor controller with a total energy controller to achieve multiple control objectives simultaneously. In conclusion, the proposed integrated control algorithm is tested using nonlinear simulations in the Control Oriented Transport SIMulator (COTSIM) for a DIII-D tokamak scenario.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimal pre-scheduling of problem remappings

A large class of scientific computational problems can be characterized as a sequence of steps where a significant amount of computation occurs each step, but the work performed at each step is not necessarily identical. Two good examples of this type of computation are: (1) regridding methods which change the problem discretization during the course of the computation, and (2) methods for solving sparse triangular systems of linear equations. Recent work has investigated a means of mapping such computations onto parallel processors; the method defines a family of static mappings with differing degrees of importance placed on the conflicting goals of good load balance and low communication/synchronization overhead. The performance tradeoffs are controllable by adjusting the parameters of the mapping method. To achieve good performance it may be necessary to dynamically change these parameters at run-time, but such changes can impose additional costs. If the computation's behavior can be determined prior to its execution, it can be possible to construct an optimal parameter schedule using a low-order-polynomial-time dynamic programming algorithm. Since the latter can be expensive, the performance is studied of the effect of a linear-time scheduling heuristic on one of the model problems, and it is shown to be effective and nearly optimal.

Nicol, David M.↗

Optical Sensor/Actuator Locations for Active Structural Acoustic Control

Researchers at NASA Langley Research Center have extensive experience using active structural acoustic control (ASAC) for aircraft interior noise reduction. One aspect of ASAC involves the selection of optimum locations for microphone sensors and force actuators. This paper explains the importance of sensor/actuator selection, reviews optimization techniques, and summarizes experimental and numerical results. Three combinatorial optimization problems are described. Two involve the determination of the number and position of piezoelectric actuators, and the other involves the determination of the number and location of the sensors. For each case, a solution method is suggested, and typical results are examined. The first case, a simplified problem with simulated data, is used to illustrate the method. The second and third cases are more representative of the potential of the method and use measured data. The three case studies and laboratory test results establish the usefulness of the numerical methods.

Piezoelectric actuators↗

Thermal Energy Storage Model Development within the Integrated Energy Systems Hybrid Repository

This publication details newly created energy storage models developed within the HYBRID Modelica repository as part of the Department of Energy Office of Nuclear Energy (DOE-NE) Integrated Energy Systems (IES) program, led by Idaho National Laboratory (INL). Model development to-date includes creation of dynamic systems-level models of concrete, latent heat, and packed-bed thermocline energy storage technologies for deployment in the IES-based HYBRID repository. Models are developed using the latest publicly available data and incorporate the possibility of control strategy inclusion for use with the existing IES modeling, analysis, and optimization toolset. Simulations showcase the abilities of each technology to cyclically charge and discharge when exposed to time-varying boundary conditions. In addition, low-level surrogate models for some of the thermal energy storage technologies were created using Python. These lower order Python files are much cheaper to run (i.e., computationally faster) and thus operate well when incorporated within the stochastic optimization problems run for the IES program. Moreover, economic data was collected for use within the INL-developed Framework for Optimization of ResourCes and Economics (FORCE). This information is incorporated within the FORCE platform. This work has resulted in creation of systems-level models for concrete, latent heat, and thermocline thermal energy storage systems with associated control systems. Now that these models are available, they can be utilized within different integrated energy park concepts to understand optimal system operation, control, and dispatching. Moreover, given the generic nature of the models, industrial partner technologies (e.g., Storworks Power, EnergyNest) can be quickly added to the repository using the existing models as a basis. Additional dynamic models for thermal energy storage concepts can be developed and added to the HYBRID repository as needed.

25 ENERGY STORAGE↗

Gaming the beamlines—employing reinforcement learning to maximize scientific outcomes at large-scale user facilities

Abstract Beamline experiments at central facilities are increasingly demanding of remote, high-throughput, and adaptive operation conditions. To accommodate such needs, new approaches must be developed that enable on-the-fly decision making for data intensive challenges. Reinforcement learning (RL) is a domain of AI that holds the potential to enable autonomous operations in a feedback loop between beamline experiments and trained agents. Here, we outline the advanced data acquisition and control software of the Bluesky suite, and demonstrate its functionality with a canonical RL problem: cartpole. We then extend these methods to efficient use of beamline resources by using RL to develop an optimal measurement strategy for samples with different scattering characteristics. The RL agents converge on the empirically optimal policy when under-constrained with time. When resource limited, the agents outperform a naive or sequential measurement strategy, often by a factor of 100%. We interface these methods directly with the data storage and provenance technologies at the National Synchrotron Light Source II, thus demonstrating the potential for RL to increase the scientific output of beamlines, and layout the framework for how to achieve this impact.

36 MATERIALS SCIENCE↗

Improving Signal-to-Noise Ratio (SNR) for Readout Signals Using Adaptive Filters on Reconfigurable Controls Hardware

This study investigates the optimization of Signal-to-Noise Ratio (SNR) in superconducting quantum computing readout signals through adaptive filtering. Quantum computing technology has the potential to revolutionize various fields by delivering exponential speedup in solving certain computational problems. However, the technology's practical implementation is hindered by the difficulty of extracting clean, reliable signals during the readout phase, with various sources of noise presenting a significant barrier to clean signals. This noise, often present in readout profiles due to imperfect isolation, degrades the system's overall SNR, thus impeding the ability to extract the quantum state accurately. The research leverages the power of adaptive filtering to improve the SNR of quantum computing readout signals. Specifically, an adaptive filter is implemented in a PYNQ overlay on an FPGA, and eventually will be connected to a quantum computing system. The system models the noise with a Least Mean Squares (LMS) adaptive filter, and then subtracts the estimated noise from the received signal to improve the SNR. A Direct Memory Access (DMA) channel is used to handle the signal processing, delivering efficient, high-speed data transfer between the PYNQ system and the hardware. The study explores the benefits of this adaptive filtering technique, potentially providing a significant contribution to practical and fast quantum computing.

Johnson, Hans↗

Improving Signal-to-Noise Ratio (SNR) for Readout Signals Using Adaptive Filters on Reconfigurable Controls Hardware

This study investigates the optimization of Signal-to-Noise Ratio (SNR) in superconducting quantum computing readout signals through adaptive filtering. Quantum computing technology has the potential to revolutionize various fields by delivering exponential speedup in solving certain computational problems. However, the technology's practical implementation is hindered by the difficulty of extracting clean, reliable signals during the readout phase, with various sources of noise presenting a significant barrier to clean signals. This noise, often present in readout profiles due to imperfect isolation, degrades the system's overall SNR, thus impeding the ability to extract the quantum state accurately. The research leverages the power of adaptive filtering to improve the SNR of quantum computing readout signals. Specifically, an adaptive filter is implemented in a PYNQ overlay on an FPGA, and eventually will be connected to a quantum computing system. The system models the n oise with a Least Mean Squares (LMS) adaptive filter, and then subtracts the estimated noise from the received signal to improve the SNR. A Direct Memory Access (DMA) channel is used to handle the signal processing, delivering efficient, high-speed data transfer between the PYNQ system and the hardware. The study explores the benefits of this adaptive filtering technique, potentially providing a significant contribution to practical and fast quantum computing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Pilot interaction with automated airborne decision making systems

An investigation was made of interaction between a human pilot and automated on-board decision making systems. Research was initiated on the topic of pilot problem solving in automated and semi-automated flight management systems and attempts were made to develop a model of human decision making in a multi-task situation. A study was made of allocation of responsibility between human and computer, and discussed were various pilot performance parameters with varying degrees of automation. Optimal allocation of responsibility between human and computer was considered and some theoretical results found in the literature were presented. The pilot as a problem solver was discussed. Finally the design of displays, controls, procedures, and computer aids for problem solving tasks in automated and semi-automated systems was considered.

Rouse, W. B.↗

Finite difference numerical methods for boundary control problems governed by hyperbolic partial differential equations

This paper briefly reviews convergent finite difference schemes for hyperbolic initial boundary value problems and their applications to boundary control systems of hyperbolic type which arise in the modelling of vibrations. These difference schemes are combined with the primal and the dual approaches to compute the optimal control in the unconstrained case, as well as the case when the control is subject to inequality constraints. Some of the preliminary numerical results are also presented.

Chen, G.↗

Research on output feedback control

In designing fixed order compensators, an output feedback formulation has been adopted by suitably augmenting the system description to include the compensator states. However, the minimization of the performance index over the range of possible compensator descriptions was impeded due to the nonuniqueness of the compensator transfer function. A controller canonical form of the compensator was chosen to reduce the number of free parameters to its minimal number in the optimization. In the MIMO case, the controller form requires a prespecified set of ascending controllability indices. This constraint on the compensator structure is rather innocuous in relation to the increase in convergence rate of the optimization. Moreover, the controller form is easily relatable to a unique controller transfer function description. This structure of the compensator does not require penalizing the compensator states for a nonzero or coupled solution, a problem that occurs when following a standard output feedback synthesis formulation.

Calise, A. J.↗

Integrated control/structure optimization by multilevel decomposition

A method for integrated control/structure optimization by multilevel decomposition is presented. It is shown that several previously reported methods were actually partial decompositions wherein only the control was decomposed into a subsystem design. One of these partially decomposed problems was selected as a benchmark example for comparison. The system is fully decomposed into structural and control subsystem designs and an improved design is produced. Theory, implementation, and results for the method are presented and compared with the benchmark example.

Zeiler, Thomas A.↗

Integrated control/structure optimization by multilevel decomposition

A method for integrated control/structure optimization by multilevel decomposition is presented. It is shown that several previously reported methods were actually partial decompositions wherein only the control was decomposed into a subsystem design. One of these partially decomposed problems was selected as a benchmark example for comparison. The present paper fully decomposes the system into structural and control subsystem designs and produces an improved design. Theory, implementation, and results for the method are presented and compared with the benchmark example.

Zeiler, Thomas A.↗

Robustness of solutions to a benchmark control problem

The robustness of 10 solutions to a benchmark control design problem presented at the 1990 American Control Conference has been evaluated. The 10 controllers have second-to-eighth-order transfer functions and have been designed using several different methods, including H-infinity optimization, loop-transfer recovery, imaginary-axis shifting, constrained optimization, structured covariance, game theory, and the internal model principle. Stochastic robustness analysis quantifies the controllers' stability and performance robustness with structured uncertainties in up to six system parameters. The analysis provides insights into system response that are not readily derived from other robustness criteria and provides a common ground for judging controllers produced by alternative methods. One important conclusion is that gain and phase margins are not reliable indicators of the probability of instability. Furthermore, parameter variations actually may improve the likelihood of achieving selected performance metrics, as demonstrated by results for the probability of settling-time exceedance.

Stengel, Robert F.↗

A Novel Multi-Agent Deep Reinforcement Learning-enabled Distributed Power Allocation Scheme for mmWave Cellular Networks

We consider the power allocation problem over shared spectrum for millimeter-Wave (mmWave) cellular downlink. Existing approaches usually find sub-optimal solutions by solving a non-convex optimization which leads to scalability issues due to centralized control. Therefore, distributed and adaptive approaches are desirable. Recently, model-free Deep Reinforcement Learning (DRL) has achieved success in such wireless resource management tasks. By modeling the radio environment as a Markov Decision Process (MDP) with the base stations (BSs) being the agents, power allocation can be automated at the agent level with comparable throughput performance to conventional centralized schemes. The multi-agent setting presents new challenges as the radio environment is impacted by the joint actions of the agents and is no longer stationary from any individual agent’s perspective. Existing literature bypasses this non-stationarity violation by ignoring it which may cause performance degradation. To tackle this issue, we propose a distributed continuous power allocation scheme based on a modified version of multi-agent Deep Deterministic Policy Gradient (MADDPG) that is tailored for the distributed multiple-agent setting. The proposed scheme employs a centralized-training distributed-execution framework where Q-functions are trained over subsets of BSs while each BS determines its transmit power based only on its own local observation. It admits constant per-BS communication and computation complexity and is thus scalable to large networks. Numerical evaluation shows that the proposed scheme adapts well to a wide range of interference conditions and can achieve comparable or better performance than several state-of-the-art non-learning approaches.

99 GENERAL AND MISCELLANEOUS↗

Lossy checkpoint compression in full waveform inversion: a case study with ZFPv0.5.5 and the overthrust model

This paper proposes a new method that combines checkpointing methods with error-controlled lossy compression for large-scale high-performance full-waveform inversion (FWI), an inverse problem commonly used in geophysical exploration. This combination can significantly reduce data movement, allowing a reduction in run time as well as peak memory. In the exascale computing era, frequent data transfer (e.g., memory bandwidth, PCIe bandwidth for GPUs, or network) is the performance bottleneck rather than the peak FLOPS of the processing unit. Like many other adjoint-based optimization problems, FWI is costly in terms of the number of floating-point operations, large memory footprint during backpropagation, and data transfer overheads. Past work for adjoint methods has developed checkpointing methods that reduce the peak memory requirements during backpropagation at the cost of additional floating-point computations. Combining this traditional checkpointing with error-controlled lossy compression, we explore the three-way tradeoff between memory, precision, and time to solution. We investigate how approximation errors introduced by lossy compression of the forward solution impact the objective function gradient and final inverted solution. Empirical results from these numerical experiments indicate that high lossy-compression rates (compression factors ranging up to 100) have a relatively minor impact on convergence rates and the quality of the final solution.

58 GEOSCIENCES↗

Feedback-based quantum algorithms for ground state preparation

The ground state properties of quantum many-body systems are a subject of interest across chemistry, materials science, and physics. Thus, algorithms for finding ground states can have broad impacts. Variational quantum algorithms are one class of ground state algorithms that has received significant attention in recent years. These algorithms utilize a hybrid quantum-classical computing framework to prepare ground states on quantum computers. However, this requires solving a classical optimization problem that can become prohibitively expensive in high dimensions. Here, we develop formulations of feedback-based quantum algorithms for ground state preparation that can be used to address this challenge for two broad classes of Hamiltonians: Fermi-Hubbard Hamiltonians, and molecular Hamiltonians represented in second quantization. Feedback-based quantum algorithms are optimization-free; in place of classical optimization, quantum circuit parameters are set according to a deterministic feedback law derived from quantum Lyapunov control principles. This feedback law guarantees a monotonic improvement in solution quality with respect to the depth of the quantum circuit. A variety of numerical illustrations are provided that analyze the convergence and robustness of feedback-based quantum algorithms for these problem classes. Published by the American Physical Society 2024

Larsen, James B. (ORCID:000000020777440X)↗