Search NASA⌕ Search

SEARCH · Search NASA

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 1,603 records · Page 89

Lipschitz control of geodesics in the Heisenberg group.

Monge first posed his (L{sup 1}) optimal mass transfer problem: to find a mapping of one distribution into another, minimizing total distance of transporting mass, in 1781. It remained unsolved in R{sup n} until the late 1990's. This result has since been extended to Riemannian manifolds. In both cases, optimal mass transfer relies upon a key lemma providing a Lipschitz control on the directions of geodesics. We will discuss the Lipschitz control of geodesics in the (subRiemannian) Heisenberg group. This provides an important step towards a potential theoretic proof of Monge's problem in the Heisenberg group.

99 GENERAL AND MISCELLANEOUS↗

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Attention Enabled Multi-Agent DRL for Decentralized Volt-VAR Control of Active Distribution System Using PV Inverters and SVCs

This paper proposes attention enabled multi-agent deep reinforcement learning (MADRL) framework for active distribution network decentralized Volt-VAR control. Using the unsupervised clustering, the whole distribution system can be decomposed into several sub-networks according to the voltage and reactive power sensitivity relationships. Then, the distributed control problem of each sub-network is modeled as Markov games and solved by the improved MADRL algorithm, where each sub-network is modeled as an adaptive agent. An attention mechanism is developed to help each agent focus on specific information that is mostly related to the reward. All agents are centrally trained offline to learn the optimal coordinated Volt-VAR control strategy and executed in a decentralized manner to make online decisions with only local information. Compared with other distributed control approaches, the proposed method can effectively deal with uncertainties, achieve fast decision makings, and significantly reduce the communication requirements. Comparison results with model-based and other data-driven methods on IEEE 33-bus and 123-bus systems demonstrate the benefits of the proposed approach.

distribution network↗

Global optimal consensus for discrete-time multi-agent systems with bounded controls

In this paper, we consider the global optimal consensus problem for discrete-time multi-agent systems with bounded control protocols over xed undirected communication networks. Each agent is described by a discrete-time single integrator and endowed with a quadratic objective function which is private to itself. For each agent, we develop two bounded distributed protocols: bounded proportional-integral (PI) protocol and bounded integral (I) protocol, based on information receiving from its neighboring agents through the communication network and the gradient of its own objective function. We show that the proposed bounded distributed protocols with properly chosen parameters solve the global optimal consensus problem if the communication network is connected, i.e., the multi-agent system achieves consensus at a state that minimizes the sum of the objective functions of all agents. The theoretical results are illustrated by numerical simulations.

Consensus, multi-agent system, optimal control↗

Bridging Control and Deployment: A Cross-Layer Analysis of Scalable Building Cluster Control

Building cluster control has emerged as a promising approach for enabling flexible and coordinated operation of distributed building systems, yet its transition from pilot demonstrations to routine grid-interactive operation remains limited. This paper argues that this gap cannot be explained by control algorithms alone. Instead, it arises from interacting barriers in communication infrastructure, data and semantic interoperability, uncertainty management, stakeholder participation, market design, and policy support. Accordingly, the paper reviews both technical and non-technical barriers to building cluster control. Technical challenges include heterogeneous devices and protocols, communication latency and reliability, distributed decision-making, and uncertainty propagation across aggregated loads. Non-technical barriers include user participation, stakeholder coordination, incentive allocation, and data governance. Existing solution approaches are synthesized, including semantic interoperability frameworks, edge and hierarchical communication architectures, distributed and transactive control strategies, uncertainty-aware optimization, policy mechanisms, and market reforms. Based on this analysis, two research directions are identified: testing infrastructures that can evaluate control performance under realistic multi-building conditions, and abstraction methods that allow building clusters to interact with other energy sectors through standardized flexibility representations. Overall, the paper provides a structured review of how building cluster control can move from isolated demonstrations toward reproducible, market-compatible, and grid-relevant implementation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Technology Improvement Pathways to Cost-Effective Vehicle Electrification

Electrifying transportation can reduce or eliminate dependence on foreign fuels, emission of green house gases, and emission of pollutants. One challenge is finding a pathway for vehicles that gains wide market acceptance to achieve a meaningful benefit. This paper evaluates several approaches aimed at making plug-in electric vehicles (EV) and plug-in hybrid electric vehicles (PHEVs) cost-effective including opportunity charging, replacing the battery over the vehicle life, improving battery life, reducing battery cost, and providing electric power directly to the vehicle during a portion of its travel. Many combinations of PHEV electric range and battery power are included. For each case, the model accounts for battery cycle life and the national distribution of driving distances to size the battery optimally. Using the current estimates of battery life and cost, only the dynamically plugged-in pathway was cost-effective to the consumer. Significant improvements in battery life and battery cost also made PHEVs more cost-effective than today's hybrid electric vehicles (HEVs) and conventional internal combustion engine vehicles (CVs).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Unidirectional resonance modes supported by secondary islands in a microcavity comprised of two half-ellipses

We propose a simple and robust mechanism to achieve unidirectional emission in a microcavity comprised of two half-ellipses. The microcavity has two geometrical parameters, two eccentricities, which permit a control of the directional emissions. For the microcavity with two small eccentricities, the positions of secondary islands near primary islands in the survival probability distributions determine the directionality of emissions. We obtain the optimized values of the eccentricities for unidirectional emission.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hierarchical Optimal Power Flow with Improved Gradient Evaluation

Existing algorithms to solve alternating-current optimal power flow (AC-OPF) often exploit linear approximations to simplify system models and accelerate computations. In this paper, we improve a recent hierarchical OPF algorithm, which rested on primal-dual gradients evaluated in a linearized distribution power flow model. Specifically, we identify a risk of voltage violation arising from the model linearization, and propose a more accurate gradient evaluation method to eliminate that risk. We further develop a hierarchical primal-dual algorithm to solve OPF based on the proposed gradient evaluation method. Numerical results on IEEE networks show that our algorithm can enhance voltage safety with satisfactory computational efficiency.

distributed algorithm↗

TU-C-17A-12: Towards a Passively Optimized Phase-Space Monte Carlo (POPMC) Treatment Planning Method: A Proof of Principle

Purpose: The advent of on-line/off-line adaptive, and biologically-conformal radiation therapy has led to a need for treatment planning solutions that utilize voxel-specific penalties, requiring optimization over a large solution space that is performed quickly, and the dose in each voxel calculated accurately. This work proposes a “passive” optimization framework, which is executed concurrently during Monte Carlo dose calculation, evaluating the cost/benefit of each history during transport, and creates a passively optimized fluence map. Methods: The Monte Carlo code Geant4 v9.6 was used for this study. The standard voxel geometry implementation was modified to support the passive optimization framework, with voxel-specific optimization parameters. Dose-benefit functions, which will increase a particle history’s weight upon dose deposition, were defined in a central collection of voxels to effectively create target structures. Histories that deposit energy to voxels are reweighted based on a voxel’s dose multiplied by its cost/benefit value. Upon full termination of each history, the dose contributions of that history are reweighted to reflect a contribution proportional to the history’s final weight. A parallel-planar 1.25 MeV photon fluence is transported through the geometry, and re-weighted at each dose deposition step. The resulting weight is tallied with the incident spatial and directional coordinates in a phase-space distribution. Results: A uniform incident fluence was reweighted during MC dose calculations to create an optimized fluence map which would generate dose profiles in target volumes that exhibit the same dose characteristics as the prescribed optimization parameters. An optimized dose profile, calculated concurrently with the phase-space, reflects the resulting dose distribution. Conclusion: This study demonstrated the feasibility of passively optimizing an incident fluence map during Monte Carlo dose calculations. The flexibility of the voxel-specific optimization framework allows a variety and combination of optimization parameters to be calculated for each voxel at every transportation step. This work is partially supported by Varian. This work is partially supported by the NIH.

07 ISOTOPE AND RADIATION SOURCES↗

