학술논문

Comparison of pursuit and ε-Greedy algorithm for load scheduling under real time pricing
Document Type
Conference
Source
2012 IEEE International Conference on Power and Energy (PECon) Power and Energy (PECon), 2012 IEEE International Conference on. :515-519 Dec, 2012
Subject
Components, Circuits, Devices and Systems
Power, Energy and Industry Applications
Pursuit algorithms
Electricity
Switches
Conferences
Greedy algorithms
Pricing
Schedules
Reinforcement Learning
Demand Response
Pursuit Algorithm
Smart Grid
Real Time Pricing
Language
Abstract
Demand Response (DR) is a useful tool to develop a balance between the available generation and loads under smart grid environment. There are various price based schemes to implement DR and flatten the load profile. Hence, for the benefit of customers, proper load scheduling is required to lower the usage of electricity during peak load periods in order to decrease the electricity cost. This work formulates load scheduling as multi stage decision making problem or Markov Decision Problem (MDP). Reinforcement learning (RL) has been used to solve many decision making problems under stochastic environment. ε-Greedy algorithm is the most popular exploration method used in RL. In this paper, pursuit algorithm is developed to achieve a balance between exploration and exploitation process of the RL. The performance of both the algorithms is compared which shows the supremacy of Pursuit Algorithm over ε-greedy algorithm.