$search

test_adjacency_list.cpp

Go to the documentation of this file.

#include <iostream>

using namespace std;

#include "../discrete_space_information/precomputed_adjacency_list/environment_precomputed_adjacency_list.h"


// 2d Points
struct Point2D
{
  Point2D(int newX, int newY) : x(newX), y(newY) {}

  int heuristicDistanceTo (const Point2D& p) { int dx=p.x-x; int dy=p.y-y; int dist=((int)sqrt(dx*dx+dy*dy));  return dist; }

  int x;
  int y;
};

ostream& operator<< (ostream& stream, Point2D p)
{
  stream << "(" << p.x << ", " << p.y << ")";
  return stream;
}

int operator< (const Point2D& p1, const Point2D& p2)
{
  return (p1.x<p2.x) || ((p1.x==p2.x) && (p1.y<p2.y));
}






void testPlanner (AdjacencyListSBPLEnv<Point2D>& e)
{
  int sol_cost;
  e.writeToStream();
  vector<Point2D> solution = e.findOptimalPath (&sol_cost);
  cout << "Returned plan is ";
  for (unsigned int i=0; i<solution.size(); i++) {
    cout << solution[i] << " ";
  }
  cout << endl;
}  




int main (int, char**)
{
  AdjacencyListSBPLEnv<Point2D> e;
  Point2D p1(0,0);
  Point2D p2(2,1);
  Point2D p3(1,4);
  Point2D p4(5,5);

  e.addPoint(p1);
  e.addPoint(p4);
  e.addPoint(p3);
  e.addPoint(p2);

  e.setCost(p1,p2,4);
  e.setCost(p1,p3,6);
  e.setCost(p3,p4,5);
  e.setCost(p2,p4,15);

  e.setStartState(p1);
  e.setGoalState(p4);

  // Initialize the MDPConfig (what does this do exactly?)
  //MDPConfig c;
  //e.InitializeMDPCfg(&c);


  // Tests
  testPlanner (e);
  e.setCost(p2,p4,1);
  testPlanner (e);
  e.removeLastPoints();
  testPlanner (e);
  e.writeToStream();
  return 0;
}

---

sbpl
Author(s): Maxim Likhachev/maximl@seas.upenn.edu
autogenerated on Fri Mar 1 14:18:57 2013