Search NASA⌕ Search

SEARCH · Search NASA

Results for “network 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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Optimal Iterative Method for Network Utility Maximization with Intertemporal Constraints

Network utility maximization (NUM) has been widely used to solve the optimal resource allocation problem in wireless network and power systems. The network planner aims to allocate generation and demand over producers and consumers such that social welfare is maximized while supply and demand are balanced, and network constraints such as branch capacity constraints are satisfied. However, when taking into account dynamics of agents, such as ramp rate constraints on power output for suppliers and impact of cumulative prior consumption on current demand for consumers, a single-period formulation is not sufficient. We propose an iterative method for the multi-period NUM with intertemporal constraints based on dual decomposition. It features a price iteration scheme that achieves optimal social welfare, and the algorithm is guaranteed to converge if proper concavity condition holds. We illustrate the iterative algorithm by power system examples. It is shown that similar to locational marginal price (LMP) in power systems, time-varying congestion prices arise when there exists binding branch constraints. Simulation results also demonstrate that there is increase in social welfare compared to a single-period formulation.

Ma, Ke↗
DOE OSTI2023

Optimization of Distribution Feeder Topology: A Differential Programming Learning Approach

This paper presents a gradient based method for optimizing distribution feeder network topology under load un- certainty. We recast the optimal network reconfiguration problem as a learning problem where edge weights of a graph are learned to produce an optimized spanning tree for a distribution network. Using recent methods published on differentiable programming, we provide a data driven method for learning these weights. We test our method on 100 variations of an IEEE 15-bus test system. Our results show that our method outperforms more traditional mathematical programming-based approaches.

differentiable programming↗
DOE OSTI2025

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Scalable Bayesian optimization with randomized prior networks

Several fundamental problems in science and engineering consist of global optimization tasks involving unknown high-dimensional (black-box) functions that map a set of controllable variables to the outcomes of an expensive experiment. Bayesian Optimization (BO) techniques are known to be effective in tackling global optimization problems using a relatively small number objective function evaluations, but their performance suffers when dealing with high-dimensional outputs. To overcome the major challenge of dimensionality, here we propose a deep learning framework for BO and sequential decision making based on bootstrapped ensembles of neural architectures with randomized priors. Using appropriate architecture choices, we show that the proposed framework can approximate functional relationships between design variables and quantities of interest, even in cases where the latter take values in high-dimensional vector spaces or even infinite-dimensional function spaces. In the context of BO, we augmented the proposed probabilistic surrogates with re-parameterized Monte Carlo approximations of multiple-point (parallel) acquisition functions, as well as methodological extensions for accommodating black-box constraints and multi-fidelity information sources. We test the proposed framework against state-of-the-art methods for BO and demonstrate superior performance across several challenging tasks with high-dimensional outputs, including a constrained multi-fidelity optimization task involving shape optimization of rotor blades in turbo-machinery.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Backflow Transformations via Neural Networks for Quantum Many-Body Wave Functions

Obtaining an accurate ground state wave function is one of the great challenges in the quantum many-body problem. In this Letter, we propose a new class of wave functions, neural network backflow (NNB). Here, the backflow approach, pioneered originally by Feynman and Cohen [Phys. Rev. 102, 1189 (1956)], adds correlation to a mean-field ground state by transforming the single-particle orbitals in a configuration-dependent way. NNB uses a feed-forward neural network to learn the optimal transformation via variational Monte Carlo calculations. NNB directly dresses a mean-field state, can be systematically improved, and directly alters the sign structure of the wave function. It generalizes the standard backflow [L. F. Tocchio et al., Phys. Rev. B 78, 041101(R) (2008)], which we show how to explicitly represent as a NNB. We benchmark the NNB on Hubbard models at intermediate doping, finding that it significantly decreases the relative error, restores the symmetry of both observables and single-particle orbitals, and decreases the double-occupancy density. Finally, we illustrate interesting patterns in the weights and bias of the optimized neural network.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Solving Optimal Power Flow for Distribution Networks with State Estimation Feedback

