A privacy-preserving distributed computational approach for distributed locational marginal prices
arXiv:2103.14094
Abstract
An important issue in today's electricity markets is the management of flexibilities offered by new practices, such as smart home appliances or electric vehicles. By inducing changes in the behavior of residential electric utilities, demand response (DR) seeks to adjust the demand of power to the supply for increased grid stability and better integration of renewable energies. A key role in DR is played by emergent independent entities called load aggregators (LAs). We develop a new decentralized algorithm to solve a convex relaxation of the classical Alternative Current Optimal Power Flow (ACOPF) problem, which relies on local information only. Each computational step can be performed in an entirely privacy-preserving manner, and system-wide coordination is achieved via node-specific distribution locational marginal prices (DLMPs). We demonstrate the efficiency of our approach on a 15-bus radial distribution network.
8 pages, 3 figures; submitted for publication
References in corpus (5)
- Distributed Optimal Power Flow Algorithm for Balanced Radial Distribution Networks
- Towards Distributed OPF using ALADIN
- Block-coordinate primal-dual method for the nonsmooth minimization over linear constraints
- The primal-dual hybrid gradient method reduces to a primal method for linearly constrained optimization problems
- DLMP-based Coordination Procedure for Decentralized Demand Response under Distribution Network Constraints