-
Notifications
You must be signed in to change notification settings - Fork 0
/
Agent.cpp
197 lines (138 loc) · 5.4 KB
/
Agent.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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
#include "Agent.h"
#include <random>
#include <thread>
#include <chrono>
using namespace std;
using namespace std::chrono;
Agent::Agent(Map *mp, bool smart) {
map = mp;
problem = nullptr;
smartAgent = smart;
int coordX = rand() % mp->getMapSize();
int coordY = rand() % mp->getMapSize();
map->getCell(coordX, coordY)->setVacuum(true);
eff = new Effector(mp);
sens = new Sensor(mp);
actionList = {};
}
Agent::~Agent() {
delete eff;
delete sens;
}
void Agent::agentWork(int UC, int wait_time) {
switch (UC) {
case 1:
perform(4, UC, wait_time);
break;
case 2 ... 3:
perform(2, UC, wait_time);
break;
case 4:
perform(runTest(), UC, wait_time);
break;
}
}
vector<Graph::node> Agent::getActions(int UC) {
if (smartAgent && (UC != 3))
return problem->Astar(sens->locateAgent());
else if (smartAgent && (UC == 3))
return problem->AstarTwo(sens->locateAgent(), sens->getDustCoords());
else
return problem->BFS(sens->locateAgent());
}
float Agent::perfEval() const {
float dustAmount = sens->getDustCoords().size();
auto perfScore = (float) (((dustAmount / (MAP_SIZE * MAP_SIZE)) * batteryUsed) + JEWEL_PENALTY * jewelCleaned);
return perfScore;
}
float Agent::evaluatePerf(vector<float> perfs) {
float avg = 0.0;
if (!perfs.empty())
avg = accumulate(perfs.begin(), perfs.end(), 0.0) / perfs.size();
return avg;
}
void Agent::perform(const int lr, const int UC, int wait_time) {
int stepNumber = 0, tick = 0;
problem = new Graph(map);
while (true) {
cout << *map << endl;
if (actionList.empty() || stepNumber >= lr) {
if (stepNumber >= lr)
stepNumber = 0;
actionList = getActions(UC);
this_thread::sleep_for(chrono::milliseconds(1));
}
int targetAction = actionList.back()->actionData;
pair<int, int> targetLocation = actionList.back()->location;
if (sens->locateAgent() != targetLocation) {
eff->travel(targetLocation.first, targetLocation.second);
stepNumber++;
}
stepNumber += eff->actOnCell(targetAction, lr - stepNumber);
batteryUsed += stepNumber;
actionList.pop_back();
tick++;
if (tick > 50){
this_thread::sleep_for(chrono::seconds (wait_time));
tick = 0;
}
}
}
int Agent :: runTest() {
int stepNumber = 0;
vector<vector<float>> perf_tab(MAX_LEARNING_RATE, vector<float>(MAX_LEARNING_RATE));
for (int learning_rate = 1; learning_rate < MAX_LEARNING_RATE + 1; learning_rate++) { // first big boucle
for (int iter_count = 1; iter_count < TEST_NUMBER + 1; iter_count++) { // second big boucle
problem = new Graph(map); // Beliefs
auto start = high_resolution_clock::now();
auto iter_timer = high_resolution_clock::now();
vector<float> perf_per_iter;
auto elapsed_time = false;
while (!elapsed_time) { // third big boucle - representing one test
// perform
if (actionList.empty() || stepNumber >= learning_rate) {
if (stepNumber >= learning_rate)
stepNumber = 0;
actionList = getActions(4);
this_thread::sleep_for(chrono::milliseconds(1));
}
int targetAction = actionList.back()->actionData;
pair<int, int> targetLocation = actionList.back()->location;
if (sens->locateAgent() != targetLocation) {
eff->travel(targetLocation.first, targetLocation.second);
stepNumber++;
}
stepNumber += eff->actOnCell(targetAction, learning_rate - stepNumber);
batteryUsed += stepNumber;
actionList.pop_back();
auto current_time = high_resolution_clock::now();
auto iteration_time = duration_cast<seconds>(current_time - iter_timer) >= 1s;
if (iteration_time) {
perf_per_iter.push_back(perfEval());
batteryUsed = 0;
jewelCleaned = 0;
iter_timer = high_resolution_clock::now();
}
elapsed_time = duration_cast<seconds>(current_time - start) >= TEST_DURATION;
}
perf_tab[learning_rate - 1][iter_count - 1] = evaluatePerf(perf_per_iter);
cout << "Test number " << iter_count << " for learning rate " << learning_rate << " : ";
cout << perf_tab[learning_rate - 1][iter_count - 1] << endl;
}
cout << endl;
}
for (int i = 0; i < MAX_LEARNING_RATE; i++) {
cout << "Mean for learning rate " << i + 1 << " : " << evaluatePerf(perf_tab[i]) << endl;
}
float curBest = 1000.0;
int best_learning_rate = 0;
for (int i = 0; i < MAX_LEARNING_RATE; i++) {
if (evaluatePerf(perf_tab[i]) < curBest) {
curBest = evaluatePerf(perf_tab[i]);
best_learning_rate = i;
}
}
delete problem;
cout << "\n\nThe best learning rate is " << best_learning_rate + 1 << endl;
return best_learning_rate + 1;
};