An Improved IPP Planning Algorithm and the Application

Abstract

Most of planners can’t avoid state combinatorial explosion which is a main problem to planning failure. To solve it, the paper brings forward the arithmetic of goal decomposition and initial decompositioin to partition the fact file for planner, thereby to reduce number of combinated states. But then, for the planners in being can’t deal with the multiple fact files, to settle which, withal, the paper introduces the arithmetic of multi-fact file management. The application for three arithmetics is on IPP possessing preferable performance. The modified planner is called MF-IPP which is able to handle multiple fact files for avoiding the combinatorial explosion. At last, we compared the performance of the two planners, and the result showed that MF-IPP can avoid the combinatorial explosion well, and the test case covering rate is meseasued by two novel rules.