ECAI 2004 Conference Paper

Concurrent Planning by Decomposition

Laura Sebastia, Eva Onaindia, Eliseo Marzal

Planning is known to be a difficult task. One of the approaches that can be used to reduce this difficulty is problem decomposition. This paper introduces a new decomposition technique for planning problems in STRIPS domains which is based on the idea of landmark, that is, literals that must be true in any solution plan. Landmarks are ordered and grouped in different sequential sets named intermediate goals (IG), being each IG a sub-goal to solve. Then, we build the initial state (IS) corresponding to each IG, such that each pair (IS, IG) is viewed as an independent problem. This way a multiprocessor system can be used to solve these problems concurrently.

Keywords: Planning, Problem decomposition

Citation: Laura Sebastia, Eva Onaindia, Eliseo Marzal: Concurrent Planning by Decomposition. In R.López de Mántaras and L.Saitta (eds.): ECAI2004, Proceedings of the 16th European Conference on Artificial Intelligence, IOS Press, Amsterdam, 2004, pp.1087-1088.

ECAI-2004 is organised by the European Coordinating Committee for Artificial Intelligence (ECCAI) and hosted by the Universitat Politècnica de València on behalf of Asociación Española de Inteligencia Artificial (AEPIA) and Associació Catalana d'Intel-ligència Artificial (ACIA).