A New Graphplan Method to Implement Partial Goals

Several new concepts are introduced, such as single satisfaction, synthesis satisfaction and sub-optimal plan. With those concepts a new algorithm based on Graphplan is presented. A lot of restrictions make the Graphplan planner far from the real world. The new algorithm inherits all the capabilities of Graphplan. Except this, it also adapted to other situations. For a problem, if Graphplan can´t find a solution implementing all the goals, the new method outputs a best sub-optimal solution, which can implement part of goals. And these partial goals can satisfy user as much as possible. In many complex circumstances, relaxing partial rigid restrictions can solve a problem more expressive and more effective