Skip navigation
Skip navigation

Reachability analysis for uncertain SSPs

Buffet, Olivier


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

CollectionsANU Research Publications
Date published: 2007
Type: Journal article
Source: International Journal on Artificial Intelligence Tools
DOI: 10.1142/S0218213007003527


File Description SizeFormat Image
01_Buffet_Reachability_analysis_for_2007.pdf229.7 kBAdobe PDF    Request a copy

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