Search NASA⌕ Search

SEARCH · Search NASA

Results for “Constraining”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

aphBO-2GP-3B: a budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture

High-fidelity complex engineering simulations are often predictive, but also computationally expensive and often require substantial computational efforts. The mitigation of computational burden is usually enabled through parallelism in high-performance cluster (HPC) architecture. Optimization problems associated with these applications is a challenging problem due to the high computational cost of the high-fidelity simulations. In this paper, an asynchronous parallel constrained Bayesian optimization method is proposed to efficiently solve the computationally expensive simulation-based optimization problems on the HPC platform, with a budgeted computational resource, where the maximum number of simulations is a constant. The advantage of this method are three-fold. Firstly, the efficiency of the Bayesian optimization is improved, where multiple input locations are evaluated parallel in an asynchronous manner to accelerate the optimization convergence with respect to physical runtime. This efficiency feature is further improved so that when each of the inputs is finished, another input is queried without waiting for the whole batch to complete. Second, the proposed method can handle both known and unknown constraints. Third, the proposed method samples several acquisition functions based on their rewards using a modified GP-Hedge scheme. The proposed framework is termed aphBO-2GP-3B, which means asynchronous parallel hedge Bayesian optimization with two Gaussian processes and three batches. The numerical performance of the proposed framework aphBO-2GP-3B is comprehensively benchmarked using 16 numerical examples, compared against other 6 parallel Bayesian optimization variants and 1 parallel Monte Carlo as a baseline, and demonstrated using two real-world high-fidelity expensive industrial applications. The first engineering application is based on finite element analysis (FEA) and the second one is based on computational fluid dynamics (CFD) simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗
DOE OSTI2025

A mixed-integer PDE-constrained optimization formulation for constructing electromagnetic cloaks with multiple materials

We study the design of an electromagnetic cloak from multiple materials with an additional constraint on the mass of the cloak. Our problem is an example of a topology optimization problem, and we formulate this problem as a mixed-integer partial-differential equation constrained optimization (MIPDECO) problem, where Maxwell’s equation models the propagation of the wave through the cloak and surrounding medium. We use binary variables to model the assignment of the different materials, and their relevant properties (permittivity and density). The mass constraint adds a nontrivial constraint to this problem. We propose a two-phase strategy to solve this problem. In the first phase, we solve a continuous relaxation, and then propose a new variant of the feasibility pump that exploits the structure of the PDE to obtain an initial integral solution candidate. In the second phase, we use a trust-region approach to improve this incumbent. We also consider a continuation or mesh-sequencing approach to find better solutions faster on consecutively finer meshes. We present detailed numerical results to illustrate the effectiveness of our approaches for constructing multi-material cloaks with a mass constraint.

Calculus of Variations and Optimization↗
DOE OSTI2021

Gaussian process regression constrained by boundary value problems

We develop a framework for Gaussian processes regression constrained by boundary value problems. The framework may be applied to infer the solution of a well-posed boundary value problem with a known second-order differential operator and boundary conditions, but for which only scattered observations of the source term are available. Scattered observations of the solution may also be used in the regression. The framework combines co-kriging with the linear transformation of a Gaussian process together with the use of kernels given by spectral expansions in eigenfunctions of the boundary value problem. Furthermore, it benefits from a reduced-rank property of covariance matrices. We demonstrate that the resulting framework yields more accurate and stable solution inference as compared to physics-informed Gaussian process regression without boundary condition constraints.

42 ENGINEERING↗
DOE OSTI2020

Gradient-based constrained optimization using a database of linear reduced-order models

A methodology grounded in model reduction is presented for accelerating the gradient-based solution of a family of linear or nonlinear constrained optimization problems where the constraints include at least one linear Partial Differential Equation (PDE). A key component of this methodology is the construction, during an offline phase, of a database of pointwise, linear, Projection-based Reduced-Order Models (PROM)s associated with a design parameter space and the linear PDE(s). A parameter sampling procedure based on an appropriate saturation assumption is proposed to maximize the efficiency of such a database of PROMs. A real-time method is also presented for interpolating at any queried but unsampled parameter vector in the design parameter space the relevant sensitivities of a PROM. The practical feasibility, computational advantages, and performance of the proposed methodology are demonstrated for several realistic, nonlinear, aerodynamic shape optimization problems governed by linear aeroelastic constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A constrained-transport embedded boundary method for compressible resistive magnetohydrodynamics

