Loading...

Utilizing distributed learning automata to solve stochastic shortest path problems

Beigy, H ; Sharif University of Technology | 2006

215 Viewed
  1. Type of Document: Article
  2. DOI: 10.1142/S0218488506004217
  3. Publisher: 2006
  4. Abstract:
  5. In this paper, we first introduce a network of learning automata, which we call it as distributed learning automata and then propose some iterative algorithms for solving stochastic shortest path problem. These algorithms use distributed learning automata to find a policy that determines a path from a source node to a destination node with minimal expected cost (length). In these algorithms, at each stage distributed learning automata determines which edges to be sampled. This sampling method may result in decreasing unnecessary samples and hence decreasing the running time of algorithms. It is shown that the shortest path is found with a probability as close as to unity by proper choice of the parameters of the proposed algorithms. © World Scientific Publishing Company
  6. Keywords:
  7. Distributed learning automata ; Learning automata ; Shortest path problems ; Stochastic graphs ; Algorithms ; Iterative methods ; Learning systems ; Probability ; Problem solving ; Random processes ; Automata theory
  8. Source: International Journal of Uncertainty, Fuzziness and Knowlege-Based Systems ; Volume 14, Issue 5 , 2006 , Pages 591-615 ; 02184885 (ISSN)
  9. URL: https://www.worldscientific.com/doi/abs/10.1142/S0218488506004217