root / trunk / code / projects / colonet / ColonetServer / PositionMonitor.cpp @ 458
History | View | Annotate | Download (3.21 KB)
1 |
/**
|
---|---|
2 |
* @file PositionMonitor.cpp
|
3 |
*
|
4 |
* @author Jason Knichel
|
5 |
*
|
6 |
* @date 2/4/08
|
7 |
*/
|
8 |
|
9 |
//TODO: make this file asynchronous
|
10 |
|
11 |
#include <PositionMonitor.h> |
12 |
#include <stdlib.h> |
13 |
#include <vision.h> |
14 |
|
15 |
#include <stdio.h> |
16 |
|
17 |
#include <map> |
18 |
using namespace std; |
19 |
|
20 |
PositionMonitor::PositionMonitor() { |
21 |
//TODO: don't hardcode this file name
|
22 |
//TODO: check for error returned from init
|
23 |
vision_init("/var/www/colonet.jpg");
|
24 |
newIdToAssign = 0;
|
25 |
} |
26 |
|
27 |
PositionMonitor::~PositionMonitor() { |
28 |
} |
29 |
|
30 |
int PositionMonitor::startMonitoring() {
|
31 |
//TODO: fill this in when this becomes asynchronous
|
32 |
return 0; |
33 |
} |
34 |
|
35 |
int PositionMonitor::stopMonitoring() {
|
36 |
//TODO: fill this in when this becomes asynchronous
|
37 |
return 0; |
38 |
} |
39 |
|
40 |
int PositionMonitor::updatePositions() {
|
41 |
VisionPosition * positions = NULL;
|
42 |
|
43 |
//TODO: check for error returned
|
44 |
int numPositions = vision_get_robot_positions(&positions);
|
45 |
|
46 |
/*
|
47 |
//TODO: compare current set of positions to previous set of
|
48 |
// positions to match up who is who
|
49 |
positionMap.clear();
|
50 |
|
51 |
int i;
|
52 |
for (i = 0; i < numPositions; i++) {
|
53 |
//TODO: would this insert by copy or just point to the memory in positions[i]?
|
54 |
// If this just points to the memory in positions[i] then we have a bug
|
55 |
positionMap[i] = positions[i];
|
56 |
}
|
57 |
*/
|
58 |
|
59 |
//TODO: also remove robots that might have disappeared
|
60 |
int i;
|
61 |
for (i = 0; i < numPositions; i++) { |
62 |
VisionPosition newPos = positions[i]; |
63 |
map<int, VisionPosition>::iterator iter;
|
64 |
for (iter = positionMap.begin(); iter != positionMap.end(); iter++) {
|
65 |
VisionPosition oldPos = iter->second; |
66 |
|
67 |
if (isProbablySameRobot(newPos, oldPos)) {
|
68 |
//TODO: is this the right use of an iterator?
|
69 |
iter->second = newPos; |
70 |
break;
|
71 |
} |
72 |
} |
73 |
|
74 |
if (iter == positionMap.end()) {
|
75 |
//a position was found that probably isn't a known robot so add it in case a new robot entered the field
|
76 |
positionMap.insert(make_pair(newIdToAssign, newPos)); |
77 |
newIdToAssign++; |
78 |
} |
79 |
} |
80 |
|
81 |
//TODO: remove this debug information
|
82 |
map<int, VisionPosition>::iterator iter;
|
83 |
for (iter = positionMap.begin(); iter != positionMap.end(); iter++) {
|
84 |
printf("%d has position (%d, %d)\n", iter->first, iter->second.x, iter->second.y);
|
85 |
} |
86 |
|
87 |
if (positions)
|
88 |
free(positions); |
89 |
|
90 |
return 0; |
91 |
} |
92 |
|
93 |
int PositionMonitor::assignRealId(int old_id, int real_id) { |
94 |
printf("assigning real_id %d to old_id %d\n", real_id, old_id);
|
95 |
|
96 |
map<int,VisionPosition>::iterator iter = positionMap.find(old_id);
|
97 |
|
98 |
if (iter == positionMap.end()) {
|
99 |
fprintf(stderr, "assignRealId: old_id not found\n");
|
100 |
return -1; |
101 |
} |
102 |
|
103 |
positionMap.insert(make_pair(real_id, iter->second)); |
104 |
positionMap.erase(old_id); |
105 |
|
106 |
return 0; |
107 |
} |
108 |
|
109 |
map<int, VisionPosition> PositionMonitor::getAllRobotPositions() {
|
110 |
return positionMap;
|
111 |
} |
112 |
|
113 |
int PositionMonitor::getRobotPosition(int robot_id, int* xbuf, int* ybuf) { |
114 |
//TODO: figure out what a map returns if the element doesn't exist
|
115 |
if (positionMap.find(robot_id) == positionMap.end()){
|
116 |
return -1; |
117 |
} |
118 |
|
119 |
VisionPosition pos = positionMap[robot_id]; |
120 |
|
121 |
*xbuf = pos.x; |
122 |
*ybuf = pos.y; |
123 |
|
124 |
return 0; |
125 |
} |
126 |
|
127 |
bool PositionMonitor::isProbablySameRobot(VisionPosition p1, VisionPosition p2) {
|
128 |
int xDiff = p1.x - p2.x;
|
129 |
int yDiff = p1.y - p2.y;
|
130 |
return (xDiff*xDiff + yDiff*yDiff < MAX_DISTANCE*MAX_DISTANCE);
|
131 |
} |