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 163 records · Page 9

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Restoring Critical Loads in Resilient Distribution Systems Using a Curriculum Learned Controller: Preprint

In this paper, we propose a curriculum learned reinforcement learning (RL) controller to facilitate distribution system critical load restoration (CLR), leveraging RL's fast online response and its outstanding optimal sequential control capability. Like many grid control problems, CLR is complicated due to the large control action space and renewable uncertainty in a heavily constrained non-linear environment with strong intertemporal dependency. The nature of the problem oftentimes causes the RL policy to converge to a poor-performing local optimum if learned directly. To overcome this, we design a two-stage curriculum in which the RL agent will learn generation control and load restoration decision under different scenarios progressively. Via curriculum learning, the trained RL controller is expected to achieve a better control performance, with critical loads restored as rapidly and reliably as possible. Using the IEEE 13-bus test system, we illustrate the performance of the RL controller trained by the proposed curriculum-based method.

61 RADIATION PROTECTION AND DOSIMETRY↗

DOE OSTI2025

Quantifying the impact of precision errors on quantum approximate optimization algorithms

The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical algorithm that seeks to achieve approximate solutions to optimization problems by iteratively alternating between intervals of controlled quantum evolution. Here, we examine the effect of analog precision errors on QAOA performance from the perspective of both algorithmic training and performance guarantees. Leveraging cumulant expansions, we recast the faulty QAOA as a control problem in which precision errors are expressed as multiplicative control noise and derive bounds on the performance of QAOA. We show using both analytical techniques and numerical simulations that fixed precision implementations of QAOA circuits are subject to an exponential degradation in performance dependent upon the number of optimal QAOA layers and magnitude of the precision error. Despite this significant reduction, we show that it is possible to mitigate precision errors in QAOA via digitization of the variational parameters at the cost of increasing circuit depth.

quantum algorithms↗

DOE OSTI2022

Feedback Power Cost Optimization in Power Distribution Networks with Prosumers

Here, we propose a feedback control approach for solving optimal power flow (OPF) problems in power distribution networks (DNs) based on a projected gradient scheme, where the cost is given by the sum of functions of local power injections. This approach does not require detailed knowledge of the grid model and enables real-time tracking of the optimal generation configuration. Moreover, the communication burden is minimal: only a broadcast from a central entity, called the Network Supervisor (NS), to the agents in the network is needed. Hence, agents do not have to share local information that can be sensitive, e.g., their power injections or the value of the local costs. Our approach is then used to solve a particular OPF problem targeting DNs with high penetration of distributed energy resources (DERs) in which the energy cost is given by the remuneration that the DERs owners receive for the service they provide.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2021

A Novel Framework for Optimizing Ramping Capability of Hybrid Energy Storage Systems

Hybrid Energy Storage System has been widely applied in aerospace, electric vehicle, and microgrid applications. The advantages are that they include complimentary technologies with both high power and energy capabilities. HESS have the potential to be useful to the bulk power systems, for example to increase the value of energy produced by variable generation resource through enabling participation in ancillary service markets. Actualizing the benefits of HESSs requires optimizing the combined ramping capability of aggregated HESS resources. To provide quality ancillary service, source of HESSs locating at multiple sites of variable generation resource must be optimally sized and cohesively controlled. Optimizing aggregated resources can be formulated as an optimization problem. Successfully solving this problem not only requires using effective solution methods but also depends on accurately and rapidly setting the necessary parameters in the problem formula. This article proposes a novel framework with double-layer structure to solve the optimization problem of aggregating ramping capability. Program developed on the upper layer focuses on solving the optimization of aggregating ramping capability among multiple HESSs and is compatible with most existing optimization algorithms. Program on lower layer of the framework targets at optimizing the local control of a single HESS based on a thorough analytics of HESS operation strategy presented in this article. Result of local optimization is also provided to upper layer program for updating the parameters in formula of optimization problem. Real time hardware-in-the-loop test is conducted to verify the performance of the optimization framework developed. The work presented is expected to provide guidance for implementing this framework in practical operation.

Luo, Yushen↗

DOE OSTI2020

A direct transcription-based multiple shooting formulation for dynamic optimization

The growing need for fast and efficient solution techniques for solving dynamic optimization problems is driven by a broad spectrum of applications in scheduling and control. We suggest a novel framework for dynamic optimization that utilizes a multiple shooting “backbone” with discrete rather than continuous subproblems, thereby eliminating need for repeated time-integration. A Lagrangian relaxation (LR)-based decomposition scheme is proposed, which dualizes the state continuity requirements between subproblems and enables parallel solution of the problem. We demonstrate the applicability of our method on two case studies: the Van der Pol oscillator and a batch reactor.

42 ENGINEERING↗

DOE OSTI2023

