Abstract: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 prob...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.Read More
Publication Year: 2006
Publication Date: 2006-10-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 100
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot