Skip navigation
Skip navigation

Robust planning with (L)RTDP

Buffet, Olivier; Aberdeen, Douglas


Stochastic Shortest Path problems (SSPs), a subclass of Markov Decision Problems (MDPs), can be efficiently dealt with using Real-Time Dynamic Programming (RTDP). Yet, MDP models are often uncertain (obtained through statistics or guessing). The usual app

CollectionsANU Research Publications
Date published: 2005
Type: Conference paper
Source: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005)


There are no files associated with this item.

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

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator