Safe Reinforcement Learning for Strategic Bidding of Virtual Power Plants in Day-Ahead Markets
원문 초록
This paper presents a novel safe reinforcement learning algorithm for strategic bidding of Virtual Power Plants (VPPs) in day-ahead electricity markets. The proposed algorithm utilizes the Deep Deterministic Policy Gradient (DDPG) method to learn competitive bidding policies without requiring an accurate market model. Furthermore, to account for the complex internal physical constraints of VPPs we introduce two enhancements to the DDPG method. Firstly, a projection-based safety shield that restricts the agent's actions to the feasible space defined by the non-linear power flow equations and operating constraints of distributed energy resources is derived. Secondly, a penalty for the shield activation in the reward function that incentivizes the agent to learn a safer policy is introduced. A case study based on the IEEE 13-bus network demonstrates the effectiveness of the proposed approach in enabling the agent to learn a highly competitive, safe strategic policy.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Reinforcement Learning from Human Feedback with High-Confidence Safety Constraints
Safe Multi-Agent Navigation guided by Goal-Conditioned Safe Reinforcement Learning
Risk-Averse Reinforcement Learning: An Optimal Transport Perspective on Temporal Difference Learning
Constraint-Adaptive Policy Switching for Offline Safe Reinforcement Learning
Offline Safe Reinforcement Learning Using Trajectory Classification
Tilted Quantile Gradient Updates for Quantile-Constrained Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.