3 #include <jsoncpp/json/json.h>
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(); }
13 std::chrono::duration<double> DT_;
14 DT_ = std::chrono::duration_cast<std::chrono::duration<double>>(
19 inline void TPRINT(const char *what)
21 std::cerr << what << ": " << TDIFF() << std::endl;
26 Json::Value jvi; // JSON input
27 Json::Value jvo; // JSON output
29 if (jvi["init"] == Json::nullValue) {
30 std::cerr << "I need `init` in JSON input scenario";
31 std::cerr << std::endl;
34 if (jvi["goal"] == Json::nullValue) {
35 std::cerr << "I need `goal` in JSON input scenario";
36 std::cerr << std::endl;
39 if (jvi["goals"] == Json::nullValue) {
40 std::cerr << "I need `goals` in JSON input scenario";
41 std::cerr << std::endl;
44 if (jvi["obst"] == Json::nullValue) {
45 std::cerr << "I need `obst` in JSON input scenario";
46 std::cerr << std::endl;
50 std::vector<RRTNode> final_path;
51 double final_path_cost = 9999;
53 init_node.x(jvi["init"][0].asDouble());
54 init_node.y(jvi["init"][1].asDouble());
55 init_node.h(jvi["init"][2].asDouble());
57 init_node.st(M_PI / 32); // only for sc2_4
61 rrts.nodes().front().x(init_node.x());
62 rrts.nodes().front().y(init_node.y());
63 rrts.nodes().front().h(init_node.h());
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);
78 Obstacle tmp_obstacle;
79 for (auto o: jvi["obst"]) {
80 tmp_obstacle.poly().clear();
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);
87 rrts.obstacles().push_back(tmp_obstacle);
91 double edist_init_goal = sqrt(
93 rrts.nodes().front().x()
94 - rrts.goals().front().x(),
98 rrts.nodes().front().y()
99 - rrts.goals().front().y(),
104 rrts.nodes().front().x(), edist_init_goal,
105 rrts.nodes().front().y(), edist_init_goal,
111 while (rrts.next()) {}
113 if (rrts.path().size() > 0) {
114 if (cc(*rrts.path().back()) < final_path_cost) {
115 final_path_cost = cc(*rrts.path().back());
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());
127 jvo["time"] = TDIFF();
130 jvo["iterations"] = rrts.icnt();
133 jvo["init"][0] = rrts.nodes().front().x();
134 jvo["init"][1] = rrts.nodes().front().y();
135 jvo["init"][2] = rrts.nodes().front().h();
138 jvo["cost"] = final_path_cost;
141 if (final_path.size() > 0) {
142 jvo["goal"][0] = final_path.back().x();
143 jvo["goal"][1] = final_path.back().y();
144 jvo["goal"][2] = final_path.back().h();
148 unsigned int pcnt = 0;
149 for (auto n: final_path) {
150 jvo["path"][pcnt][0] = n.x();
151 jvo["path"][pcnt][1] = n.y();
152 jvo["path"][pcnt][2] = n.h();
153 if (n.t(RRTNodeType::cusp))
155 if (n.t(RRTNodeType::connected))
159 jvo["cusps-in-path"] = cu;
160 jvo["connecteds-in-path"] = co;
163 unsigned int gcnt = 0;
164 for (auto g: rrts.goals()) {
165 jvo["goals"][gcnt][0] = g.x();
166 jvo["goals"][gcnt][1] = g.y();
167 jvo["goals"][gcnt][2] = g.h();
172 unsigned int ocnt = 0;
173 for (auto o: rrts.obstacles()) {
174 unsigned int ccnt = 0;
175 for (auto c: o.poly()) {
176 jvo["obst"][ocnt][ccnt][0] = std::get<0>(c);
177 jvo["obst"][ocnt][ccnt][1] = std::get<1>(c);
184 jvo["nodes"] = (unsigned int) rrts.nodes().size();
187 // unsigned int ncnt = 0;
188 // for (auto n: rrts.nodes()) {
189 // jvo["nodes_x"][ncnt] = n.x();
190 // jvo["nodes_y"][ncnt] = n.y();
191 // //jvo["nodes_h"][ncnt] = n.h();
195 std::cout << jvo << std::endl;