Skip to Main content Skip to Navigation
Reports

Robust LRTDP: Reachability Analysis

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 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.
Document type :
Reports
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00509353
Contributor : Olivier Buffet <>
Submitted on : Wednesday, August 11, 2010 - 6:08:30 PM
Last modification on : Friday, September 16, 2016 - 3:06:09 PM
Long-term archiving on: : Thursday, December 1, 2016 - 11:34:07 AM

File

reachability.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00509353, version 1

Collections

Citation

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

Share

Metrics

Record views

138

Files downloads

200