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 163 records · Page 9

Distributed Prognostic Health Management with Gaussian Process Regression

Distributed prognostics architecture design is an enabling step for efficient implementation of health management systems. A major challenge encountered in such design is formulation of optimal distributed prognostics algorithms. In this paper. we present a distributed GPR based prognostics algorithm whose target platform is a wireless sensor network. In addition to challenges encountered in a distributed implementation, a wireless network poses constraints on communication patterns, thereby making the problem more challenging. The prognostics application that was used to demonstrate our new algorithms is battery prognostics. In order to present trade-offs within different prognostic approaches, we present comparison with the distributed implementation of a particle filter based prognostics for the same battery data.

Saha, Sankalita↗

Limitations of Separate Cloud and Rain Categories in Parameterizing Collision-Coalescence for Bulk Microphysics Schemes

Warm rain collision-coalescence has been persistently difficult to parameterize in bulk microphysics schemes. We use a flexible bulk microphysics scheme with bin scheme process parameterizations, called AMP, to investigate reasons for the difficulty. AMP is configured in a variety of ways to mimic bulk schemes and is compared to simulations with the bin scheme upon which AMP is built. We find that an important limitation in traditional bulk schemes is the use of separate cloud and rain categories. When the drop size distribution is instead represented by a continuous distribution, the simulation of cloud-to-rain conversion is substantially improved. We also find large sensitivity to the threshold size to distinguish cloud and rain in traditional schemes; substantial improvement is found by decreasing the threshold from 40 to 25 μm. Neither the use of an assumed functional form for the size distribution nor the choice of predicted distribution moments has a large impact on the ability of AMP to simulate rain production. When predicting four total moments of the liquid drop size distribution, either with a traditional two-category, two-moment scheme with a reduced size threshold, or a four-moment single-category scheme, errors in the evolution of mass and the cloud size distribution are similar, but the single-category scheme has a substantially better representation of the rain size distribution. Optimal moment combinations for the single-category approach are investigated and appear to be linked more to the information content they provide for constraining the size distributions than to their correlation with collision-coalescence rates.

54 ENVIRONMENTAL SCIENCES↗

On Estimating the Phase of Periodic Waveform in Additive Gaussian Noise, Part 2

Motivated by advances in signal processing technology that support more complex algorithms, a new look is taken at the problem of estimating the phase and other parameters of a periodic waveform in additive Gaussian noise. The general problem was introduced and the maximum a posteriori probability criterion with signal space interpretation was used to obtain the structures of optimum and some suboptimum phase estimators for known constant frequency and unknown constant phase with an a priori distribution. Optimal algorithms are obtained for some cases where the frequency is a parameterized function of time with the unknown parameters and phase having a joint a priori distribution. In the last section, the intrinsic and extrinsic geometry of hypersurfaces is introduced to provide insight to the estimation problem for the small noise and large noise cases.

Rauch, L. L.↗

Limitations of Separate Cloud and Rain Categories in Parameterizing Collision-Coalescence for Bulk Microphysics Schemes

Warm rain collision-coalescence has been persistently difficult to parameterize in bulk microphysics schemes. We use a flexible bulk microphysics scheme with bin scheme process parameterizations, called AMP, to investigate reasons for the difficulty. AMP is configured in a variety of ways to mimic bulk schemes and is compared to simulations with the bin scheme upon which AMP is built. We find that an important limitation in traditional bulk schemes is the use of separate cloud and rain categories. When the drop size distribution is instead represented by a continuous distribution, the simulation of cloud-to-rain conversion is substantially improved. We also find large sensitivity to the threshold size to distinguish cloud and rain in traditional schemes; substantial improvement is found by decreasing the threshold from 40 to 25 μm. Neither the use of an assumed functional form for the size distribution nor the choice of predicted distribution moments has a large impact on the ability of AMP to simulate rain production. When predicting four total moments of the liquid drop size distribution, either with a traditional two-category, two-moment scheme with a reduced size threshold, or a four-moment single-category scheme, errors in the evolution of mass and the cloud size distribution are similar, but the single-category scheme has a substantially better representation of the rain size distribution. Optimal moment combinations for the single-category approach are investigated and appear to be linked more to the information content they provide for constraining the size distributions than to their correlation with collision-coalescence rates.

autoconversion↗

An approximate method for the synthesis of optimal control of distributed systems.

