Synthesizing plans for multiple domains

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Bouguerra, A., & Karlsson, L. (2005). Synthesizing plans for multiple domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3607 LNAI, pp. 30–43). Springer Verlag. https://doi.org/10.1007/11527862_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free