Robust LRTDP: Reachability Analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2004

Robust LRTDP: Reachability Analysis

Olivier Buffet


Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reachable. This paper presents an algorithm checking for goal reachability, especially in the complex case of an uncertain SSP where only a possible interval is known for each transition probability. This gives an analysis method for determining if SSP algorithms such as RTDP are applicable, even if the exact model is not known. We aim at a symbolic analysis in order to avoid a complete state-space enumeration.
Fichier principal
Vignette du fichier
reachability.pdf (256.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00509353 , version 1 (11-08-2010)


  • HAL Id : inria-00509353 , version 1


Olivier Buffet. Robust LRTDP: Reachability Analysis. [Research Report] 2004, pp.20. ⟨inria-00509353⟩
62 View
62 Download


Gmail Facebook Twitter LinkedIn More