Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “constraint satisfaction”

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.

25 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Ensuring Transient Stability With Guaranteed Region of Attraction in DC Microgrids

DC microgrids have promising applications in renewable integration due to their better energy efficiency when connecting DC components. However, they might be unstable since many loads in a DC microgrid are regulated as constant power loads (CPLs) that have a destabilizing negative impedance effect. As a result, the state trajectory displacement caused by abrupt load changes or contingencies can easily lead to instability. Many existing works have been devoted to studying the region of attraction (ROA) of a DC microgrid, in which the system is guaranteed to be asymptotically stable. Nevertheless, existing work either focuses on using numerical methods for ROA approximations that generally have no performance guarantees or cannot ensure a desired ROA for a general DC microgrid. To close this gap, this paper develops an innovative control synthesis algorithm to make a general DC microgrid have a theoretically guaranteed ROA, for example, to cover the entirety of its operating range regarding state trajectories. Here, we first study the nonlinear dynamics of a DC microgrid to derive a novel transient stability condition to rigorously certify whether a given operating range is a subset of the ROA; then, we formulate a control synthesis optimization problem to guarantee the condition’s satisfaction. This condition is a linear constraint, and the optimization problem resembles an optimal power flow problem and has a good computational behavior. Simulation case studies verify the validity of the proposed work.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Closing the loop: model-predictive control for a closed-circuit reverse osmosis system

This article presents a model-predictive controller (MPC) for the maximization of the energy efficiency of a closed-circuit desalination reverse osmosis (CCRO) system. CCRO is a process for producing drinking water that is based on a cyclic operation with the following two phases: (a) filtration and (b) drain. In this article, we test model predictive control for optimal control of this process. The most important features of our approach are as follows: (a) the selection of a model structure that enables reliable forecasts of the filtration phase (up to 3 h), (b) an on-line model calibration strategy that ensures model forecast reliability, and (c) the satisfaction of equipment safety and operational constraints on the selected setpoints. We challenge this through deliberate introduction of changes in the unmeasured feed concentration and the applied constraints. Our results indicate that frequent model parameter updates are critical to maintain model reliability for MPC purposes. In addition, we illustrate that parameter identifiability is not guaranteed and that deliberate variation in flow rates is necessary even though the process never operates in steady state. Finally, MPC can compute flow rate setpoints that maximize the energy efficiency of the CCRO process while satisfying the applicable equipment and safety constraints.

closed-circuit reverse osmosis↗
DOE OSTI2023

Challenges in Demonstrating Safety Criteria Satisfaction for External Events under a Risk-Informed Performance-Based Framework

The NRC is currently developing 10 CFR Part 53 that would establish a technology-inclusive regulatory framework for use by applicants for new commercial advanced nuclear reactors. The new draft rule language brings new explicit regulatory requirements of the quantitative health objectives (QHOs) as a constraint on plant risk and safety criteria for the plant design, including external hazards. Historically, light water reactors (LWRs) have demonstrated satisfaction of the QHOs through the use of surrogates in the form of CDF/LERF. However, these risk surrogates are not broadly applicable for all advanced reactor types, and for advanced reactors where external events are likely to be the dominant contributor to plant risk, a direct calculation of the QHOs in terms of offsite consequence is likely necessary. While the detailed analysis of low frequency events provides insights that can help justify alternative treatments to past conservatisms, the findings are dependent on the quality and confidence associated with the analyses. The assessment of external hazards presents a unique challenge, as their potential frequency of occurrence, especially of largemagnitude events, is inherently uncertain given the long return periods in question. This paper evaluates the QHOs and their potential role as safety criteria in evaluating external event risk as it applies to advanced reactors to aid in the development of consistent and appropriate analysis methodologies.

Chen, Ben↗
DOE OSTI2024

Optimizing the location and configuration of disaster resilience hubs under transportation and electric power network failures

Natural disasters often result in failures of transportation network components and blackouts that imperil the wellbeing of vulnerable populations. In response to these events, resilience hubs have been proposed as a pre-disaster planning strategy to improve access to critical services. This paper introduces an optimization-based approach to locate and configure electric power-generating resilience hubs considering the possibility of failures in transportation and electric power systems. The model's objective is to identify hub locations and configurations that maximize transportation accessibility to the hubs and maximize the satisfaction of basic energy needs through hub-generated electric power. Besides a budget constraint, the model accounts for limits on the levels of hub energy generation vis-à-vis community energy demands, and on the transportation network distance of communities to hubs. Three heuristics are presented for the proposed planning problem. The first heuristic is a genetic algorithm (GA) with problem-specific solution generation procedures. The other two heuristics implement greedy search techniques. Numerical experiments were conducted, using data from rural Puerto Rico, to illustrate the application of the proposed model and heuristics, and examine their performance. In the numerical experiments, the GA heuristic found better solutions than the greedy heuristics. Additionally, design solutions consisting of spatially dispersed hubs with low energy generation capacity were better than solutions with spatially concentrated high-capacity hubs. Lastly, across a wide range of hub demand scenarios, only a small number of candidate hub locations consistently ranked among the best locations for establishing a hub.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Performance Analysis of Speculative Parallel Adaptive Local Timestepping for Conservation Laws

