×

Utilizing distributed learning automata to solve stochastic shortest path problems. (English) Zbl 1107.68076

Summary: 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.

MSC:

68T05 Learning and adaptive systems in artificial intelligence
68R10 Graph theory (including graph drawing) in computer science
05C85 Graph algorithms (graph-theoretic aspects)
68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1002/net.3230140208 · Zbl 0542.90101 · doi:10.1002/net.3230140208
[2] Pritsker A. A. B., Journal of Industrial Engineering pp 14–
[3] Frank H., Operations Research 15 pp 583– · Zbl 1226.90001
[4] Martin J. J., Operations Research pp 60–
[5] Sizal C. U., Math. Comp. Simulation 21 pp 276–
[6] Mirchandani P. B., Computer Operations Research 8 pp 347–
[7] Sigal C. C., Operations Research 48 pp 1422–
[8] DOI: 10.1002/(SICI)1097-0037(199708)30:1<9::AID-NET2>3.0.CO;2-H · Zbl 0878.90096 · doi:10.1002/(SICI)1097-0037(199708)30:1<9::AID-NET2>3.0.CO;2-H
[9] DOI: 10.1002/(SICI)1097-0037(199603)27:2<133::AID-NET5>3.0.CO;2-L · Zbl 0851.90129 · doi:10.1002/(SICI)1097-0037(199603)27:2<133::AID-NET5>3.0.CO;2-L
[10] DOI: 10.1287/trsc.34.2.198.12304 · Zbl 0990.90011 · doi:10.1287/trsc.34.2.198.12304
[11] DOI: 10.1002/1097-0037(200101)37:1<35::AID-NET4>3.0.CO;2-G · Zbl 0997.90038 · doi:10.1002/1097-0037(200101)37:1<35::AID-NET4>3.0.CO;2-G
[12] DOI: 10.1002/net.10049 · Zbl 1026.90088 · doi:10.1002/net.10049
[13] DOI: 10.1109/3477.931507 · doi:10.1109/3477.931507
[14] DOI: 10.1109/TSMCB.2002.1049608 · doi:10.1109/TSMCB.2002.1049608
[15] DOI: 10.1137/0320005 · Zbl 0536.90035 · doi:10.1137/0320005
[16] Nedzelnitsky O. V., IEEE Transactions on Systems, Man, and Cybernetics 17 pp 1004– · doi:10.1109/TSMC.1987.6499311
[17] DOI: 10.1109/12.485372 · Zbl 1068.68676 · doi:10.1109/12.485372
[18] DOI: 10.1109/12.862220 · doi:10.1109/12.862220
[19] Meybodi M. R., Journal of Faculty of Engineering 34 pp 1–
[20] DOI: 10.1016/S0925-2312(01)00686-5 · Zbl 1006.68749 · doi:10.1016/S0925-2312(01)00686-5
[21] DOI: 10.1142/S012906570200090X · Zbl 02178727 · doi:10.1142/S012906570200090X
[22] DOI: 10.1142/S0129065701000655 · doi:10.1142/S0129065701000655
[23] Narendra K. S., Learning Automata: An Introduction (1989)
[24] Thathachar M. A. L., IEEE Transactions on Systems, Man, and Cybernetics 17 pp 1095– · doi:10.1109/TSMC.1987.6499323
[25] Thathachar M. A. L., IEEE Transactions on Systems, Man, and Cybernetics 11 pp 236–
[26] Mood A. M., Introduction to the theory of statistis (1963)
[27] Lakshmivarahan S., IEEE Transactions on Systems, Man, and Cybernetics 6 pp 756–
[28] Norman M. F., Markovian Process and Learning Models (1972)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.