A distributed algorithm based on relaxed ADMM for energy resources coordination

Distributed optimization algorithms contribute to an insight for the optimal coordination of distributed energy resources (DERs). To tackle the DER coordination problem, this paper studies a composite constrained optimization problem over multi-agent networks, where all agents independently maintain convex objective functions while satisfying the local and coupled constraints. Within the Peaceman-Rachford splitting (PRS) framework, a distributed algorithm based on the relaxed ADMM method is proposed for the considered problem, where agents in the network commonly share a fixed step-size instead of the diminishing one. Finally, the simulations on the optimal coordination of DERs including distributed generators (DGs) and energy storages (ESs) are conducted to validate the effectiveness of the proposed algorithm.

Automated summary

Distributed optimization algorithms are crucial for optimal coordination of distributed energy resources. This paper proposes a distributed algorithm based on the relaxed ADMM method to tackle the DER coordination problem, showing effectiveness through simulations on DER coordination.