Scheduling Domestic Shiftable Loads in Smart Grids: A Learning Automata-Based Scheme

In this paper, we consider the problem of scheduling shiftable loads, overmultiple users, in smart grids. We approach the problem, which is becoming increasingly pertinent in our present energy-thirsty society, using a novel distributed game-theoretic framework. From a modeling perspective, the distributed scheduling problem is formulated as a game, and in particular, a so-called "Potential" game. This game has at least one pure strategy Nash Equilibrium (NE), and we demonstrate that the NE point is a global optimal point. The solution that we propose, which is the pioneering solution that incorporates the theory of Learning Automata (LA), permits the total supplied loads to approach the power budget of the subnet once the algorithm has converged to the NE point. The scheduling is achieved by attaching a LA to each customer. The paper discusses the applicability of three different LA schemes, and in particular the recently-introduced Bayesian Learning Automata (BLA). Numerical results (The algorithmic details and the experimental results presented here are limited in the interest of space. More detailed explanations of these are found in [13]), obtained from testing the schemes on numerous simulated datasets, demonstrate the speed and the accuracy of proposed algorithms in terms of their convergence to the game's NE point.