Using classical planners to solve nondeterministic planning problems
Ugur Kuter, Dana S. Nau, Elnatan Reisner, Robert P. Goldman · 2008
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 solu-tions in fully-observable nondeterministic planning domains. Our experiments show that when using our technique with FF and SGPlan (two well-known classical planners), its perfor-mance compares quite favorably to that of MBP, one of the best-known planners for nondeterministic planning problems.