Deep Sigma Point Processes-Assisted Chance-Constrained Power System Transient Stability Preventive Control

Here this paper proposes a deep sigma point processes (DSPP)-assisted chance-constrained power system transient stability preventive control method to deal with uncertain renewable energy and loads-induced stability risk. The traditional transient stability-constrained preventive control is reformulated as a chance-constrained optimization problem. To deal with the computational bottleneck of the time-domain simulation-based probabilistic transient stability assessment, the DSPP is developed. DSPP is a parametric Bayesian approach that allows us to predict system transient stability with high computational efficiency while accurately quantifying the confidence intervals of the predictions that can be used to inform system instability risk. To this end, with a given preset confidence probability, we embed DSPP into the primal dual interior point method to help solve the chance-constrained preventive control problem, where the corresponding Jacobian and Hessian matrices are derived. Comparison results with other existing methods show that the proposed method can significantly speed up preventive control while maintaining high accuracy and convergence

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Harnessing the power of gradient-based simulations for multi-objective optimization in particle accelerators

Abstract Particle accelerator operation requires simultaneous optimization of multiple objectives. Multi-objective optimization (MOO) is particularly challenging due to trade-offs between the objectives. Evolutionary algorithms, such as genetic algorithms (GAs), have been leveraged for many optimization problems, however, they do not apply to complex control problems by design. This paper demonstrates the power of differentiability for solving MOO problems in particle accelerators using a deep differentiable reinforcement learning (DDRL) algorithm. We compare the DDRL algorithm with model-free reinforcement learning (MFRL), GA, and Bayesian optimization (BO) for simultaneous optimization of heat load and trip rates in the continuous electron beam accelerator facility. The underlying problem enforces strict constraints on both individual states and actions as well as cumulative (global) constraints on energy requirements of the beam. Using historical accelerator data, we develop a physics-based surrogate model which is differentiable and allows for back-propagation of gradients. The results are evaluated in the form of a Pareto-front with two objectives. We show that the DDRL outperforms MFRL, BO, and GA on high dimensional problems.

43 PARTICLE ACCELERATORS↗

DOE OSTI2020

Exponential Decay in the Sensitivity Analysis of Nonlinear Dynamic Programming

In this report, we study the sensitivity of discrete-time dynamic programs with nonlinear dynamics and objective to perturbations in the initial conditions and reference parameters. Under uniform controllability and boundedness assumptions for the problem data, we prove that the directional derivative of the optimal state and control at time $k$, $x^*_k$, and $u^*_k$, with respect to the reference signal at time $i$, $d_i$, will have exponential decay in terms of $|k-i|$ with a decay rate $\rho$ independent of the temporal horizon length. The key technical step is to prove that a version of the convexification approach proposed by Verschueren et al. can be applied to the KKT conditions and results in a convex quadratic program with uniformly bounded data. In turn, Riccati techniques can be further employed to obtain the sensitivity result, borne from the observation that the directional derivatives are solutions of quadratic programs with structure similar to the KKT conditions themselves. We validate our findings with numerical experiments on a small nonlinear, nonconvex, dynamic program.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Reinforcement learning applied to dilute combustion control for increased fuel efficiency

To reduce the modeling burden for control of spark-ignition engines, reinforcement learning (RL) has been applied to solve the dilute combustion limit problem. Q-learning was used to identify an optimal control policy to adjust the fuel injection quantity in each combustion cycle. A physics-based model was used to determine the relevant states of the system used for training the control policy in a data-efficient manner. The cost function was chosen such that high cycle-to-cycle variability (CCV) at the dilute limit was minimized while maintaining stoichiometric combustion as much as possible. Experimental results demonstrated a reduction of CCV after the training period with slightly lean combustion, contributing to a net increase in fuel conversion efficiency of 1.33%. To ensure stoichiometric combustion for three-way catalyst compatibility, a second feedback loop based on an exhaust oxygen sensor was incorporated into the fuel quantity controller using a slow proportional-integral (PI) controller. The closed-loop experiments showed that both feedback loops can cooperate effectively, maintaining stoichiometric combustion while reducing combustion CCV and increasing fuel conversion efficiency by 1.09%. Finally, a modified cost function was proposed to ensure stoichiometric combustion with a single controller. In addition, the learning period was shortened by half to evaluate the RL algorithm performance on limited training time. Experimental results showed that the modified cost function could achieve the desired CCV targets, however, the learning time was reduced by half and the fuel conversion efficiency increased only by 0.30%.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2021

Iterative Linearization for Phasor-Defined Optimal Power Dispatch

