Open Access Repository

Asynchronous consensus for optimal power flow control in smart grid with zero power mismatch


Downloads per month over past year

Millar, BS ORCID: 0000-0001-9119-0281 and Jiang, D ORCID: 0000-0002-7738-0078 2018 , 'Asynchronous consensus for optimal power flow control in smart grid with zero power mismatch' , Journal of Modern Power Systems and Clean Energy, vol. 6, no. 3 , pp. 412-422 , doi: 10.1007/s40565-018-0378-4.

124863 - Asynch...pdf | Download (1MB)

| Preview


The heterogeneous nature of smart grid components and the desire for smart grids to be scalable, stable and respect customer privacy have led to the need for more distributed control paradigms. In this paper we provide a distributed optimal power flow solution for a smart distribution network with separable global costs, separable non-convex constraints, and inseparable linear constraints, while considering important aspects of network operation such as distributed generation and load mismatch, and nodal voltage constraints. An asynchronous averaging consensus protocol is developed to estimate the values of inseparable global information. The consensus protocol is then combined with a fully distributed primal dual optimization utilizing an augmented Lagrange function to ensure convergence to a feasible solution with respect to power flow and power mismatch constraints. The presented algorithm uses only local and neighbourhood communication to simultaneously find the mismatch between power generation, line loss and loads, to calculate nodal voltages, and to minimize distributed costs, leading to a completely distributed solution of the global problem. An IEEE test feeder system with a reasonable number of nodes is used to illustrate the proposed method and efficiency.

Item Type: Article
Authors/Creators:Millar, BS and Jiang, D
Keywords: consensus protocol, cooperative system, distributed algorithm, distributed control, optimization, smart grid
Journal or Publication Title: Journal of Modern Power Systems and Clean Energy
Publisher: Springer Berlin Heidelberg
ISSN: 2196-5625
DOI / ID Number: 10.1007/s40565-018-0378-4
Copyright Information:

Copyright The Author(s) 2018. Licensed under Creative Commons Attribution 4.0 International (

Related URLs:
Item Statistics: View statistics for this item

Actions (login required)

Item Control Page Item Control Page