A Model Calibration Method for Grid-Forming Inverters Using Iterative Bayesian Optimization

As inverter-based resources (IBRs) are rapidly deployed, especially at the distribution and microgrid levels, the need to include their accurate representations in power systems models increases. With well-calibrated models, IBR-interactions can be examined, preventing any stability and operational issues, especially in islanded systems. This paper proposes a method to calibrate generic inverter models using Bayesian optimization, but with a parameter-grouping approach to improve speed and accuracy. This approach is illustrated for a grid-forming inverter using synthetic data and field measurements from a simple IBRbased microgrid. Tests show that the calibration algorithm has modest computation cost and is robust to noisy measurements..

Biswas, Shuchismita↗

Vehicle routing for the last mile of power system restoration

This paper studied a novel problem in power system restoration: the Power Restoration Vehicle Routing Problem (PRVRP). The goal of PRVRPs is to decide how coordinate repair crews effectively in order to recover from blackouts as fast as possible after a disaster has occurred. PRVRPs are complex problems that combine vehicle routing and power restoration scheduling problems. The paper proposed a multi-stage optimization algorithm based on the idea of constraint injection that meets the aggressive runtime constraints necessary for disaster recovery. The algorithms were validated on benchmarks produced by the Los Alamos National Laboratory, using the infrastructure of the United States. The disaster scenarios were generated by state-of-the-art hurricane simulation tools similar to those used by the National Hurricane Center. Experimental results show that the constraint-injection algorithms can reduce the blackouts by 50% or more over field practices. Moreover, the results show that the constraint-injection algorithm using large neighborhood search over a blackbox simulator provide competitive quality and scales better than using a MIP solver on the subproblems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distribution Locational Marginal Pricing (DLMP) for Congestion Management and Voltage Support

In this paper, a day-ahead market-clearing model for smart distribution systems is proposed. Various types of distributed energy resources (DERs), such as distributed energy storage, distributed generators, microgrids, and load aggregators, can bid into the day-ahead distribution-level electricity market. Considering system Volt/VAR control, network reconfiguration, and interactions with the wholesale market, an optimization model is built to clear the day-ahead market, through which the distribution locational marginal pricing (DLMPs) for both active power and reactive power are determined. Through derivations of the Lagrangian function and sensitivity factors, DLMPs are decomposed to five components (i.e., marginal costs for active power, reactive power, congestion, voltage support, and loss), which provide price signals to motivate DERs to contribute to congestion management and voltage support. Finally, case studies demonstrate the effectiveness of the proposed method.

congestion management↗

A Data-Driven Multi-Period Importance Sampling Strategy for Stochastic Economic Dispatch

Power systems with high penetrations of renewable energy (e.g., wind power) require sophisticated approaches to optimize system performance due to uncertainty in short-term system generation capacity. In this paper, we combine a data-driven analog scenario selection method with importance sampling to create a novel scenario construction approach for two-stage stochastic economic dispatch problems with a large number of wind farms on a network. The proposed method produces scenarios with realistic physics by finding high-fidelity analogs that can describe future states of the system. We show how to extend this method to multi-period operations and demonstrate the effectiveness of this technique by simulating economic dispatch operations on a synthetic test system over the course of a week.

data-driven forecasting↗

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems

This work presents methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices play a critical role in many power system applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

large scale↗

Systems and methods for optimal power flow on a radial network

Node controllers and power distribution networks in accordance with embodiments of the invention enable distributed power control. One embodiment includes a node controller including a distributed power control application; a plurality of node operating parameters describing the operating parameter of a node and a set of at least one node selected from the group consisting of an ancestor node and at least one child node; wherein send node operating parameters to nodes in the set of at least one node; receive operating parameters from the nodes in the set of at least one node; calculate a plurality of updated node operating parameters using an iterative process to determine the updated node operating parameters using the node operating parameters that describe the operating parameters of the node and the set of at least one node, where the iterative process involves evaluation of a closed form solution; and adjust node operating parameters.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Interval-parameter semi-infinite fuzzy-stochastic mixed-integer programming approach for environmental management under multiple uncertainties