Optimal power flow (OPF) problems, which dispatch power targets to controllable generating units across a network, must generally account for non-convex constraints on power flow. Furthermore, adapting those problems so as to make them solvable with convex optimization techniques is an area of much academic and operational interest. In this paper, we present a method for solving OPF as a quadratic program by iteratively refining and re-initializing a linearized model of power flow based on the outputs of an associated nonlinear solver. The linear model on which we demonstrate this method is an adapted version of an approximation designed for use with unbalanced distribution networks. As an important benefit, the model allows for the explicit inclusion of nodal voltage phasor values in both the OPF problem's objective and its constraints, which opens the door to the idea of phasor-based control (PBC) design. We show in simulations on the IEEE 13-node test feeder that our method quickly converges to a set of phasor targets that are sufficiently precise for use in operations at the distribution level.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2026

Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression

Dynamic optimization problems arise in many applications including flow control, full waveform inversion, and medical imaging. These problems are plagued by significant computational challenges. One such challenge — and the focus of this work — is the memory limitation induced by the size of the underlying dynamical system. In particular, the entire dynamic trajectory is required for derivative computation and therefore must be stored or recomputed using, e.g., checkpointing. Although recent work demonstrated the use of adaptive randomized sketching to overcome the memory challenge, that work only applies to smooth unconstrained problems, prohibiting its use for nonsmooth regularized and constrained problems. The inclusion of nonsmooth regularizers and constraints is critical as they often arise in an attempt to preserve certain physical properties or to promote sparsity. To solve these problems, we introduce a trust-region algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function that leverages randomized sketching to compress the dynamical system trajectories and adaptively adjust the sketch rank to satisfy a gradient inexactness condition. We prove convergence of this algorithm and demonstrate that it achieves substantial memory reduction on three discretized PDE-constrained optimization applications.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Control-Affine Schrödinger Bridge and Generalized Bohm Potential

From a stochastic control perspective, the Schrödinger bridge is a density-valued continuous curve parameterized by time that connects a given pair of initial and terminal probability densities via minimum effort controlled Brownian motion. The control-affine Schrödinger bridge extends this idea to a generic control-affine Itô diffusion, possibly with an additive state cost. Here, in this letter, we recast the necessary conditions of optimality for the control-affine Schrödinger bridge problem as a two point boundary value problem for a quantum mechanical Schrödinger PDE with complex potential. This complex-valued potential is a generalization of the real-valued Bohm potential in quantum mechanics. Our derived potential is akin to the optical potential in nuclear physics where the real part of the potential encodes elastic scattering (transmission of wave function), and the imaginary part encodes inelastic scattering (absorption of wave function). The key takeaway is that the process noise that drives the evolution of probability densities induces an absorbing medium in the evolution of wave function. These results make new connections between control theory and non-equilibrium statistical mechanics through the lens of quantum mechanics.

Markov processes↗

DOE OSTI2020

Efficient Ensemble-Based Stochastic Gradient Methods for Optimization Under Geological Uncertainty

Ensemble-based stochastic gradient methods, such as the ensemble optimization (EnOpt) method, the simplex gradient (SG) method, and the stochastic simplex approximate gradient (StoSAG) method, approximate the gradient of an objective function using an ensemble of perturbed control vectors. These methods are increasingly used in solving reservoir optimization problems because they are not only easy to parallelize and couple with any simulator but also computationally more efficient than the conventional finite-difference method for gradient calculations. In this work, we show that EnOpt may fail to achieve sufficient improvement of the objective function when the differences between the objective function values of perturbed control variables and their ensemble mean are large. On the basis of the comparison of EnOpt and SG, we propose a hybrid gradient of EnOpt and SG to save on the computational cost of SG. We also suggest practical ways to reduce the computational cost of EnOpt and StoSAG by approximating the objective function values of unperturbed control variables using the values of perturbed ones. We first demonstrate the performance of our improved ensemble schemes using a benchmark problem. Results show that the proposed gradients saved about 30–50% of the computational cost of the same optimization by using EnOpt, SG, and StoSAG. As a real application, we consider pressure management in carbon storage reservoirs, for which brine extraction wells need to be optimally placed to reduce reservoir pressure buildup while maximizing the net present value. Results show that our improved schemes reduce the computational cost significantly.

58 GEOSCIENCES↗

DOE OSTI2021

The continuum and leading twist limits of parton distribution functions in lattice QCD

In this study, we present continuum limit results for the unpolarized parton distribution function of the nucleon computed in lattice QCD. This study is the first continuum limit using the pseudo-PDF approach with Short Distance Factorization for factorizing lattice QCD calculable matrix elements. Our findings are also compared with the pertinent phenomenological determinations. Inter alia, we are employing the summation Generalized Eigenvalue Problem (sGEVP) technique in order to optimize our control over the excited state contamination which can be one of the most serious systematic errors in this type of calculations. A crucial novel ingredient of our analysis is the parameterization of systematic errors using Jacobi polynomials to characterize and remove both lattice spacing and higher twist contaminations, as well as the leading twist distribution. This method can be expanded in further studies to remove all other systematic errors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2025

