A New Decomposition Procedure for Dynamic Programming
暂无分享,去创建一个
This paper presents a new decomposition procedure that reduces the highspeed memory requirement and interpolations, associated with the dynamic programming algorithm. It shows that an nth-order system described by k coupled difference or differential equations can be treated as a kth-order system with respect to the high-speed memory requirement and interpolations in the dynamic programming procedure.
[1] Robert E. Larson,et al. State increment dynamic programming , 1968 .
[2] David G. Luenberger,et al. Reducing the Memory Requirements of Dynamic Programming , 1968, Oper. Res..
[3] George L. Nemhauser,et al. Introduction To Dynamic Programming , 1966 .
[4] D. Luenberger. Canonical forms for linear multivariable systems , 1967, IEEE Transactions on Automatic Control.
[5] Stuart E. Dreyfus,et al. Applied Dynamic Programming , 1965 .