Inproceedings,
Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking
IJCAI, page 473--478. (2001)
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...
