A Network-Constrained Demand Response Game for Procuring Energy Balancing Services
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914910519164928 |
|---|---|
| author | Chen, Xiupeng Shomalzadeh, Koorosh Scherpen, Jacquelien M. A. Monshizadeh, Nima |
| author_facet | Chen, Xiupeng Shomalzadeh, Koorosh Scherpen, Jacquelien M. A. Monshizadeh, Nima |
| contents | Securely and efficiently procuring energy balancing services in distribution networks remains challenging, especially within a privacy-preserving environment. This paper proposes a network-constrained demand response game, i.e., a Generalized Nash Game (GNG), to incentivize energy consumers to offer balancing services. Specifically, we adopt a supply function-based bidding method for our demand response problem, where a requisite load adjustment must be met. To ensure the secure operation of distribution networks, we incorporate physical network constraints, including line capacity and bus voltage limits, into the game formulation. In addition, we analytically evaluate the efficiency loss of this game. Previous approaches to steer energy consumers toward the Generalized Nash Equilibrium (GNE) of the game often necessitated sharing some private information, which might not be practically feasible or desired. To overcome this limitation, we propose a decentralized market clearing algorithm with analytical convergence guarantees, which only requires the participants to share limited, non-sensitive information with others. Numerical analyses illustrate that the proposed market mechanism exhibits a low market efficiency loss. Moreover, these analyses highlight the critical role of integrating physical network constraints. Finally, we demonstrate the scalability of our proposed algorithm by conducting simulations on the IEEE 33-bus and 69-bus test systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_17475 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A Network-Constrained Demand Response Game for Procuring Energy Balancing Services Chen, Xiupeng Shomalzadeh, Koorosh Scherpen, Jacquelien M. A. Monshizadeh, Nima Systems and Control Optimization and Control Securely and efficiently procuring energy balancing services in distribution networks remains challenging, especially within a privacy-preserving environment. This paper proposes a network-constrained demand response game, i.e., a Generalized Nash Game (GNG), to incentivize energy consumers to offer balancing services. Specifically, we adopt a supply function-based bidding method for our demand response problem, where a requisite load adjustment must be met. To ensure the secure operation of distribution networks, we incorporate physical network constraints, including line capacity and bus voltage limits, into the game formulation. In addition, we analytically evaluate the efficiency loss of this game. Previous approaches to steer energy consumers toward the Generalized Nash Equilibrium (GNE) of the game often necessitated sharing some private information, which might not be practically feasible or desired. To overcome this limitation, we propose a decentralized market clearing algorithm with analytical convergence guarantees, which only requires the participants to share limited, non-sensitive information with others. Numerical analyses illustrate that the proposed market mechanism exhibits a low market efficiency loss. Moreover, these analyses highlight the critical role of integrating physical network constraints. Finally, we demonstrate the scalability of our proposed algorithm by conducting simulations on the IEEE 33-bus and 69-bus test systems. |
| title | A Network-Constrained Demand Response Game for Procuring Energy Balancing Services |
| topic | Systems and Control Optimization and Control |
| url | https://arxiv.org/abs/2306.17475 |