SAT-Based Parallel Planning Using a Split Representation of Actions

Planning based on propositional SAT(isfiability) is a powerful approach to computing step-optimal plans given a parallel execution semantics. In this setting: (i) a solution plan must be minimal in the number of plan steps required, and (ii) non-conflicting actions can be executed instantaneously in parallel at a plan step. Underlying SAT-based approaches is the invocation of a decision procedure on a SAT encoding of a bounded version of the problem. A fundamental limitation of existing approaches is the size of these encodings. This problem stems from the use of a direct representation of actions

• Type: Conference
• Year: 2009
• Where: AIPS
• Authors: Nathan Robinson, Charles Gretton, Duc Nghia Pham, Abdul Sattar
• Keywords: AIPS 2009, Artificial Intelligence, Parallel Execution, Plan Step, SAT Encodings