An algorithm for parallel processing of the state increment dynamic programming problem

Abstract

An algorithm is proposed for the parallel processing of the dynamic programming problem. The procedure combines the state increment approach with function partitioning and evaluate the partitioned cost function using the successive approximations technique as n one-dimensional problems in a decoupled form.