Motivated by the increased interest in pulsed-power magneto-inertial fusion devices in recent years, we present a method for implementing an arbitrarily shaped embedded boundary on a Cartesian mesh while solving the equations of compressible resistive magnetohydrodynamics. The method is built around a finite volume formulation of the equations in which a Riemann solver is used to compute fluxes on the faces between grid cells, and a face-centered constrained transport formulation of the induction equation. The small time step problem associated with the cut cells is avoided by always computing fluxes on the faces and edges of the Cartesian mesh. We extend the method to model a moving interface between two materials with different properties using a ghost-fluid approach, and show some preliminary results including shock-wave-driven and magnetically-driven dynamical compressions of magnetohydrostatic equilibria. In conclusion, we present a thorough verification of the method and show that it converges at second order in the absence of discontinuities, and at first order with a discontinuity in material properties.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Physics-constrained deep neural network method for estimating parameters in a redox flow battery

Here, in this paper, we present a physics-constrained deep neural network (PCDNN) method for parameter estimation in the zero-dimensional (0D) model of the vanadium redox flow battery (VRFB). In this approach, we use deep neural networks to approximate the model parameters as functions of the operating conditions. This method allows the integration of VRFB computational models as the physical constraints in the parameter learning process, leading to enhanced accuracy of parameter estimation and cell voltage prediction. Using an experimental dataset, we demonstrate that the PCDNN method can estimate model parameters for a range of operating conditions and improve the 0D model prediction of voltage compared to the 0D model prediction with constant operation-condition-independent parameters estimated with traditional inverse methods. We also demonstrate that the PCDNN approach has an improved generalization ability for estimating parameter values for operating conditions not used in the training process.

25 ENERGY STORAGE↗
DOE OSTI2026

Stochastic Microgrid Scheduling With Chance‐Constrained Resilience Consideration

Traditionally, it is assumed that microgrids transition seamlessly from grid‐connected operation to islanded mode in the event of sudden main grid outages. In reality, the islanding process, especially unintentional islanding, is rarely seamless. Instead, it is subject to voltage and frequency fluctuations caused by the instantaneous disconnection of the point of common coupling (PCC) switch, variations in loads and renewable generation output and even the protection tripping of distributed energy resources (DERs). To mitigate these fluctuations and facilitate a smooth islanding process, we propose a stochastic microgrid scheduling model that incorporates chance‐constrained resilience measures. Specifically, the resilience measure is defined as the probability of successful islanding (PSI), that is, the probability that a microgrid can mitigate the generation‐demand imbalance caused by the disconnection of the PCC switch, variations in load and renewable generation and DER tripping. This measure is modelled using chance constraints. Unlike existing reliability and resilience indices, which typically neglect the possibility of microgrid/DER failure under extreme events and assume their survival while primarily focussing on reducing impact duration or magnitude, the proposed PSI‐based framework explicitly addresses microgrid and DER survival during the islanding transition. The formulated nonlinear chance constraints are approximated using a multiinterval approach and equivalently represented as a mixed‐integer linear programming (MILP) formulation. Case study results validate the proposed method, showing that the PSI estimation error is reduced to less than 8%, compared to approximately 28% with existing methods. Various sensitivity analyses on the DER tripping rate and PSI settings were performed to validate the robustness of the proposed method. In particular, the necessity of accounting for DER tripping in the PSI calculation was demonstrated.

chance constrained optimization↗
DOE OSTI2022

Security-Constrained Unit Commitment for Electricity Market: Modeling, Solution Methods, and Future Challenges

This paper summarizes the technical activities of the IEEE Task Force on Solving Large Scale Optimization Problems in Electricity Market and Power System Applications. This Task Force was established by the IEEE Technology and Innovation Subcommittee to first review the state-of-the-art of the security-constrained unit commitment (SCUC) business model, its mathematical formulation, and solution techniques in solving electricity market clearing problems. The Task Force then investigated the emerging challenges of future market clearing problems and presented efforts in building benchmark mathematical and business models.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Online Model-Free DER Dispatch Via Adaptive Voltage Sensitivity Estimation and Chance Constrained Programming

This paper proposes an online data-driven distributed energy resource management system (DERMS) for distribution system optimal DER dispatch as well as voltage regulation. Here, the key innovation is to leverage the Local Sensitivity Factor (LSF) for transforming the DER control into a computationally efficient linear programming (LP) problem. By taking real-time measurements, the estimation of LSF eliminates the need for an accurate distribution system model as well as full nodal load information, which is difficult to achieve in practice. A robust recursive least squares method is also developed to ensure the robust estimation of LSF, which is initialized using reasonable values from model-derived LSFs. This allows the system to adapt to changing operational conditions effectively. A scenario-based, chance-constrained framework is further employed to ensure voltage remains within acceptable limits in the presence of measurement and estimation uncertainties. Test results on a real-world, 759-node distribution network located in western Colorado, U.S., validate the effectiveness and robustness of the proposed control approach and demonstrate its superior performance as compared to alternative methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Combining Observations and Models: A Review of the CARDAMOM Framework for Data‐Constrained Terrestrial Ecosystem Modeling

