The Stochastic Shortest Path Problem: A polyhedral combinatorics perspective - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

The Stochastic Shortest Path Problem: A polyhedral combinatorics perspective

Matthieu Guillot
  • Fonction : Auteur
  • PersonId : 1129083
Gautier Stauffer

Résumé

In this paper, we give a new framework for the stochastic shortest path problem in finite state and action spaces. Our framework generalizes both the frameworks proposed by Bertsekas and Tsitsiklis [7] and by Bertsekas and Yu [8]. We prove that the problem is well-defined and (weakly) polynomial when (i) there is a way to reach the target state from any initial state and (ii) there is no transition cycle of negative costs (a generalization of negative cost cycles). These assumptions generalize the standard assumptions for the deterministic shortest path problem and our framework encapsulates the latter problem (in contrast with prior works). In this new setting, we can show that (a) one can restrict to deterministic and stationary policies, (b) the problem is still (weakly) polynomial through linear programming, (c) Value Iteration and Policy Iteration converge, and (d) we can extend Dijkstra's algorithm.
Fichier principal
Vignette du fichier
articlePPCSIntroV3.pdf (347.85 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01591475 , version 1 (21-09-2017)

Identifiants

Citer

Matthieu Guillot, Gautier Stauffer. The Stochastic Shortest Path Problem: A polyhedral combinatorics perspective. 2017. ⟨hal-01591475⟩
279 Consultations
4271 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More