Time Reduction of the Dynamic programming computation in the case of hybrid vehicle
Résumé
Deterministic Dynamic Programming is frequently used to solve the management problem of hybrid vehicles (choice of mode and power sharing between thermal and electric sources). However, it is time consuming and thus difficult to use in global sizing optimization or in parametric studies. This paper presents a comparison between three methods to compute the DDP problems. These methods are applied on the well known case of the Toyota PRIUS. It proves that a dense matrix method can reduce the computation time by up to 10 compared to classical solving methods