Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximate dynamic programming 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.

26 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Near-Optimal Performance of Stochastic Model Predictive Control

Here, this article presents a regret analysis for stochastic model predictive control (SMPC) in linear systems with quadratic performance index and additive and multiplicative uncertainties. Under a finite support assumption, the problem can be cast as a finite-dimensional quadratic program, but the problem becomes quickly intractable as the problem size grows exponentially in the horizon length. SMPC aims to compute approximate solutions by solving a sequence of problems with truncated prediction horizons and committing the solution in a receding-horizon fashion. Although this approach is widely used in practice, its performance relative to the optimal solution is not well understood. This article reports for the first time a rigorous near-optimal performance guarantee of SMPC: under stabilizability and detectability conditions, the regret of SMPC is exponentially small in the prediction horizon length, allowing SMPC to achieve near-optimal performance at a substantially reduced computational expense.

93E20, 93B45↗
DOE OSTI2020

Tractable minor-free generalization of planar zero-field Ising models

In this work, we present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive 'gluing' of planar and O(1)-sized components and subsets of at most three vertices into a tree. The polynomial time algorithm of the dynamic programming type for solving exact inference (computing partition function) and exact sampling (generating i.i.d. samples) consists of sequential application of an efficient (for planar) or brute-force (for O(1)-sized) inference and sampling to the components as a black box. To illustrate the utility of the new family of tractable graphical models, we first build a polynomial algorithm for inference and sampling of zero-field Ising models over K 33 -minor-free topologies and over K 5 -minor-free topologies—both of which are extensions of the planar zero-field Ising models—which are neither genus- nor treewidth-bounded. Second, we empirically demonstrate an improvement in the approximation quality of the NP-hard problem of inference over the square-grid Ising model in a node-dependent nonzero 'magnetic' field.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Overvoltage Prevention and Curtailment Reduction Using Adaptive Droop-Based Supplementary Control in Smart Inverters

Recent developments in the renewable energy sector have seen an unprecedented growth in residential photovoltaic (PV) installations. However, high PV penetration levels often lead to overvoltage problems in low-voltage (LV) distribution feeders. Smart inverter control such as active power curtailment (APC)-based overvoltage control can be implemented to overcome these challenges. The APC technique utilizes a constant droop-based approach which curtails power rigidly, which can lead to significant energy curtailment in the LV distribution feeders. In this paper, different variations of the APC technique with linear, quadratic, and exponential droops have been analyzed from the point-of-view of energy curtailment for a LV distribution network in North America. Further, a combinatorial approach using various droop-based APC methods in conjunction with adaptive dynamic programming (ADP) as a supplementary control scheme has also been proposed. The proposed approach minimizes energy curtailment in the LV distribution network by adjusting the droop gains. Simulation results depict that ADP in conjunction with exponential droop reduces the energy curtailment to approximately 50% compared to using the standard linear droop.

42 ENGINEERING↗
DOE OSTI2021

Dynamic Ride-Matching for Large-Scale Transportation Systems

Efficient dynamic ride-matching (DRM) in large-scale transportation systems is a key driver in transport simulations to yield answers to challenging problems. Although the DRM problem is simple to solve, it quickly becomes a computationally challenging problem in large-scale transportation system simulations. Therefore, this study thoroughly examines the DRM problem dynamics and proposes an optimization-based solution framework to solve the problem efficiently. To benefit from parallel computing and reduce computational times, the problem’s network is divided into clusters utilizing a commonly used unsupervised machine learning algorithm along with a linear programming model. Then, these sub-problems are solved using another linear program to finalize the ride-matching. At the clustering level, the framework allows users adjusting cluster sizes to balance the trade-off between the computational time savings and the solution quality deviation. A case study in the Chicago Metropolitan Area, U.S., illustrates that the framework can reduce the average computational time by 58% at the cost of increasing the average pick up time by 26% compared with a system optimum, that is, non-clustered, approach. Another case study in a relatively small city, Bloomington, Illinois, U.S., shows that the framework provides quite similar results to the system-optimum approach in approximately 62% less computational time.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Semiglobal Safety-Filtered Extremum Seeking With Unknown CBFs

We introduce a safe extremum-seeking (Safe ES) algorithm which achieves the minimization of an unknown objective function while ensuring that an unknown, yet measured, control barrier function (CBF) remains above an arbitrarily small negative value for all time. In other words, “practical safety” is maintained during the entire period of convergence to the constrained extremum. Our design is based on quadratic program (QP) CBF style filters for safety, which is applied in an average and estimated sense. Using nonsmooth analysis tools, we guarantee semiglobal practical asymptotic (SPA) stability of the global constrained optimum, practical convergence to the safe set if starting in a condition violating the CBF, and practical safety for all time—semiglobally—if starting in safe set. The safety result of the paper is analogous with modern notions of SPA stability, guaranteeing that, for any small violation of safety, there exist design coefficients which guarantee that such a small violation is not exceeded. The paper outlines a set of sufficient conditions on the barrier and objective functions, and by way of a Lyapunov argument, we demonstrate that nonconvex constrained optimization problems can be solved. We present these results in the setting of a static map and a dynamical system. A simulation example illustrates the results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Approximating Trajectory Constraints With Machine Learning – Microgrid Islanding With Frequency Constraints