The rapid increase in the volume and variety of terrestrial biosphere observations (i.e., remote sensing data and in situ measurements) offers a unique opportunity to derive ecological insights, refine process‐based models, and improve forecasting for decision support. However, despite their potential, ecological observations have primarily been used to benchmark process‐based models, as many past and current models lack the capability to directly integrate observations and their associated uncertainties for parameterization. In contrast, data assimilation frameworks such as the CARbon DAta MOdel fraMework (CARDAMOM) and its suite of process‐based models, known as the Data Assimilation Linked Ecosystem Carbon Model (DALEC), are specifically designed for model‐data fusion. This review, motivated by a recent CARDAMOM community workshop, examines the development and applications of CARDAMOM, with an emphasis on its role in advancing ecosystem process understanding. CARDAMOM employs a Bayesian approach, using a Markov Chain Monte Carlo algorithm to enable data‐driven calibration of DALEC parameters and initial states (i.e., carbon pool sizes) through observation operators. CARDAMOM's unique ability to retrieve localized model process parameters from diverse datasets—ranging from in situ measurements to global satellite observations—makes it a highly flexible tool for analyzing spatially variable ecosystem responses to environmental change. However, assimilating these data also presents challenges, including data quality issues that propagate into model skill, as well as trade‐offs between model complexity, parameter equifinality, and predictive performance. We discuss potential solutions to these challenges, such as reducing parameter equifinality by incorporating new observations. This review also offers community recommendations for incorporating emerging datasets, integrating machine learning techniques, strengthening collaboration with remote sensing, field, and modeling communities, and expanding CARDAMOM's relevance for localized ecosystem monitoring and decision‐making. CARDAMOM enables a deep, mechanistic understanding of terrestrial ecosystem dynamics that cannot be achieved through empirical analyses of observational datasets or weakly constrained models alone.

Bayesian inference↗
DOE OSTI2020

Statistical Treatment of Inverse Problems Constrained by Differential Equations-based Models with Stochastic Terms

This paper introduces a statistical treatment of inverse problems constrained by models with stochastic terms. The solution of the forward problem is given by a distribution represented numerically by an ensemble of simulations. The goal is to formulate the inverse problem, in particular the objective function, to find the closest forward distribution (i.e., the output of the stochastic forward problem) that best explains the distribution of the observations in a certain metric. We use proper scoring rules, a concept employed in statistical forecast verification, namely energy, variogram, and hybrid (i.e., combination of the two) scores. We study the performance of the proposed formulation in the context of two applications: a coefficient field inversion for subsurface flow governed by an elliptic partial differential equation with a stochastic source and a parameter inversion for power grid governed by differential-algebraic equations. In both cases we show that the variogram and the hybrid scores produce better parameter inversion results than does the energy score, whereas the energy score leads to better probabilistic predictions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Time-Constrained Capacitated Vehicle Routing Problem in Urban E-Commerce Delivery

Electric vehicle routing problems can be particularly complex when recharging must be performed mid-route. In some applications, such as e-commerce parcel delivery truck routing, however, mid-route recharging may not be necessary because of constraints on vehicle capacities and the maximum allowed time for delivery. In this study, we develop a mixed-integer optimization model that exactly solves such a time-constrained capacitated vehicle routing problem, especially of interest for e-commerce parcel delivery vehicles. We compare our solution method with an existing metaheuristic and carry out exhaustive case studies considering four U.S. cities—Austin, TX; Bloomington, IL; Chicago, IL; and Detroit, MI—and two vehicle types: conventional vehicles and battery electric vehicles (BEVs). In these studies we examine the impact of vehicle capacity, maximum allowed travel time, service time (dwelling time to physically deliver the parcel), and BEV range on system-level performance metrics, including vehicle miles traveled (VMT). We find that the service time followed by the vehicle capacity plays a key role in the performance of our approach. We assume an 80-mi BEV range as a baseline without mid-route recharging. Our results show that the BEV range has a minimal impact on performance metrics because the VMT per vehicle averages around 72 mi. In a case study for shared-economy parcel deliveries, we observe that VMT could be reduced by 38.8% in Austin if service providers were to operate their distribution centers jointly.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

