Alleviating the Curse of Dimensionality in Minkowski Sum Approximations of Storage Flexibility
Статистика
Minkowski sums computation is demanding.
Proposed method outperforms existing approximations in terms of computational complexity and accuracy.
Simulation study shows efficiency of the approach.
Extensive simulation study conducted to illustrate superiority of the proposed method.
Proposed disaggregation method does not require optimization.
Computational complexity is quadratic in number of time periods and linear in number of devices.
Цитаты
"Proposed methods provide an efficient means to aggregate and disaggregate energy storages."
"We show that up to 2d vertices of each polytope can be computed efficiently."
"Our approach outperforms ten state-of-the-art inner approximations in terms of computational complexity and accuracy."