Here, we introduce deep earning aided constraint encoding to tackle the frequency-constraint microgrid scheduling problem. The nonlinear function between system operating condition and frequency nadir is approximated by using a neural network, which admits an exact mixed-integer formulation (MIP). This formulation is then integrated with the scheduling problem to encode the frequency constraint. With the stronger representation power of the neural network, the resulting commands can ensure adequate frequency response in a realistic setting in addition to islanding success. The proposed method is validated on a modified 33-node system. Successful islanding with a secure response is simulated under the scheduled commands using a detailed three-phase model in Simulink. The advantages of our model are particularly remarkable when the inertia emulation functions from wind turbine generators are considered.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗
DOE OSTI2020

RELAP-7 Application and Enhancement for FLEX Strategies and ATF Behavior under Extended Loss of AC Power Conditions

This report summarizes the results of a three-year research project sponsored by the U.S. Department of Energy (DOE) Nuclear Energy University Program (NEUP) to enhance and apply the RELAP-7 code by adding and improving several important components (e.g., a mechanistic Reactor Core Isolation Cooling (RCIC) system model) for thermal hydraulic studies of LWRs under ELAP conditions and evaluating the time available for transition to portable FLEX equipment. The project team included University of Massachusetts–Lowell, The Ohio State University, Texas A&M University, Idaho National Laboratory and Oak Ridge National Laboratory. In the Fukushima accident, it was found that the RCIC system played a crucial role in delaying core meltdown by almost three days in Fukushima Daiichi Unit 2, because of self-regulated operation of the steam driven RCIC turbine-pump injection system. Steam flow in the convergent-divergent nozzles of the RCIC Terry turbine is two-phase non-equilibrium transonic flow with homogenous nucleation condensation. To more accurately predict the dynamic process and behavior of the transonic compressible steam flow, a one-dimensional transient two-phase analytical model is presented. A simplified four-fluid model was employed in the present work with the consideration of four separate fluid fields: vapor, liquid film, entrained droplets and condensed droplets. The mass, momentum and energy interactions between the fluids were considered and modeled. An extended seven-equation non-equilibrium critical flow model was developed to obtain the critical pressure and velocities of each phase at the nozzle throat. To predict the wetness in the divergent section, a mechanistic nucleation condensation model was integrated in the nozzle analysis model, considering the generation and consequent growth of droplets. The governing differential equations on a staggered grid were discretized using the second-order Lax-Wendroff scheme with a flux limiter, and the Semi-Implicit Method for Pressure-Linked Equation (SIMPLE) algorithm was employed to solve the discrete linear system. To demonstrate the predictability and reliability of the physical models and the numerical method proposed in the present work, three representative nozzles were modeled and simulated. The results show good agreement with the available experimental data, even for condensation shock. Then, the 1D nozzle model was employed to obtain nozzle flow tables of the Terry turbine nozzle for different working pressures which can cover the operation pressure range of the RCIC system. A mechanistic RCIC turbine-pump system model was developed and implemented in the system code TRACE to simulate dynamic responses of the RCIC system under Beyond Design Basis Accident (BDBA) conditions. The turbine-pump governing equations are based on the control volume approach of the angular momentum balance. The physics based mechanistic RCIC model was developed using the TRACE control system components (i.e., signal variables, control blocks, and tables), and incorporated into a TRACE boiling water reactor (BWR) model. The TRACE model in this report has a detailed nodalization of the reactor pressure vessel (RPV), and all of the major flow paths and system components, including the safety relief valves (SRVs) and the containment suppression pool and drywell. Based on the nozzle flow tables generated from the 1D nozzle model developed, the turbine drive torque can be calculated from table lookup. Since the detailed specifications of the RCIC pump are unavailable, the homologous curves for a Bingham pump were used in the current pump component. A station black-out (SBO) accident test problem was selected to demonstrate the TRACE RCIC model. The short-term SBO simulations were performed for two cladding materials: Zircaloy and FeCrAl, to demonstrate the effect of the accident tolerant fuel cladding on fuel heat-up under BDBA accident conditions. The wetwell plays a vital safety role in SBO and other BWR accident scenarios in that it can reduce containment pressure and supply additional core make-up water. The suppression pool temperature distribution has a very large impact on both RPV and containment pressure. Thus, another novel contribution of the project comes mainly from an improved, systems-level wetwell model which can capture buoyancy-induced thermal stratification effects due to steam injection and condensation. A two-zone stratified wetwell model has been implemented in RELAP-7 and some results from that model are presented. This wetwell model is capable of simulating thermal stratification due to a low steam mass injection rate. With a low mass flow rate, the model assumes that all the steam condenses within the pipe and the resulting plume can be approximated with a purely buoyant, heat-source driven model. The wetwell model developed with these assumptions is adequate to simulate slow transients such as extended SBO transients.

42 ENGINEERING↗