SEARCH · Engineering Papers

Results for “grid optimization”

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 757 records · Page 42

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Formulations and Valid Inequalities for Optimal Black Start Allocation in Power Systems

The restoration of a power system after a blackout starts around units with enhanced technical capabilities, referred to as black start units (BSUs). We examine the planning problem of optimally allocating these units on the grid subject to a budget constraint. We present a mixed integer programming model based on current literature in power systems. Binary variables are associated with the allocation of BSUs and with the energization state of buses, branches, and generators of the power system over a time horizon. We extract a substructure of the feasible region which imposes the requirement that each island that appears during the restoration process must have at least one operational generator. We discuss three equivalent reformulations for this requirement. We introduce a family of exponentially many, polynomially separable, valid inequalities to strengthen the formulation. Under simplifying assumptions, we show that the convex hull of the feasible region is a full-dimensional polyhedron, and prove that some of the constraints we introduced are facet-defining. We perform experiments to examine the difference in strength between the formulations as well as the computational times to solve the problem to near optimality for synthetic instances of the IEEE-39, IEEE-118, Illinois-200, WECC-225, IEEE-300, South Carolina-500, and Texas-2000 power systems. We illustrate a use case of the model. We conclude by suggesting extensions of the current work for future research.

Black Start Allocation↗

DOE OSTI2020

A priori analysis on deep learning of subgrid-scale parameterizations for Kraichnan turbulence

In the present study, we investigate different data-driven parameterizations for large eddy simulation of two-dimensional turbulence in the a priori settings. These models utilize resolved flow field variables on the coarser grid to estimate the subgrid-scale stresses. We use data-driven closure models based on localized learning that employs a multilayer feedforward artificial neural network with point-to-point mapping and neighboring stencil data mapping, and convolutional neural network fed by data snapshots of the whole domain. The performance of these data-driven closure models is measured through a probability density function and is compared with the dynamic Smagorinksy model (DSM). The quantitative performance is evaluated using the cross-correlation coefficient between the true and predicted stresses. We analyze different frameworks in terms of the amount of training data, selection of input and output features, their characteristics in modeling with accuracy, and training and deployment computational time. We also demonstrate computational gain that can be achieved using the intelligent eddy viscosity model that learns eddy viscosity computed by the DSM instead of subgrid-scale stresses. Here, we detail the hyperparameters optimization of these models using the grid search algorithm.

42 ENGINEERING↗

DOE OSTI2025

A Model Predictive Control to Improve Grid Resilience

The following article details a model predictive control (MPC) to improve grid resilience when faced with variable generation resources. This topic is of significant interest to utility power systems where distributed intermittent energy sources will increase significantly and be relied on for electric grid ancillary services. Previous work on MPCs has focused on narrowly targeted control applications such as improving electric vehicle (EV) charging infrastructure or reducing the cost of integrating Energy Storage Systems (ESSs) into the grid. In contrast, this article develops a comprehensive treatment of the construction of an MPC tailored to electric grids and then applies it integration of intermittent energy resources. To accomplish this, the following article includes a description of a reduced order model (ROM) of an electric power grid based on a circuit model, an optimization formulation that describes the MPC, a collocation method for solving linear time-dependent differential algebraic equations (DAEs) that result from the ROM, and an overall strategy for iteratively refining the behavior of the MPC. Next, the algorithm is validated using two separate numerical experiments. First, the algorithm is compared to an existing MPC code and the results are verified by a numerically precise simulation. It is shown that this algorithm produces a control comparable to existing algorithms and the behavior of the control carefully respects the bounds specified. Second, the MPC is applied to a small nine bus system that contains a mix of turbine-spinning-machine-based and intermittent generation in order to demonstrate the algorithm’s utility for resource planning and control of intermittent resources. This study demonstrates how the MPC can be tuned to change the behavior of the control, which can then assist with the integration of intermittent resources into the grid. The emphasis throughout the paper is to provide systematic treatment of the topic and produce a novel nonlinear control compatible design framework applicable to electric grids and the control of variable resources. This differs from the more targeted application-based focus in most presentations.

microgrid↗

DOE OSTI2021

A Network-Aware Distributed Energy Resource Aggregation Framework for Flexible, Cost-Optimal, and Resilient Operation

