Bipartite graph-based community-to-community matching in local energy market considering socially networked prosumers

Abstract

The mutual influences among different energy prosumers caused by the socially connected relationship have not been modeled explicitly in the current local energy market. Hence, we first develop an iterative market clearing framework to bridge the data-driven and model-driven models of heterogeneous market participants. Then, we consider the behavior difficulty, communication channel, depth of information process, social influence, and observed peer effects in the multi-agent deep reinforcement learning (MADRL) framework in the data-driven models. Finally, we calculate the marginal market value of each C2C energy transaction with a linearized distribution network power flow model and formulate the C2C matching as a bipartite graph. We propose a recurrent Hungarian algorithm to solve the best matching schemes of C2C trading. Case studies verify that the distribution network power flow model considered in C2C energy trading successfully constrain the unit values of nodal voltages between 0.9 and 1.1. The power flow values in distribution network are constrained within the upper limits of transmission capacity for each branch. The finite iteration number of MADRL in hybrid market-clearing algorithm guarantees the normal P2P energy market operation. Moreover, the social influences for the P2P energy trading results are verified by comparing P2P trading results in different scenarios. Our proposed model can better depict the trading behaviors in communities.