REACHABILITY ANALYSIS FOR UNCERTAIN SSPs
2007 ◽
Vol 16
(04)
◽
pp. 725-749
Keyword(s):
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.
2017 ◽
Vol 86
(1)
◽
pp. 1-27
1991 ◽
Vol 16
(3)
◽
pp. 580-595
◽
2007 ◽
Vol 37
(5)
◽
pp. 710-720
◽
2011 ◽
Vol 23
(3)
◽
pp. 460-469
◽
2010 ◽
Vol 102-104
◽
pp. 791-795
2013 ◽
Vol 38
(2)
◽
pp. 209-227
◽
1998 ◽
Vol 44
(11-part-2)
◽
pp. S125-S136
◽