An approximate method is presented for the synthesis of an optimal control of distributed parameter systems, based on a combination of the ideas of Lyapunov's direct method and those of Bellman's successive approximation in policy space. The method is such that the approximate equation is improved after each iteration in the sense of the performance index being used.

Park, K. E.↗

Droplet size distributions in turbulent clouds: experimental evaluation of theoretical distributions

Precipitation efficiency and optical properties of clouds, both central to determining Earth's weather and climate, depend on the size distribution of cloud particles. Here in this paper, theoretical expressions for cloud droplet size distribution shape are evaluated using measurements from controlled experiments in a convective-cloud chamber. The experiments are a unique opportunity to constrain theory because they are in steady-state and because the initial and boundary conditions are well characterized compared to typical atmospheric measurements. Three theoretical distributions obtained from a Langevin drift-diffusion approach to cloud formation via stochastic condensation are tested: (a) stochastic condensation with a constant removal time-scale; (b) stochastic condensation with a size-dependent removal time-scale; (c) droplet growth in a fixed supersaturation condition and with size-dependent removal. In addition, a similar Weibull distribution that can be obtained from the drift-diffusion approach, as well as from mechanism-independent probabilistic arguments (e.g., maximum entropy), is tested as a fourth hypothesis. Statistical techniques such as the χ2 test, sum of squared errors of prediction, and residual analysis are employed to judge relative success or failure of the theoretical distributions to describe the experimental data. An extensive set of cloud droplet size distributions are measured under different aerosol injection rates. Five different aerosol injection rates are run both for size-selected aerosol particles, and six aerosol injection rates are run for broad-distribution, polydisperse aerosol particles. In relative comparison, the most favourable comparison to the measurements is the expression for stochastic condensation with size-dependent droplet removal rate. However, even this optimal distribution breaks down for broad aerosol size distributions, primarily due to deviations from the measured large-droplet tail. Lastly, a possible explanation for the deviation is the Ostwald ripening effect coupled with deactivation/activation in polluted cloud conditions.

54 ENVIRONMENTAL SCIENCES↗

Planning Amidst Uncertainty: Identifying Core CCS Infrastructure Robust to Storage Uncertainty

Carbon Capture and Storage (CCS) is a critical technology for reducing anthropogenic CO2 emissions, but its large-scale deployment is complicated by uncertainties in geological storage performance. These uncertainties pose significant financial and operational risks, as underperforming storage sites can lead to costly infrastructure modifications, inefficient pipeline routing, and economic shortfalls. To address this challenge, we propose a novel optimization workflow that is based on mixed-integer linear programming and explicitly integrates probabilistic modeling of storage uncertainty into CCS infrastructure design. This workflow generates multiple infrastructure scenarios by sampling storage capacity distributions, optimally solving each scenario using a mixed-integer linear programming model, and aggregating results into a heatmap to identify core infrastructure components that have a low likelihood of underperforming. A risk index parameter is introduced to balance trade-offs between cost, CO2 processing capacity, and risk of underperformance, allowing stakeholders to quantify and mitigate uncertainty in CCS planning. Applying this workflow to a CCS dataset from the US Department of Energy’s Carbon Utilization and Storage Partnership project reveals key insights into infrastructure resilience. Reducing the risk index from 15% to 0% is observed to lead to an 83.7% reduction in CO2 processing capacity and a 77.1% decrease in project profit, quantifying the trade-off between risk tolerance and project performance. Furthermore, our results highlight critical breakpoints, where small adjustments in the risk index produce disproportionate shifts in infrastructure performance, providing actionable guidance for decision-makers. Unlike prior approaches that aimed to cheaply repair underperforming infrastructure, our workflow constructs robust CCS networks from the ground up, ensuring cost-effective infrastructure under storage uncertainty. These findings demonstrate the practical relevance of incorporating uncertainty-aware optimization into CCS planning, equipping decision-makers with a tool to make informed project planning decisions.

Olson, Daniel↗

Robust hierarchical dispatch for residential distribution network management considering home thermal flexibility and model predictive control

In the transactive energy (TE) paradigm, the devices of participative consumers, or prosumers, may be aggregated and employed to drive operational objectives at the network level. Home heating, ventilation and air-conditioning (HVAC) systems in particular are well-suited to modulate their behaviours based on both home thermal flexibility and requests from the utility grid. This paper develops a robust, hierarchical power dispatch scheme in the context of a residential distribution network. The formulation couples a unique, multiphase linear distribution optimal power flow (OPF) at the upper level with model predictive control (MPC)-based HVAC fleet controllers at the lower level. The proposed approach is tested on nearly 2000 homes with a three-phase distribution network in an intraday market setting, where two major applications are explored and analysed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Microgrid Assisted Design for Remote Areas

