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 underwhatconditions the resulting plans will be correct andwhetherthe plaltner canevenfind a plan if oneexists. Thispaperidentifies 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 changesrequired to turn ucPoPinto a parallel execution planner. In "addition, wedescribe howthis planner can be applied to the problemof queryaccess planning, whereparallel execution producessubstantial reductions in overall execution time.

• Type: Conference
• Year: 1994
• Where: AIPS
• Authors: Craig A. Knoblock
• Keywords: AIPS 1994, Artificial Intelligence, Execution Producessubstantial Reductions, Numberof Partial-order Planners, Parallel Execution Planner