Reachability Analysis for Uncertain SSPs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal on Artificial Intelligence Tools Year : 2007

Reachability Analysis for Uncertain SSPs


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 article 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. As this is a time-consuming algorithm, we also present a simple process that often speeds it up dramatically. Yet, the main improvement still needed is to turn to a symbolic analysis in order to avoid a complete state-space enumeration.
No file

Dates and versions

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



Olivier Buffet. Reachability Analysis for Uncertain SSPs. International Journal on Artificial Intelligence Tools, 2007, 16 (4), pp.725-749. ⟨10.1142/S0218213007003527⟩. ⟨inria-00509337⟩
100 View
0 Download



Gmail Facebook X LinkedIn More