Planning with Reduced Operator Sets

Classical propositional STRIPSplanning is nothing but the search for a path in the state-transition graph induced by the operators in the planning problem. What makes the problem hard is the size and the sometimesadverse structure of this graph. Weconjecture that the search for a plan wouldbe moreefficient if there were only a small numberof paths from the initial state to the goal state. Toverify this conjecture, we define the notion of reducedoperator sets and describe ways of finding such reduced sets. We demonstrate that somestate-of-the-art planners run faster using reduced operator sets.

Authors

• Patrik Haslum
• Peter Jonsson

Keywords

No keywords are indexed for this paper.