Previous: AIDA-97-08 Next: AIDA-98-01 Index 1997


Intellectics Group: Technical Report 97-09

Restraining and Complete Refinement Planning

Ulrich Scholz

Planning is a very hard task, so even reducing a specific planning problem to a sightly easier one can often be of much help. Many domains have properties which allow this reduction with reasonable effort. This paper shows that besides using complete refinement, it can be helpful to search only for a subset of all possible solutions and presents examples of both strategies. They are demonstrated by solving large problems of domains presented by Barret and Weld, and the Flat Tire problem during the simplification step.

Full Paper: Compressed postscript Compressed DVI

BibTeX entry