Iterative refinement of the discretization of the Dynamic Programming State Grid
The dynamic programming method is well known and widely used for the calculation of the optimal operating strategy of hybrid electric vehicles. In this paper the challenge of large grid sizes due to growing battery capacities and complex powertrain concepts and the need for fine discretization is met by an iterative approach which has the chance to reduce memory usage and computing time by reducing the SOC range with each iteration.
KeywordsCombustion Univer Control Grid Iterative Dynamic
Unable to display preview. Download preview PDF.