Search NASA⌕ Search

SEARCH · Search NASA

Results for “ADMM”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Real-Time Multiregional Market-to-Market Congestion Management Through Exchange of Relief Cost Curve

This paper introduces a novel method for multiregional market-to-market (M2M) coordinated congestion management. It identifies shortcomings in existing M2M approaches, where Regional Transmission Organizations (RTOs) exchange shadow prices and relief requests to optimize congestion relief allocations across interconnected regions. Two methods are proposed to enhance flow and price convergence. The first method proposes that both Regional Transmission Organizations (RTOs) use state-estimator flows directly to determine relief requirements, eliminating delays and potential oscillations caused by using market flows calculated from the prior period under existing M2M approach. The second method involves exchanging transmission relief cost curves, enabling each RTOs to integrate other RTOs' relief costs curve into its real-time security-constrained economic dispatch (SCED). This method can effectively extend the coordination to multiple transmission lines and across more than two RTOs. The alternating direction method of multipliers (ADMM) is also applied to the M2M coordination problem and compared with the proposed methods. Case studies on small and large-scale systems demonstrate the effectiveness of these approaches.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Distributed Data-Driven Optimization for Voltage Regulation in Distribution Systems

Here, this paper proposes a distributed data-driven optimization framework for voltage regulation in distribution systems. The recursive kernel regression and alternating direction method of multipliers (ADMM) are selected to cover the system learning and distributed optimization tasks. The proposed distributed data-driven framework is capable of having a rapid response to system or load changes while considering the operation optimality. Besides, the distributed algorithm parallels the computation tasks and reduces the computational expense of a single agent. To validate the performance of the proposed method, a hypothetical 7-Bus system and the IEEE 123-Bus system are selected to show the effectiveness of the proposed data-driven framework. According to the numerical study results, the proposed method offers great flexibility for selecting customized kernel models for different regions and can effectively improve the system voltage profile in a distributed manner.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

Multi-Timescale Three-Phase Unbalanced Distribution System Operation With Variable Renewable Generations

This paper proposes a multi-timescale operational approach for a three-phase unbalanced distribution system, which contains hourly scheduling at substation level and minutes power flow operation at feeder level. In the substation scheduling model, the objective is to minimize the system cost with variable renewable generations. The given error distribution model of renewable generation is formulated as a chance constraint, and derived into a deterministic form by Gaussian mixture model (GMM) with genetic algorithm-based expectation-maximization (GAEM). In the feeder scheduling model, the system cost is further reduced with the optimal power flow (OPF) at a timescale of minutes. Considering the nonconvexity of the three-phase unbalanced OPF problem in distribution systems, the semidefinite programming (SDP) is used to relax the problem into a convex problem, and a distributed computation approach is built based on alternating direction method of multiplier (ADMM). The IEEE 123-bus distribution system, DU (University of Denver) campus distribution system, and the IEEE 8500-bus distribution system are used as the test bench for the proposed approach. And the numerical results demonstrate the effectiveness and validity of the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Chance-Constrained Energy Management System for Power Grids With High Proliferation of Renewables and Electric Vehicles

This paper proposes a two-stage energy management system (EMS) for power grids with massive integration of electric vehicles (EVs) and renewable energy resources. The first stage economic dispatch determines the optimal operating points of charging stations and battery swapping stations (BSS) for EVs under plug-in and battery swapping modes, respectively. The proposed stochastic model predictive control (SMPC) problem in this stage is characterized through a chance-constrained optimization formulation that can effectively capture the system and the forecast uncertainties. A distributed algorithm, the alternating direction method of multipliers (ADMM), is applied to accelerate the optimization computation through parallel computing. The second stage is aimed in coordinating the EV charging mechanisms to continuously follow the first-stage solutions, i.e., the target operating points, and meeting the EV customers' charging demands captured via the Advanced Metering Infrastructure (AMI). In this work, the proposed solution offers a holistic control strategy for large-scale centralized power grids in which the aggregated individual parameters are predictable and the system dynamics do not vary sharply within a short time-interval.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Decentralized Low-Rank State Estimation for Power Distribution Systems