Conventional optimal power flow (OPF) solvers assume full observability of the involved system states. However in practice, there is a lack of reliable system monitoring devices in the distribution networks. To close the gap between the theoretic algorithm design and practical implementation, this work proposes to solve the OPF problems based on the state estimation (SE) feedback for the distribution networks where only a part of the involved system states are physically measured. The SE feedback increases the observability of the under-measured system and provides more accurate system states monitoring when the measurements are noisy. We analytically investigate the convergence of the proposed algorithm. The numerical results demonstrate that the proposed approach is more robust to large pseudo measurement variability and inherent sensor noise in comparison to the other frameworks without SE feedback.

distirbution systems↗
DOE OSTI2018

Dynamic Power Distribution System Management With a Locally Connected Communication Network

Coordinated optimization and control of distribution-level assets can enable a reliable and optimal integration of massive amount of distributed energy resources (DERs) and facilitate distribution system management (DSM). Accordingly, the objective is to coordinate the power injection at the DERs to maintain certain quantities across the network, e.g., voltage magnitude, line flows, or line losses, to be close to a desired profile. By and large, the performance of the DSM algorithms has been challenged by two factors: i) the possibly non-strongly connected communication network over DERs that hinders the coordination; ii) the dynamics of the real system caused by the DERs with heterogeneous capabilities, time-varying operating conditions, and real-time measurement mismatches. In this paper, we investigate the modeling and algorithm design and analysis with the consideration of these two factors. In particular, a game theoretic characterization is first proposed to account for a locally connected communication network over DERs, along with the analysis of the existence and uniqueness of the Nash equilibrium (NE) therein. To achieve the equilibrium in a distributed fashion, a projected-gradient-based asynchronous DSM algorithm is then advocated. The algorithm performance, including the convergence speed and the tracking error, is analytically guaranteed under the dynamic setting. In conclusion, extensive numerical tests on both synthetic and realistic cases corroborate the analytical results derived.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

SNNVis: Visualizing Graph Embedding of Evolutionary Optimization for Spiking Neural Networks

While Spiking Neural Networks (SNNs) show a lot of promise, it is difficult to optimize them because applying traditional gradient-based optimization techniques is difficult. Even though evolutionary algorithms (EAs) have been shown to promise to optimize SNNs, understanding the relationship between evolving the characteristics of SNNs and their performance to improve the optimization algorithm is challenging because of the complex characteristics and huge population size. We propose visual analytics with novel graph embedding for evolutionary SNNs to address the challenges. While existing graph embedding techniques have limitations in preserving the specific features of the nodes and edges, our approach maintains them. Also, we develop visual analytics for understanding the relationship between the network performance and the features of nodes and edges and exploring and analyzing the evolving SNNs to build insights into improving the EA.

Chae, Junghoon [ORNL] (ORCID:0000000206016746)↗
DOE OSTI2025

Neural network approaches for parameterized optimal control

Here, we consider numerical approaches for deterministic, finite-dimensional optimal control problems whose dynamics depend on unknown or uncertain parameters. We seek to amortize the solution over a set of relevant parameters in an offline stage to enable rapid decision-making and be able to react to changes in the parameter in the online stage. To tackle the curse of dimensionality arising when the state and/or parameter are high-dimensional, we represent the policy using neural networks. We compare two training paradigms: First, our model-based approach leverages the dynamics and definition of the objective function to learn the value function of the parameterized optimal control problem and obtain the policy using a feedback form. Second, we use actor-critic reinforcement learning to approximate the policy in a data-driven way. Using an example involving a two-dimensional convection-diffusion equation, which features high-dimensional state and parameter spaces, we investigate the accuracy and efficiency of both training paradigms. While both paradigms lead to a reasonable approximation of the policy, the model-based approach is more accurate and considerably reduces the number of PDE solves.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Optimal function estimation with photonic quantum sensor networks

