A new distributed learning automata based algorithm for solving stochastic shortest path problem

被引:0
|
作者
Beigy, H [1 ]
Meybodi, MR [1 ]
机构
[1] Amirkabir Univ Technol, Dept Comp Engn, Soft Comp Lab, Tehran, Iran
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A new distributed learning automata, (DLA),based algorithm for solving stochastic shortest path problem is presented: The objective is to use DLA to find a policy that, determines a path from a source node to a destination node with minimal expected cost. It. has been shown that the proposed algorithm finds the shortest path in A, stochastic graph with probability as close as to unity.
引用
收藏
页码:339 / 343
页数:5
相关论文
共 50 条