2 research outputs found

    Iterative Dynamic Programming—An Efficient Method for the Validation of Power Flow Control Strategies

    No full text
    The operation of electrical networks, microgrids, or heterogeneous battery systems, especially the dispatch of single units within the system, requires sophisticated power flow control strategies. If objectives such as efficiency are demanded for the operation of the energy system, typical control strategies lack the ability to verify the optimality of the operation. Dynamic programming is a widely used method for determining the global optima of trajectory problems. In the context of energy systems and power flow optimization, it is restricted to applications with a low number of states and decisions. The reason for this is the rapid growth of computational effort with increasing dimensionality of the state and decision space. The approach of iterative dynamic programming (iDP) makes dynamic programming applicable to the planning and benchmarking of complex power flow optimization problems. To illustrate this, a heterogeneous battery energy storage system is introduced for which the iDP optimizes the power split at the point of common coupling to minimize the total cumulative loss of energy. The method can be adopted for a broad range of energy systems such as microgrids, utility grids, or electric vehicles. The applicability is limited only by the computation time, which depends on the model complexity and the length of the time series. To verify the functionality of the iterative dynamic programming, its results are directly compared to those of the standard dynamic programming. The total computation time can be reduced by 98% in the tested scenario. As relevant use cases, static and dynamic methods of power sharing are validated and benchmarked. The iDP offers a novel and computationally efficient method for the design and validation of power flow control strategies
    corecore