The problem of optimally measuring an analytic function of unknown local parameters each linearly coupled to a qubit sensor is well understood, with applications ranging from field interpolation to noise characterization. Here we resolve a number of open questions that arise when extending this framework to Mach-Zehnder interferometers and quadrature displacement sensing. In particular, we derive lower bounds on the achievable mean square error in estimating a linear function of either local phase shifts or quadrature displacements. In the case of local phase shifts, these results prove, and somewhat generalize, a conjecture by Proctor []. For quadrature displacements, we extend proofs of lower bounds to the case of arbitrary linear functions. We provide optimal protocols achieving these bounds up to small (multiplicative) constants and describe an algebraic approach to deriving new optimal protocols, possibly subject to additional constraints. Using this approach, we prove necessary conditions for the amount of entanglement needed for any optimal protocol for both local phase and displacement sensing. Published by the American Physical Society 2024

Bringewatt, Jacob↗
DOE OSTI2018

Developing Fugitive Emissions Sensor Networks

This document summarizes research performed under the Laboratory Directed Research and Development (LDRD) project titled Developing Fugitive Emissions Sensor Networks: New Optimization Algorithms for Monitoring, Measurement and Verification. The purpose of this project is to develop methods and software to enhance detection programs through optimal design of the sensor network. This project includes both software development and field work. While this project is focused on methane emissions, the sensor placement optimization framework can be applied to a wide range of applications, including the placement of water quality sensors, surveillance cameras, fire and chemical detectors. This research has the potential to improve national security by improving the way sensors are deployed in the field.

47 OTHER INSTRUMENTATION↗
DOE OSTI2019

Multistage matching network and related techniques

Multistage matching networks and analytical frameworks for improving and/or optimizing the networks is provided. In one example, a framework relaxes the resistive constraint on the input and load impedances of the stages of a multistage matching network and allows them to be complex. Based on this framework, the design of multistage matching networks can be improved or optimized, such as using a method of Lagrange multipliers. A design optimization approach, for example, can be used to predict an optimum distribution of gains and impedance characteristics among the stages of a multistage matching network. The efficiency of matching networks designed using this example approach is compared with a conventional design approach, and it is shown that significant efficiency improvements are possible.

42 ENGINEERING↗
DOE OSTI2022

Development of lean, efficient, and fast physics-framed deep-learning-based proxy models for subsurface carbon storage

In this work, we present deep-learning-based surrogate models for CCUS developed with four different algorithms and a physics-framed two-phase flow problem involving displacement of water by CO 2 . The deep-learning models were trained using 3D datasets describing the pressure plume, CO 2 saturation plume, and water extraction rate generated by numerical simulation. The hyperparameters defining the architecture of the neural networks were optimized to determine the slimmest network size and training parameters that give the most efficient performance at the least training cost. To develop a robust model that closely mimics the governing physical laws, the discretized form of the two-phase fluid transport equation was used to formulate the supervised deep-learning task. The algorithms investigated in this study predicted the data to above 95% accuracy, with the multi-layer perceptron model demonstrating the best performance by balancing training speed, prediction time, and prediction accuracy with lean network capacity. Furthermore, the surrogate models simultaneously predict reservoir pressure and CO 2 saturation in every grid block, including the surface well extraction rate and bottomhole pressure, at all simulation times for a given static model realization in just a few seconds on a standard desktop computer. A key outcome of this study is that limits can be placed on network design parameters to avoid over designing neural networks, with associated efficiencies in training and prediction times. This is very useful because large volumes of data may be generated in CCUS projects and over-design of neural network architectures imposes penalties that are antithetical to the goal of near-real time forecasting.

58 GEOSCIENCES↗
DOE OSTI2025

Quantum Reinforcement Learning for Volt-VAR Control in Power Distribution Systems

