Using Classical Planners to Solve Nondeterministic Planning Problems.

Kuter, U., Nau, D., Reisner, E. and Goldman, R. (2008)
In Proceedings of the NATO RTO Symposium HFM-142 on Adaptability in Coalition Teamwork. 21-23 April. Copenhagen.

PDF download: [pdf]
 

Keywords: classic planners, algorithms, conjunctive abstraction, experimental evaluation

Abstract: Researchers have developed a huge number of algorithms to solve classical planning problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic solutions in fully-observable nondeterministic planning domains. Our experiments show that when using our technique with FF and SGPlan (two well-known classical planners), its performance compares quite favorably to that of MBP, one of the best-known planners for nondeterministic planning problems.