An Analysis of Stochastic Shortest Path Problems

We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose a probability distribution over the set of successor nodes so as to reach a certain destination node with minimum expected cost. The costs of transition between successive nodes c...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematics of operations research 1991-08, Vol.16 (3), p.580-595
Hauptverfasser:	Bertsekas, Dimitri P, Tsitsiklis, John N
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Coordinate systems Cost efficiency Determinism Dynamic programming Ergodic theory Exact sciences and technology first passage Flows in networks. Combinatorial problems Functions Graphs Implicit costs Markov processes Markovian decision problems Mathematical vectors Operational research and scientific management Operational research. Management science Operations research policy iteration Probability Probability distributions shortest path Stochastic models Studies Theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!