In this study, an interval-parameter semi-infinite fuzzy-chance-constrained mixed-integer linear programming (ISIFCIP) approach is developed for supporting long-term planning of waste-management systems under multiple uncertainties in the City of Regina, Canada. The method improves upon the existing interval-parameter semi-infinite programming (ISIP) and fuzzy-chance-constrained programming (FCCP) by incorporating uncertainties expressed as dual uncertainties of functional intervals and multiple uncertainties of distributions with fuzzy-interval admissible probability of violating constraint within a general optimization framework. The binary-variable solutions represent the decisions of waste-management-facility expansion, and the continuous ones are related to decisions of waste-flow allocation. The interval solutions can help decision-makers to obtain multiple decision alternatives, as well as provide bases for further analyses of tradeoffs between waste-management cost and system-failure risk. In the application to the City of Regina, Canada, two scenarios are considered. In Scenario 1, the City's waste-management practices would be based on the existing policy over the next 25 years. The total diversion rate for the residential waste would be approximately 14%. Scenario 2 is associated with a policy for waste minimization and diversion, where 35% diversion of residential waste should be achieved within 15 years, and 50% diversion over 25 years. In this scenario, not only landfill would be expanded, but also CF and MRF would be expanded. Through the scenario analyses, useful decision support for the City's solid-waste managers and decision-makers has been generated. Three special characteristics of the proposed method make it unique compared with other optimization techniques that deal with uncertainties. Firstly, it is useful for tackling multiple uncertainties expressed as intervals, functional intervals, probability distributions, fuzzy sets, and their combinations; secondly, it has capability in addressing the temporal variations of the functional intervals; thirdly, it can facilitate dynamic analysis for decisions of facility-expansion planning and waste-flow allocation within a multi-facility, multi-period and multi-option context.

54 ENVIRONMENTAL SCIENCES↗

Estimation of extreme temperatures in direct solar methane pyrolysis within a porous medium

Porous media have wide application in renewable energy conversion processes, such as solar-thermal fuels production and decarbonization. Heat transport mechanisms within porous media can be highly complex, particularly under extreme conditions encountered in concentrated solar thermal reactors in which direct measurement of temperature is challenging. Here, we implement and report an inverse heat conduction model to estimate the temperature distribution throughout a porous substrate domain in a direct solar methane pyrolysis process. By solving a two-dimensional heat transfer problem and applying an inverse optimization algorithm, we estimate the quasi-steady state spatial temperature distribution in a fibrous porous carbon substrate. The results are validated indirectly by experimentally measured graphite deposition and a simplified reaction kinetic model.

finite difference method↗

Scenario generation for stochastic optimization problems via the sparse grid method

We study the use of sparse grids in the scenario generation (or discretization) problem in stochastic programming problems where the uncertainty is modeled using a continuous multivariate distribution. We show that, under a regularity assumption on the random function involved, the sequence of optimal objective function values of the sparse grid approximations converges to the true optimal objective function values as the number of scenarios increases. The rate of convergence is also established. We treat separately the special case when the underlying distribution is an affine transform of a product of univariate distributions, and show how the sparse grid method can be adapted to the distribution by the use of quadrature formulas tailored to the distribution. We numerically compare the performance of the sparse grid method using different quadrature rules with classic quasi-Monte Carlo (QMC) methods, optimal rank-one lattice rules, and Monte Carlo (MC) scenario generation, using a series of utility maximization problems with up to 160 random variables. The results show that the sparse grid method is very efficient, especially if the integrand is sufficiently smooth. In such problems the sparse grid scenario generation method is found to need several orders of magnitude fewer scenarios than MC and QMC scenario generation to achieve the same accuracy. As a result, it is indicated that the method scales well with the dimension of the distribution--especially when the underlying distribution is an affine transform of a product of univariate distributions, in which case the method appears scalable to thousands of random variables.

97 MATHEMATICS AND COMPUTING↗