Compilation Based Approaches to Probabilistic Planning -- Thesis Summary

Authors

  • Ran Taig Ben Gurion University of the Negev

DOI:

https://doi.org/10.1609/aaai.v28i1.8778

Keywords:

planning under uncertainty, translation based approach,conformant probabilistic planning

Abstract

The main focus of our work is the use of classical planning algorithms in service of more complex problems of planning under uncertainty. In particular, we are exploring compilation techniques that allow us to reduce some probabilistic planning problems into variants of classical planning, such as metric planning,resource-bounded planning, and cost-bounded suboptimal planning. Currently, our initial work focuses on \emph{conformant probabilistic planning}. We intend toimprove our current methods by improving our compilation methods, but also by improving the ability of current planners to handle the special features ofour compiled problems. Then, we hope to extend these techniques to handle more complex probabilistic settings, such as problems with stochastic actions andpartial observability.

Downloads

Published

2014-06-21

How to Cite

Taig, R. (2014). Compilation Based Approaches to Probabilistic Planning -- Thesis Summary. Proceedings of the AAAI Conference on Artificial Intelligence, 28(1). https://doi.org/10.1609/aaai.v28i1.8778