Imperfect-Information Games and Generalized Planning
Abstract
We study a generalized form of planning under partial observability, in which we have multiple, possibly infinitely many, planning domains with the same actions and observations, and goals expressed over observations, which are possibly temporally extended. By building on work on two-player (non-probabilistic) games with imperfect information in the Formal Methods literature, we devise a general technique, generalizing the belief-state construction, to remove partial observability. This reduces the planning problem to a game of perfect information with a tight correspondence between plans and strategies. Then we instantiate the technique and solve some generalized-planning problems. PDF
Cite
Text
De Giacomo et al. "Imperfect-Information Games and Generalized Planning." International Joint Conference on Artificial Intelligence, 2016.Markdown
[De Giacomo et al. "Imperfect-Information Games and Generalized Planning." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/giacomo2016ijcai-imperfect/)BibTeX
@inproceedings{giacomo2016ijcai-imperfect,
title = {{Imperfect-Information Games and Generalized Planning}},
author = {De Giacomo, Giuseppe and Murano, Aniello and Rubin, Sasha and Di Stasio, Antonio},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2016},
pages = {1037-1043},
url = {https://mlanthology.org/ijcai/2016/giacomo2016ijcai-imperfect/}
}