Skip navigation
Skip navigation

Reachability analysis for uncertain SSPs

Buffet, Olivier

Description

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...[Show more]

CollectionsANU Research Publications
Date published: 2005
Type: Book chapter
URI: http://hdl.handle.net/1885/85410
DOI: 10.1109/ICTAI.2005.106

Download

There are no files associated with this item.


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator