Planning under partial observability is one of the most significant and challenging planning problems. It has been shown to be hard, both theoretically and experimentally. In this paper, we present a novel approach to the problem of planning under partial observability in non-deterministic domains. We propose an algorithm that searches through a (possibly cyclic) and-or graph induced by the domain. The algorithm generates conditional plans that are guaranteed to achieve the goal...
%0 Conference Paper
%1 Bertoli01a
%A Bertoli, Piergiorgio
%A Cimatti, Alessandro
%A Roveri, Marco
%A Traverso, Paolo
%B IJCAI
%D 2001
%K model-checking, planning
%P 473--478
%T Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.448
%X Planning under partial observability is one of the most significant and challenging planning problems. It has been shown to be hard, both theoretically and experimentally. In this paper, we present a novel approach to the problem of planning under partial observability in non-deterministic domains. We propose an algorithm that searches through a (possibly cyclic) and-or graph induced by the domain. The algorithm generates conditional plans that are guaranteed to achieve the goal...
@inproceedings{Bertoli01a,
abstract = {{Planning under partial observability is one of the most significant and challenging planning problems. It has been shown to be hard, both theoretically and experimentally. In this paper, we present a novel approach to the problem of planning under partial observability in non-deterministic domains. We propose an algorithm that searches through a (possibly cyclic) and-or graph induced by the domain. The algorithm generates conditional plans that are guaranteed to achieve the goal...}},
added-at = {2011-05-04T16:04:17.000+0200},
author = {Bertoli, Piergiorgio and Cimatti, Alessandro and Roveri, Marco and Traverso, Paolo},
biburl = {https://www.bibsonomy.org/bibtex/2da29429661c9c0b19a7fad33086326b6/baisemain},
booktitle = {IJCAI},
citeulike-article-id = {1402236},
citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.448},
interhash = {5ace03fccc201ca8e818411efd458738},
intrahash = {da29429661c9c0b19a7fad33086326b6},
keywords = {model-checking, planning},
pages = {473--478},
posted-at = {2007-06-21 11:47:57},
priority = {2},
timestamp = {2011-05-04T16:04:37.000+0200},
title = {{Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking}},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.448},
year = 2001
}