Optimal Bi-Level Bidding and Dispatching Strategy Between Active Distribution Network and Virtual Alliances Using Distributed Robust Multi-Agent Deep Reinforcement Learning

Abstract

The deregulated active distribution network (ADN) would incorporate numerous autonomous stakeholders, including some emerging distributed virtual alliances (DVAs) like virtual microgrids and virtual power plants. Those DVAs would autonomously participate in energy market trading through bidding among themselves and dispatching conducted by the ADN. In this paper, the optimal bidding and dispatching model for DVAs and ADN in the day-ahead market is first developed as a stochastic dynamic programming model with the risk of misconduct considered, and then re-formulated as a Markov Decision Process to be solved by a new Distributed Robust Multi-Agent Deep Deterministic Policy Gradient algorithm based on the concept of robust Nash equilibrium (RNE). This algorithm is a fully distributed online optimization that would converge to RNE. It is an effective risk-averse method to obtain the optimal bidding strategies of DVAs and the optimal dispatching decisions of distribution system operator (DSO). Its high computational performance is demonstrated in the case studies, and the strategic decisions of DVAs and DSO are thoroughly analyzed.