Abstract: In classical planning, the aim is to find a sequence of actions that transforms a given initial state Z to some state satisfying goals G.Partial satisfaction planning is one of key point in planning problem.In partial satisfaction planning^1-2, each goal has a utility value u_g≥0, representing how mach each goal is worth to a user;each action a∈A has an associated execution cost C_a≥0, representing how costly it is to execute each action.Let P be the set of all valid plans and let G_p∈G be the set of goals achieved by a plan.The objective is to find a plan P that maximizes the difference between total achieved utility u and total cost of all actions: arg p∈P max sum (u_g) from g∈G_p-sum (C_a) from c∈p.This article gives a new heuristic search algorithm for partial satisfaction planning.It confirms their effective through the examples.