pith. sign in

arxiv: 2511.02668 · v2 · submitted 2025-11-04 · 🧮 math.OC

Towards grid-aware multi-period flexibility aggregation - A constrained zonotope approach

Maurice Raetsch , Ma\'isa Beraldo Bandeira , Christian Rehtanz , Alexander Engelmann , Timm Faulwasser This is my paper

Pith reviewed 2026-05-18 00:51 UTC · model grok-4.3

classification 🧮 math.OC
keywords flexibility aggregationconstrained zonotopesmulti-period operationset projectiondistribution gridpower system optimizationcomputational geometry
0
0 comments X

The pith

Constrained zonotopes enable faster projection of multi-period flexibility sets in power distribution grids.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proposes constrained zonotopes as a structured set representation to aggregate flexibility from individual devices while incorporating grid constraints over multiple time periods. Set projection onto the point of interconnection becomes the bottleneck in multi-period settings, and the zonotope form exploits linear structure to reduce this cost. The method is demonstrated on a 15-bus distribution grid that includes time-dependent elements, with horizons reaching 96 timesteps. A sympathetic reader cares because quicker aggregation lets operators consider more resources and longer schedules without prohibitive compute. The results indicate clear runtime gains relative to standard polytope projection techniques.

Core claim

Constrained zonotopes provide an efficient representation for the feasible sets of devices and network constraints, allowing the multi-period flexibility region at the point of interconnection to be obtained by projection at substantially lower computational cost than classic polytope methods on a 15-bus test system.

What carries the argument

Constrained zonotope, a zonotope intersected with a finite set of linear inequalities, used to model device and grid feasible regions so that their Minkowski sum and subsequent projection remain tractable.

If this is right

  • Aggregation remains practical for horizons of at least 96 timesteps on modest distribution networks.
  • The number of devices treated individually can be reduced while still respecting time-coupled and network constraints.
  • Computation times drop enough to support repeated solves inside real-time or day-ahead operational loops.
  • Time-dependent elements such as storage or demand response are handled without reformulating the entire problem as a monolithic polytope.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same representation might be reused inside market-clearing problems that clear aggregated bids at the feeder head.
  • Hybrid schemes could switch between zonotope and polytope representations depending on the number of active time periods.
  • Extending the approach to three-phase unbalanced networks would test whether the linear-constraint structure survives unbalanced power-flow models.

Load-bearing premise

Device feasible sets and grid constraints admit a constrained zonotope description whose projection preserves the essential multi-period feasibility information without unacceptable conservatism.

What would settle it

Compute the projected flexibility region for the 15-bus system at 96 timesteps with both the zonotope method and a full polytope projection, then check whether the zonotope region contains points that violate network limits or excludes points that remain feasible.

Figures

Figures reproduced from arXiv: 2511.02668 by Alexander Engelmann, Christian Rehtanz, Ma\'isa Beraldo Bandeira, Maurice Raetsch, Timm Faulwasser.

