2 This file is part of I am car.
4 I am car is nree software: you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation, either version 3 of the License, or
7 (at your option) any later version.
9 I am car is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with I am car. If not, see <http://www.gnu.org/licenses/>.
21 #include <jsoncpp/json/json.h>
27 #include "rrtplanner.h"
28 #include "slotplanner.h"
35 //#define JSONLOGEDGES
36 //#define JSONLOGSAMPLES
39 //#define USE_INTERRUPT
48 //#define USE_SLOTPLANNER
51 //#define USE_SLOTPLANNER
57 std::chrono::high_resolution_clock::time_point TSTART_;
58 std::chrono::high_resolution_clock::time_point TEND_;
61 void TSTART() {TSTART_ = std::chrono::high_resolution_clock::now();}
63 std::chrono::duration<float> DT_;
64 TEND_ = std::chrono::high_resolution_clock::now();
65 DT_ = std::chrono::duration_cast<std::chrono::duration<float>>(
68 TELAPSED += DT_.count();
69 ELAPSED = DT_.count();
71 void TPRINT(const char *what) {
72 std::chrono::duration<float> DT_;
73 DT_ = std::chrono::duration_cast<std::chrono::duration<float>>(
76 std::cerr << what << ": " << DT_.count() << std::endl;
79 bool run_planner = true;
81 SDL_Window* gw = NULL;
98 void *next_run(void *arg)
100 struct next_arg *na = (struct next_arg *) arg;
101 T2 *lp = (T2 *) na->p;
103 while (!*gf && lp->elapsed() < TMAX) {
119 Json::Value jvi; // JSON input
120 Json::Value jvo; // JSON output
124 std::string encoding = jvi.get("encoding", "UTF-8" ).asString();
128 jvi["init"][0].asFloat(),
129 jvi["init"][1].asFloat(),
130 jvi["init"][2].asFloat()),
132 jvi["goal"][0].asFloat(),
133 jvi["goal"][1].asFloat(),
134 jvi["goal"][2].asFloat()));
135 std::vector<CircleObstacle> co;
136 std::vector<SegmentObstacle> so;
137 for (auto o: jvi["obst"]) {
138 if (o["circle"] != Json::nullValue) {
139 co.push_back(CircleObstacle(
140 o["circle"][0].asFloat(),
141 o["circle"][1].asFloat(),
142 o["circle"][2].asFloat()));
144 if (o["segment"] != Json::nullValue) {
145 so.push_back(SegmentObstacle(
147 o["segment"][0][0].asFloat(),
148 o["segment"][0][1].asFloat(),
151 o["segment"][1][0].asFloat(),
152 o["segment"][1][1].asFloat(),
154 p.frame().add_bnode(so.back().init());
157 p.link_obstacles(&co, &so);
161 ParallelSlot ps = ParallelSlot();
162 #ifdef USE_SLOTPLANNER
164 for (auto xy: jvi["slot"]["polygon"]) {
165 ps.slot().add_bnode(new RRTNode(
170 if (ps.slot().bnodes().size() > 0)
173 jvo["ppse"] = ELAPSED;
174 TPRINT("ParallelSlot");
176 if (ps.cusp().size() > 0) {
177 p.goal(ps.cusp().front().front());
178 p.slot_cusp(ps.cusp().front()); // use first found solution
179 jvo["midd"][0] = p.goal()->x();
180 jvo["midd"][1] = p.goal()->y();
181 jvo["midd"][2] = p.goal()->h();
182 jvo["goal"][0] = p.slot_cusp().back()->x();
183 jvo["goal"][1] = p.slot_cusp().back()->y();
184 jvo["goal"][2] = p.slot_cusp().back()->h();
186 jvo["goal"][0] = p.goal()->x();
187 jvo["goal"][1] = p.goal()->y();
188 jvo["goal"][2] = p.goal()->h();
192 std::vector<RRTNode *> steered;
193 for (auto jn: jvi["traj"][0]) {
194 steered.push_back(new RRTNode(
201 std::reverse(steered.begin(), steered.end());
202 RRTNode *pn = p.root();
203 for (auto n: steered) {
206 pn->add_child(n, p.cost(pn, n));
210 pn->add_child(p.goal(), p.cost(pn, p.goal()));
219 #elif defined USE_INTERRUPT
220 signal(SIGINT, hint);
221 signal(SIGTERM, hint);
223 while (run_planner) {
230 #elif defined USE_TMAX
233 while (!p.goal_found() && p.elapsed() < TMAX) {
237 if (ps.cusp().size() > 0)
238 p.tlog(p.findt(p.slot_cusp().back()));
243 #elif defined USE_PTHREAD
245 RRTNode *ron = nullptr;
246 RRTNode *gon = nullptr;
248 pthread_t rt; // root thread
249 pthread_t gt; // goal thread
250 pthread_t ct; // connect thread
263 pthread_create(&rt, NULL, &next_run, (void *) &ra);
264 pthread_create(>, NULL, &next_run, (void *) &ga);
268 std::vector<RRTNode *> steered;
269 while (!gf && p.elapsed() < TMAX &&
270 p.p_root_.nodes().size() < NOFNODES &&
271 p.p_goal_.nodes().size() < NOFNODES) {
274 for (int i = 0; i < IXSIZE; i++) {
275 for (int j = 0; j < IYSIZE; j++) {
276 if (p.p_root_.ixy_[i][j].changed() &&
277 p.p_goal_.ixy_[i][j].changed()) {
279 for (auto rn: p.p_root_.ixy_[i][j].nodes()) {
280 for (auto gn: p.p_goal_.ixy_[i][j].nodes()) {
281 if (rn->ccost() + gn->ccost() < mc &&
287 mc = rn->ccost() + gn->ccost();
291 //steered = p.steer(rn, gn);
292 //for (unsigned int k = 0; k < steered.size() - 1; k++)
293 // steered[k]->add_child(steered[k + 1], 1);
296 // steered[steered.size() - 1])) {
297 // for (auto n: steered)
301 //if (steered[steered.size() - 1]->ccost() +
303 // gn->ccost() < mc) {
305 // p.goal_found(true);
308 // mc = steered[steered.size() - 1]->ccost() +
312 //for (auto n: steered)
315 //if (p.elapsed() >= TMAX)
324 if (p.elapsed() >= TMAX)
327 // end of overlap trees
331 pthread_join(rt, NULL);
332 pthread_join(gt, NULL);
333 float nodo = ((float) ndl / (float) tol);
334 std::cerr << "nothing done is " << 100.0 * nodo;
335 std::cerr << "%" << std::endl;
336 //std::cerr << "rgf is " << p.p_root_.goal_found() << std::endl;
337 //std::cerr << "ggf is " << p.p_goal_.goal_found() << std::endl;
338 //std::cerr << "cgf is " << p.goal_found() << std::endl;
339 //if (p.goal_found()) {
341 // steered = p.steer(ron, gon);
342 // for (auto ns: steered) {
343 // p.nodes().push_back(ns);
345 // ron->add_child(ns, p.cost(ron, ns));
348 // mc = ron->ccost() + gon->ccost();
350 if (p.p_root_.goal_found() && p.p_root_.goal()->ccost() < mc) {
351 ron = p.p_root_.goal()->parent();
352 gon = p.p_root_.goal();
353 mc = p.p_root_.goal()->ccost();
355 if (p.p_goal_.goal_found() && p.p_goal_.goal()->ccost() < mc) {
356 ron = p.p_goal_.goal();
357 gon = p.p_goal_.goal()->parent();
358 mc = p.p_goal_.goal()->ccost();
360 p.root()->remove_parent(); // needed if p.p_goal_.goal_found()
362 p.goal()->children().clear();
365 while (gon != p.goal()) {
366 p.p_root_.nodes().push_back(new RRTNode(
371 p.p_root_.nodes().back(),
374 p.p_root_.nodes().back()));
375 ron = p.p_root_.nodes().back();
378 ron->add_child(p.goal(), p.p_root_.cost(ron, p.goal()));
380 // end of connect trees
388 jvo["rrte"] = ELAPSED;
393 // statistics to error output
394 std::cerr << "TELAPSED is " << TELAPSED << std::endl;
395 std::cerr << "Elapsed is " << p.elapsed() << std::endl;
396 std::cerr << "Goal found is " << p.goal_found() << std::endl;
397 std::cerr << "#nodes is " << p.nodes().size() << std::endl;
398 std::cerr << "#samples is " << p.samples().size() << std::endl;
399 std::cerr << "`tlog` size is " << p.tlog().size() << std::endl;
400 std::cerr << "trajectories costs:" << std::endl;
401 for (j = 0; j < p.clog().size(); j++)
402 std::cerr << "- " << p.clog()[j] << std::endl;
403 std::cerr << "RRT #nodes:" << std::endl;
404 for (j = 0; j < p.nlog().size(); j++)
405 std::cerr << "- " << p.nlog()[j] << std::endl;
406 std::cerr << "trajectories seconds:" << std::endl;
407 for (j = 0; j < p.slog().size(); j++)
408 std::cerr << "- " << p.slog()[j] << std::endl;
409 std::cerr << "RRT edges (from root) log size: " << p.rlog().size();
410 std::cerr << std::endl;
411 for (auto edges: p.rlog())
412 std::cerr << "- " << edges.size() << std::endl;
415 jvo["elap"] = TELAPSED;
417 jvo["nodo"][0] = nodo;
420 for (j = 0; j < p.clog().size(); j++)
421 jvo["cost"][j] = p.clog()[j];
423 for (j = 0; j < p.nlog().size(); j++)
424 jvo["node"][j] = p.nlog()[j];
426 for (j = 0; j < p.slog().size(); j++)
427 jvo["secs"][j] = p.slog()[j];
431 for (auto traj: p.tlog()) {
434 jvo["traj"][j][i][0] = n->x();
435 jvo["traj"][j][i][1] = n->y();
436 jvo["traj"][j][i][2] = n->h();
437 jvo["traj"][j][i][3] = n->t();
438 jvo["traj"][j][i][4] = n->s();
446 for (auto edges: p.rlog()) {
448 for (auto e: edges) {
449 jvo["edge"][i][j][0][0] = e->init()->x();
450 jvo["edge"][i][j][0][1] = e->init()->y();
451 jvo["edge"][i][j][0][2] = e->init()->h();
452 jvo["edge"][i][j][1][0] = e->goal()->x();
453 jvo["edge"][i][j][1][1] = e->goal()->y();
454 jvo["edge"][i][j][1][2] = e->goal()->h();
460 #ifdef JSONLOGSAMPLES
463 for (auto s: p.samples()) {
464 jvo["samp"][j][0] = s->x();
465 jvo["samp"][j][1] = s->y();
466 jvo["samp"][j][2] = s->h();
471 std::cout << jvo << std::endl;
474 SDL_DestroyWindow(gw);
488 if (SDL_Init(SDL_INIT_VIDEO) < 0) {
489 std::cerr << "SDL could not initialize! SDL_Error: ";
490 std::cerr << SDL_GetError();
491 std::cerr << std::endl;
494 SDL_GL_SetAttribute(SDL_GL_CONTEXT_MAJOR_VERSION, 2);
495 SDL_GL_SetAttribute(SDL_GL_CONTEXT_MINOR_VERSION, 1);
496 gw = SDL_CreateWindow(
498 SDL_WINDOWPOS_UNDEFINED,
499 SDL_WINDOWPOS_UNDEFINED,
502 SDL_WINDOW_OPENGL | SDL_WINDOW_SHOWN);
504 std::cerr << "Window could not be created! SDL_Error: ";
505 std::cerr << SDL_GetError();
506 std::cerr << std::endl;
509 gc = SDL_GL_CreateContext(gw);
511 std::cerr << "OpenGL context couldn't be created! SDL Error: ";
512 std::cerr << SDL_GetError();
513 std::cerr << std::endl;
516 if (SDL_GL_SetSwapInterval(1) < 0) {
517 std::cerr << "Warning: Unable to set VSync! SDL Error: ";
518 std::cerr << SDL_GetError();
519 std::cerr << std::endl;
523 std::cerr << "Unable to initialize OpenGL!";
524 std::cerr << std::endl;
532 GLenum error = GL_NO_ERROR;
533 glMatrixMode(GL_PROJECTION);
535 error = glGetError();
536 if (error != GL_NO_ERROR) {
537 std::cerr << "Error initializing OpenGL! ";
538 std::cerr << gluErrorString(error);
539 std::cerr << std::endl;
542 glMatrixMode(GL_MODELVIEW);
544 error = glGetError();
545 if (error != GL_NO_ERROR) {
546 std::cerr << "Error initializing OpenGL! ";
547 std::cerr << gluErrorString(error);
548 std::cerr << std::endl;
551 glClearColor(1, 1, 1, 1);
552 error = glGetError();
553 if (error != GL_NO_ERROR) {
554 std::cerr << "Error initializing OpenGL! ";
555 std::cerr << gluErrorString(error);
556 std::cerr << std::endl;