A Conformant Planner with Explicit Disjunctive Representation of Belief States

Vol. 19 (2009): Nineteenth International Conference on Automated Planning and Scheduling

Volume

Vol. 19 (2009): Nineteenth International Conference on Automated Planning and Scheduling

Long Papers

This paper describes a novel and competitive complete conformant planner. Key to the enhanced performance is an efficient encoding of belief states as disjunctive normal form formulae and an efficient procedure for computing the successor belief state. We provide experimental comparative evaluation on a large pool of benchmarks. The novel design provides great efficiency and enhanced scalability, along with the intuitive structure of disjunctive normal form representations.

10.1609/icaps.v19i1.13378