Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems

By Peng Yi, Yiguang Hong, Feng Liu. at - Automatisierungstechnik, 2015

464 citations recorded by the source corpus.

Abstract In this paper, the distributed resource allocation optimization problem is investigated. The allocation decisions are made to minimize the sum of all the agents’ local objective functions while satisfying both the global network resource constraint and the local allocation feasibility constraints. Here the data corresponding to each agent in this separable optimization problem, such as the network resources, the local allocation feasibility constraint, and the local objective function, is only accessible to individual agent and cannot be shared with others, which renders new challenges in this distributed optimization problem. Based on either projection or differentiated projection, two classes of continuous-time algorithms are proposed to solve this distributed optimization problem in an initialization-free and scalable manner. Thus, no re-initialization is required even if the operation environment or network configuration is changed, making it possible to achieve a “plug-and-play” optimal operation of networked heterogeneous agents. The algorithm convergence is guaranteed for strictly convex objective functions, and the exponential convergence is proved for strongly convex functions without local constraints. Then the proposed algorithm is applied to the distributed economic dispatch problem in power grids, to demonstrate how it can achieve the global optimum in a scalable way, even when the generation cost, or system load, or network configuration, is changing.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/4953a41fbbe42de0c4b75e9b6fc002715b525bd4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Ziyang Meng
2. Zongli Lin
3. Xinlei Yi
4. Shu Liang
5. Tao Yang
6. Peng Yi
7. Karl Henrik Johansson
8. Yiguang Hong

In Electrical and Electronic Engineering

1. Peng Yi
2. Karl Henrik Johansson
3. Ziyang Meng
4. Yiguang Hong
5. Zongli Lin

Citations in the corpus

• Distributed Nash equilibrium seeking for aggregative games with coupled constraints (2016, background): “Although some projected dynamics without any perturbation was studied, e.g., in (Yi et al. 2016), the analysis for the perturbed one is novel.”
• A survey of distributed optimization (2019, background): “…(2017) ; Margellos, Falsone, Garatti, and Prandini (2018) ; Nedi ´c, Olshevsky, and Shi (2018) and continuous-time algorithms are presented in Cherukuri and Cortés (2015, 2016) ; Deng, Liang, and Yu (2018) ; Liang, Zeng, and Hong (2018) ; Yi, Hong, and Liu (2016) and Deng, Liang, and Hong (2018) .”