AAAI Publications, Twentieth International Conference on Automated Planning and Scheduling

Font Size: 
Pattern Database Heuristics for Fully Observable Nondeterministic Planning
Robert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher

Last modified: 2010-04-20


When planning in an uncertain environment, one is often interested in finding a contingent plan that prescribes appropriate actions for all possible states that may be encountered during the execution of the plan. We consider the problem of finding strong cyclic plans for fully observable nondeterministic (FOND) planning problems. The algorithm we choose is LAO*, an informed explicit state search algorithm. We investigate the use of pattern database (PDB) heuristics to guide LAO* towards goal states. To obtain a fully domain-independent planning system, we use an automatic pattern selection procedure that performs local search in the space of pattern collections. The evaluation of our system on the FOND benchmarks of the Uncertainty Part of the International Planning Competition 2008 shows that our approach is competitive with symbolic regression search in terms of problem coverage, speed, and plan quality.


strong cyclic planning; PDB heuristics

Full Text: PDF