Multi-Agent Reinforcement Learning with Graph Convolutional Neural
Networks for optimal Bidding Strategies of Generation Units in Electricity
Markets
- URL: http://arxiv.org/abs/2208.06242v1
- Date: Thu, 11 Aug 2022 09:29:31 GMT
- Title: Multi-Agent Reinforcement Learning with Graph Convolutional Neural
Networks for optimal Bidding Strategies of Generation Units in Electricity
Markets
- Authors: Pegah Rokhforoz, Olga Fink
- Abstract summary: This paper proposes a distributed learning algorithm based on deep reinforcement learning (DRL) and a graph convolutional neural network (GCN)
The state and connection between nodes are the inputs of the GCN, which can make agents aware of the structure of the system.
We evaluate the proposed algorithm on the IEEE 30-bus system under different scenarios.
- Score: 1.370633147306388
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Finding optimal bidding strategies for generation units in electricity
markets would result in higher profit. However, it is a challenging problem due
to the system uncertainty which is due to the unknown other generation units'
strategies. Distributed optimization, where each entity or agent decides on its
bid individually, has become state of the art. However, it cannot overcome the
challenges of system uncertainties. Deep reinforcement learning is a promising
approach to learn the optimal strategy in uncertain environments. Nevertheless,
it is not able to integrate the information on the spatial system topology in
the learning process. This paper proposes a distributed learning algorithm
based on deep reinforcement learning (DRL) combined with a graph convolutional
neural network (GCN). In fact, the proposed framework helps the agents to
update their decisions by getting feedback from the environment so that it can
overcome the challenges of the uncertainties. In this proposed algorithm, the
state and connection between nodes are the inputs of the GCN, which can make
agents aware of the structure of the system. This information on the system
topology helps the agents to improve their bidding strategies and increase the
profit. We evaluate the proposed algorithm on the IEEE 30-bus system under
different scenarios. Also, to investigate the generalization ability of the
proposed approach, we test the trained model on IEEE 39-bus system. The results
show that the proposed algorithm has more generalization abilities compare to
the DRL and can result in higher profit when changing the topology of the
system.
Related papers
- Assessing and Enhancing Graph Neural Networks for Combinatorial Optimization: Novel Approaches and Application in Maximum Independent Set Problems [0.0]
Graph Neural Networks (GNNs) show promise for researchers in solving Combinatorial optimization (CO) problems.
This study investigates the effectiveness of GNNs in solving the maximum independent set (MIS) problem.
arXiv Detail & Related papers (2024-11-06T09:12:31Z) - Intelligent Hybrid Resource Allocation in MEC-assisted RAN Slicing Network [72.2456220035229]
We aim to maximize the SSR for heterogeneous service demands in the cooperative MEC-assisted RAN slicing system.
We propose a recurrent graph reinforcement learning (RGRL) algorithm to intelligently learn the optimal hybrid RA policy.
arXiv Detail & Related papers (2024-05-02T01:36:13Z) - Decentralized Learning Strategies for Estimation Error Minimization with Graph Neural Networks [94.2860766709971]
We address the challenge of sampling and remote estimation for autoregressive Markovian processes in a wireless network with statistically-identical agents.
Our goal is to minimize time-average estimation error and/or age of information with decentralized scalable sampling and transmission policies.
arXiv Detail & Related papers (2024-04-04T06:24:11Z) - Online Network Source Optimization with Graph-Kernel MAB [62.6067511147939]
We propose Grab-UCB, a graph- kernel multi-arms bandit algorithm to learn online the optimal source placement in large scale networks.
We describe the network processes with an adaptive graph dictionary model, which typically leads to sparse spectral representations.
We derive the performance guarantees that depend on network parameters, which further influence the learning curve of the sequential decision strategy.
arXiv Detail & Related papers (2023-07-07T15:03:42Z) - A Comparative Analysis of Bias Amplification in Graph Neural Network
Approaches for Recommender Systems [0.0]
The bias amplification issue needs to be investigated while using these algorithms.
In this paper, we aim to comprehensively study this problem through a literature review and an analysis of the behavior against biases of different GNN-based algorithms.
arXiv Detail & Related papers (2023-01-18T16:29:05Z) - Dynamic Network Reconfiguration for Entropy Maximization using Deep
Reinforcement Learning [3.012947865628207]
Key problem in network theory is how to reconfigure a graph in order to optimize a quantifiable objective.
In this paper, we cast the problem of network rewiring for optimizing a specified structural property as a Markov Decision Process (MDP)
We then propose a general approach based on the Deep Q-Network (DQN) algorithm and graph neural networks (GNNs) that can efficiently learn strategies for rewiring networks.
arXiv Detail & Related papers (2022-05-26T18:44:22Z) - Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions.
For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions.
The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
arXiv Detail & Related papers (2022-05-13T21:09:41Z) - Decentralized Statistical Inference with Unrolled Graph Neural Networks [26.025935320024665]
We propose a learning-based framework, which unrolls decentralized optimization algorithms into graph neural networks (GNNs)
By minimizing the recovery error via end-to-end training, this learning-based framework resolves the model mismatch issue.
Our convergence analysis reveals that the learned model parameters may accelerate the convergence and reduce the recovery error to a large extent.
arXiv Detail & Related papers (2021-04-04T07:52:34Z) - Resource Allocation via Model-Free Deep Learning in Free Space Optical
Communications [119.81868223344173]
The paper investigates the general problem of resource allocation for mitigating channel fading effects in Free Space Optical (FSO) communications.
Under this framework, we propose two algorithms that solve FSO resource allocation problems.
arXiv Detail & Related papers (2020-07-27T17:38:51Z) - Resource Allocation via Graph Neural Networks in Free Space Optical
Fronthaul Networks [119.81868223344173]
This paper investigates the optimal resource allocation in free space optical (FSO) fronthaul networks.
We consider the graph neural network (GNN) for the policy parameterization to exploit the FSO network structure.
The primal-dual learning algorithm is developed to train the GNN in a model-free manner, where the knowledge of system models is not required.
arXiv Detail & Related papers (2020-06-26T14:20:48Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.