Ugur Kuter, Dana Nau, Elnatan Reisner, Robert P. Goldman
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.
Subjects: 1.11 Planning; 15.7 Search
Submitted: Jun 27, 2008