Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
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)
Schubert, L.K., Gerevini, A.: Accelerating partial order planners by improving plan and goal choices. In: Proc. of the 7th IEEE International Conference on Tools with AI, pp. 442–450. IEEE Computer Society Press, Los Alamitos (1995)
Tsuneto, R., Nau, D., Hendler, J.: Plan-refinement strategies and search-space size. In: Steel, S., Alami, R. (eds.) ECP 1997. LNCS, vol. 1348, pp. 414–426. Springer, Heidelberg (1997)
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)
Schattenberg, B., Weigl, A., Biundo, S.: Hybrid planning using flexible strategies. In: Furbach, U. (ed.) KI 2005. LNCS (LNAI), vol. 3698, pp. 258–272. Springer, Heidelberg (2005)
Schattenberg, B., Biundo, S.: A unifying framework for hybrid planning and scheduling. In: Freksa, C., Kohlhase, M., Schill, K. (eds.) KI 2006. LNCS (LNAI), vol. 4314, pp. 361–373. Springer, Heidelberg (2007)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schattenberg, B., Bidot, J., Biundo, S. (2007). On the Construction and Evaluation of Flexible Plan-Refinement Strategies. In: Hertzberg, J., Beetz, M., Englert, R. (eds) KI 2007: Advances in Artificial Intelligence. KI 2007. Lecture Notes in Computer Science(), vol 4667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74565-5_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-74565-5_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74564-8
Online ISBN: 978-3-540-74565-5
eBook Packages: Computer ScienceComputer Science (R0)