Figure 1
Figure 1. Figure 1: Tree-structured optimization of power system operation [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 3
Figure 3. Figure 3: Topology of the 15-bus radial distribution grid with [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FOR at the slack bus modeled as polytope and as [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Dependency of p1,2(1) FOR of active and reactive power at the following timestep. for large problem size. These result highlight the potential use of these set rep￾resentations for dynamic sets. For instance, this can be used in ADP to model a feasible set for a fixed set of constraints and add more dynamic constraints, e.g. time-varying generator setpoints, via further intersection as necessary. Time-depe… view at source ↗
read the original abstract

Aggregation schemes provide a means to reduce the computational complexity of power system operation by reducing the number of devices that are considered individually. This can be achieved with tools of computational geometry, where the feasible set is projected onto the decision variables of the point of interconnection. Set projection is computationally expensive, especially in the context of multi-period power system operation. This calls for efficiency improvements via structure exploitation of set representations. This paper proposes efficient flexibility aggregation via constrained zonotopes. We evaluate the performance of the proposed method on a 15-bus distribution grid with time-dependent elements for up to 96 timesteps. The results suggest that the presented method significantly improves computation times compared to classic polytope projection approaches.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 2 minor

Summary. The paper proposes using constrained zonotopes for grid-aware multi-period flexibility aggregation in power systems. It exploits the structure of constrained zonotopes to compute projections of device and grid feasible sets onto point-of-interconnection variables more efficiently than standard polytope methods. The central empirical claim is that the approach yields substantial wall-clock speed-ups on a 15-bus distribution network with time-dependent elements, for horizons up to 96 timesteps, while remaining suitable for operational use.

Significance. If the constrained-zonotope projections preserve feasibility and tightness to within acceptable operational margins, the method would materially reduce the computational barrier to multi-period flexibility aggregation in distribution grids. The reported timing gains on a concrete 15-bus instance with realistic time couplings are a concrete strength; however, the absence of quantitative fidelity metrics (error bounds, volume ratios, or feasibility-violation rates) leaves the practical value of the speed-up unverified.

major comments (3)
  1. [§5] §5 (Numerical Results): The performance tables compare only computation times against polytope projection; no accompanying error metrics (Hausdorff distance, maximum constraint violation, or fraction of feasible points retained) are reported for the 15-bus, 96-timestep case. This omission is load-bearing because the central claim is that the faster method remains usable for grid-aware aggregation.
  2. [§3.2–3.3] §3.2–3.3 (Constrained-zonotope encoding and projection): The construction that encodes inter-temporal device and grid constraints into the generator and constraint matrices of the constrained zonotope is presented without an explicit bound on the conservatism of the subsequent projection. If the representation cannot capture all time couplings exactly, the Minkowski sum and projection may systematically exclude feasible operating points or over-approximate the feasible set; neither outcome is quantified.
  3. [§4.1] §4.1 (Multi-period grid model): The claim that the constrained-zonotope representation of the network constraints remains exact after aggregation is not accompanied by a verification step (e.g., comparison against a small-horizon exact polytope or a Monte-Carlo feasibility check). This verification is necessary to substantiate that the reported speed-up does not trade off critical feasibility information.
minor comments (2)
  1. [Figure 2] Figure 2: the legend and axis scaling for the 96-timestep case are difficult to read; enlarging or splitting the plot would improve clarity.
  2. [Notation] Notation: the symbols for the constrained-zonotope generator matrix and the projection operator are introduced without a consolidated table; a short notation table would aid readability.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive comments, which highlight important aspects of verification for our proposed constrained-zonotope approach to multi-period flexibility aggregation. We address each major comment below with clarifications on the exactness properties of the representation and indicate the revisions we will make to strengthen the empirical support.

read point-by-point responses

  1. Referee: [§5] §5 (Numerical Results): The performance tables compare only computation times against polytope projection; no accompanying error metrics (Hausdorff distance, maximum constraint violation, or fraction of feasible points retained) are reported for the 15-bus, 96-timestep case. This omission is load-bearing because the central claim is that the faster method remains usable for grid-aware aggregation.

    Authors: We agree that the numerical results would benefit from explicit fidelity metrics to confirm operational usability. The constrained-zonotope encoding is constructed to be exact for the underlying linear constraints, but we will revise §5 to include, for smaller instances (up to 12 timesteps) where exact polytope projection remains tractable, quantitative comparisons such as maximum constraint violation rates and the fraction of feasible points retained under Monte-Carlo sampling. For the full 96-timestep case, direct polytope comparison is intractable, which is precisely why the zonotope method is advantageous. revision: yes

  2. Referee: [§3.2–3.3] §3.2–3.3 (Constrained-zonotope encoding and projection): The construction that encodes inter-temporal device and grid constraints into the generator and constraint matrices of the constrained zonotope is presented without an explicit bound on the conservatism of the subsequent projection. If the representation cannot capture all time couplings exactly, the Minkowski sum and projection may systematically exclude feasible operating points or over-approximate the feasible set; neither outcome is quantified.

    Authors: The encoding in §3.2–3.3 augments the generator matrix and constraint set to exactly capture all linear inter-temporal couplings from device dynamics and the linear power-flow model. Because constrained zonotopes admit an exact representation of polyhedra defined by affine equalities and inequalities, the Minkowski sum and projection onto the point-of-interconnection variables introduce no additional conservatism. We will add a clarifying remark and short proof sketch in §3.3 referencing the exact-representation property of constrained zonotopes. revision: yes

  3. Referee: [§4.1] §4.1 (Multi-period grid model): The claim that the constrained-zonotope representation of the network constraints remains exact after aggregation is not accompanied by a verification step (e.g., comparison against a small-horizon exact polytope or a Monte-Carlo feasibility check). This verification is necessary to substantiate that the reported speed-up does not trade off critical feasibility information.

    Authors: We will incorporate an explicit verification step. In the revised manuscript we add to §4.1 and §5 a side-by-side comparison on a reduced 3-bus, 8-timestep instance, reporting the Hausdorff distance between the constrained-zonotope projection and the exact polytope as well as Monte-Carlo feasibility-violation rates. This will confirm that aggregation preserves exactness for the linear network constraints. revision: yes

Circularity Check

0 steps flagged

Constrained zonotope aggregation method is an independent algorithmic proposal with empirical validation

full rationale

The paper proposes using constrained zonotopes to exploit structure for faster multi-period flexibility aggregation and projection onto point-of-interconnection variables, then reports wall-clock timing improvements versus polytope methods on a 15-bus system with time-dependent elements up to 96 steps. No equations or central claims reduce by construction to fitted parameters, self-definitions, or self-citation chains; the derivation relies on standard Minkowski sums and projections in computational geometry whose correctness is independently checkable, and the speed-up claim is supported by direct empirical comparison rather than any internal renaming or loop.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The approach rests on standard power-system modeling assumptions and the existence of efficient projection algorithms for constrained zonotopes; no new physical entities or fitted constants are introduced in the abstract.

axioms (1)
  • domain assumption Individual device and grid constraints admit a constrained zonotope representation whose Minkowski sum and projection remain tractable.
    Invoked to justify replacing polytope projection with zonotope operations for multi-period cases.

pith-pipeline@v0.9.0 · 5656 in / 1281 out tokens · 32124 ms · 2026-05-18T00:51:17.870862+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [1]

    Survey and Comparison of Optimization-Based Aggregation Methods for the Determination of the Flexibility Potentials at Vertical System Interconnections,

    M. Sarstedt, L. Kluß, J. Gerster, T. Meldau, and L. Hofmann, “Survey and Comparison of Optimization-Based Aggregation Methods for the Determination of the Flexibility Potentials at Vertical System Interconnections,”Energies, vol. 14, no. 3, p. 687, 2021

    work page 2021

  2. [2]

    Determination of the Time-Dependent Flexibility of Active Distribution Networks to Control Their TSO-DSO Interconnection Power Flow,

    D. Mayorga Gonzalez, J. Hachenberger, J. Hinker, F. Rewald, U. H ¨ager, C. Rehtanz, and J. Myrzik, “Determination of the Time-Dependent Flexibility of Active Distribution Networks to Control Their TSO-DSO Interconnection Power Flow,” in Power Systems Computation Conference (PSCC), 2018, pp. 1– 8

    work page 2018

  3. [3]

    Estimating the active and reactive power flexibility area at the TSO-DSO interface,

    J. Silva, J. Sumaili, R. J. Bessa, L. Seca, M. A. Matos, V . Miranda, M. Caujolle, B. Goncer, and M. Sebastian-Viana, “Estimating the active and reactive power flexibility area at the TSO-DSO interface,”IEEE Transactions on Power Systems, vol. 33, no. 5, pp. 4741–4750, 2018

    work page 2018

  4. [4]

    Monetarization of the Fea- sible Operation Region of Active Distribution Grids Based on a Cost-Optimal Flexibility Disaggregation,

    M. Sarstedt and L. Hofmann, “Monetarization of the Fea- sible Operation Region of Active Distribution Grids Based on a Cost-Optimal Flexibility Disaggregation,”IEEE Access, vol. 10, pp. 5402–5415, 2022

    work page 2022

  5. [5]

    TSO–DSO interaction: Active distribution network power chart for TSO ancillary services provision,

    F. Capitanescu, “TSO–DSO interaction: Active distribution network power chart for TSO ancillary services provision,” Electric Power Systems Research, vol. 163, pp. 226–230, 2018

    work page 2018

  6. [6]

    Aggregation of Demand-Side Flexibilities: A Comparative Study of Approximation Algorithms,

    E. ¨Ozt¨urk, K. Rheinberger, T. Faulwasser, K. Worthmann, and M. Preißinger, “Aggregation of Demand-Side Flexibilities: A Comparative Study of Approximation Algorithms,”Energies, vol. 15, no. 7, p. 2501, 2022

    work page 2022

  7. [7]

    Barriers and insights to compute multi- period cost curves of active power aggregated flexibility from distribution systems for TSO-DSO coordination,

    F. Capitanescu, “Barriers and insights to compute multi- period cost curves of active power aggregated flexibility from distribution systems for TSO-DSO coordination,”IEEE Trans. Power Syst., pp. 1–12, 2025

    work page 2025

  8. [8]

    Non-Iterative Solution for Coordinated Optimal Dispatch via Equivalent Projection— Part I: Theory,

    Z. Tan, Z. Yan, H. Zhong, and Q. Xia, “Non-Iterative Solution for Coordinated Optimal Dispatch via Equivalent Projection— Part I: Theory,”IEEE Transactions on Power Systems, vol. 39, no. 1, pp. 890–898, 2024

    work page 2024

  9. [9]

    Approx- imate Dynamic Programming With Feasibility Guarantees,

    A. Engelmann, M. B. Bandeira, and T. Faulwasser, “Approx- imate Dynamic Programming With Feasibility Guarantees,” IEEE Transactions on Control of Network Systems, pp. 1565– 1576, 2025

    work page 2025

  10. [10]

    A Projection-Based Approach for Distributed Energy Resources Aggregation,

    Y . Wang, H. Zhong, and G. Ruan, “A Projection-Based Approach for Distributed Energy Resources Aggregation,” in 2023 IEEE PES Innovative Smart Grid Technologies Europe (ISGT EUROPE), 2023, pp. 1–5

    work page 2023

  11. [11]

    Optimal sizing of capacitors placed on a radial distribution system,

    M. Baran and F. Wu, “Optimal sizing of capacitors placed on a radial distribution system,”IEEE Transactions on Power Delivery, vol. 4, no. 1, pp. 735–743, 1989

    work page 1989

  12. [12]

    M. B. Bandeira, A. Engelmann, and T. Faulwasser,Complexity Reduction for TSO-DSO Coordination: Flexibility Aggrega- tion vs. Distributed Optimization, 2025. arXiv: 2509.10595 [eess]

    work page arXiv 2025

  13. [13]

    Ag- gregation and disaggregation of energetic flexibility from distributed energy resources,

    F. L. M ¨uller, J. Szab ´o, O. Sundstr ¨om, and J. Lygeros, “Ag- gregation and disaggregation of energetic flexibility from distributed energy resources,”IEEE Transactions on Smart Grid, vol. 10, no. 2, pp. 1205–1214, 2019

    work page 2019

  14. [14]

    Inner approximation of minkowski sums: A union-based approach and applications to aggregated energy resources,

    M. S. Nazir, I. A. Hiskens, A. Bernstein, and E. Dall’Anese, “Inner approximation of minkowski sums: A union-based approach and applications to aggregated energy resources,” in2018 IEEE Conference on Decision and Control (CDC), 2018, pp. 5708–5715

    work page 2018

  15. [15]

    An ADP framework for flexibility and cost aggregation: Guarantees and open problems,

    M. Beraldo Bandeira, T. Faulwasser, and A. Engelmann, “An ADP framework for flexibility and cost aggregation: Guarantees and open problems,”Electr. Power Syst. Res., vol. 234, 2024, Art. no. 110818

    work page 2024

  16. [16]

    Constrained zonotopes: A new tool for set-based esti- mation and fault detection,

    J. K. Scott, D. M. Raimondo, G. R. Marseglia, and R. D. Braatz, “Constrained zonotopes: A new tool for set-based esti- mation and fault detection,”Automatica, vol. 69, pp. 126–136, 2016

    work page 2016

  17. [17]

    Time-Based Aggregation of Flexibility at the TSO-DSO Interconnection Point,

    D. A. Contreras and K. Rudion, “Time-Based Aggregation of Flexibility at the TSO-DSO Interconnection Point,” inIEEE Power & Energy Society General Meeting (PESGM), 2019, pp. 1–5

    work page 2019

  18. [18]

    Network reconfiguration in distribution systems for loss reduction and load balancing,

    M. Baran and F. Wu, “Network reconfiguration in distribution systems for loss reduction and load balancing,”IEEE Transac- tions on Power Delivery, vol. 4, no. 2, pp. 1401–1407, 1989

    work page 1989

  19. [19]

    Coordinated V oltage Control for Conservation V oltage Reduction in Power Distribution Systems,

    R. R. Jha and A. Dubey, “Coordinated V oltage Control for Conservation V oltage Reduction in Power Distribution Systems,” inIEEE Power & Energy Society General Meeting (PESGM), 2020, pp. 1–5

    work page 2020

  20. [20]

    Reach- ability analysis of discrete-time systems with disturbances,

    S. Rakovic, E. Kerrigan, D. Mayne, and J. Lygeros, “Reach- ability analysis of discrete-time systems with disturbances,” IEEE Trans. Autom. Control, vol. 51, no. 4, pp. 546–561, 2006

    work page 2006

  21. [21]

    Equality set projection: A new algorithm for the projection of polytopes in halfspace representation,

    C. Jones, E. Kerrigan, and J. Maciejowski, “Equality set projection: A new algorithm for the projection of polytopes in halfspace representation,” Eng. Dept., Cambridge Univ., Cambridge, U.K., Tech. Rep. TR.463, 2004

    work page 2004

  22. [22]

    Set operations and order reductions for constrained zonotopes,

    V . Raghuraman and J. P. Koeln, “Set operations and order reductions for constrained zonotopes,”Automatica, vol. 139, 2022, Art. no. 110204

    work page 2022

  23. [23]

    JuMP 1.0: Recent improvements to a modeling language for mathematical optimization,

    M. Lubin, O. Dowson, J. D. Garcia, J. Huchette, B. Legat, and J. P. Vielma, “JuMP 1.0: Recent improvements to a modeling language for mathematical optimization,”Math. Program. Computation, vol. 15, no. 3, pp. 581–589, 2023

    work page 2023

  24. [24]

    The MOSEK optimizer API for julia manual. Version 11.0.,

    MOSEK, “The MOSEK optimizer API for julia manual. Version 11.0.,” 2025, Accessed: Jul. 31, 2025. [Online]. Available: https://docs.mosek.com/latest/juliaapi/index.html

    work page 2025

  25. [25]

    MATPOWER: Steady-state operations, planning, and anal- ysis tools for power systems research and education,

    R. D. Zimmerman, C. E. Murillo-S ´anchez, and R. J. Thomas, “MATPOWER: Steady-state operations, planning, and anal- ysis tools for power systems research and education,”IEEE Trans. Power Syst., vol. 26, no. 1, pp. 12–19, 2011

    work page 2011

  26. [26]

    DG planning with amalgamation of economic and reliability considera- tions,

    N. R. Battu, A. R. Abhyankar, and N. Senroy, “DG planning with amalgamation of economic and reliability considera- tions,”Int. J. Elect. Power Eng. Syst., vol. 73, pp. 273–282, 2015

    work page 2015