In this work, we present a three-stage multiobjective mixed-integer linear programming (MILP) for the optimal expansion planning and operation of isolated multienergy microgrids in remote areas. By selecting the optimal distributed generators (DGs) and energy storage systems (ESSs) mix selection, siting, sizing, and scheduling in the remote microgrid, the proposed model is targeted to minimize the annualized total cost of microgrids while enhancing the performance of the system, i.e., minimizing the voltage deviations and line power loss. To represent the electricity and heat flow between generation resources and various electrical, heating, and cooling loads in the isolated microgrid, linearized power flow, and heat flow constraints are employed in the proposed optimization model. The available capacity of DGs and ESSs are modeled as discrete constants instead of continuous variables for practical purpose. Numerical simulation results on a remote microgrid consisting of DGs, ESSs, and various loads validate the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Feedback Power Cost Optimization in Power Distribution Networks with Prosumers

Here, we propose a feedback control approach for solving optimal power flow (OPF) problems in power distribution networks (DNs) based on a projected gradient scheme, where the cost is given by the sum of functions of local power injections. This approach does not require detailed knowledge of the grid model and enables real-time tracking of the optimal generation configuration. Moreover, the communication burden is minimal: only a broadcast from a central entity, called the Network Supervisor (NS), to the agents in the network is needed. Hence, agents do not have to share local information that can be sensitive, e.g., their power injections or the value of the local costs. Our approach is then used to solve a particular OPF problem targeting DNs with high penetration of distributed energy resources (DERs) in which the energy cost is given by the remuneration that the DERs owners receive for the service they provide.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Opportunities and Challenges to Capturing Distributed Battery Value via Retail Utility Rates and Programs

Distributed battery deployment is increasing with advanced metering, control, and communication technologies, leaving electric utilities with an under-utilized, flexible grid resource in aggregate. Rates can reflect locational and temporal prices while utility incentive-based programs allow DERs to provide direct grid services. However, utilities must balance accurately reflecting dynamic grid conditions versus simple and feasible design that encourages customer participation. Currently, most rates and incentive-based programs are simple, but as penetration of DER and advanced controls increase, dynamic designs could become prevalent. Utilities could encourage providing multiple services to optimize distributed battery dispatch and value streams, however, challenges persist when stacking services across distribution and bulk systems. A DER committed to multiple discrete services concurrently necessitates coordination between operators and a clear hierarchy of commitments. One way to address this is to separate commitments by time or capacity. For services that follow cyclic, predictable patterns, or those that are peak driven with predictability, an operator could ensure sufficient state of charge for participation, leaving time where a distributed battery could otherwise provide different services by segmenting participation temporally. To provide continuous or unexpected services, a battery operator may use state of charge management to reserve some percentage of the battery and segment participation by capacity. Macroeconomic trends, load patterns, generation profiles, and grid configurations drive variation in value and the subsequent implications for utility offerings and how a customer might participate. As distributed battery adoption increases, both regulators and utilities will need to ensure no adverse grid impacts and encourage provision of societal value beyond the customer domain.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.

convergence↗

Applying Biomimetic Algorithms for Extra-Terrestrial Habitat Generation

The objective is to simulate and optimize distributed cooperation among a network of robots tasked with cooperative excavation on an extra-terrestrial surface. Additionally to examine the concept of directed Emergence among a group of limited artificially intelligent agents. Emergence is the concept of achieving complex results from very simple rules or interactions. For example, in a termite mound each individual termite does not carry a blueprint of how to make their home in a global sense, but their interactions based strictly on local desires create a complex superstructure. Leveraging this Emergence concept applied to a simulation of cooperative agents (robots) will allow an examination of the success of non-directed group strategy achieving specific results. Specifically the simulation will be a testbed to evaluate population based robotic exploration and cooperative strategies while leveraging the evolutionary teamwork approach in the face of uncertainty about the environment and partial loss of sensors. Checking against a cost function and 'social' constraints will optimize cooperation when excavating a simulated tunnel. Agents will act locally with non-local results. The rules by which the simulated robots interact will be optimized to the simplest possible for the desired result, leveraging Emergence. Sensor malfunction and line of sight issues will be incorporated into the simulation. This approach falls under Swarm Robotics, a subset of robot control concerned with finding ways to control large groups of robots. Swarm Robotics often contains biologically inspired approaches, research comes from social insect observation but also data from among groups of herding, schooling, and flocking animals. Biomimetic algorithms applied to manned space exploration is the method under consideration for further study.

