On the Construction and Evaluation of Flexible Plan-Refinement Strategies
This paper describes a system for the systematic construction and evaluation of planning strategies. It is based on a proper formal account of refinement planning and allows to decouple plan-deficiency detection, refinement computation, and search control. In adopting this methodology, planning strategies can be explicitly described and easily deployed in various system configurations.
We introduce novel domain-independent planning strategies that are applicable to a wide range of planning capabilities and methods. These so-called HotSpot strategies are guided by information about current plan defects and solution options. The results of a first empirical performance evaluation are presented in the context of hybrid planning.
Unable to display preview. Download preview PDF.
- 1.Joslin, D., Pollack, M.: Least-cost flaw repair: A plan refinement strategy for partial-order planning. In: Hayes-Roth, B., Korf, R. (eds.) Proc. of the 12th National Conference on AI, pp. 1004–1009. AAAI (1994)Google Scholar
- 2.Peot, M.A., Smith, D.: Threat removal strategies for partial-order planning. In: Proc. of the 11th National Conference on AI, pp. 492–499 (1993)Google Scholar
- 5.McCluskey, T.L.: Object transition sequences: A new form of abstraction for HTN planners. In: Chien, S., Kambhampathi, R., Knoblock, C. (eds.) Proc. of the 5th International Conference on AI Planning Systems, pp. 216–225. AAAI (2000)Google Scholar
- 8.Biundo, S., Schattenberg, B.: From abstract crisis to concrete relief – A preliminary report on combining state abstraction and HTN planning. In: Cesta, A., Borrajo, D. (eds.) Proc. of the 6th European Conference on Planning (2001)Google Scholar