Generating Parallel Execution Plans with a Partial-order Planner

Manyreal-world planning problems require generating plans that maximizethe parallelism inherent in a problem. There are a numberof partial-order planners that generate such plans; however, in most of these planners it is unclear under what conditions the resulting plans will be correct and whetherthe plaltner can evenfind a plan if one exists. This paperidentifies the underlying assumptionsabout whena partial plan can be executedin parallel, defines the classes of parallel plans that can be generatedby different partialorder planners, and describes the changes required to turn ucPoPinto a parallel execution planner. In "addition, we describe howthis planner can be applied to the problemof query access planning, where parallel execution produces substantial reductions in overall execution time.

Authors

• Craig A. Knoblock

Keywords

No keywords are indexed for this paper.