Reachability Analysis for Uncertain SSPs

  • Authors:

  • Olivier Buffet

  • Affiliations:

  • National ICT Australia & The Australian National University

  • Venue:
  • ICTAI '05 Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Stochastic Shortest Path problems (SSPs) can be efficientlydealt 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.