Stable simulation of conservation laws, such as those used to model fluid dynamics and plasma physics applications, requires the satisfaction of the so-called Courant-Friedrichs-Lewy condition. By allowing regions of the mesh to advance with different timesteps that locally satisfy this stability constraint, significant work reduction can be attained when compared to a time integration scheme using a single timestep size. However, parallelizing this algorithm presents considerable difficulty. Since the stability condition depends on the state of the system, dependencies become dynamic and potentially non-local. In this article, we present an adaptive local timestepping algorithm using an optimistic (Timewarp-based) parallel discrete event simulation. We introduce waiting heuristics to limit misspeculation and a semi-static load balancing scheme to eliminate load imbalance as parts of the mesh require finer or coarser timesteps. Last, we outline an interface for separating the physics of the specific conservation law from the temporal integration allowing for productive adoption of our proposed algorithm. We present a misspeculation study for three conservation laws, demonstrating both the productivity of the local timestepping API, for which 74% of the lines of code are reused across different conservation laws, and the robustness of the waiting heuristics—at most 1.5% of element updates are rolled back. Our performance studies demonstrate up to a 2.8× speedup versus a baseline unoptimized local timestepping approach, a 4x improvement in per-node throughput compared to an MPI parallelization of synchronous timestepping, and scalability up to 3,072 cores on NERSC’s Cori Haswell partition.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Hierarchical Model-Free Transactional Control of Building Loads to Support Grid Services

A transition from generation on demand to consumption on demand is one of the solutions to overcome the many limitations associated with the higher penetration of renewable energy sources. Such a transition, however, requires a considerable amount of load flexibility in the demand side. Demand response (DR) programs can reveal and utilize this demand flexibility by enabling the participation of a large number of grid-interactive efficient buildings (GEB). Existing approaches on DR require significant modelling or training efforts, are computationally expensive, and do not guarantee the satisfaction of end users. To address the aforementioned limitations, this software code considers a scalable hierarchical model-free transactional control approach that incorporates elements of virtual battery, game theory, and model-free control (MFC) mechanisms. The developed approach separates the control mechanism into upper and lower levels. The MFC modulates the flexible GEB in the lower level with guaranteed thermal comfort of end users in response to the optimal pricing and power signals determined in the upper layer using a Stackelberg game integrated with aggregate virtual battery constraints. Additionally, the usage of MFC necessitates less burdensome computational and communication requirements, thus, it is easily deployable even on small, embedded devices. This software code enables the use of residential and small-size commercial buildings to offer a potentially substantial source of ancillary grid services that are currently underutilized. A hierarchical, model-free transactive building control provides a smooth interface between the grid service requests of utilities and the reliable control required by participating buildings. Model-free control, which supports distributed control architecture, will be a more scalable solution that can be deployed in neighborhood-size systems as well as individual buildings. The proposed approach contributes to the body of knowledge on two main aspects. First, it couples the MFC with the game-theoretic control and proposes a scalable model-free transactive control approach. MFC does not require any modeling effort or model training for the various building loads. This is very beneficial since deriving an accurate model for every single unit participating in DR programs and obtaining all the parameters about the units (e.g., thermal coefficients, standby losses) are infeasible. Also, MFC is computationally efficient, easily deployable even on small, embedded devices, and can be implemented in real time. Second, it integrates the concept of virtual battery into DR via the Stackelberg game. The concept of virtual battery enables efficient coordination and aggregation of a large number of flexible GEB with guaranteed thermal comfort of end users.

Olama, Mohammed [Oak Ridge National Lab. (ORNL), O↗
DOE OSTI2025

N = 8 Supergravity from Positivity

The duality between color and kinematics brings many simplifications to the construction of scattering amplitudes. Here, we show that satisfaction of the tree-level Bern-Carrasco-Johansson relations can dramatically simplify loop computations even when the loop-level relations are not explicitly satisfied. We introduce an agglomerative algorithm, color-dual cut tiling, that builds the entire integrand from the simplest on-shell conditions applied to a seed of off-shell integrand information. Specifically, we demonstrate that for two-to-two scattering at three loops in the maximally supersymmetric gauge theory there is sufficient information contained in planar cuts—completely determined by positivity constraints—to generate all of the nonplanar sector. We further make use of the generalized double copy to generate a representation of maximally supersymmetric gravity as a functional of the planar SYM input. We close with comments on generalizations and possible applications of the approach. Published by the American Physical Society 2025

Carrasco, John Joseph M. (ORCID:0000000244998488)↗