Volt-VAR control (VVC) is crucial in active distribution networks for optimizing voltage profiles and minimizing network losses. While traditional deep reinforcement learning (DRL) algorithms exhibit promise for VVC, they often require extensive computational resources to handle such a high-dimensional problem. As a potential solution, quantum reinforcement learning (QRL) algorithms integrate the computational capabilities of quantum computing into the DRL framework. However, existing QRL algorithms struggle with complex VVC problems due to the limitations of current quantum hardware. To bridge this gap, this paper proposes an innovative QRL algorithm featuring an end-to-end architecture that integrates a classical autoencoder, variational quantum circuits (VQCs), and classical post-processing layers. This design efficiently compresses high-dimensional grid states, enabling VQCs to leverage quantum advantages while producing multiple control device outputs tailored for VVC tasks. Numerical studies on three representative distribution systems verify the effectiveness and scalability of the proposed QRL algorithm, and demonstrate its enhanced performance over classical approaches with only approximately 1% of the parameters. Additionally, the robustness of our developed algorithm is validated through noisy quantum environments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Scale-bridging Optimization Framework for Desalination Integrated Produced Water Networks

Produced water (PW) management poses a major challenge to U.S. oil and gas development. Due to freshwater scarcity and PW injection curtailments, desalination may become a necessity in some parts of the country. Integrating rigorous desalination process models within a produced water network for co-optimization of desalination design and network operation can be challenging to scale-up due to computational complexity. In this work we use the trust region filter framework to decompose the integrated optimization problem into an optimization master problem consisting of the network model and simplified surrogates for the desalination units and an optimization sub problem for the rigorous desalination unit model. The approach is demonstrated on a multiperiod produced water network from the PARETO library with thermal desalination units.

Naik, Sakshi↗
DOE OSTI2022

Hierarchical Distributed Optimal Power Flow of HV and MV Distribution Networks With Continuous and Discrete Devices

With large-scale distributed photovoltaics (PVs) being integrated into distribution networks (DNs), coordinated optimal power flow (OPF) of high voltage (HV) and medium voltage (MV) DNs should be investigated to optimally dispatch the distributed PVs and other network devices. Here, this paper presents a hierarchical distributed OPF method for HV and MV DNs with on-load tap changers, reactive power compensators, feeder switches and distributed PVs. A hierarchical master-slave control architecture is applied to implement coordinated OPF of two-layer DNs. The HV master problem and MV subproblems are transformed into mixed-integer convex problems respectively with second order cone programming and LinDistFlow approximation. Since there is no efficient distributed algorithm to solve such OPF models with integer subproblems, a novel distributed algorithm is proposed in this paper to efficiently solve the hierarchical coordinated OPF model with integer subproblems in a distributed manner. In the proposed algorithm, the coordinated OPF model is solved in a branch-and-bound framework, where in each branch node generalized Benders decomposition (GBD) algorithm is applied to decompose the coordinated OPF model into a master problem and relaxed subproblems and solves them iteratively to get optimal solution. The GBD optimal and feasible cutting planes generated in a branch node are proved to be valid for its descendants. Moreover, three acceleration techniques are introduced into the proposed algorithm to improve computational efficiency. Finally, the effectiveness and accuracy of the proposed method are verified via simulation tests in Jinzhai DNs of China.

42 ENGINEERING↗
DOE OSTI2024

Distributionally Robust Bilevel Optimization Model for Distribution Network With Demand Response Under Uncertain Renewables Using Wasserstein Metrics

Here, we consider a distribution network integrating demand response (DR) participants in the presence of uncertain renewable suppliers and outdoor temperatures. A bilevel optimization model is proposed to capture the intricate dynamics between price-incentivized DR participants and distribution system operations, including energy procurement and active/reactive power flows. The model is formulated as a distributional robust bilevel optimization using Wasserstein metrics. We show favorable data-driven properties including out-of-sample guarantee and asymptotic consistency. Furthermore, we present a tractable mixed-integer linear programming reformulation and characterize the worst-case distribution. Computational experiments are conducted on a modified 33-bus system. Our findings underscore the efficacy of the pricing strategies derived from the proposed bilevel optimization model. These strategies not only effectively manage DR participants' behavior but also bring equity considerations among households with various characteristics to light. The results contribute to a deeper understanding of the interplay between distribution system operators and DR participants.

24 POWER TRANSMISSION AND DISTRIBUTION↗