Facets of hydro power and future trends in a Nordic Context

Hydropower technologies bolster high penetration of variable renewable energies (VREs) in the net zero emissions scenarios. Nevertheless, there are various challenges to meeting the ambitious goal, such as stability, reliability, resiliency, security, lack of reactive power, voltage support and inertia, large-scale storage deployment and coordination, interconnectedness, demand-side response, higher thermal cycles with increased start/stops, and inadequate Levelized Cost of Energy (LCOE) for system-wise VRE integration and profitability. This survey conducts a bottom-up analysis to unveil the opportunities to utilize hydropower facilities and disentangle the nested problem for intertwining design features, control algorithms, operation, optimization approaches, incentives, services, and market mechanisms using a three-pillar framework perspective: grid owners, power producers, and machine designers. The survey identified emerging trends in real-time and capacity markets, flexible power systems, and enhanced grid capabilities, including advanced voltage support and updated grid codes. These developments present significant opportunities for hydropower, such as achieving super-flexibility through hybridization, expanded reactive power capabilities, and advanced operational modes like a synchronous condenser and power adequator functionalities. These opportunities require novel design philosophies — including new winding, stator, and rotor configurations, optimized ventilation, and active cooling systems — to enhance performance under stressed grid and climate conditions. Finally, integrating climate and energy models for multi-basin optimization with finer spatial and temporal granularity enhances the planning accuracy for water management of hydropower while addressing environmental challenges. The review delivers helpful prospective suggestions and tools that would serve researchers, power engineers, and stakeholders in making decisions about hydropower technologies and services in 2050 and beyond.

13 HYDRO ENERGY↗

DOE OSTI2024

Enhancing quantum annealing accuracy through replication-based error mitigation *

Abstract Quantum annealers like those manufactured by D-Wave Systems are designed to find high quality solutions to optimization problems that are typically hard for classical computers. They utilize quantum effects like tunneling to evolve toward low-energy states representing solutions to optimization problems. However, their analog nature and limited control functionalities present challenges to correcting or mitigating hardware errors. As quantum computing advances towards applications, effective error suppression is an important research goal. We propose a new approach called replication based mitigation (RBM) based on parallel quantum annealing (QA). In RBM, physical qubits representing the same logical qubit are dispersed across different copies of the problem embedded in the hardware. This mitigates hardware biases, is compatible with limited qubit connectivity in current annealers, and is well-suited for currently available noisy intermediate-scale quantum annealers. Our experimental analysis shows that RBM provides solution quality on par with previous methods while being more flexible and compatible with a wider range of hardware connectivity patterns. In comparisons against standard QA without error mitigation on larger problem instances that could not be handled by previous methods, RBM consistently gets better energies and ground state probabilities across parameterized problem sets.

Djidjev, Hristo N. (ORCID:0000000192868824)↗

DOE OSTI2020

Decentralized Schemes with Overlap for Solving Graph-Structured Optimization Problems

We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it uses overlapping subdomains to promote and accelerate convergence. We show that the algorithm converges if the size of the overlap is sufficiently large and that the convergence rate improves exponentially with the size of the overlap. The proposed approach provides a bridge between fully decentralized and centralized architectures and is flexible in that it enables the implementation of asynchronous schemes, handling of constraints, and balancing of computing, communication, and data privacy needs. The proposed scheme is tested in an estimation problem for a 9241-node power network and we show that it outperforms the alternating direction method of multipliers.

asynchronous↗

DOE OSTI2021

Grey-box modeling and application for building energy simulations - A critical review

Grey-box modeling, as one of the three fundamental modeling techniques for building energy models, has many advantages compared with black-box modeling and white-box modeling. Additionally, it has been widely applied to solve problems of building technologies, such as building load estimation, control and optimization, and building-grid integration. However, a thorough review of grey-box modeling is not available. This review study systematically investigated various aspects of grey-box modeling for buildings. First, the fundamental aspects of grey-box modeling are presented, including the theoretical background, modeling of building elements, modeling order, modeling diagram, and order reduction. Second, the detailed modeling approaches are discussed. Third, multiple applications of grey-box modeling are investigated for building energy domain, which are categorized into the following groups: heat dynamics analysis, thermal load estimation, building control and optimization, district/urban scale energy modeling, and building-grid integration. Finally, the available software packages for grey-box modeling are compared. Overall, the challenges of using grey-box modeling can be summarized as follows: (1) the theoretical limitations and assumptions of grey-box modeling are unclear; (2) grey-box model naming convention and structure are confusing; (3) grey-box model creation is vague; (4) suitable applications of grey-box models are unknown; and (5) grey-box models lack unified software solutions for wider adoption.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