Birge, Brian↗

Deep Reinforcement Learning Based Volt-VAR Optimization in Smart Distribution Systems

This paper develops a model-free volt-VAR optimization (VVO) algorithm via multi-agent deep reinforcement learning (DRL) in unbalanced distribution systems. This method is novel since we cast the VVO problem in distribution networks to an intelligent deep Q-network (DQN) framework, which avoids solving a specific optimization model directly when facing time-varying operating conditions in the systems. We consider statuses/ratios of switchable capacitors, voltage regulators, and smart inverters installed at distributed generators as the action variables of the agents. A delicately designed reward function guides these agents to interact with the distribution system, in the direction of reinforcing voltage regulation and power loss reduction simultaneously. The forward-backward sweep method for radial three-phase distribution systems provides accurate power flow results within a few iterations to the DRL environment. The proposed method realizes the dual goals for VVO. We test this algorithm on the unbalanced IEEE 13-bus and 123-bus systems. Numerical simulations validate the excellent performance of this method in voltage regulation and power loss reduction.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Solving a system of linear equations: From centralized to distributed methods

For a wide range of control engineering applications, the problem of solving a system of linear equations is often encountered and has been well studied. Traditionally, this problem has been mainly solved in a centralized manner. However, for applications related to large-scale complex networked systems, centralized algorithms are often subjected to some practical issues due to limited computational power and communication bandwidth. As a promising and viable alternative, distributed algorithms can effectively address the issues associated with centralized algorithms by solving the problem efficiently in a multi-agent setting that accords with the distributed nature of networked systems. Distributed algorithms decompose the entire problem into many sub-problems that are solved by individual agents in a cooperative manner. In this survey paper, we provide a detailed overview of the state of the art relevant to distributed algorithms for solving a system of linear equations. We will first review basic distributed algorithms including both discrete-time and continuous-time algorithms. Then we will discuss the extended algorithms to achieve communication efficiency. Furthermore, we will also introduce distributed algorithms to obtain the minimum-norm solution for a system of linear equations with multiple solutions, as well as the least-squares solutions when there is no solution. Finally, the relationship of distributed algorithms for solving a system of linear equations to the existing distributed optimization algorithms is discussed.

Wang, Peng↗

Impact of cyber attacks on distributed compressive sensing based state estimation in power distribution grids

Modern power distribution grids suffer from multiple vulnerabilities due to the tight integration between the physical system and the cyber infrastructure. Sophisticated and malicious cyber attacks continue to adversely impact the grid operation leading to performance degradation, service interruption, and grid failure. State estimation plays an essential role in grid monitoring and advancing cyber-attack situational awareness. In this regard, this paper first proposes a distributed compressive sensing (CS) state estimation approach for an unobservable distribution grid. Further, the proposed distributed CS approach divides the distribution grid into sub-areas to perform local state estimation. Then an alternating direction method of multipliers (ADMM) based iterative information exchange among neighboring areas is employed to complete the estimation process. In this estimation process, the impact of loss of measurement data, false data injection (FDI), replay, and neighborhood cyber-attacks is analyzed. Extensive simulations are performed on the IEEE 37-bus and IEEE 123-bus standard networks to demonstrate the algorithm’s robustness to the aforementioned cyber-attacks. A quantitative analysis of computational complexity and simulation time of the distributed CS based approach is also presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Estimating energy consumption and GHG emissions in the U.S. food supply chain for net-zero

This work provides a database of the U.S. food system’s energy consumption and GHG emissions at the national and state levels by food supply chain (FSC) stage, fuel type, and food commodity. We estimate that the U.S. FSC consumed a total 4660 TBTU (4900 PJ) of site energy, 7130 TBTU (7500 PJ) of primary energy, and generated 970 MMT of GHG emissions in 2016. Among all the stages, on-farm production is the largest energy consumer (31% primary energy) and GHG emissions contributor (70%), largely due to raising animals. Optimizing distribution can reduce the stage’s energy consumption and GHG emissions and increase products’ shelf-life. Reducing food loss and waste is another good option, as it decreases the amount of food necessary to grow, thus impacting the overall FSC. The database can help stakeholders identify stage- and region-specific strategies and measures to curtail the environmental footprint of the U.S. food system.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