To efficiently use the ubiquitous behind-the-meter distributed energy resources (DERs) in distribution systems for providing grid services, this paper presents a hierarchical control framework for DER optimal aggregation and control. We first develop a convex optimization model to evaluate the DER flexibility, and then use a convex model-predictive-control based approach to dispatch those DERs. The hierarchical control framework consists of a utility controller, community aggregators and multiple home energy management systems. The flexibility of the DERs is evaluated by each controller in the hierarchy such that the resultant flexibility is feasible given its operational domain. Based on the determined flexibility, the hierarchical controllers then compute optimal setpoints for the DERs to help the distribution system regulate node voltages and provide other distribution grid services. Numerical simulations performed on a model of a real distribution feeder in Colorado, using actual DER data in a residential community demonstrate that the proposed approach can effectively alleviate voltage issues and support resilient operation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS2001

Efficient Cache use for Stencil Operations on Structured Discretization Grids

We derive tight bounds on the cache misses for evaluation of explicit stencil operators on structured grids. Our lower bound is based on the isoperimetrical property of the discrete octahedron. Our upper bound is based on a good surface to volume ratio of a parallelepiped spanned by a reduced basis of the interference lattice of a grid. Measurements show that our algorithm typically reduces the number of cache misses by a factor of three, relative to a compiler optimized code. We show that stencil calculations on grids whose interference lattice have a short vector feature abnormally high numbers of cache misses. We call such grids unfavorable and suggest to avoid these in computations by appropriate padding. By direct measurements on a MIPS R10000 processor we show a good correlation between abnormally high numbers of cache misses and unfavorable three-dimensional grids.

Frumkin, Michael↗

DOE OSTI2015

MO-G-304-04: Generating Well-Dispersed Representations of the Pareto Front for Multi-Criteria Optimization in Radiation Treatment Planning

Purpose: To present a novel multi-criteria optimization (MCO) solution approach that generates well-dispersed representation of the Pareto front for radiation treatment planning. Methods: Different algorithms have been proposed and implemented in commercial planning software to generate MCO plans for external-beam radiation therapy. These algorithms consider convex optimization problems. We propose a grid-based algorithm to generate well-dispersed treatment plans over Pareto front. Our method is able to handle nonconvexity in the problem to deal with dose-volume objectives/constraints, biological objectives, such as equivalent uniform dose (EUD), tumor control probability (TCP), normal tissue complication probability (NTCP), etc. In addition, our algorithm is able to provide single MCO plan when clinicians are targeting narrow bounds of objectives for patients. In this situation, usually none of the generated plans were within the bounds and a solution is difficult to identify via manual navigation. We use the subproblem formulation utilized in the grid-based algorithm to obtain a plan within the specified bounds. The subproblem aims to generate a solution that maps into the rectangle defined by the bounds. If such a solution does not exist, it generates the solution closest to the rectangle. We tested our method with 10 locally advanced head and neck cancer cases. Results: 8 objectives were used including 3 different objectives for primary target volume, high-risk and low-risk target volumes, and 5 objectives for each of the organs-at-risk (OARs) (two parotids, spinal cord, brain stem and oral cavity). Given tight bounds, uniform dose was achieved for all targets while as much as 26% improvement was achieved in OAR sparing comparing to clinical plans without MCO and previously proposed MCO method. Conclusion: Our method is able to obtain well-dispersed treatment plans to attain better approximation for convex and nonconvex Pareto fronts. Single treatment plan can be achieved when given bounds on the objectives.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2026

Quantum Computing in Next-Generation Transportation Optimization

We explore how quantum computing (QC) can advance transportation optimization, with a focus on two high-impact areas: traffic signal control and vehicle electrification with grid integration. As transportation systems grow in complexity, classical optimization methods increasingly struggle to deliver scalable and efficient solutions, particularly for real-time, data-rich environments. This work identifies key challenges within these two domains where QC may offer advantages, particularly in handling combinatorial decision spaces and dynamic constraints. We begin by outlining the limitations of classical approaches for traffic signal control optimization and electric vehicle charging coordination, highlighting where computational limitations arise. Previous quantum formulations are presented and new formulations are proposed to demonstrate how emerging quantum algorithms, including quantum annealing and the Quantum Approximation Optimization Algorithm, could be leveraged to reformulate and address these problems. We also evaluate the suitability of current quantum hardware and discuss recent trends that indicate when QC may become a viable tool for transportation applications. While acknowledging the present limitations of QC technologies, this poster emphasizes the importance of preparing quantum-compatible models today. By reviewing and establishing formulations that align with the strengths of quantum algorithms, researchers and practitioners can better position themselves to take advantage of QC advancements as they occur. This work aims to provide a practical, forward-looking perspective on the near-term potential of quantum computing in transportation optimization.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2024

Towards optimal sensor placement for inverse problems in spaces of measures

