---
title: "Robust Planning with (L)RTDP"
authors:
  - "Olivier Buffet"
  - "Douglas Aberdeen"
doi: ""
url: "https://ijcai.org/proceedings/2005/219"
pdf: "https://ijcai.org/proceedings/2005/0219.pdf"
venue: "Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence"
year: 2005
pages: "1214-1218"
track: ""
keywords:
---

# Robust Planning with (L)RTDP

Olivier Buffet, Douglas Aberdeen

*Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence*, pages 1214-1218.

## Abstract

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 approach is robust planning: searching for the best policy under the worst model. This paper shows how RTDP can be made robust in the common case where transition probabilities are known to lie in a given interval.