Abstract
Intelligent agents acting in real world environments need to synthesize their course of action based on multiple sources of knowledge. They also need to generate plans that smoothly integrate actions from different domains. In this paper we present a generic approach to synthesize plans for solving planning problems involving multiple domains. The proposed approach performs search hierarchically by starting planning in one domain and considering subgoals related to the other domains as abstract tasks to be planned for later when their respective domains are considered. To plan in each domain, a domain-dependent planner can be used, making it possible to integrate different planners, possibly with different specializations. We outline the algorithm, and the assumptions underlying its functionality. We also demonstrate through a detailed example, how the proposed framework compares to planning in one global domain.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amir, E., Engelhardt, B.: Factored planning. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico, pp. 929–935. Morgan Kaufmann, San Francisco (2003)
Lotem, A., Nau, D., Cao, Y., Muñoz-Avila, H.: Shop: Simple hierarchical ordered planner. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI), pp. 968–973 (1999)
Erol, K., Hendler, J.A., Nau, D.S.: UMCP: A sound and complete procedure for hierarchical task-network planning. In: Artificial Intelligence Planning Systems, pp. 249–254 (1994)
Fink, E., Yang, Q.: Automatically abstracting the effects of operators. In: Hendler, J. (ed.) Proceedings of the 1st International Conference on Artificial Intelligence Planning Systems (AIPS 1992), College Park, Maryland, USA, pp. 243–251. Morgan Kaufmann, San Francisco (1992)
Giunchiglia, F., Villafiorita, A., Walsh, T.: Theories of abstraction. Artificial Intelligence Communications 10(3-4), 167–176 (1997)
Karlsson, L.: Conditional progressive planning under uncertainty. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI), pp. 431–438 (2001)
Knoblock, C.A.: Learning abstraction hierarchies for problem solving. In: Dietterich, T., Swartout, W. (eds.) Proceedings of the 8th National Conference on Artificial Intelligence, Menlo Park, California. AAAI Press, Menlo Park (1990)
Knoblock, C.A.: Automatically generating abstractions for planning. Artificial Intelligence 68(2), 243–302 (1994)
Koehler, J.: Solving complex planning tasks through extraction of subproblems. In: Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (AIPS 1998), pp. 62–69 (1998)
Lansky, A.L., Getoor, L.: Scope and abstraction: Two criteria for localized planning. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1612–1619 (1995)
Llavori, R.B.: Strplan: A distributed planner for object-centered application domains. Applied Intelligence 10(2-3), 259–275 (1999)
Nau, D.S., Au, T.C., Ilghami, O., Kuter, U., Murdock, W., Wu, D., Yaman, F.: SHOP2: An HTN planning system. Journal of Artificial Intelligence Research 20, 379–404 (2003)
Porteous, J., Sebastia, L., Hoffmann, J.: On the extraction, ordering, and usage of landmarks in planning. In: Proceedings of the 6th European Conference on Planning, ECP 2001 (2001)
Sacerdoti, E.D.: Planning in a hierarchy of abstraction spaces. Artificial Intelligence 5(2), 115–135 (1974)
Smith, D.E., Peot, M.A.: A critical look at knoblock’s hierarchy mechanism. In: Hendler, J. (ed.) Proceedings of the 1st International Conference on Artificial Intelligence Planning Systems (AIPS 1992), pp. 307–308. Kaufmann, San Mateo (1992)
Wah, B.W., Chen, Y.: Partitioning of temporal planning problems in mixed space using the theory of extended saddle points. In: 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), pp. 266–273 (2003)
Wilkins, D.E.: Practical Planning: extending the classical AI paradigm. Morgan Kaufmann, San Francisco (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouguerra, A., Karlsson, L. (2005). Synthesizing Plans for Multiple Domains. In: Zucker, JD., Saitta, L. (eds) Abstraction, Reformulation and Approximation. SARA 2005. Lecture Notes in Computer Science(), vol 3607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527862_3
Download citation
DOI: https://doi.org/10.1007/11527862_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27872-6
Online ISBN: 978-3-540-31882-8
eBook Packages: Computer ScienceComputer Science (R0)