Efficient aggregation and coordination of storage-like resources via feasible region deconstruction

To aggregate distributed storage-like resources (SLR) for bulk power system utilization, this paper proposes a feasible region deconstruction-based method that characterizes the aggregated flexibility range of SLRs in a coordinated and efficient manner. Considering the power and energy constrains, the operation feasible region of the SLR is modelled as a general polytope. The feasible region of each SLR is deconstructed by the linear combination of a set of basic homothetic polytopes. Then the SLR aggregation process is converted to arithmetic addition of the combination coefficients of basic homothetic polytopes. Case studies verify the effectiveness of the proposed method in terms of security guarantee and computational efficiency.

Authors

Institutions

Publication Details

Journal
IET conference proceedings.
Published
2025-03-01
DOI
https://doi.org/10.1049/icp.2025.0638
Primary Topic
Optimization and Search Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient aggregation and coordination of storage-like resources via feasible region deconstruction

Ying Cao, Zhenfei Tan, Zheng Yan
IET conference proceedings.
Optimization and Search Problems
article

Efficient aggregation and coordination of storage-like resources via feasible region deconstruction

Ying Cao, Zhenfei Tan, Zheng Yan
article en

Abstract

To aggregate distributed storage-like resources (SLR) for bulk power system utilization, this paper proposes a feasible region deconstruction-based method that characterizes the aggregated flexibility range of SLRs in a coordinated and efficient manner. Considering the power and energy constrains, the operation feasible region of the SLR is modelled as a general polytope. The feasible region of each SLR is deconstructed by the linear combination of a set of basic homothetic polytopes. Then the SLR aggregation process is converted to arithmetic addition of the combination coefficients of basic homothetic polytopes. Case studies verify the effectiveness of the proposed method in terms of security guarantee and computational efficiency.

IET conference proceedings.Vol. 2024(33)
Shanghai Jiao Tong University (CN)
Openalex Percentile: Top 96%
Optimization and Search Problems
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.