Flexible Conformant Graphplan

The conformant planner has enjoyed great success in non-deterministic planning domain. However, the conformant planning problems are still cast in terms of imperative constraints that are either wholly satisfied or wholly violated. It is argued herein that this framework is too rigid to capture the full subtlety of many real problems. This paper introduces the notion of flexible constraint into conformant planning and introduces a novel flexible conformant planning problem, namely conformant flexible planning problem. We also put forward a Graph plan-based algorithm to solve this problem. The method takes into account user´s requirement and taste, therefore, it can improve the quality of a plan comprehensively, and make the solution plan more suitable for the needs. In this sense, it can handle the planning problems much closer to the real world.