Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed 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.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Estimating the impact of tariff-driven behind-the-meter storage operation on distribution grid investments

Increasing growth of distributed solar photovoltaics (PV) and electric vehicles (EV) can strain local distribution networks and require costly upgrades. Distributed battery storage, often deployed alongside PV, can be used to mitigate those costs, depending on how batteries are operated. This study evaluates the potential deferral value of distributed battery storage across a range of tariff structures, focusing on the rate structures most commonly available to residential customers today and related variants. Deferrals are evaluated with a least-cost distribution grid expansion optimization model to identify requirements on line reconductoring, transformer upgrades, and voltage regulator installations under each tariff. Results show that TOU rates and net billing tariffs can yield meaningful deferral value, depending on specific tariff structure features. Under the best performing tariff structure tested, storage produced a median annualized deferral value of $7.18 per kW of storage capacity ( kW S ) across all feeders in the sample, though deferral values were considerably larger for feeders with peak loads that coincide with utility system peak, i.e., timing of TOU peak period. In contrast, under an unrestricted TOU design with no restrictions on grid charging or discharging, the median deferral value was $0/ kW S illustrating the critical importance of tariff structure details.

Rodriguez-Garcia, Luis↗
DOE OSTI2021

The Baghdad Atlas: A relational database of inelastic neutron-scattering (n,n ' γ) data

A relational database has been developed based on the original (n,n'γ) work carried out by A. M. Demidov et al., at the Nuclear Research Institute in Baghdad, Iraq (Demidov et al., 1978) for 105 independent measurements comprising 76 elemental samples of natural composition and 29 isotopically-enriched samples. The information from this Atlas includes: γ-ray energies and relative intensities; nuclide and level data corresponding to the residual nucleus and meta data associated with the target sample that allows for the extraction of the flux-weighted (n,n'γ) cross sections for a given transition relative to a defined value. The optimized angular-distribution-corrected fast-neutron flux-weighted partial γ-ray cross section for the production of the 846.8-keV 21+→0gs+γ-ray transition in 56Fe, determined to be $\langle$σγ$\rangle$=143(29) mb, is used for this purpose. However, different values for the adopted cross section can be readily implemented to accommodate user preference based on revised determinations of this quantity. The Atlas (n,n'γ) data has been compiled into a series of CSV-style ASCII data sets and a suite of Python scripts have been developed to build and install the database locally. The database can then be accessed directly through the SQLite engine, or using alternative methods such as the Jupyter Notebook Python-browser interface. Several examples exploiting different interaction methodologies are distributed with the complete software package.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Initial position optimization in molecular dynamics simulations for a Coulomb system

A new algorithm for molecular dynamics (MD) simulations is developed to optimize plasma particle distributions at given initial temperatures. By combining velocity scaling and reassignment, the method effectively eliminates the initial rise and oscillation in temperatures observed with randomly distributed positions. These rises and oscillations are undesired numerical artifacts observed in conventional plasma MD simulations, arising from unoptimized particle positions. The algorithm demonstrates temperature relaxation without initial rises or oscillations, as well as precise flow velocity relaxation, enabling accurate measurement of relaxation times. The code is accelerated using graphics processing units for parallel processing, enhancing the study of plasma dynamics. The proposed method for distributing physically valid particles in MD simulations enables accurate studies of intrinsic collision processes in plasmas, including the dynamics of strongly coupled plasmas, plasma–wave interactions, and transport phenomena in magnetized plasmas. The paper concludes with a discussion of potential applications and future enhancements to the algorithm.

Jo, Jawon (ORCID:0009000924193285)↗
DOE OSTI2024

Thermal Management System for an Electric Machine With Additively Manufactured Hollow Conductors With Integrated Heat Pipes

Here, this paper discusses steps taken to develop a novel thermal management system for an aircraft propulsion electric machine containing additively manufactured coils integrated with heat pipes aimed at boosting its specific power. Experimental setups are used to size and characterize heat pipes for the application and 3D thermal finite element analysis is used to determine optimum heat transfer coefficient of the convective boundaries. For some of the convective boundaries, fin-based surface area enhancement is required to reach a target combined overall heat transfer coefficient and surface area performance (UA). This enhancement is worked out using a combination of the Engineering Equation Solver tool and 3D thermal FEA. The thermal management system's UA, and by extension its specific power, sensitivity to coolant temperature is explored. Temperature distribution plots of optimized machine components are also presented and discussed. Lastly, additional heat pipe testing is carried out to study its maximum heat transfer capability's sensitivity to condenser coolant temperature and configuration.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Deep Reinforcement Learning Enabled Physical-Model-Free Two-Timescale Voltage Control Method for Active Distribution Systems

Active distribution networks are being challenged by frequent and rapid voltage violations due to renewable energy integration. Conventional model-based voltage control methods rely on accurate parameters of the distribution networks, which are difficult to achieve in practice. This paper proposes a novel physical-model-free two-timescale voltage control framework for active distribution systems. To achieve fast control of PV inverters, the whole network is first partitioned into several subnetworks using voltage-reactive power sensitivity. Then, the scheduling of PV inverters in the multiple sub-networks is formulated as Markov games and solved by a multi-agent soft actor-critic (MASAC) algorithm, where each subnetwork is modeled as an intelligent agent. All agents are trained in a centralized manner to learn a coordinated strategy while being executed based on only local information for fast response. For the slower time-scale control, OLTCs and switched capacitors are coordinated by a single agent-based SAC algorithm using the global information with considering control behaviors of the inverters. Particularly, the two-level agents are trained concurrently with information exchange according to the reward signal calculated from the data-driven surrogate model. Comparative tests with different benchmark methods on IEEE 33-and 123-bus systems and 342-node low voltage distribution system demonstrate that the proposed method can effectively mitigate the fast voltage violations and achieve systematical coordination of different voltage regulation assets without the knowledge of accurate system model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Enumeration reduction algorithm for the characterization of multi-primary LED systems

Multi-primary tunable LED lighting systems can generate a vast number of spectral outputs, with the exact number depending on the resolution of the control signal and number of LED primaries. Computing all combinations to identify optimal spectral power distributions (SPDs) with a specified chromaticity would require a tremendous amount of time and computational power. Here, an enumeration reduction (ER) algorithm is described to reduce the computation time by defining a bounding pyramid in the three-dimensional tristimulus space that maps to the circumscribed square of the target region in the chromaticity diagram. This method enables computing only the necessary amount of tristimulus values (and resulting chromaticity coordinates) for SPDs that fall into a user-defined target chromaticity area, reducing computation time by avoiding the need to generate each combination and calculate its chromaticity coordinates. The results show that the proposed ER algorithm can greatly reduce the time – up to 922 times in a series of tests – to determine a set of metamers compared to a full enumeration computation.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Spatial inequities in access to medications for treatment of opioid use disorder highlight scarcity of methadone providers under counterfactual scenarios

Access to treatment and medication for opioid use disorder (MOUD) is essential in reducing opioid use and associated behavioral risks, such as syringe sharing among persons who inject drugs (PWID). Syringe sharing among PWID carries high risk of transmission of serious infections such as hepatitis C and HIV. MOUD resources, such as methadone provider clinics, however, are often unavailable to PWID due to barriers like long travel distance to the nearest methadone provider and the required frequency of clinic visits. The goal of this study is to examine the uncertainty in the effects of travel distance in initiating and continuing methadone treatment and how these interact with different spatial distributions of methadone providers to impact co-injection (syringe sharing) risks. A baseline scenario of spatial access was established using the existing locations of methadone providers in a geographical area of metropolitan Chicago, Illinois, USA. Next, different counterfactual scenarios redistributed the locations of methadone providers in this geographic area according to the densities of both the general adult population and according to the PWID population per zip code. We define different reasonable methadone access assumptions as the combinations of short, medium, and long travel distance preferences combined with three urban/suburban travel distance preference. Our modeling results show that when there is a low travel distance preference for accessing methadone providers, distributing providers near areas that have the greatest need (defined by density of PWID) is best at reducing syringe sharing behaviors. However, this strategy also decreases access across suburban locales, posing even greater difficulty in regions with fewer transit options and providers. As such, without an adequate number of providers to give equitable coverage across the region, spatial distribution cannot be optimized to provide equitable access to all PWID. Our study has important implications for increasing interest in methadone as a resurgent treatment for MOUD in the United States and for guiding policy toward improving access to MOUD among PWID.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Graphical Optimization of Spectral Shift Reconstructions for Optical Backscatter Reflectometry

Optical backscatter reflectometry (OBR) is an interferometric technique that can be used to measure local changes in temperature and mechanical strain based on spectral analyses of backscattered light from a singlemode optical fiber. The technique uses Fourier analyses to resolve spectra resulting from reflections occurring over a discrete region along the fiber. These spectra are cross-correlated with reference spectra to calculate the relative spectral shifts between measurements. The maximum of the cross-correlated spectra—termed quality—is a metric that quantifies the degree of correlation between the two measurements. Recently, this quality metric was incorporated into an adaptive algorithm to (1) selectively vary the reference measurement until the quality exceeds a predefined threshold and (2) calculate incremental spectral shifts that can be summed to determine the spectral shift relative to the initial reference. Using a graphical (network) framework, this effort demonstrated the optimal reconstruction of distributed OBR measurements for all sensing locations using a maximum spanning tree (MST). By allowing the reference to vary as a function of both time and sensing location, the MST and other adaptive algorithms could resolve spectral shifts at some locations, even if others can no longer be resolved.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Efficient Anomaly Detection Driven By Different Machine Learning Architectures And Models

The rapid growth and ubiquitous adoption of the internet and cyber-physical systems (CPS) have fundamentally transformed modern communication, work, and human-system interactions. While networks now form the backbone of critical digital ecosystems, enabling seamless data transmission across diverse, interconnected systems, this increased connectivity also expands the attack surface, making real-time detection of network intrusions and anomalies a pressing challenge. Detecting unusual activities within network infrastructure requires advanced data traffic analysis to differentiate between legitimate and malicious interactions. Traditional approaches to network anomaly detectionâ??such as rule-based and signature-based systemsâ??often depend on predefined patterns to identify known anomalies, limiting their effectiveness against emerging, stealthy, or previously unseen threats. These conventional methods suffer from high false alarm rates and fail to adapt to the ever-evolving nature of network traffic, particularly in large-scale, decentralized environments where data volume, velocity, and variety are constantly increasing. This dissertation presents artificial intelligence (AI)-driven approaches to anomaly detection that leverage graphics processing unit (GPU)-enabled high-performance computing (HPC) platforms for processing massive network traffic data and monitoring the components of cyber-physical systems (CPS) for potentially hazardous conditions. The research advances several key contributions: (1) Designing efficient machine learning techniques for CPS condition monitoring and anomaly detection; (2) enabling federated learning (FL) frameworks that enable distributed detection while preserving data privacy and system resilience; (3) exploring graph-based methodologies combining graph neural networks (GNN) and graph machine learning (ML) approaches for the Internet of Things (IoT) and automotive network security, and (4) performing distributed edge computing optimizations that integrate FL with scalable technologies for reduced communication overhead. Through extensive experiments, these methodologies demonstrate that complex anomaly detection and condition monitoring tasks can be achieved while balancing computational efficiency and detection accuracy through fine-grained network information processing. The frameworks developed in this research establish a robust foundation for network anomaly detection, providing scalable, adaptive, and privacy-preserving solutions for safeguarding CPS and IoT networks in an increasingly interconnected digital landscape. The practical implications of these research findings are significant, as they can inform the development of next-generation network security systems and contribute to the protection of critical infrastructure against sophisticated cyber attacks.

Marfo, William↗
DOE OSTI2026

Measurement-informed Dynamic Aggregation of Distribution Systems

This paper proposes a measurement-informed dynamic aggregation methodology in order to create equivalent representations of distribution systems that are compatible with large-scale transmission analysis. By optimizing an equivalent feeder parameters using time-series measurements of active power, reactive power, and voltage at the Point of Interconnection (POI), the approach yields simplified yet dynamically accurate equivalents. Implemented in PSCAD with models of photovoltaic–battery systems, three-phase motors, and static loads, the method employs hybrid differential evolution and bounded least-squares optimization laying the foundation for for real-time state estimation and optimized sensor placement in distribution networks.

Ahmed, Kazi Ishrak [University of Tennessee, Knoxv↗
DOE OSTI2021

Planning for Resilient Power Distribution Systems using Risk-Based Quantification and Q-Learning

Grid hardening is one of the most effective approaches that reduce the component failures and restoration efforts thus increasing the resilience of the power systems against extreme events. However, hardening and upgrading the entire system is prohibitively expensive and hence the optimal design of a distribution network is challenging. This paper adopted a reinforcement learning algorithm to identify the optimal hardening strategy to enhance the resilience of power distribution systems. Adopting the Q-learning algorithm as the reinforcement learning technique, we found the sequential optimal action for hardening measures to enhance the grid's resilience for the given budget. To identify the optimal strategy through Q-learning, Conditional Value at Risk (CVaR) is used as a rewarding metric. A study on the IEEE 123-bus test feeder validate the effectiveness of the proposed model and show how to effectively allocate budget limited resources to plan a resilient power distribution network.

Paul, Shuva↗
DOE OSTI2021

AC Power Flow Based DLMP Calculation and Decomposition Method to Smooth Power Fluctuation of Distributed Renewable Energy Sources

As the penetration of renewable energy sources increases, the growing renewable power variability brings ramping issues to power systems. Meanwhile, the development of distributed energy resources (DERs) makes the distribution systems to provide both energy and ancillary services. To incentivise individual resources and customers to alleviate ramping issues on the demand side, a two-stage distribution locational marginal price (DLMP) calculation and decomposition method is developed to formulate the marginal power ramping price for DERs. In the first stage of the proposed method, a distribution system operator market scheduling model based on AC optimal power flow is designed to estimate the optimal operating point of the distribution system. Subsequently, the voltage and power flow constraints are linearised in stage two to calculate DLMP. Finally, based on the Lagrange function and sensitivity factors, DLMP is decomposed to the marginal costs for active/reactive power, voltage management, power loss and power variability. Case studies demonstrate that the proposed model can effectively smooth the power fluctuation and reduce the ramping flexibility requirements of distribution systems.

AC optimal power flow↗
DOE OSTI2022

Market mechanism to enable grid-aware dispatch of Aggregators in radial distribution networks

This paper presents a market-based optimization framework wherein Aggregators can compete for nodal capacity across a distribution feeder and guarantee that allocated flexible capacity cannot cause overloads or congestion. This mechanism, thus, allows Aggregators with allocated capacity to pursue a number of services at the whole-sale market level to maximize revenue of flexible resources. Based on Aggregator bids of capacity (MW) and network access price ($/MW), the distribution system operator (DSO) formulates an optimization problem that prioritizes capacity to the different Aggregators across the network while implicitly considering AC network constraints. This grid-aware allocation is obtained by incorporating a convex inner approximation into the optimization framework that prioritizes hosting capacity to different Aggregators. We adapt concepts from transmission-level capacity market clearing, utility demand charges, and Internet-like bandwidth allocation rules to distribution system operations by incorporating nodal voltage and transformer constraints into the optimization framework. Simulation based results on IEEE distribution networks showcase the effectiveness of the approach.

Nazir, Mohammad Nawaf↗
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 OSTI2025

Ocelot: An Interactive, Efficient Distributed Compression-As-a-Service Platform With Optimized Data Compression Techniques

Large volumes of data generated by scientific simulations, genome sequencing, and other applications need to be moved among clusters for data collection/analysis. Data compression techniques have effectively reduced data storage and transfer costs. However, users' requirements on interactively controlling both data quality and compression ratios are non-trivial to fulfill. Here, we propose a novel Compression-as-a-Service (CaaS) platform called Ocelot with four important contributions: (1) It offers real-time visualization, interactive compression, and transfer of scientific datasets. (2) It incorporates new strategies for compressing diverse types of datasets more effectively than traditional methods. (3) It provides an effective method for estimating the compression ratio and execution time of compression tasks. (4) Experiments on multiple real-world datasets on geographically distributed computers show that Ocelot can significantly improve data transfer efficiency with a performance gain of more than 10x in computing clusters with relatively slow networks.

compression as a service (CaaS)↗
DOE OSTI2024

Exploiting Power Flow Manifold to Solve AC Optimal Power Flow

AC optimal power flow has proven difficult to solve with interior point methods on GPUs. This is largely due to challenging linear algebra problems that current state of the art massively parallel linear solvers struggle with. However, the advent of Riemannian optimization techniques and the fact that the power flow equations form a smooth manifold present an alternative approach. In this talk, we present the basics of Riemannian optimization techniques in which optimization is done directly on a manifold. Then we present computational results showing that Riemannian techniques are capable of producing solutions of comparable quality as interior point methods.

AC optimal power flow↗
DOE OSTI2023

Distributed Rules-Based Deconfliction of ADMS Applications - Part 2: Conceptual Implementation

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. The first document previously defined the requirements, context, and methods for decomposing the deconfliction problem using the Laminar Coordination Framework and Variable Grid Structures. The deconfliction problem was decomposed into a distributed optimization problem based on the concept of quasi-static grid segments, which form independent distributed areas for control and coordination. It was recommended that selection of the optimal number of decompositions of the deconfliction problem be made based on a tradeoff analysis between computational speed and global optimality. This second document defines 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↗