Robust Planning with (L)RTDP

Buffet, Olivier; Aberdeen, Douglas

Robust Planning with (L)RTDP

Download BibTeX Cite

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.

Olivier Buffet, and Douglas Aberdeen. 2005. Robust Planning with (L)RTDP. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 1214–1218. https://ijcai.org/proceedings/2005/219

@inproceedings{ijcai2005p219,
  title     = {Robust Planning with (L)RTDP},
  author    = {Buffet, Olivier and Aberdeen, Douglas},
  booktitle = {Proceedings of the Nineteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-05}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  pages     = {1214--1218},
  year      = {2005},
  url       = {https://ijcai.org/proceedings/2005/219},
}

TY  - CPAPER
TI  - Robust Planning with (L)RTDP
AU  - Buffet, Olivier
AU  - Aberdeen, Douglas
T2  - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2005
SP  - 1214
EP  - 1218
UR  - https://ijcai.org/proceedings/2005/219
ER  -