New complexity results for time-constrained dynamical optimal path problems