Demand-Side Management (DSM) systems represent an efficient method to improve the performance of Smart Grid infrastructures by controlling users' power loads. In this paper, we focus our analysis on fully distributed DSM systems especially designed to reduce the peak demand of groups of residential users. In our proposed scheme, each appliance decides autonomously its scheduling using only limited information on the energy price fixed by the retailer, thus greatly reducing the system complexity as well as the need of information exchanges. We develop two schedule-selection policies based on the Proportional Imitation Rule, where at each iteration all appliances switch to a new schedule with a probability proportional to the cost difference between the actual and cheapest schedules of the previous iteration. We analyze the proposed learning methods based on realistic instances in several use-case scenarios, and show their effectiveness in terms of cost reductions (both local and system-wide) as well as convergence speed to stable and efficient system equilibria.

(2015). Distributed Demand-Side Management in Smart Grid: how Imitation improves Power Scheduling . Retrieved from http://hdl.handle.net/10446/106054

Distributed Demand-Side Management in Smart Grid: how Imitation improves Power Scheduling

Barbato, Antimo;Martignon, Fabio;
2015-01-01

Abstract

Demand-Side Management (DSM) systems represent an efficient method to improve the performance of Smart Grid infrastructures by controlling users' power loads. In this paper, we focus our analysis on fully distributed DSM systems especially designed to reduce the peak demand of groups of residential users. In our proposed scheme, each appliance decides autonomously its scheduling using only limited information on the energy price fixed by the retailer, thus greatly reducing the system complexity as well as the need of information exchanges. We develop two schedule-selection policies based on the Proportional Imitation Rule, where at each iteration all appliances switch to a new schedule with a probability proportional to the cost difference between the actual and cheapest schedules of the previous iteration. We analyze the proposed learning methods based on realistic instances in several use-case scenarios, and show their effectiveness in terms of cost reductions (both local and system-wide) as well as convergence speed to stable and efficient system equilibria.
2015
Barbato, Antimo; Capone, Antonio; Chen, Lin; Martignon, Fabio; Paris, Stefano
File allegato/i alla scheda:
File Dimensione del file Formato  
Paper_ICC2015.pdf

Solo gestori di archivio

Versione: postprint - versione referata/accettata senza referaggio
Licenza: Licenza default Aisberg
Dimensione del file 329.63 kB
Formato Adobe PDF
329.63 kB Adobe PDF   Visualizza/Apri
Pubblicazioni consigliate

Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10446/106054
Citazioni
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 1
social impact