-
Notifications
You must be signed in to change notification settings - Fork 0
/
RW-Chasing.cpp
45 lines (32 loc) · 1.48 KB
/
RW-Chasing.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include "stdSysImports.h"
#include "bresenham.h"
using std::string;
/*
############# README ###########
analyzing and simulating u is chasing a randomwalking v
(not using this for training but seeing how well the model can classify dynamic trajectories)
*/
int main() {
std::ofstream myfile;
myfile.open("RW-Chasing.csv");
int trajectories, timesteps, buffersize;
trajectories = 500;
timesteps = 2000;
buffersize = 128;
for (int k = 1; k <= trajectories ; k ++){ // looping over each trajectory
std::pair<int,int> uPositions[timesteps] = {};
std::pair<int,int> vPositions[timesteps] = {};
// start chaser in the center and randomly set v outside 512 units from center
std::pair<int,int> u0 = {2048,2048};
std::pair<int,int> v0 = {(rand() % 2)*(u0.first+512) + rand() % (u0.first-512) + 1,(rand() % 2)*(u0.second+512) +rand() % (u0.second-512) + 1}; //randomize runner pos
uPositions[0] = u0;
vPositions[0] = v0;
myfile << k << '\n';
for (int i = 1; i <= timesteps; i++){ // loop through each time step
vPositions[i] = randMove(vPositions[i-1].first,vPositions[i-1].second);
uPositions[i] = bresenhamstep(uPositions[i-1].first,uPositions[i-1].second,vPositions[i-1].first,vPositions[i-1].second);
myfile << uPositions[i-1].first << "," << uPositions[i-1].second << "," << vPositions[i-1].first << "," << vPositions[i-1].second << "\n";
}
}
return 0;
}