On transformation of conditional, conformant and parallel planning to linear programming

Abstract

Classical planning in Artificial Intelligence is a computationally expensive problem of finding a sequence of actions that transforms a given initial state of the problem to a desired goal situation. Lack of information about the initial state leads to conditional and conformant planning that is more difficult than classical one. A parallel plan is the plan in which some actions can be executed in parallel, usually leading to decrease of the plan execution time but increase of the difficulty of finding the plan. This paper is focused on three planning problems which are computationally difficult: conditional, conformant and parallel conformant. To avoid these difficulties a set of transformations to Linear Programming Problem (LPP), illustrated by examples, is proposed. The results show that solving LPP corresponding to the planning problem can be computationally easier than solving the planning problem by exploring the problem state space. The cost is that not always the LPP solution can be interpreted directly as a plan.

Keywords

• planning
• conformant planning
• conditional planning
• parallel planning
• uncertainty
• linear programming
• computational complexity