Undirected Graph Description and Dimensionality Reduction Deconstruction of Complex Microgrid Networks
Due to its complex architecture, modeling microgrids is challenging. This article focuses on proposing a downscaling strategy via the Louvain Community Clustering (LCC) algorithm. An undirected graph modeling method for microgrids is proposed. The algorithm divides the undirected graph into different functional domains, identifies and aggregates nodes within divided domains, and uses node clusters as the smallest modeling units, effectively reducing the difficulty of microgrid modeling.
Authors
- Xingyuan Chen (ORCID: https://orcid.org/0000-0001-6506-8928)
- Yini Wang (ORCID: https://orcid.org/0000-0001-8545-2660)
- Yang Hu (ORCID: https://orcid.org/0000-0001-9079-6978)
- Zhentao Shi (ORCID: https://orcid.org/0000-0002-7289-2840)
- Zhao Jingwei
- Han Yang (ORCID: https://orcid.org/0000-0001-5855-2172)
Institutions
- North China Electric Power University (CN)
Publication Details
- Published
- 2024-11-29
- DOI
- https://doi.org/10.1109/ei264398.2024.10990804
- Primary Topic
- Graph Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00