This article considers the low-observability state estimation problem in power distribution networks and develops a decentralized state estimation algorithm leveraging the matrix completion methodology. Matrix completion has been shown to be an effective technique in state estimation that exploits the low dimensionality of the power system measurements to recover missing information. This technique can utilize an approximate (linear) load flow model, or it can be used with no physical models in a network where no information about the topology or line admittance is available. The direct application of matrix completion algorithms requires solving a semi-definite programming (SDP) problem, which becomes computationally challenging for large networks. We therefore develop a decentralized algorithm that capitalizes on the popular proximal alternating direction method of multipliers (proximal ADMM). The method allows us to distribute the computation among different areas of the network, leading to a scalable algorithm. By doing all computations at individual control areas and only communicating with neighboring areas, the algorithm eliminates the need for data to be sent to a central processing unit and thus increases efficiency and contributes to the goal of autonomous control of distribution networks. We illustrate the advantages of the proposed algorithm numerically using standard IEEE test cases.

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

Data-Driven Affinely Adjustable Robust Volt/VAr Control

Recent years have seen the increasing proliferation of distributed energy resources with intermittent power outputs, posing new challenges to the voltage management in distribution networks. To this end, this paper proposes a data-driven affinely adjustable robust Volt/VAr control (AARVVC) scheme, which modulates the smart inverter’s reactive power in an affine function of its active power, based on the voltage sensitivities with respect to real/reactive power injections. To achieve a fast and accurate estimation of voltage sensitivities, we propose a data-driven method based on deep neural network (DNN), together with a rule-based bus-selection process using the bidirectional search method. Our method only uses the operating statuses of selected buses as inputs to DNN, thus significantly improving the training efficiency and reducing information redundancy. Finally, a distributed consensus-based solution, based on the alternating direction method of multipliers (ADMM), for the AARVVC is applied to decide the inverter’s reactive power adjustment rule with respect to its active power. Only limited information exchange is required between each local agent and the central agent to obtain the slope of the reactive power adjustment rule, and there is no need for the central agent to solve any (sub)optimization problems. Finally, numerical results on the modified IEEE-123 bus system validate the effectiveness and superiority of the proposed data-driven AARVVC method.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Networked Microgrids Optimization

This project is mainly about the operation optimization of three networked microgrids (MG), including centralized optimization and distributed optimization. The alternating direction method of multipliers (ADMM) algorithm is used for distributed optimization. In the distribution network considered here, there is a Distribution Management system (DMS) as the system coordinator and several networked microgrids. In grid-connected mode, power could be imported or exported at the distribution substation bus according to the utility rate, and the exchanged power at point of common coupling (PCC) of any microgrid has a limitation. In islanded mode, the power imports/exports at the distribution substation are zero. In both grid-connected and islanded mode, the distribution substation is taken as a slack bus with fixed voltage magnitude.

