In this paper we will use the framework to study cooperative heuristic multi-agent planning. During the construction of their plans, the agents use a heuristic function inspired by the FF planner (l3l). At any time in the process of planning the agents may exchange available resources, or they may request an agent to produce a missing resource. The latter feature is anabled by an advertising mechanism: Any agent communicates to the other agents which resources it can, in principle, produce using a plan scheme stored in its knowledge base. The planning algorithm presented in this paper is sound but not complete: It might fail to find a plan in cases a valid plan does exist.