Description: The beginning and end of the free dynamic programming, find the minimum index function recursive algorithm for computing the reverse procedure. x is the state variable, a represents a phase state M-function DecisFun (k, x) from the stage of the state variable x k of the corresponding enable decision variables determined M-function ObjFun (k, x, u) is the phase index function , M-function TransFun (k, x, u) is the state transition function, where x is the phase of a state variable k, u is the corresponding decision variables output p_opt constituted by a 4, p_opt = [NO group optimal strategy group optimal trajectory group indicator function value group] fval is a column vector, each element represent p_opt optimal strategy group corresponds to the beginning of each end state x optimal function value
To Search:
File list (Check if you may need any files):
DYNPROG.m
Download