Imperfect-Information Games and Generalized Planning
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 1037-1042.
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.
@inproceedings{ijcai2016p151,
title = {Imperfect-Information Games and Generalized Planning},
author = {De Giacomo, Giuseppe and Murano, Aniello and Rubin, Sasha and Stasio, Antonio Di},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {1037--1042},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/151},
}
TY - CPAPER TI - Imperfect-Information Games and Generalized Planning AU - De Giacomo, Giuseppe AU - Murano, Aniello AU - Rubin, Sasha AU - Stasio, Antonio Di T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 1037 EP - 1042 UR - https://ijcai.org/proceedings/2016/151 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
