5 using namespace __gnu_cxx;
7 Planner::Planner(std::vector<Action> actions, literals init, literals goal){
9 _start = new Node(Action("start",literals(), init));
11 Node* finish = new Node(Action("finish",goal,literals()));
13 for(vector<Action>::iterator action = actions.begin(); action != actions.end(); ++action){
14 const literals& effects = action->effects();
15 for (literals::const_iterator effect = effects.begin(); effect != effects.end(); ++effect){
16 cerr << "Adding effect: " << *effect << endl;
17 _actions[*effect] = *action;
24 void Planner::makePlan(Node* node){
25 cerr << "Fetching preconditions for action: " << node->action().executable() << ".. ";
26 const literals& preconds = node->action().preconditions();
27 cerr << "done" << endl;
29 if (preconds.size() == 0){
30 cerr << "Found no preconds" << endl;
31 _start->addChild(node);
33 for (literals::const_iterator precond = preconds.begin(); precond != preconds.end(); ++precond){
34 cerr << "Looking for: " << *precond << endl;
35 hash_map<string,Node*>::iterator addedNode = _addedNodes.find(*precond);
36 if(addedNode != _addedNodes.end()){
37 cerr << "Using already added node" << endl;
38 addedNode->second->addChild(node);
40 hash_map<string, Action>::iterator action = _actions.find(*precond);
41 if (action != _actions.end()){
42 cerr << "Adding new node" << endl;
43 Node* newnode = new Node(action->second);
44 newnode->addChild(node);
48 cerr << "Action with effect: " << *precond << " not found!" << endl;
55 void Planner::addNode(Node* node){
56 const literals& effects = node->action().effects();
58 for (literals::const_iterator effect = effects.begin(); effect != effects.end(); ++effect){
59 cout << "Adding node for effect: " << *effect << endl;
60 _addedNodes[*effect] = node;
65 void Planner::execute(){
66 _start->execute(literals());