The objective of this work is to quantify the reconstruction error in sparse inverse problems with measures and stochastic noise, motivated by optimal sensor placement. To be useful in this context, the error quantities must be explicit in the sensor configuration and robust with respect to the source, yet relatively easy to compute in practice, compared to a direct evaluation of the error by a large number of samples. In particular, we consider the identification of a measure consisting of an unknown linear combination of point sources from a finite number of measurements contaminated by Gaussian noise. The statistical framework for recovery relies on two main ingredients: first, a convex but non-smooth variational Tikhonov point estimator over the space of Radon measures and, second, a suitable mean-squared error based on its Hellinger–Kantorovich distance to the ground truth. To quantify the error, we employ a non-degenerate source condition as well as careful linearization arguments to derive a computable upper bound. This leads to asymptotically sharp error estimates in expectation that are explicit in the sensor configuration. Thus they can be used to estimate the expected reconstruction error for a given sensor configuration and guide the placement of sensors in sparse inverse problems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

A Sustainable Wind–Biogas Hybrid System for Remote Areas in Jordan: A Case Study of Mobile Hospital for a Zaatari Syrian Refugee Camp

Access to reliable and sustainable energy in remote areas remains a pressing global challenge, significantly affecting economic development and the quality of life. This study focuses on the implementation of fully off-grid wind–biogas hybrid power systems to address this issue, with a focus on remote healthcare camp facilities. This paper investigates the performance of a hybrid renewable energy system within the context of one of Jordan’s northern remote areas, the Zaatari Syrian Refugee Camp, assessing its efficiency and environmental impact by taking the Zaatari hospital as the case study. Simulations were conducted to evaluate system components, including wind turbines, biogas generators, and diesel generators. A comprehensive evaluation was conducted, encompassing both the operational efficiency of the system and its impact on the environment. This study also considered various scenarios (SC#), including grid availability and autonomy levels, to optimize system configurations. The techno-economic assessment employed the levelized cost of energy (LCOE) as a key performance indicator, and sensitivity analyses explored the impact of diesel costs and wind power fluctuations on the system. Additionally, environmental assessment was conducted to evaluate the environmental effects of hybrid systems, with a specific focus on reducing greenhouse gas emissions. This investigation involved an examination of emissions in three different scenarios. The results indicate that the lowest LCOE that could be achieved was 0.0734 USD/kWh in SC#1 with 72.42% autonomy, whereas achieving 100% autonomy increased the LCOE to 0.1756 USD/kWh. Additionally, the results reveal that in scenarios SC#2 and SC#3, which have a higher proportion of diesel generator usage, there were elevated levels of NO x and CO 2 emissions. Conversely, in SC#1, which lacks diesel generators, emissions were notably lower. The proposed hybrid system demonstrates its potential to provide a reliable energy supply to healthcare facilities in remote regions, emphasizing both economic feasibility and environmental benefits. These findings contribute to informed decision making for sustainable energy solutions in similar contexts, promoting healthcare accessibility and environmental sustainability.

09 BIOMASS FUELS↗

NASA NTRS2019

Reinforcement Learning Applied to Cognitive Space Communications

The future of space exploration depends on robust, reliable communication systems. As the number of such communication systems increase, automation is fast becoming a requirement to achieve this goal. A reinforcement learning solution can be employed as a possible automation method for such systems. The goal of this study is to build a reinforcement learning algorithm which optimizes data throughput of a single actor. A training environment was created to simulate a link within the NASA Space Communication and Navigation (SCaN) infrastructure, using state of the art simulation tools developed by the SCaN Center for Engineering, Networks, Integration, and Communications (SCENIC) laboratory at NASA Glenn Research Center to obtain the closest possible representation of the real operating environment. Reinforcement learning was then used to train an agent inside this environment to maximize data throughput. The simulation environment contained a single actor in low earth orbit capable of communicating with twenty-five ground stations that compose the Near-Earth Network (NEN). Initial experiments showed promising training results, so additional complexity was added by augmenting simulation data with link fading profiles obtained from real communication events with the International Space Station. A grid search was performed to find the optimal hyperparameters and model architecture for the agent. Using the results of the grid search, an agent was trained on the augmented training data. Testing shows that the agent performs well inside the training environment and can be used as a foundation for future studies with added complexity and eventually tested in the real space environment.

Schubert, Carson D.↗

DOE OSTI2023

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- ${\boldsymbol{\mathcal{C}^2}}$ Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- ${\boldsymbol{\mathcal{C}^2}}$ objective functions is proposed and analyzed. Upper- ${\boldsymbol{\mathcal{C}^2}}$ is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- ${\boldsymbol{\mathcal{C}^2}}$ objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- ${\boldsymbol{\mathcal{C}^2}}$ problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

Event generator tuning using Bayesian optimization

Monte Carlo event generators contain a large number of parameters that must be determined by comparing the output of the generator with experimental data. Generating enough events with a fixed set of parameter values to enable making such a comparison is extremely CPU intensive, which prohibits performing a simple brute-force grid-based tuning of the parameters. Bayesian optimization is a powerful method designed for such black-box tuning applications. In this article, we show that Monte Carlo event generator parameters can be accurately obtained using Bayesian optimization and minimal expert-level physics knowledge. A tune of the PYTHIA 8 event generator using $e^+e^-$ events, where 20 parameters are optimized, can be run on a modern laptop in just two days. Combining the Bayesian optimization approach with expert knowledge should enable producing better tunes in the future, by making it faster and easier to study discrepancies between Monte Carlo and experimental data.

47 OTHER INSTRUMENTATION↗

DOE OSTI2021

DERMS-RT (Distributed Energy Resource Management Solution using Real-Time Optimization) [SWR-20-46]

DERMS-RT provides a distributed energy resource management solution using real-time optimization to control different types of distributed energy resources (DERs) — such as rooftop PVs, battery energy storage systems, HVAC loads, electric water heater loads, and EV charging loads, and use these DERs to provide distribution voltage regulation and peak demand management services. The control approach implemented by DERM-RT is developed based on the real-time optimal power flow and distributed control previously developed by NREL researchers. The software codes are designed to provide modular DER management solution that can be easily applied to control heterogeneous DERs in distribution grids in coordination with centralized utility management systems. Also, DERMS-RT provides application programming interface (API) to extract useful grid model information from an open-source power system simulation software, use the information to solve the optimization problem, and apply the optimal set-points to the controlled DERs. In this way, DERMS-RT provides a plug-and-play function for implementing the real-time DER control on different utility system models, and it can be used as a simulation testbed to demonstrate the impact of real-time DER optimization on improving grid operations.

Ding, Fei↗

DOE OSTI2021

Enhancing Distribution Grid Resilience Through Model Predictive Controller Enabled Prioritized Load Restoration Strategy

Effective resilience improvement strategies enable the power grid to cope with disruptive extreme events. Most power grid outages are caused by disruptions in distribution grids. Motivated by the urgent need for power system resilience research, this paper proposes a priority-weighted optimal load restoration technique to enhance the resilience of distribution grids against extreme events. The proposed technique is based on smart distribution technology and framed as sequential multi-step decision process (MDP) and mixed integer linear program (MILP). It is formulated as optimal control problem with a model predictive control (MPC) approach. We applied the devised MILP-MPC-based load restoration technique to a simplified single-bus version of the IEEE 13-bus distribution system with integrated distributed energy resources (DERs) such as wind turbine, photovoitaic array, microturbine, and energy storage device. The technique executes a reducing and rolling horizon optimization in each control step in real-time using the forecasted information of the renewables, the fuel status of the microturbine and the state of charge of the energy storage device. We consider an extreme event which triggered outage of the upstream utility grid and caused islanded operation of the distribution grid. We demonstrated the effectiveness of the proposed MPC approach in restoring the distribution grid loads based on their priority during the main grid outage-caused islanded operation.

61 RADIATION PROTECTION AND DOSIMETRY↗

DOE OSTI2021

Enhancing Distribution Grid Resilience Through Model Predictive Controller Enabled Prioritized Load Restoration Strategy: Preprint

Effective resilience improvement strategies enable the power grid to cope with disruptive extreme events. Most power grid outages are caused by disruptions in distribution grids. Motivated by the urgent need for power system resilience research, this paper proposes a priority-weighted optimal load restoration technique to enhance the resilience of distribution grids against extreme events. The proposed technique is based on smart distribution technology and framed as sequential multi-step decision process (MDP) and mixed integer linear program (MILP). It is formulated as optimal control problem with a model predictive control (MPC) approach. We applied the devised MILP-MPC-based load restoration technique to a simplified single-bus version of the IEEE 13-bus distribution system with integrated distributed energy resources (DERs) such as wind turbine, photovoltaic array, microturbine, and energy storage device. The technique executes a reducing and rolling horizon optimization in each control step in real-time using the forecasted information of the renewables, the fuel status of the microturbine and the state of charge of the energy storage device. We consider an extreme event which triggered outage of the upstream utility grid and caused islanded operation of the distribution grid. We demonstrated the effectiveness of the proposed MPC approach in restoring the distribution grid loads based on their priority during the main grid outage-caused islanded operation.

61 RADIATION PROTECTION AND DOSIMETRY↗

DOE OSTI2021

Enhancing Distribution Grid Resilience Through Model Predictive Controller Enabled Prioritized Load Restoration Strategy

Effective resilience improvement strategies enable the power grid to cope with disruptive extreme events. Most power grid outages are caused by disruptions in distribution grids. Motivated by the urgent need for power system resilience research, this paper proposes a priority-weighted optimal load restoration technique to enhance the resilience of distribution grids against extreme events. The proposed technique is based on smart distribution technology and framed as sequential multi-step decision process (MDP) and mixed integer linear program (MILP). It is formulated as optimal control problem with a model predictive control (MPC) approach. We applied the devised MILP-MPC-based load restoration technique to a simplified single-bus version of the IEEE 13-bus distribution system with integrated distributed energy resources (DERs) such as wind turbine, photovoltaic array, microturbine, and energy storage device. The technique executes a reducing and rolling horizon optimization in each control step in real-time using the forecasted information of the renewables, the fuel status of the microturbine and the state of charge of the energy storage device. We consider an extreme event which triggered outage of the upstream utility grid and caused islanded operation of the distribution grid. We demonstrated the effectiveness of the proposed MPC approach in restoring the distribution grid loads based on their priority during the main grid outage-caused islanded operation.

61 RADIATION PROTECTION AND DOSIMETRY↗

DOE OSTI2023

Distributed Rules-Based Deconfliction of ADMS Applications: Part 1: Requirements & Decomposition

This work introduces a rules-based deconfliction methodology for resolving conflicting device control commands issued by advanced power applications considering a range of technical, economic, environmental, and social objectives. The methodology is designed to serve as one of multiple alternative implementations (along with application cooperation and global optimization) for the numerical component of the Deconfliction Pipeline. Development of the methodology is divided into two parts. This first document introduces the requirements, context, and methods for decomposing the deconfliction problem using the Laminar Coordination Framework and Variable Grid Structures. The deconfliction problem is decomposed into a distributed optimization problem based on the concept of quasi-static grid segments, which form independent distributed areas for control and coordination. Selection of the optimal number of decompositions of the deconfliction problem should be made based on a tradeoff analysis between computational speed and global optimality. This second document will define an initial set of technical, economic, and environmental criteria, as well as thirty specific qualitative rules that are used as part of the deconfliction methodology to eliminate non-viable setpoint alternatives. The deconfliction optimization problem is converted into a ranking of individual discrete setpoints, which are scored by the extent to which they satisfy specific decision criteria. The ranking is determined through the concepts of deconfliction exclusivity, priority, and preference. Several multi-criteria decision-making frameworks are examined with the simple multi-attribute rating technique exploiting ranks (SMARTER) recommended as a simple implementation alternative that aligns with the steps of the rules-based deconfliction methodology.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

A massively parallel and scalable multi-CPU material point method

Harnessing the power of modern multi-GPU architectures, we present a massively parallel simulation system based on the Material Point Method (MPM) for simulating physical behaviors of materials undergoing complex topological changes, self-collision, and large deformations. Our system makes three critical contributions. First, we introduce a new particle data structure that promotes coalesced memory access patterns on the GPU and eliminates the need for complex atomic operations on the memory hierarchy when writing particle data to the grid. Second, we propose a kernel fusion approach using a new Grid-to-Particles-to-Grid (G2P2G) scheme, which efficiently reduces GPU kernel launches, improves latency, and significantly reduces the amount of global memory needed to store particle data. Finally, we introduce optimized algorithmic designs that allow for efficient sparse grids in a shared memory context, enabling us to best utilize modern multi-GPU computational platforms for hybrid Lagrangian-Eulerian computational patterns. We demonstrate the effectiveness of our method with extensive benchmarks, evaluations, and dynamic simulations with elastoplasticity, granular media, and fluid dynamics. In comparisons against an open-source and heavily optimized CPU-based MPM codebase [Fang et al. 2019] on an elastic sphere colliding scene with particle counts ranging from 5 to 40 million, our GPU MPM achieves over 100x per-time-step speedup on a workstation with an Intel 8086K CPU and a single Quadro P6000 GPU, exposing exciting possibilities for future MPM simulations in computer graphics and computational science. Moreover, compared to the state-of-the-art GPU MPM method [Hu et al. 2019a], we not only achieve 2x acceleration on a single GPU but our kernel fusion strategy and Array-of-Structs-of-Array (AoSoA) data structure design also generalizes to multi-GPU systems. Our multi-GPU MPM exhibits near-perfect weak and strong scaling with 4 GPUs, enabling performant and large-scale simulations on a 10243 grid with close to 100 million particles with less than 4 minutes per frame on a single 4-GPU workstation and 134 million particles with less than 1 minute per frame on an 8-GPU workstation.

Wang, Xinlei↗