Conformant Planning via Symbolic Model Checking

@article{Cimatti2000ConformantPV,
  title={Conformant Planning via Symbolic Model Checking},
  author={Alessandro Cimatti and Marco Roveri},
  journal={J. Artif. Intell. Res.},
  year={2000},
  volume={13},
  pages={305-338}
}
We tackle the problem of planning in nondeterministic domains, by presenting a new approach to conformant planning. Conformant planning is the problem of nding a sequence of actions that is guaranteed to achieve the goal despite the nondeterminism of the domain. Our approach is based on the representation of the planning domain as a nite state automaton. We use Symbolic Model Checking techniques, in particular Binary Decision Diagrams, to compactly represent and eÆciently search the automaton… CONTINUE READING