{"type":"ScholarlyArticle","title":"Robust Planning with (L)RTDP","authors":[{"name":"Olivier Buffet","slug":"olivier-buffet","given":"Olivier","family":"Buffet","affiliation":""},{"name":"Douglas Aberdeen","slug":"douglas-aberdeen","given":"Douglas","family":"Aberdeen","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2005/219","pdf":"https://ijcai.org/proceedings/2005/0219.pdf","markdown":"https://ijcai.org/proceedings/2005/219.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/219","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":219,"pages":{"first":1214,"last":1218},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}