Using Classical Planners to Solve Nondeterministic Planning Problems

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.

• Type: Conference
• Year: 2008
• Where: AIPS
• Authors: Ugur Kuter, Dana S. Nau, Elnatan Reisner, Robert P. Goldman
• Keywords: AIPS 2008, Artificial Intelligence, Nondeterministic Planning, Nondeterministic Planning Domains, Planning Problems