Research Of Flexible Planning Algorithm Based On Heuristic Searching

Now Intelligent planning is one of the most important research fields in AI. Because of its wide application researchers pay much attention to planning technology. But along with the process of intelligent planning from theoretics to applications research, researchers find that classical planning cann't satisfy the demand of practice applications. Becasuse planning problem itself is a very hard problem to be solved and there are many indeterminacy factors. Traditionally, planning problems are cast in terms of imperative constraints that are either wholly satisfied or wholly violated, which limits the classical planning algorithms only to solve small-scaled model planning problems. It is argued herein that this framework is too rigid to capture the full subtlety of many real problems. In order to sovle the problem above, it gives birth to a new planning problem named flexible planning problem. A new flexible planning problem is defined which supports the soft constraints often found in reality.I study flexible planning and heuristic searching theory deeply in order to apply them to flexible planning problem. In this paper, I present the thought of dealing with flexible planning problem using heuristic searching and create the solving model of flexible planning.This research on flexible planning is very important both theoretically and practically.