
[full paper] 
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 subgoal 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.10871088.