A Resource Allocation Strategy for Virtual Power Plants Based on URLLC to Minimize Control Costs

With the swift growth of renewable energy and the evolution of smart grid technologies, the concept of the Virtual Power Plant (VPP) has risen as a pioneering strategy for energy management, marking a pivotal area of study within power system research. Nonetheless, the effectiveness of VPPs hinges on the implementation of Ultra-Reliable and Low-Latency Communications (URLLC). In VPP operations, communication lags or data packet losses can result in the delayed or failed execution of control instructions, impacting both the stability of the electrical grid and the efficacy of energy management. Against this backdrop, this paper aims to bolster the control capabilities of VPPs by integrating control demands with URLLC constraints. We have crafted an optimization problem designed to reduce control expenditures in VPP operations through strategic distribution of potential data packet losses and wireless resources, all the while guaranteeing the stability of the power grid and the productivity of energy transactions. To tackle this issue, we have developed a Greedy Choice-Local Search Strategy algorithm (GC-LSS) that seeks to achieve the lowest possible control costs within the bounds of communication constraints. The simulation outcomes align with the expected parameter variations, and our proposed method demonstrates superior performance compared to random allocation methods.

Authors

Institutions

Publication Details

Published
2025-03-14
DOI
https://doi.org/10.1109/itoec63606.2025.10967917
Primary Topic
Smart Grid Energy Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Resource Allocation Strategy for Virtual Power Plants Based on URLLC to Minimize Control Costs

Diqing Zhou, Yilong Chen, Yingfei Wang, Shuaihong Jiang et al.
Smart Grid Energy Management
article

A Resource Allocation Strategy for Virtual Power Plants Based on URLLC to Minimize Control Costs

Diqing Zhou, Yilong Chen, Yingfei Wang, Shuaihong Jiang, Zhong Gan
article en

Abstract

With the swift growth of renewable energy and the evolution of smart grid technologies, the concept of the Virtual Power Plant (VPP) has risen as a pioneering strategy for energy management, marking a pivotal area of study within power system research. Nonetheless, the effectiveness of VPPs hinges on the implementation of Ultra-Reliable and Low-Latency Communications (URLLC). In VPP operations, communication lags or data packet losses can result in the delayed or failed execution of control instructions, impacting both the stability of the electrical grid and the efficacy of energy management. Against this backdrop, this paper aims to bolster the control capabilities of VPPs by integrating control demands with URLLC constraints. We have crafted an optimization problem designed to reduce control expenditures in VPP operations through strategic distribution of potential data packet losses and wireless resources, all the while guaranteeing the stability of the power grid and the productivity of energy transactions. To tackle this issue, we have developed a Greedy Choice-Local Search Strategy algorithm (GC-LSS) that seeks to achieve the lowest possible control costs within the bounds of communication constraints. The simulation outcomes align with the expected parameter variations, and our proposed method demonstrates superior performance compared to random allocation methods.

NARI Group (China) (CN), Shanghai Electric (China) (CN)
Openalex Percentile: Top 93%
Smart Grid Energy Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.