]> rtime.felk.cvut.cz Git - hubacji1/iamcar2.git/blob - src/test7.cc
Output list of planner results
[hubacji1/iamcar2.git] / src / test7.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         if (jvi["init"] == Json::nullValue) {
30                 std::cerr << "I need `init` in JSON input scenario";
31                 std::cerr << std::endl;
32                 return 1;
33         }
34         if (jvi["goal"] == Json::nullValue) {
35                 std::cerr << "I need `goal` in JSON input scenario";
36                 std::cerr << std::endl;
37                 return 1;
38         }
39         if (jvi["goals"] == Json::nullValue) {
40                 std::cerr << "I need `goals` in JSON input scenario";
41                 std::cerr << std::endl;
42                 return 1;
43         }
44         if (jvi["obst"] == Json::nullValue) {
45                 std::cerr << "I need `obst` in JSON input scenario";
46                 std::cerr << std::endl;
47                 return 1;
48         }
49
50         std::vector<RRTNode> final_path;
51         double final_path_cost = 9999;
52         RRTNode init_node;
53         init_node.x(jvi["init"][0].asDouble());
54         init_node.y(jvi["init"][1].asDouble());
55         init_node.h(jvi["init"][2].asDouble());
56         init_node.sp(2.7);
57         init_node.st(M_PI / 32); // only for sc2_4
58         init_node.next();
59
60         RRTS rrts;
61         rrts.nodes().front().x(init_node.x());
62         rrts.nodes().front().y(init_node.y());
63         rrts.nodes().front().h(init_node.h());
64         {
65                 RRTNode tmp_node;
66                 tmp_node.x(jvi["goal"][0].asDouble());
67                 tmp_node.y(jvi["goal"][1].asDouble());
68                 tmp_node.h(jvi["goal"][2].asDouble());
69                 rrts.goals().push_back(tmp_node);
70                 for (auto g: jvi["goals"]) {
71                         tmp_node.x(g[0].asDouble());
72                         tmp_node.y(g[1].asDouble());
73                         tmp_node.h(g[2].asDouble());
74                         rrts.goals().push_back(tmp_node);
75                 }
76         }
77         {
78                 Obstacle tmp_obstacle;
79                 for (auto o: jvi["obst"]) {
80                         tmp_obstacle.poly().clear();
81                         for (auto c: o) {
82                                 double tmp_x = c[0].asDouble();
83                                 double tmp_y = c[1].asDouble();
84                                 auto tmp_tuple = std::make_tuple(tmp_x, tmp_y);
85                                 tmp_obstacle.poly().push_back(tmp_tuple);
86                         }
87                         rrts.obstacles().push_back(tmp_obstacle);
88                 }
89         }
90         {
91                 double edist_init_goal = sqrt(
92                         pow(
93                                 rrts.nodes().front().x()
94                                 - rrts.goals().front().x(),
95                                 2
96                         )
97                         + pow(
98                                 rrts.nodes().front().y()
99                                 - rrts.goals().front().y(),
100                                 2
101                         )
102                 );
103                 rrts.set_sample(
104                         rrts.nodes().front().x(), edist_init_goal,
105                         rrts.nodes().front().y(), edist_init_goal,
106                         0, 2 * M_PI
107                 );
108         }
109
110         TSTART();
111         while (rrts.next()) {}
112         TEND();
113         if (rrts.path().size() > 0) {
114                 if (cc(*rrts.path().back()) < final_path_cost) {
115                         final_path_cost = cc(*rrts.path().back());
116                         final_path.clear();
117                         for (auto n: rrts.path()) {
118                                 final_path.push_back(RRTNode());
119                                 final_path.back().x(n->x());
120                                 final_path.back().y(n->y());
121                                 final_path.back().h(n->h());
122                         }
123                 }
124         }
125         std::cerr << "finished 0, cost is " << final_path_cost << std::endl;
126         int rcnt = 0;
127         jvo[rcnt++] = rrts.json();
128 for (int i = 1; i < 5; i++) {
129         init_node.next();
130         RRTS rrts2;
131         rrts2.goals() = rrts.goals();
132         rrts2.obstacles() = rrts.obstacles();
133         rrts2.nodes().front().x(init_node.x());
134         rrts2.nodes().front().y(init_node.y());
135         rrts2.nodes().front().h(init_node.h());
136         {
137                 double edist_init_goal = sqrt(
138                         pow(
139                                 rrts2.nodes().front().x()
140                                 - rrts2.goals().front().x(),
141                                 2
142                         )
143                         + pow(
144                                 rrts2.nodes().front().y()
145                                 - rrts2.goals().front().y(),
146                                 2
147                         )
148                 );
149                 rrts2.set_sample(
150                         rrts2.nodes().front().x(), edist_init_goal,
151                         rrts2.nodes().front().y(), edist_init_goal,
152                         0, 2 * M_PI
153                 );
154         }
155         TSTART();
156         while (rrts2.next()) {}
157         TEND();
158         if (rrts2.path().size() > 0) {
159                 if (cc(*rrts2.path().back()) < final_path_cost) {
160                         final_path_cost = cc(*rrts2.path().back());
161                         final_path.clear();
162                         for (auto n: rrts2.path()) {
163                                 final_path.push_back(RRTNode());
164                                 final_path.back().x(n->x());
165                                 final_path.back().y(n->y());
166                                 final_path.back().h(n->h());
167                         }
168                 }
169         }
170         std::cerr << "finished " << i << ", cost is " << final_path_cost;
171         std::cerr << std::endl;
172         jvo[rcnt++] = rrts2.json();
173 }
174         std::cout << jvo << std::endl;
175         return 0;
176 }