A New Distributed Learning Automata Based Algorithm For Solving Stochastic Shortest Path Problem.
Hamid Beigy, Mohammad Reza Meybodi · Joint International Conference on Information Sciences · 2002
A new distributed learning automata (DLA) based algorithm for solving stochastic shortest path problem is presented. The objective is to use DLA to nd 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 nds the shortest path in a stochastic graph with probability as close as to unity.