Decomposition has proved an effective strategy in planning, with one decomposition-based planner, SGPLAN, exhibiting strong performance in the last two IPCs. By decomposing planning problems into several loosely coupled subproblems, themselves planning problems, a planner can be used to solve each of the subproblems individually. The subplans can then be combined to form a solution to the original problem. When planning for subproblems, it is necessary to account for the interactions between the actions used to solve the current sub-problem and the actions chosen to solve other subproblems. The approach taken in SGPLAN is inspiring, but some aspects of the decomposition process are not fully described in the literature. In particular, how subplans are merged to form a complete plan is not discussed anywhere in detail. This paper presents an approach to planning at this subproblem level, detailing how the choices made whilst solving one subprob-lem can be influenced by the conflicts with other subproblems, and introduces a novel technique employing wait events that can be included in subproblem solution plans to allow the context of the existing schedule to be directly considered.
[1]
NebelBernhard,et al.
The FF planning system
,
2001
.
[2]
Yixin Chen,et al.
Temporal Planning using Subgoal Partitioning and Resolution in SGPlan
,
2006,
J. Artif. Intell. Res..
[3]
Ivan Serina,et al.
LPG: A Planner Based on Local Search for Planning Graphs with Action Costs
,
2002,
AIPS.
[4]
Daniel S. Weld,et al.
UCPOP: A Sound, Complete, Partial Order Planner for ADL
,
1992,
KR.
[5]
S. Edelkamp,et al.
The Deterministic Part of IPC-4: An Overview
,
2005,
J. Artif. Intell. Res..
[6]
Subbarao Kambhampati,et al.
Reviving Partial Order Planning
,
2001,
IJCAI.
[7]
Bernhard Nebel,et al.
The FF Planning System: Fast Plan Generation Through Heuristic Search
,
2011,
J. Artif. Intell. Res..
[8]
Qiang Yang,et al.
Intelligent planning - a decomposition and abstraction based approach
,
1997,
Artificial intelligence.