International Journal of Uncertainty Fuzziness and Knowledge-Based Systems · 2006 · 100 citations · 25 references
ComputingComputer ScienceAlgorithmsDistributed SystemsMachine LearningDistributed AlgorithmsDistributed ComputingDistributed LearningShortest Path AlgorithmsStochastic NetworksStochastic Shortest Path ProblemsDistributed AutomataDistributed Machine LearningDistributed OptimizationDistributed Shortest Path Algorithms
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.
25
An Introduction to the Theory of Statistics
Shortest‐path algorithms: Taxonomy and annotation
Narsingh Deo, C. Y. Pang · Networks · 1984 · 311 citations
Distribution of the Time Through a Directed, Acyclic Network
J. J. Martin · Operations Research · 1965 · 217 citations
Stochastic shortest path problems with recourse
George Polychronopoulos, John N. Tsitsiklis · Networks · 1996 · 209 citations · Full text