-
Notifications
You must be signed in to change notification settings - Fork 19
/
app.cpp
195 lines (181 loc) · 5.81 KB
/
app.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
#include <getopt.h>
#include <cbs.hpp>
#include <default_params.hpp>
#include <ecbs.hpp>
#include <hca.hpp>
#include <icbs.hpp>
#include <iostream>
#include <ir.hpp>
#include <pibt.hpp>
#include <pibt_complete.hpp>
#include <problem.hpp>
#include <push_and_swap.hpp>
#include <random>
#include <revisit_pp.hpp>
#include <vector>
#include <whca.hpp>
#include <winpibt.hpp>
void printHelp();
std::unique_ptr<Solver> getSolver(const std::string solver_name, Problem* P,
bool verbose, int argc, char* argv[]);
int main(int argc, char* argv[])
{
std::string instance_file = "";
std::string output_file = DEFAULT_OUTPUT_FILE;
std::string solver_name;
bool verbose = false;
char* argv_copy[argc + 1];
for (int i = 0; i < argc; ++i) argv_copy[i] = argv[i];
struct option longopts[] = {
{"instance", required_argument, 0, 'i'},
{"output", required_argument, 0, 'o'},
{"solver", required_argument, 0, 's'},
{"verbose", no_argument, 0, 'v'},
{"help", no_argument, 0, 'h'},
{"time-limit", required_argument, 0, 'T'},
{"make-scen", no_argument, 0, 'P'},
{0, 0, 0, 0},
};
bool make_scen = false;
int max_comp_time = -1;
// command line args
int opt, longindex;
opterr = 0; // ignore getopt error
while ((opt = getopt_long(argc, argv, "i:o:s:vhPT:", longopts, &longindex)) !=
-1) {
switch (opt) {
case 'i':
instance_file = std::string(optarg);
break;
case 'o':
output_file = std::string(optarg);
break;
case 's':
solver_name = std::string(optarg);
break;
case 'v':
verbose = true;
break;
case 'h':
printHelp();
return 0;
case 'P':
make_scen = true;
break;
case 'T':
max_comp_time = std::atoi(optarg);
break;
default:
break;
}
}
if (instance_file.length() == 0) {
std::cout << "specify instance file using -i [INSTANCE-FILE], e.g.,"
<< std::endl;
std::cout << "> ./app -i ../instance/sample.txt" << std::endl;
return 0;
}
// set problem
Problem P = Problem(instance_file);
// set max computation time (otherwise, use param in instance_file)
if (max_comp_time != -1) P.setMaxCompTime(max_comp_time);
// create scenario
if (make_scen) {
P.makeScenFile(output_file);
return 0;
}
// solve
auto solver = getSolver(solver_name, &P, verbose, argc, argv_copy);
solver->solve();
if (solver->succeed() && !solver->getSolution().validate(&P)) {
std::cout << "error@app: invalid results" << std::endl;
return 0;
}
solver->printResult();
// output result
solver->makeLog(output_file);
if (verbose) {
std::cout << "save result as " << output_file << std::endl;
}
return 0;
}
std::unique_ptr<Solver> getSolver(const std::string solver_name, Problem* P,
bool verbose, int argc, char* argv[])
{
std::unique_ptr<Solver> solver;
if (solver_name == "PIBT") {
solver = std::make_unique<PIBT>(P);
} else if (solver_name == "winPIBT") {
solver = std::make_unique<winPIBT>(P);
} else if (solver_name == "HCA") {
solver = std::make_unique<HCA>(P);
} else if (solver_name == "WHCA") {
solver = std::make_unique<WHCA>(P);
} else if (solver_name == "CBS") {
solver = std::make_unique<CBS>(P);
} else if (solver_name == "ICBS") {
solver = std::make_unique<ICBS>(P);
} else if (solver_name == "PIBT_COMPLETE") {
solver = std::make_unique<PIBT_COMPLETE>(P);
} else if (solver_name == "ECBS") {
solver = std::make_unique<ECBS>(P);
} else if (solver_name == "RevisitPP") {
solver = std::make_unique<RevisitPP>(P);
} else if (solver_name == "PushAndSwap") {
solver = std::make_unique<PushAndSwap>(P);
} else if (solver_name == "IR") {
solver = std::make_unique<IR>(P);
} else if (solver_name == "IR_SINGLE_PATHS") {
solver = std::make_unique<IR_SINGLE_PATHS>(P);
} else if (solver_name == "IR_FIX_AT_GOALS") {
solver = std::make_unique<IR_FIX_AT_GOALS>(P);
} else if (solver_name == "IR_FOCUS_GOALS") {
solver = std::make_unique<IR_FOCUS_GOALS>(P);
} else if (solver_name == "IR_MDD") {
solver = std::make_unique<IR_MDD>(P);
} else if (solver_name == "IR_BOTTLENECK") {
solver = std::make_unique<IR_BOTTLENECK>(P);
} else if (solver_name == "IR_HYBRID") {
solver = std::make_unique<IR_HYBRID>(P);
} else {
std::cout << "warn@app: "
<< "unknown solver name, " + solver_name + ", continue by PIBT"
<< std::endl;
solver = std::make_unique<PIBT>(P);
}
solver->setParams(argc, argv);
solver->setVerbose(verbose);
return solver;
}
void printHelp()
{
std::cout << "\nUsage: ./app [OPTIONS] [SOLVER-OPTIONS]\n"
<< "\n**instance file is necessary to run MAPF simulator**\n\n"
<< " -i --instance [FILE_PATH] instance file path\n"
<< " -o --output [FILE_PATH] ouptut file path\n"
<< " -v --verbose print additional info\n"
<< " -h --help help\n"
<< " -s --solver [SOLVER_NAME] solver, choose from the below\n"
<< " -T --time-limit [INT] max computation time (ms)\n"
<< " -P --make-scen make scenario file using "
"random starts/goals"
<< "\n\nSolver Options:" << std::endl;
// each solver
PIBT::printHelp();
winPIBT::printHelp();
HCA::printHelp();
WHCA::printHelp();
RevisitPP::printHelp();
PushAndSwap::printHelp();
CBS::printHelp();
ECBS::printHelp();
ICBS::printHelp();
PIBT_COMPLETE::printHelp();
IR::printHelp();
IR_SINGLE_PATHS::printHelp();
IR_FIX_AT_GOALS::printHelp();
IR_FOCUS_GOALS::printHelp();
IR_MDD::printHelp();
IR_BOTTLENECK::printHelp();
IR_HYBRID::printHelp();
}