本文首先对现有的三种动态规划选代算法：微分动态规划、渐进代化算法、状态增量动态规划作了简单评述．针对如何进一步减少计算工作量和加快收敛速度．提出单增量搜索算法．通过理论阐述和实例分析，说明这种新的法代算法优于上述三种常用方法．最后，本文把这种方法推广到连续型动态规划问题． In this paper, we first give a brief review of the three existing algorithms of dynamic programming, such as differential dynamic programming, incremental evolutionary algorithm and state incremental dynamic programming. For how to further reduce the computational workload and speed up the convergence. Proposed a single incremental search algorithm. Through theoretical exposition and case analysis, this new method is better than the above three commonly used methods. Finally, this paper generalizes this method to the continuous dynamic programming problem.