摘要
本文首先将动态规划中的函数空间迭代法转化成了一种既简单规律，又易于编程的表格式迭代算法．在此基础上，针对两个状态间的最短路问题，给出了一种可并行运算且运算量较小的函数空间二分迭代法．为进一步地降低运算量，还讨论各权值之间的关系，并给出了一种能有效地简化网络结构的权值预处理方法．
In this paper, the iterative method of function on a state spacein dynamic programming is changed into a tabular iteration method whichis sample, regular and helpful for progra￣ng. Based on this, point at theshortest path problem between two states, an iterative method of functionon the bipatite state space is given which can be paralleled and reguiresfewer OPerations. In order to decrease the operation times, the relationshipsamong the weights is discussed, and a method of preconditioning the weightsis provided which can effectively simplify the structure of a network.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
1996年第5期3-9,共7页
Systems Engineering-Theory & Practice
关键词
动态规划
函数空间迭代法
最短路
shortest route
state
weight
decision
optical policy