Security-constrained unit commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via mixed-integer linear programming (MIP), sometimes multiple times per day, with only minor changes in input data. In this work, we propose a number of machine learning techniques to effectively extract information from previously solved instances in order to significantly improve the computational performance of MIP solvers when solving similar instances in the future. Based on statistical data, we predict redundant constraints in the formulation, good initial feasible solutions, and affine subspaces where the optimal solution is likely to lie, leading to a significant reduction in problem size. Computational results on a diverse set of realistic and large-scale instances show that using the proposed techniques, SCUC can be solved on average 4.3 times faster with optimality guarantees and 10.2 times faster without optimality guarantees, with no observed reduction in solution quality. Out-of-distribution experiments provide evidence that the method is somewhat robust against data-set shift. Summary of Contribution. The paper describes a novel computational method, based on a combination of mixed-integer linear programming (MILP) and machine learning (ML), to solve a challenging and fundamental optimization problem in the energy sector. The method advances the state-of-the-art, not only for this particular problem, but also, more generally, in solving discrete optimization problems via ML. We expect that the techniques presented can be readily used by practitioners in the energy sector and adapted, by researchers in other fields, to other challenging operations research problems that are solved routinely.

Machine Learning↗
DOE OSTI2023

Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition

In “Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition,” we review the state of the art in practical algorithms for scheduling power-systems operations in the short term and the results of the recent competition organized by the U.S. Advanced Research Projects Agency–Energy. We explain the mixed-integer nonlinear formulation used in the competition for nonspecialists in electrical engineering, the context and organization of the competition, and the performance of competitors. We find that the collective approaches and results of competitors provide support for efforts to move nonlinear optimization techniques into industrial applications, as they have proven to be a robust and efficient alternative to current linear approximation techniques.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Potential Availability of and Supply Curves for Low-Cost, Dispatch-Constrained Electricity

Among other changes, variable renewable energy (VRE) - primarily wind and solar photovoltaics - is achieving a growing share of total generation. High VRE penetrations may result in an increased level of curtailment and thus suppress the value of additional VRE. This VRE, that either would not be built due to price suppression or would be curtailed, can be considered a resource that we define as low-cost, dispatch-constrained electricity (LDE). LDE could be used for various applications which value low-cost electricity and can operate at reduced capacity factors. Examples include electrolytic hydrogen production and carbon capture. This report provides initial estimates of the quantity and availability of the potential LDE resource in the U.S. under scenarios with high VRE penetrations. It also provides supply curves that can be used in subsequent analysis of the opportunity to use the LDE. We modeled several scenarios using capacity expansion and production cost models for LDE prices ranging from $\$ $0/MWh to $\$ $30/MWh. These LDE prices, coupled with low renewable energy cost assumptions, resulted in VRE penetrations ranging from 48-66% in 2050. The resulting LDE supplies range from 100 - 300 TWh/yr at a price of $\$ $0/MWh to 3,500 - 4,200 TWh/yr at $\$ $30/MWh. Increasing LDE prices increases wind and photovoltaics deployment; however, other generation technology capacities do not decrease equivalently in our models. Thus, additional generation is available but the capacity of traditional dispatchable generation is only reduced slightly. The available LDE is concentrated in the central and southwest U.S. regions because of their high wind and solar resources.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Controlled Islanding Strategy Considering Uncertainty of Renewable Energy Sources Based on Chance-constrained Model

Controlled islanding plays an essential role in preventing the blackout of power systems. Although there are several studies on this topic in the past, not enough attention is paid to the uncertainty brought by renewable energy sources (RESs) that may cause unpredictable unbalanced power and the observability of power systems after islanding that is essential for back-up black-start measures. Therefore, a novel controlled islanding model based on mixed-integer second-order cone and chance-constrained programming (MISOCCP) is proposed to address these issues. First, the uncertainty of RESs is characterized by their possibility distribution models with chance constraints, and the requirements, e. g., system observ-ability, for rapid back-up black-start measures are also considered. Then, a law of large numbers (LLN) based method is employed for converting the chance constraints into deterministic ones and reformulating the non-convex model into convex one. Finally, case studies on the revised IEEE 39-bus and 118-bus power systems as well as the comparisons among different models are given to demonstrate the effectiveness of the proposed model. The results show that the proposed model can result in less unbalanced power and better observability after islanding compared with other models.

24 POWER TRANSMISSION AND DISTRIBUTION↗