base/main.cc

   1 /*
   2 This file is part of I am car.
   3
   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.
   8
   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.
  13
  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/>.
  16 */
  17
  18 #include <algorithm>
  19 #include <chrono>
  20 #include <iostream>
  21 #include <jsoncpp/json/json.h>
  22 #include <pthread.h>
  23 #include <signal.h>
  24 #include <unistd.h>
  25 #include "compile.h"
  26 #include "obstacle.h"
  27 #include "rrtplanner.h"
  28 #include "slotplanner.h"
  29 // OpenGL
  30 #include <GL/gl.h>
  31 #include <GL/glu.h>
  32 #include <SDL2/SDL.h>
  33
  34 // debug
  35 //#define JSONLOGEDGES
  36 //#define JSONLOGSAMPLES
  37
  38 // choose
  39 //#define USE_INTERRUPT
  40 // or
  41 //#define USE_TMAX
  42 // or
  43 //#define USE_LOADF
  44 // or
  45 #define USE_PTHREAD
  46
  47 // enable
  48 //#define USE_SLOTPLANNER
  49
  50 // enable
  51 //#define USE_SLOTPLANNER
  52
  53 #ifdef USE_INTERRUPT
  54         #define USE_GL
  55 #endif
  56
  57 std::chrono::high_resolution_clock::time_point TSTART_;
  58 std::chrono::high_resolution_clock::time_point TEND_;
  59 float TELAPSED = 0;
  60 float ELAPSED = 0;
  61 void TSTART() {TSTART_ = std::chrono::high_resolution_clock::now();}
  62 void TEND() {
  63         std::chrono::duration<float> DT_;
  64         TEND_ = std::chrono::high_resolution_clock::now();
  65         DT_ = std::chrono::duration_cast<std::chrono::duration<float>>(
  66                 TEND_ - TSTART_
  67         );
  68         TELAPSED += DT_.count();
  69         ELAPSED = DT_.count();
  70 }
  71 void TPRINT(const char *what) {
  72         std::chrono::duration<float> DT_;
  73         DT_ = std::chrono::duration_cast<std::chrono::duration<float>>(
  74                 TEND_ - TSTART_
  75         );
  76         std::cerr << what << ": " << DT_.count() << std::endl;
  77 }
  78
  79 bool run_planner = true;
  80
  81 SDL_Window* gw = NULL;
  82 SDL_GLContext gc;
  83
  84 bool init();
  85 bool initGL();
  86
  87 void hint(int)
  88 {
  89         run_planner = false;
  90 }
  91
  92 #ifdef USE_PTHREAD
  93 struct next_arg {
  94         bool *gf;
  95         T2 *p;
  96 };
  97
  98 void *next_run(void *arg)
  99 {
 100         struct next_arg *na = (struct next_arg *) arg;
 101         T2 *lp = (T2 *) na->p;
 102         bool *gf = na->gf;
 103         while (!*gf && lp->elapsed() < TMAX) {
 104                 if (lp->next())
 105                         *gf = true;
 106                 lp->tend();
 107         }
 108         pthread_exit(NULL);
 109         return NULL;
 110 }
 111 #endif
 112
 113 int main()
 114 {
 115 #ifdef USE_GL
 116         init();
 117 #endif
 118
 119         Json::Value jvi; // JSON input
 120         Json::Value jvo; // JSON output
 121         unsigned int i = 0;
 122         unsigned int j = 0;
 123         std::cin >> jvi;
 124         std::string encoding = jvi.get("encoding", "UTF-8" ).asString();
 125
 126         PLANNER p(
 127                         new RRTNode(
 128                                 jvi["init"][0].asFloat(),
 129                                 jvi["init"][1].asFloat(),
 130                                 jvi["init"][2].asFloat()),
 131                         new RRTNode(
 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()));
 143                 }
 144                 if (o["segment"] != Json::nullValue) {
 145                         so.push_back(SegmentObstacle(
 146                                 new RRTNode(
 147                                         o["segment"][0][0].asFloat(),
 148                                         o["segment"][0][1].asFloat(),
 149                                         0),
 150                                 new RRTNode(
 151                                         o["segment"][1][0].asFloat(),
 152                                         o["segment"][1][1].asFloat(),
 153                                         0)));
 154                         p.frame().add_bnode(so.back().init());
 155                 }
 156         }
 157         p.link_obstacles(&co, &so);
 158         p.ocost(p.root());
 159         p.ocost(p.goal());
 160
 161         ParallelSlot ps = ParallelSlot();
 162 #ifdef USE_SLOTPLANNER
 163         TSTART();
 164         for (auto xy: jvi["slot"]["polygon"]) {
 165                 ps.slot().add_bnode(new RRTNode(
 166                         xy[0].asFloat(),
 167                         xy[1].asFloat()
 168                 ));
 169         }
 170         if (ps.slot().bnodes().size() > 0)
 171                 ps.fpose();
 172         TEND();
 173         jvo["ppse"] = ELAPSED;
 174         TPRINT("ParallelSlot");
 175 #endif
 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();
 185         } else {
 186                 jvo["goal"][0] = p.goal()->x();
 187                 jvo["goal"][1] = p.goal()->y();
 188                 jvo["goal"][2] = p.goal()->h();
 189         }
 190         TSTART();
 191 #ifdef USE_LOADF
 192         std::vector<RRTNode *> steered;
 193         for (auto jn: jvi["traj"][0]) {
 194                 steered.push_back(new RRTNode(
 195                                         jn[0].asFloat(),
 196                                         jn[1].asFloat(),
 197                                         jn[2].asFloat(),
 198                                         jn[3].asFloat(),
 199                                         jn[4].asFloat()));
 200         }
 201         std::reverse(steered.begin(), steered.end());
 202         RRTNode *pn = p.root();
 203         for (auto n: steered) {
 204                 if (IS_NEAR(pn, n))
 205                         continue;
 206                 pn->add_child(n, p.cost(pn, n));
 207                 pn = n;
 208                 p.glplot();
 209         }
 210         pn->add_child(p.goal(), p.cost(pn, p.goal()));
 211         p.goal_found(true);
 212         p.tlog(p.findt());
 213         if (p.opt_path()) {
 214                 p.tlog(p.findt());
 215                 p.glplot();
 216         }
 217         p.glplot();
 218         sleep(2);
 219 #elif defined USE_INTERRUPT
 220         signal(SIGINT, hint);
 221         signal(SIGTERM, hint);
 222         p.tstart();
 223         while (run_planner) {
 224                 p.next();
 225                 p.tend();
 226                 if (p.opt_path())
 227                         p.tlog(p.findt());
 228                 p.glplot();
 229         }
 230 #elif defined USE_TMAX
 231         p.tstart();
 232         p.tend();
 233         while (!p.goal_found() && p.elapsed() < TMAX) {
 234                 p.next();
 235                 p.tend();
 236                 if (p.opt_path()) {
 237                         if (ps.cusp().size() > 0)
 238                                 p.tlog(p.findt(p.slot_cusp().back()));
 239                         else
 240                                 p.tlog(p.findt());
 241                 }
 242         }
 243 #elif defined USE_PTHREAD
 244         bool gf = false;
 245         RRTNode *ron = nullptr;
 246         RRTNode *gon = nullptr;
 247         float mc = 9999;
 248         pthread_t rt; // root thread
 249         pthread_t gt; // goal thread
 250         pthread_t ct; // connect thread
 251
 252         struct next_arg ra;
 253         ra.gf = &gf;
 254         ra.p = &p.p_root_;
 255
 256         struct next_arg ga;
 257         ga.gf = &gf;
 258         ga.p = &p.p_goal_;
 259
 260         p.tstart();
 261         p.p_root_.tstart();
 262         p.p_goal_.tstart();
 263         pthread_create(&rt, NULL, &next_run, (void *) &ra);
 264         pthread_create(&gt, NULL, &next_run, (void *) &ga);
 265         int tol = 0;
 266         int ndl = 0;
 267         bool ndone = true;
 268         while (!gf && p.elapsed() < TMAX &&
 269                         p.p_root_.nodes().size() < NOFNODES &&
 270                         p.p_goal_.nodes().size() < NOFNODES) {
 271                 // overlap trees
 272                 ndone = true;
 273                 for (int i = 0; i < IXSIZE; i++) {
 274                 for (int j = 0; j < IYSIZE; j++) {
 275                         if (p.p_root_.ixy_[i][j].changed() &&
 276                                         p.p_goal_.ixy_[i][j].changed()) {
 277 ndone = false;
 278 for (auto rn: p.p_root_.ixy_[i][j].nodes()) {
 279 for (auto gn: p.p_goal_.ixy_[i][j].nodes()) {
 280         if (rn->ccost() + gn->ccost() < mc &&
 281                         IS_NEAR(rn, gn)) {
 282                 gf = true;
 283                 p.goal_found(true);
 284                 ron = rn;
 285                 gon = gn;
 286                 mc = rn->ccost() + gn->ccost();
 287         }
 288 }}
 289                         }
 290                         tol++;
 291                         if (ndone)
 292                                 ndl++;
 293                         p.tend();
 294                         if (p.elapsed() >= TMAX)
 295                                 goto escapeloop;
 296                 }}
 297                 // end of overlap trees
 298                 p.tend();
 299         }
 300 escapeloop:
 301         pthread_join(rt, NULL);
 302         pthread_join(gt, NULL);
 303         float nodo = ((float) ndl / (float) tol);
 304         std::cerr << "nothing done is " << 100.0 * nodo;
 305         std::cerr << "%" << std::endl;
 306         //std::cerr << "rgf is " << p.p_root_.goal_found() << std::endl;
 307         //std::cerr << "ggf is " << p.p_goal_.goal_found() << std::endl;
 308         //std::cerr << "cgf is " << p.goal_found() << std::endl;
 309         if (p.p_root_.goal_found() && p.p_root_.goal()->ccost() < mc) {
 310                 ron = p.p_root_.goal()->parent();
 311                 gon = p.p_root_.goal();
 312                 mc = p.p_root_.goal()->ccost();
 313         }
 314         if (p.p_goal_.goal_found() && p.p_goal_.goal()->ccost() < mc) {
 315                 ron = p.p_goal_.goal();
 316                 gon = p.p_goal_.goal()->parent();
 317                 mc = p.p_goal_.goal()->ccost();
 318         }
 319         p.root()->remove_parent();  // needed if p.p_goal_.goal_found()
 320         p.root()->ccost(0);
 321         p.goal()->children().clear();
 322         // connect trees
 323         if (gf) {
 324         while (gon != p.goal()) {
 325                 p.p_root_.nodes().push_back(new RRTNode(
 326                                 gon->x(),
 327                                 gon->y(),
 328                                 gon->h()));
 329                 ron->add_child(
 330                                 p.p_root_.nodes().back(),
 331                                 p.p_root_.cost(
 332                                                 ron,
 333                                                 p.p_root_.nodes().back()));
 334                 ron = p.p_root_.nodes().back();
 335                 gon = gon->parent();
 336         }
 337         ron->add_child(p.goal(), p.p_root_.cost(ron, p.goal()));
 338         }
 339         // end of connect trees
 340         if (gf)
 341                 p.tlog(p.findt());
 342         if (p.opt_path())
 343                 p.tlog(p.findt());
 344 #endif
 345         TEND();
 346         TPRINT("RRT");
 347         jvo["rrte"] = ELAPSED;
 348 #ifdef JSONLOGEDGES
 349         p.logr(p.root());
 350 #endif
 351
 352         // statistics to error output
 353         std::cerr << "TELAPSED is " << TELAPSED << std::endl;
 354         std::cerr << "Elapsed is " << p.elapsed() << std::endl;
 355         std::cerr << "Goal found is " << p.goal_found() << std::endl;
 356         std::cerr << "#nodes is " << p.nodes().size() << std::endl;
 357         std::cerr << "#samples is " << p.samples().size() << std::endl;
 358         std::cerr << "`tlog` size is " << p.tlog().size() << std::endl;
 359         std::cerr << "trajectories costs:" << std::endl;
 360         for (j = 0; j < p.clog().size(); j++)
 361                 std::cerr << "- " << p.clog()[j] << std::endl;
 362         std::cerr << "RRT #nodes:" << std::endl;
 363         for (j = 0; j < p.nlog().size(); j++)
 364                 std::cerr << "- " << p.nlog()[j] << std::endl;
 365         std::cerr << "trajectories seconds:" << std::endl;
 366         for (j = 0; j < p.slog().size(); j++)
 367                 std::cerr << "- " << p.slog()[j] << std::endl;
 368         std::cerr << "RRT edges (from root) log size: " << p.rlog().size();
 369         std::cerr << std::endl;
 370         for (auto edges: p.rlog())
 371                 std::cerr << "- " << edges.size() << std::endl;
 372
 373         // JSON output
 374         jvo["elap"] = TELAPSED;
 375 #ifdef USE_PTHREAD
 376         jvo["nodo"][0] = nodo;
 377 #endif
 378         // log cost
 379         for (j = 0; j < p.clog().size(); j++)
 380                 jvo["cost"][j] = p.clog()[j];
 381         // log #nodes
 382         for (j = 0; j < p.nlog().size(); j++)
 383                 jvo["node"][j] = p.nlog()[j];
 384         // log seconds
 385         for (j = 0; j < p.slog().size(); j++)
 386                 jvo["secs"][j] = p.slog()[j];
 387         // log traj
 388         i = 0;
 389         j = 0;
 390         for (auto traj: p.tlog()) {
 391                 i = 0;
 392                 for (auto n: traj) {
 393                         jvo["traj"][j][i][0] = n->x();
 394                         jvo["traj"][j][i][1] = n->y();
 395                         jvo["traj"][j][i][2] = n->h();
 396                         jvo["traj"][j][i][3] = n->t();
 397                         jvo["traj"][j][i][4] = n->s();
 398                         i++;
 399                 }
 400                 j++;
 401         }
 402 #ifdef JSONLOGEDGES
 403         i = 0;
 404         j = 0;
 405         for (auto edges: p.rlog()) {
 406                 j = 0;
 407                 for (auto e: edges) {
 408                         jvo["edge"][i][j][0][0] = e->init()->x();
 409                         jvo["edge"][i][j][0][1] = e->init()->y();
 410                         jvo["edge"][i][j][0][2] = e->init()->h();
 411                         jvo["edge"][i][j][1][0] = e->goal()->x();
 412                         jvo["edge"][i][j][1][1] = e->goal()->y();
 413                         jvo["edge"][i][j][1][2] = e->goal()->h();
 414                         j++;
 415                 }
 416                 i++;
 417         }
 418 #endif
 419 #ifdef JSONLOGSAMPLES
 420         i = 0;
 421         j = 0;
 422         for (auto s: p.samples()) {
 423                 jvo["samp"][j][0] = s->x();
 424                 jvo["samp"][j][1] = s->y();
 425                 jvo["samp"][j][2] = s->h();
 426                 j++;
 427         }
 428 #endif
 429         // print output
 430         std::cout << jvo << std::endl;
 431
 432 #ifdef USE_GL
 433         SDL_DestroyWindow(gw);
 434         SDL_Quit();
 435 #endif
 436
 437         // free mem
 438         for (auto o: so) {
 439                 delete o.init();
 440                 delete o.goal();
 441         }
 442         return 0;
 443 }
 444
 445 bool init()
 446 {
 447         if (SDL_Init(SDL_INIT_VIDEO) < 0) {
 448                 std::cerr << "SDL could not initialize! SDL_Error: ";
 449                 std::cerr << SDL_GetError();
 450                 std::cerr << std::endl;
 451                 return false;
 452         }
 453         SDL_GL_SetAttribute(SDL_GL_CONTEXT_MAJOR_VERSION, 2);
 454         SDL_GL_SetAttribute(SDL_GL_CONTEXT_MINOR_VERSION, 1);
 455         gw = SDL_CreateWindow(
 456                         "I am car",
 457                         SDL_WINDOWPOS_UNDEFINED,
 458                         SDL_WINDOWPOS_UNDEFINED,
 459                         SCREEN_WIDTH,
 460                         SCREEN_HEIGHT,
 461                         SDL_WINDOW_OPENGL | SDL_WINDOW_SHOWN);
 462         if (gw == NULL) {
 463                 std::cerr << "Window could not be created! SDL_Error: ";
 464                 std::cerr << SDL_GetError();
 465                 std::cerr << std::endl;
 466                 return false;
 467         }
 468         gc = SDL_GL_CreateContext(gw);
 469         if (gc == NULL) {
 470                 std::cerr << "OpenGL context couldn't be created! SDL Error: ";
 471                 std::cerr << SDL_GetError();
 472                 std::cerr << std::endl;
 473                 return false;
 474         }
 475         if (SDL_GL_SetSwapInterval(1) < 0) {
 476                 std::cerr << "Warning: Unable to set VSync! SDL Error: ";
 477                 std::cerr << SDL_GetError();
 478                 std::cerr << std::endl;
 479                 return false;
 480         }
 481         if (!initGL()) {
 482                 std::cerr << "Unable to initialize OpenGL!";
 483                 std::cerr << std::endl;
 484                 return false;
 485         }
 486         return true;
 487 }
 488
 489 bool initGL()
 490 {
 491         GLenum error = GL_NO_ERROR;
 492         glMatrixMode(GL_PROJECTION);
 493         glLoadIdentity();
 494         error = glGetError();
 495         if (error != GL_NO_ERROR) {
 496                 std::cerr << "Error initializing OpenGL! ";
 497                 std::cerr << gluErrorString(error);
 498                 std::cerr << std::endl;
 499                 return false;
 500         }
 501         glMatrixMode(GL_MODELVIEW);
 502         glLoadIdentity();
 503         error = glGetError();
 504         if (error != GL_NO_ERROR) {
 505                 std::cerr << "Error initializing OpenGL! ";
 506                 std::cerr << gluErrorString(error);
 507                 std::cerr << std::endl;
 508                 return false;
 509         }
 510         glClearColor(1, 1, 1, 1);
 511         error = glGetError();
 512         if (error != GL_NO_ERROR) {
 513                 std::cerr << "Error initializing OpenGL! ";
 514                 std::cerr << gluErrorString(error);
 515                 std::cerr << std::endl;
 516                 return false;
 517         }
 518         return true;
 519 }