Colony

/**

 * @file PositionMonitor.cpp

 *

 * @author Jason Knichel

 *

 * @date 2/4/08

 */

//TODO: make this file asynchronous

#include <PositionMonitor.h>

#include <stdlib.h>

#include <vision.h>

#include <stdio.h>

#include <map>

using namespace std;

PositionMonitor::PositionMonitor() {

  //TODO: don't hardcode this file name

  //TODO: check for error returned from init

  vision_init("/var/www/colonet.jpg");

  newIdToAssign = -1;

}

PositionMonitor::~PositionMonitor() {

}

int PositionMonitor::startMonitoring() {

  //TODO: fill this in when this becomes asynchronous

  return 0;

}

int PositionMonitor::stopMonitoring() {

  //TODO: fill this in when this becomes asynchronous

  return 0;

}

int PositionMonitor::updatePositions() {

  VisionPosition * positions = NULL;

  //TODO: check for error returned

  int numPositions = vision_get_robot_positions(&positions);

  printf("numPositions is %d\n", numPositions);

  for (int i = 0; i < numPositions; i++) {

    printf("{%d,%d} ", positions[i].x, positions[i].y);

  }

  printf("\n");

  /*

  //TODO: compare current set of positions to previous set of

  // positions to match up who is who

  positionMap.clear();

  int i;

  for (i = 0; i < numPositions; i++) {

    //TODO: would this insert by copy or just point to the memory in positions[i]?

    //      If this just points to the memory in positions[i] then we have a bug

    positionMap[i] = positions[i];

  }

  */

  //TODO: also remove robots that might have disappeared

  int i;

  for (i = 0; i < numPositions; i++) {

    VisionPosition newPos = positions[i];

    map<int, VisionPosition>::iterator iter;

    for (iter = positionMap.begin(); iter != positionMap.end(); iter++) {

      VisionPosition oldPos = iter->second;

      if (isProbablySameRobot(newPos, oldPos)) {

        //TODO: is this the right use of an iterator?

        iter->second = newPos;

        break;

      }

    }

    if (iter == positionMap.end()) {

      printf("Inserting new robot: %d (%d,%d)", newIdToAssign, newPos.x, newPos.y);

      //a position was found that probably isn't a known robot so add it in case a new robot entered the field

      positionMap.insert(make_pair(newIdToAssign, newPos));

      newIdToAssign--;

    }

  }

  //TODO: remove this debug information

  map<int, VisionPosition>::iterator iter;

  for (iter = positionMap.begin(); iter != positionMap.end(); iter++) {

    printf("%d has position (%d, %d)\n", iter->first, iter->second.x, iter->second.y);

  }

  if (positions)

    free(positions);

  return 0;

}

int PositionMonitor::assignRealId(int old_id, int real_id) {

  printf("assigning real_id %d to old_id %d\n", real_id, old_id);

  map<int,VisionPosition>::iterator iter = positionMap.find(old_id);

  if (iter == positionMap.end()) {

    fprintf(stderr, "assignRealId: old_id not found\n");

    return -1;

  }

  positionMap.insert(make_pair(real_id, iter->second));

  positionMap.erase(old_id);

  return 0;

}

map<int, VisionPosition> PositionMonitor::getAllRobotPositions() {

  //TODO do this in another thread!

  updatePositions();

  return positionMap;

}

int PositionMonitor::getRobotPosition(int robot_id, int* xbuf, int* ybuf) {

  //TODO: figure out what a map returns if the element doesn't exist

  if (positionMap.find(robot_id) == positionMap.end()){

    return -1;

  }

  VisionPosition pos = positionMap[robot_id];

  *xbuf = pos.x;

  *ybuf = pos.y;

  return 0;

}

bool PositionMonitor::isProbablySameRobot(VisionPosition p1, VisionPosition p2) {

  int xDiff = p1.x - p2.x;

  int yDiff = p1.y - p2.y;

  return (xDiff*xDiff + yDiff*yDiff < MAX_DISTANCE*MAX_DISTANCE);

}