Modeling competition of virtual power plants via deep learning

Traditionally, models pooling flexible demand and generation units into Virtual Power Plants have been solved via separated approaches, decomposing the problem into parts dedicated to market clearing and separate parts dedicated to managing the state-constraints. The reason for this is the high computational complexity of solving dynamic, i.e. multi-stage, problems under competition. Such approaches have the downside of not adequately modeling the direct competition between these agents over the entire considered time period. This paper approximates the decisions of the players via ‘actor networks’ and the assumptions on future realizations of the uncertainties as ‘critic networks’, approaching the tractability issues of multi-period optimization and market clearing at the same time. Mathematical proof of this solution converging to a Nash equilibrium is provided and supported by case studies on the IEEE 30 and 118 bus systems. Utilizing this approach, the framework is able to cope with high uncertainty spaces extending beyond traditional approximations such as scenario trees. In addition, the paper suggests various possibilities of parallelization of the framework in order to increase computational efficiency. Applying this process allows for parallel solution of all time periods and training the approximations in parallel, a problem previously only solved in succession.