Decomposition of planning problems

  • Authors:

  • Laura Sebastia;Eva Onaindia;Eliseo Marzal

  • Affiliations:

  • Technical University of Valencia, Valencia, Spain;Technical University of Valencia, Valencia, Spain;Technical University of Valencia, Valencia, Spain

  • Venue:
  • AI Communications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The ability to decompose a problem into manageable sub-components is a necessity in complex problem-solving tasks. In planning, the application of a divide-and-conquer methodology is known as planning decomposition. This technique consists of the following: decomposing a problem into smaller components (subproblems), solving these subproblems individually, and then combining the obtained solutions. The success of this technique is subject to the interactions that may appear between actions from solutions for different subproblems.In this paper, we present a novel technique, STeLla, to overcome the inherent difficulties in planning decomposition. This technique partitions a planning problem in such a way that its subproblems can then be solved separately (either sequentially or concurrently) and their solutions can be easily combined. The key issue is that interactions among goals are used to come up with the problem decomposition rather than solving them once the problem is decomposed. This approach proves to be very beneficial with respect to other decomposition methods and state-of-the-art planners.