Fast strong planning for fully observable nondeterministic planning problems

作者：Fu Jicheng^*; Jaramillo Andres Calderon; Ng Vincent; Bastani Farokh B; Yen I Ling

来源：Annals of Mathematics and Artificial Intelligence, 2016, 78(2): 131-155.

DOI：10.1007/s10472-016-9517-7

• Fully observable nondeterministic planning (FOND)
• Strong-cyclic planning
• Strong planning
• Weak planning

The ability to find strong solutions to fully observable nondeterministic (FOND) planning problems, if they exist, is desirable because unlike weak and strong-cyclic solutions, strong solutions are guaranteed to achieve the goal. However, only limited work has been done on FOND planning with strong solutions. In this paper, we present a sound and complete strong planning algorithm and incorporate it into our planner, FIP, which has achieved outstanding performance on strong cyclic planning problems. This new strong planning approach enables FIP to first search for strong solutions, and then search for strong-cyclic solutions only if strong solutions do not exist. We conduct extensive experiments to evaluate the new strong planning approach to (1) find a strong solution if one exists and (2) determine the non-existence of a strong solution. Experimental results demonstrate the superior performance of our planner to Gamer and MBP, the two best-known planners capable of solving strong FOND planning problems, on a variety of benchmark problems. Not only is our planner on average three orders of magnitude faster than Gamer and MBP, but it also scales up to larger problems.

• 出版日期2016-10