Chen, Yang [Oak Ridge National Laboratory (ORNL), ↗
DOE OSTI2024

Security Constrained Distributed Transaction Model for Multiple Prosumers

Massive access of renewable energy has prompted demand-side distributed resources to participate in regulation and improve flexibility of power systems. With large-scale access of massive, decentralized, and diverse distributed resources, demand-side market members have transformed from traditional “consumers” to “prosumers”. To explore the distributed transaction model of prosumers, in this paper, a multi-prosumer distributed transaction model is proposed, and the Conditional Value-at-Risk (CVaR) theory is applied to quantify potential risks caused by the stochastic characteristics inherited from renewable energy. First, a prosumer model under constraints of the distribution network including photovoltaic units, fuel cells, energy storage system, central air conditioning and flexible loads is established, and a multi-prosumer distributed transaction strategy is proposed to achieve power sharing among multiple prosumers. Second, a prosumer transaction model based on CVaR is constructed to measure risks inherited from the uncertainty of PV output within the prosumer and ensure safety of system operation in extreme PV output scenarios. Then, the alternating direction multiplier method (ADMM) is utilized to solve the constructed model efficiently. Finally, distributed transaction costs of prosumers are distributed fairly based on the generalized Nash equilibrium to maximize social benefits. Simulation results show the multi-prosumer distributed transaction mechanism established under the proposed generalized Nash equilibrium method can encourage power sharing among prosumers, increasing their own income and social benefits. Also, the CVaR can assist decision making of prosumers in weighting the risks and benefits, improving system resilience through energy management of prosumers.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Decentralized Signal Processing and Distributed Control of Collaborative Autonomous Networks (17-ERD-101 LDRD Final Report)

Intelligent autonomous sensor networks, often comprised of large numbers of sensors, must be capable of jointly exploiting data collected at each agent in the network, and using that data to optimize their future actions towards multiple mission objectives. Centralized signal processing and optimization solutions process all data and determine all future actions at a single agent, and the resulting information and commands are disseminated back to the network. The communications bandwidth this requires and the single point of failure the central agent represents often make these solutions untenable for national security applications. In this project, several fundamental algorithms for solving both the decentralized signal processing and network optimization were developed, as well as simulation software to validate the results of these algorithms at scale. Specifically, novel algorithms for Bayesian decentralized estimation and decentralized detection and optimization based on the alternating direction method of multipliers (ADMM) were developed for autonomous sensor networks and published in the literature. The first large scale simulation of autonomous sensor networks (1000 agents) was conducted on this project, validating the performance of the developed algorithms. These algorithms and simulation tools are critical components of any decentralized autonomous network and have current and future national security applications, including distributed sensor networks for detection, estimation, and tracking problems, and large decentralized cyber-physical infrastructure such as the power grid.

42 ENGINEERING↗
DOE OSTI2021

Scalable Techniques for Stochastic Power Flow Problems (Final Report)

The proposed research focuses on developing scalable algorithms for two-stage security-constrained OPF problems with AC power flow constraints, a class of problems complicated by (i) scale arising from a scenario representation; and (ii) the presence of nonlinearity, nonconvexity, and possibly second-stage discreteness or complementarity. Unfortunately, most existing solvers cannot contend with both challenges simultaneously; accordingly, the proposed research focuses on developing solution techniques that can both scale with the number of scenarios and contend with nonconvexity and second-stage complementarity. We consider three avenues for addressing such problems: (i) Variable sample-size SQP (VS-SQP) methods that combine sparse Quasi-Newton updates with a scalable variance-reduced stochastic gradient scheme for stochastic QP subproblems, allowing for contending with second-stage complementarity via regularization; (ii) Variable sample-size stochastic Interior-point (VS-sIP) schemes that propose a sampling-based regularized (to allow for contending with complementarity) interior-point schemes in which a Schur-complement technique is employed for decomposing the Newton direction computation step; (iii) Variable sample-size tractable ADMM (VS-tADMM) schemes combine variable sample-sizes with carefully designed techniques for resolving each of the nonconvex updates (by leveraging the QCQP structures). We intend to compare the three schemes using performance profiles in terms of solution quality, scalability, etc. and then select one scheme which will then be developed and further refined in Python for purposes of the GO competition.

42 ENGINEERING↗
DOE OSTI2023

Binary Control Pulse Optimization for Quantum Systems

Quantum control aims to manipulate quantum systems toward specific quantum states or desired operations. Designing highly accurate and effective control steps is vitally important to various quantum applications, including energy minimization and circuit compilation. In this paper we focus on discrete binary quantum control problems and apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Specifically, we develop a generic model and extend it in several ways. We introduce a squared L 2 -penalty function to handle additional side constraints, to model requirements such as allowing at most one control to be active. We introduce a total variation (TV) regularizer to reduce the number of switches in the control. We modify the popular gradient ascent pulse engineering (GRAPE) algorithm, develop a new alternating direction method of multipliers (ADMM) algorithm to solve the continuous relaxation of the penalized model, and then apply rounding techniques to obtain binary control solutions. We propose a modified trust-region method to further improve the solutions. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

An MILP-Based Distributed Energy Management for Coordination of Networked Microgrids

An MILP-based distributed energy management for the coordination of networked microgrids is proposed in this paper. Multiple microgrids and the utility grid are coordinated through iteratively adjusted price signals. Based on the price signals received, the microgrid controllers (MCs) and distribution management system (DMS) update their schedules separately. Then, the price signals are updated according to the generation–load mismatch and distributed to MCs and DMS for the next iteration. The iteration continues until the generation–load mismatch is small enough, i.e., the generation and load are balanced under agreed price signals. Through the proposed distributed energy management, various microgrids and the utility grid with different economic, resilient, emission and socio-economic objectives are coordinated with generation–load balance guaranteed and the microgrid customers’ privacy preserved. In particular, a piecewise linearization technique is employed to approximate the augmented Lagrange term in the alternating direction method of multipliers (ADMM) algorithm. Thus, the subproblems are transformed into mixed integer linear programming (MILP) problems and efficiently solved by open-source MILP solvers, which would accelerate the adoption and deployment of microgrids and promote clean energy. The proposed MILP-based distributed energy management is demonstrated through various case studies on a networked microgrids test system with three microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2017

Efficient convolutional sparse coding

Computationally efficient algorithms may be applied for fast dictionary learning solving the convolutional sparse coding problem in the Fourier domain. More specifically, efficient convolutional sparse coding may be derived within an alternating direction method of multipliers (ADMM) framework that utilizes fast Fourier transforms (FFT) to solve the main linear system in the frequency domain. Such algorithms may enable a significant reduction in computational cost over conventional approaches by implementing a linear solver for the most critical and computationally expensive component of the conventional iterative algorithm. The theoretical computational cost of the algorithm may be reduced from O(M.sup.3N) to O(MN log N), where N is the dimensionality of the data and M is the number of elements in the dictionary. This significant improvement in efficiency may greatly increase the range of problems that can practically be addressed via convolutional sparse representations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Grid-Interactive Electric Vehicle and Building Coordination Using Coupled Distributed Control: Preprint

As an increasing number of controllable devices are introduced onto the grid, they can individually provide ancillary services in support of grid stability. However, the goals of each device differ due to their type and individual objectives, causing instances where they may conflict. To reduce the chances of these devices contributing to grid instability, these devices must effectively communicate in a cooperative manner to both meet their own needs while providing services to the grid. Previous work demonstrates that the NALD (Network Lasso-ADMM - Limited Communication - DMPC) algorithm allows coordination between two subsystems that use different control algorithms (building and charging stations) to provide services to the grid and individually optimize their performance in a specific scenario. The ideal NALD algorithm should be generalized to allow plug-and-play capabilities across devices of differing characteristics. This paper takes a step toward generalizability by updating the electric vehicle charging objective and re-defining the communication scheme compared to prior work to generalize the coordination and, as a result, improve the performance of the NALD algorithm.

ADVANCED PROPULSION SYSTEMS,ENERGY CONSERVATION, C↗
DOE OSTI2024

Solving the Grid Optimization Competition Challenge 3 Problem

The Grid Optimization Competition Challenge 3 Problem posed a multiperiod security-constrained unit commitment problem with base-case AC power flow. The problem formulation includes binary unit commitment decisions, nonlinear AC power flow and balance, dispatchable loads, and linearized contingency real power flow, among other features. This talk will present a modified consensus ADMM algorithm, which splits the problem into mixed-integer linear and nonlinear components, as a heuristic solution method for this large-scale mixed integer nonlinear program. We will present some computational results from the competition for our implementation and reflect on the challenges of participating the grid optimization competition.

AC power flow↗
DOE OSTI2016

Beyond union of subspaces: Subspace pursuit on Grassmann manifold for data representation

Discovering the underlying structure of a high-dimensional signal or big data has always been a challenging topic, and has become harder to tackle especially when the observations are exposed to arbitrary sparse perturbations. Here in this paper, built on the model of a union of subspaces (UoS) with sparse outliers and inspired by a basis pursuit strategy, we exploit the fundamental structure of a Grassmann manifold, and propose a new technique of pursuing the subspaces systematically by solving a non-convex optimization problem using the alternating direction method of multipliers. This problem as noted is further complicated by non-convex constraints on the Grassmann manifold, as well as the bilinearity in the penalty caused by the subspace bases and coefficients. Nevertheless, numerical experiments verify that the proposed algorithm, which provides elegant solutions to the sub-problems in each step, is able to de-couple the subspaces and pursue each of them under time-efficient parallel computation.

97 MATHEMATICS AND COMPUTING↗