Asynchronous Implementation of a Region-Based Distributed Optimal Power Flow Algorithm

The scalability potential of distributed algorithms justifies the growing interest for decentralized optimal power flow (OPF) algorithms. However, the need for communication can significantly slow down the convergence of these algorithms when considering various communication hazards. To overcome this issue, an asynchronous framework is proposed where decentralized agents only wait for a fraction of the overall messages. Simulations considering communication and computation delays will highlight the speedup and robustness of the asynchronous version of the algorithm in the case of message losses.