Two-Stage Dual Dynamic Programming With Application to Nonlinear Hydro Scheduling

Abstract

We present an approximate method for solving nonlinear control problems over long time horizons, in which the full nonlinear model is preserved over an initial part of the horizon, while the remainder of the horizon is modeled using a linear relaxation. As this approximate problem may still be too large to solve directly, we present a Benders decomposition-based solution algorithm that iterates between solving the nonlinear and linear parts of the horizon. This extends the Dual Dynamic Programming approach commonly employed for optimization of linearized hydro power systems. We prove that the proposed algorithm converges after a finite number of iterations, even when the nonlinear initial stage problems are solved inexactly. We also bound the suboptimality of the split-horizon method with respect to the original nonlinear problem, in terms of the properties of a map between the linear and nonlinear stateinput trajectories. We then apply this method to a case study concerning a multiple reservoir hydro system, approximating the nonlinear head effects in the second stage using McCormick envelopes. We demonstrate that near-optimal solutions can be obtained in a shrinking horizon setting when the full nonlinear model is used for only a short initial section of the horizon. For this example, the approach is shown to be more practical than both conventional dynamic programming and a multi-cell McCormick envelope approximation from literature.

Increasing electrical reserve provision in districts by exploiting energy flexibility of buildings with robust model predictive control

“…2 Note that the borehole field is outside the scope of this study, as seasonal storage management requires different modeling techniques. The interested reader is referred to [51] . The storage, anyway, cannot be used for arbitrage as the round-trip efficiency is low, due to high exergy losses.…”

Distributed Model Predictive Control of Buildings and Energy Hubs

“…A known MPC practice is move-blocking [39], where decision variables at the end of the prediction horizon are constrained to be equal, as these have a small effect on the optimality of the implemented control input at the current time step. With the same reasoning, we only relax the variables after a certain horizon N relax [40] and keep the first N relax ones as binaries. This way we can improve the estimation of the first N relax binary variables [41], while lowering the complexity of the problem compared to the non-relaxed MIQP.…”

An approximate dynamic programming method for unit-based small hydropower scheduling

“…To alleviate the problem of the curse of dimensionality, several variants of DP have been proposed in recent years. In (Flamm et al, 2021), a two-stage dual dynamic programming method is proposed to reconstruct the nonlinear problem; the approach is notable for its calculation accuracy and solving efficiency. In (Feng et al, 2017), an orthogonal discrete differential dynamic programming (ODDDP) method is introduced.…”