Choosing grid points in solving singular optimal control problems by iterative dynamic programming

摘要: In using iterative dynamic programming to determine the optimal control policy of complex systems, time interval is divided into P intervals convert problem an optimization involving stages. We consider parametrization, where in each kept constant, but length stage allowed vary, so that determined during course optimization. To feed rate for two fed-batch reactor models ethanol fermentation, it found more than one grid point required at get convergence vicinity global optimum. For these problems, considerably better use random perturbations uniform order generate points.