A Cloud-Edge-End Collaboration Framework for Fixed-Time Distributed Optimization of Virtual Power Plants

Kai Kang, Nian Shi, Keqi Zhang, Si Cai, Liang Zhang, Xueming Shao, Lei Shu, Renjie Hu, Leimin WangMathematics 2025 · DOI

TL;DR

This paper introduces a novel cloud-edge-end collaborative framework for optimizing Virtual Power Plants (VPPs). It proposes a distributed fixed-time consensus algorithm that guarantees convergence within a predetermined timeframe, addressing limitations of previous methods that lacked predictable convergence and struggled with computational efficiency and privacy in complex power grids.

What Problem Does This Paper Address?

The increasing integration of renewable energy sources into power grids introduces significant volatility and uncertainty. Virtual Power Plants (VPPs) are a key strategy to manage these challenges by aggregating distributed energy resources. However, optimizing VPP operations, particularly for economic dispatch, faces two major hurdles:

  1. Computational Efficiency and Scalability: Traditional centralized approaches become bottlenecks as the number of distributed resources grows, leading to slow computation and high communication costs. While distributed methods offer better privacy and scalability, they can still struggle with computational efficiency in complex network topologies.
  2. Predictable and Fast Convergence: Existing optimization algorithms often exhibit asymptotic convergence, meaning they approach the optimal solution but never quite reach it, or their convergence time is dependent on initial conditions, making it unpredictable. This is problematic for real-time grid operations where timely decisions are crucial. Furthermore, many methods don't guarantee convergence within a fixed, pre-determined time.

This paper aims to bridge this gap by proposing a framework that enhances computational speed and a distributed algorithm that ensures fixed-time convergence, all while preserving data privacy.

Methods

The core of this paper lies in two main contributions:

  1. Cloud-Edge-End Collaboration Framework: This hierarchical framework divides the power grid into multiple regions, each managed by an edge server. These edge servers are connected to a central cloud server.
  2. Cloud Tier: Handles high-level tasks like demand forecasting and inter-zone structural analysis to derive optimal generation quotas.
  3. Edge Tier: Each edge server manages a region, coordinating local distributed autonomous entities (generators, storage, loads) using agent-based modeling. This allows for parallel computation of distributed optimization algorithms across different regions.
  4. End Tier: Represents the individual agents (e.g., generators, storage units) within each region that communicate with their neighbors.
  5. Distributed Fixed-Time Optimization Consensus Algorithm: This algorithm is designed for VPPs to solve the economic dispatch problem.
  6. Fixed-Time Convergence: Unlike asymptotic or finite-time methods, this algorithm guarantees that the system state converges to the optimal solution within a specific, pre-determined time, regardless of the initial state. This is achieved through novel Lyapunov function analysis and specific control gains.
  7. Handling Constraints: The algorithm is designed to handle both equality (e.g., power balance) and inequality (e.g., generation limits) constraints, making it more practical for real-world VPP operations.
  8. Privacy Preservation: By only requiring local gradient exchanges between neighboring agents at the edge level and aggregated regional information at the cloud level, the framework significantly enhances data privacy compared to centralized approaches.

Datasets

Not discussed in the paper. The simulations utilize parameters obtained from existing literature ([24, 25, 29]) for a three-area system.

Key Insights and Ideas

  • Hierarchical Optimization for Scalability: The cloud-edge-end architecture is a powerful paradigm for tackling large-scale distributed optimization problems. By distributing computation and leveraging parallel processing at the edge, it significantly boosts efficiency.
  • Fixed-Time Convergence is Crucial for Real-Time Grids: The ability to guarantee convergence within a predictable, pre-set time is a critical advancement for applications like VPP economic dispatch, where rapid and reliable decision-making is paramount.
  • Balancing Efficiency and Privacy: The proposed framework effectively addresses the trade-off between computational efficiency and data privacy. The distributed nature at the edge and the aggregation at the cloud level offer a robust solution.
  • Practicality through Constraint Handling: Incorporating both equality and inequality constraints makes the algorithm more applicable to the complex realities of power system operation.

Key Results

  • The proposed distributed fixed-time consensus algorithm achieves convergence in a fixed, predetermined time.
  • The algorithm demonstrated faster convergence and required fewer iterations compared to existing asymptotic and finite-time consensus algorithms from the literature ([5], [19], [20], [21]). For instance, the settling time for the proposed algorithm was 8.9249 seconds, compared to 9.6204 seconds for a fixed-time algorithm in [21].
  • Simulations on a three-area VPP system showed that the algorithm effectively balances supply and demand, satisfying equation constraints.
  • The cloud-edge-end framework enabled parallel computation by edge servers, leading to higher computational efficiency.

Limitations and Future Work

  • Future Research Directions: The authors suggest future work will focus on incorporating additional constraints and exploring the interactions and competitive dynamics among multiple VPPs.
  • Implicit Limitations: While the paper demonstrates effectiveness, the complexity of implementing such a cloud-edge-end system in a real-world power grid, including communication infrastructure and cybersecurity, is a significant practical challenge not fully detailed. The paper also focuses on economic dispatch; extending it to other VPP control objectives would be valuable.

Summary updated

Abstract

As the power grid expands, concerns about system computation speed and information privacy are becoming more critical. While distributed optimization methods protect individual privacy effectively, they struggle with computational efficiency in complex topologies. To address these issues, this paper proposes a cloud–edge–end collaboration framework consisting of a cloud server and multiple edge servers. This framework enables parallel computation of multiple distributed optimization algorithms. Additionally, a distributed fixed-time optimization consensus algorithm is designed for virtual power plants, allowing the convergence time to be predetermined offline. The fixed-time convergence of the algorithm is proven and its effectiveness and superiority are demonstrated through simulation cases.
BibTeX
@inproceedings{kang2025cloud,
  author = {Kai Kang and Nian Shi and Keqi Zhang and Si Cai and Liang Zhang and Xueming Shao and Lei Shu and Renjie Hu and Leimin Wang},
  title = {{A Cloud-Edge-End Collaboration Framework for Fixed-Time Distributed Optimization of Virtual Power Plants}},
  booktitle = {Mathematics},
  year = {2025},
  doi = {10.3390/math13111883},
}
Figure