Reachability Analysis for Uncertain SSPS

Olivier Buffet

Abstract: 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 ...