]> rtime.felk.cvut.cz Git - hubacji1/iamcar2.git/blob - src/test2.cc
Merge branch 'feature/test3-cute-c2-collision-detection'
[hubacji1/iamcar2.git] / src / test2.cc
1 #include <chrono>
2 #include <iostream>
3 #include <jsoncpp/json/json.h>
4
5 #include "rrts.h"
6
7 std::chrono::high_resolution_clock::time_point TSTART_;
8 std::chrono::high_resolution_clock::time_point TEND_;
9 inline void TSTART() { TSTART_ = std::chrono::high_resolution_clock::now(); }
10 inline void TEND() { TEND_ = std::chrono::high_resolution_clock::now(); }
11 inline double TDIFF()
12 {
13         std::chrono::duration<double> DT_;
14         DT_ = std::chrono::duration_cast<std::chrono::duration<double>>(
15                 TEND_ - TSTART_
16         );
17         return DT_.count();
18 }
19 inline void TPRINT(const char *what)
20 {
21         std::cerr << what << ": " << TDIFF() << std::endl;
22 }
23
24 int main()
25 {
26         Json::Value jvi; // JSON input
27         Json::Value jvo; // JSON output
28         std::cin >> jvi;
29
30         if (jvi["init"] == Json::nullValue) {
31                 std::cerr << "I need `init` in JSON input scenario";
32                 std::cerr << std::endl;
33                 return 1;
34         }
35
36         if (jvi["goal"] == Json::nullValue) {
37                 std::cerr << "I need `goal` in JSON input scenario";
38                 std::cerr << std::endl;
39                 return 1;
40         }
41
42         if (jvi["goals"] == Json::nullValue) {
43                 std::cerr << "I need `goals` in JSON input scenario";
44                 std::cerr << std::endl;
45                 return 1;
46         }
47
48         if (jvi["obst"] == Json::nullValue) {
49                 std::cerr << "I need `obst` in JSON input scenario";
50                 std::cerr << std::endl;
51                 return 1;
52         }
53
54         RRTS rrts;
55         rrts.nodes().front().x(jvi["init"][0].asDouble());
56         rrts.nodes().front().y(jvi["init"][1].asDouble());
57         rrts.nodes().front().h(jvi["init"][2].asDouble());
58         {
59                 RRTNode tmp_node;
60                 tmp_node.x(jvi["goal"][0].asDouble());
61                 tmp_node.y(jvi["goal"][1].asDouble());
62                 tmp_node.h(jvi["goal"][2].asDouble());
63                 rrts.goals().push_back(tmp_node);
64                 for (auto g: jvi["goals"]) {
65                         tmp_node.x(g[0].asDouble());
66                         tmp_node.y(g[1].asDouble());
67                         tmp_node.h(g[2].asDouble());
68                         rrts.goals().push_back(tmp_node);
69                 }
70         }
71         {
72                 Obstacle tmp_obstacle;
73                 for (auto o: jvi["obst"]) {
74                         tmp_obstacle.poly().clear();
75                         for (auto c: o) {
76                                 double tmp_x = c[0].asDouble();
77                                 double tmp_y = c[1].asDouble();
78                                 auto tmp_tuple = std::make_tuple(tmp_x, tmp_y);
79                                 tmp_obstacle.poly().push_back(tmp_tuple);
80                         }
81                         rrts.obstacles().push_back(tmp_obstacle);
82                 }
83         }
84
85         {
86                 double edist_init_goal = sqrt(
87                         pow(
88                                 rrts.nodes().front().x()
89                                 - rrts.goals().front().x(),
90                                 2
91                         )
92                         + pow(
93                                 rrts.nodes().front().y()
94                                 - rrts.goals().front().y(),
95                                 2
96                         )
97                 );
98                 rrts.set_sample(
99                         rrts.nodes().front().x(), edist_init_goal,
100                         rrts.nodes().front().y(), edist_init_goal,
101                         0, 2 * M_PI
102                 );
103         }
104
105         TSTART();
106         while (rrts.next()) {}
107         TEND();
108
109         {
110                 jvo["time"] = TDIFF();
111         }
112         {
113                 if (rrts.path().size() > 0) {
114                         jvo["cost"] = cc(*rrts.path().back());
115                 } else {
116                         jvo["cost"] = -1;
117                 }
118         }
119         {
120                 jvo["init"][0] = rrts.nodes().front().x();
121                 jvo["init"][1] = rrts.nodes().front().y();
122                 jvo["init"][2] = rrts.nodes().front().h();
123         }
124         {
125                 unsigned int ocnt = 0;
126                 for (auto o: rrts.obstacles()) {
127                         unsigned int ccnt = 0;
128                         for (auto c: o.poly()) {
129                                 jvo["obst"][ocnt][ccnt][0] = std::get<0>(c);
130                                 jvo["obst"][ocnt][ccnt][1] = std::get<1>(c);
131                                 ccnt++;
132                         }
133                         ocnt++;
134                 }
135         }
136         {
137                 unsigned int gcnt = 0;
138                 for (auto g: rrts.goals()) {
139                         jvo["goals"][gcnt][0] = g.x();
140                         jvo["goals"][gcnt][1] = g.y();
141                         jvo["goals"][gcnt][2] = g.h();
142                         gcnt++;
143                 }
144         }
145         {
146                 if (rrts.path().size() > 0) {
147                         jvo["goal"][0] = rrts.path().back()->x();
148                         jvo["goal"][1] = rrts.path().back()->y();
149                         jvo["goal"][2] = rrts.path().back()->h();
150                 }
151                 unsigned int cu = 0;
152                 unsigned int co = 0;
153                 unsigned int pcnt = 0;
154                 for (auto n: rrts.path()) {
155                         jvo["path"][pcnt][0] = n->x();
156                         jvo["path"][pcnt][1] = n->y();
157                         jvo["path"][pcnt][2] = n->h();
158                         if (n->t(RRTNodeType::cusp))
159                                 cu++;
160                         if (n->t(RRTNodeType::connected))
161                                 co++;
162                         pcnt++;
163                 }
164                 jvo["path#cusp"] = cu;
165                 jvo["path#connected"] = co;
166         }
167
168         std::cout << jvo << std::endl;
169         return 0;
170 }