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/>.
23 #include <jsoncpp/json/json.h>
29 #include "rrtplanner.h"
30 #include "slotplanner.h"
40 //#define JSONLOGEDGES
41 //#define JSONLOGSAMPLES
47 //#define USE_INTERRUPT
56 std::chrono::high_resolution_clock::time_point TSTART_;
57 std::chrono::high_resolution_clock::time_point TEND_;
60 void TSTART() {TSTART_ = std::chrono::high_resolution_clock::now();}
62 std::chrono::duration<float> DT_;
63 TEND_ = std::chrono::high_resolution_clock::now();
64 DT_ = std::chrono::duration_cast<std::chrono::duration<float>>(
67 TELAPSED += DT_.count();
68 ELAPSED = DT_.count();
70 void TPRINT(const char *what) {
71 std::chrono::duration<float> DT_;
72 DT_ = std::chrono::duration_cast<std::chrono::duration<float>>(
75 std::cerr << what << ": " << DT_.count() << std::endl;
78 bool run_planner = true;
81 SDL_Window* gw = NULL;
99 void *next_run(void *arg)
101 struct next_arg *na = (struct next_arg *) arg;
102 T2 *lp = (T2 *) na->p;
104 while (!*gf && lp->elapsed() < TMAX) {
116 float new_x = 1 + static_cast<float>(rand()) /
117 static_cast<float>(RAND_MAX / (6.6 - 1 - 1));
119 float new_h = M_PI / 2;
120 return new RRTNode(new_x, new_y, new_h);
125 srand(static_cast<unsigned>(time(0)));
130 Json::Value jvi; // JSON input
131 Json::Value jvo; // JSON output
135 std::string encoding = jvi.get("encoding", "UTF-8" ).asString();
139 jvi["init"][0].asFloat(),
140 jvi["init"][1].asFloat(),
141 jvi["init"][2].asFloat()),
143 jvi["goal"][0].asFloat(),
144 jvi["goal"][1].asFloat(),
145 jvi["goal"][2].asFloat()));
146 jvo["init"][0] = p.root()->x();
147 jvo["init"][1] = p.root()->y();
148 jvo["init"][2] = p.root()->h();
149 std::vector<CircleObstacle> co;
150 std::vector<SegmentObstacle> so;
151 for (auto o: jvi["obst"]) {
152 if (o["circle"] != Json::nullValue) {
153 co.push_back(CircleObstacle(
154 o["circle"][0].asFloat(),
155 o["circle"][1].asFloat(),
156 o["circle"][2].asFloat()));
158 if (o["segment"] != Json::nullValue) {
159 so.push_back(SegmentObstacle(
161 o["segment"][0][0].asFloat(),
162 o["segment"][0][1].asFloat(),
165 o["segment"][1][0].asFloat(),
166 o["segment"][1][1].asFloat(),
168 p.frame().add_bnode(so.back().init());
171 p.link_obstacles(&co, &so);
175 ParallelSlot ps = ParallelSlot();
177 jvi["slot"] != Json::nullValue &&
178 jvi["slot"]["polygon"] != Json::nullValue
180 for (auto xy: jvi["slot"]["polygon"]) {
181 ps.slot().add_bnode(new RRTNode(
187 #ifdef USE_SLOTPLANNER
189 if (ps.slot().bnodes().size() > 0)
192 jvo["ppse"] = ELAPSED;
193 TPRINT("ParallelSlot");
195 if (ps.slot().bnodes().size() > 0) {
197 p.samplingInfo_ = ps.getSamplingInfo();
198 p.useSamplingInfo_ = true;
200 if (ps.cusp().size() > 0) {
201 p.goal(ps.getMidd());
203 p.slot_cusp(ps.cusp().front()); // use first found solution
204 jvo["midd"][0] = p.goal()->x();
205 jvo["midd"][1] = p.goal()->y();
206 jvo["midd"][2] = p.goal()->h();
207 jvo["goal"][0] = p.slot_cusp().back()->x();
208 jvo["goal"][1] = p.slot_cusp().back()->y();
209 jvo["goal"][2] = p.slot_cusp().back()->h();
211 jvo["goal"][0] = p.goal()->x();
212 jvo["goal"][1] = p.goal()->y();
213 jvo["goal"][2] = p.goal()->h();
216 std::cerr << "Slot Info:" << std::endl;
217 if (ps.slotSide() == LEFT)
218 std::cerr << "- LEFT" << std::endl;
220 std::cerr << "- RIGHT" << std::endl;
221 if (ps.slotType() == PARALLEL)
222 std::cerr << "- PARALLEL" << std::endl;
224 std::cerr << "- PERPENDICULAR" << std::endl;
226 std::vector<RRTNode *> steered;
227 for (auto jn: jvi["traj"][0]) {
228 steered.push_back(new RRTNode(
235 std::reverse(steered.begin(), steered.end());
236 RRTNode *pn = p.root();
237 for (auto n: steered) {
240 pn->add_child(n, p.cost(pn, n));
244 pn->add_child(p.goal(), p.cost(pn, p.goal()));
253 #elif defined USE_INTERRUPT
254 signal(SIGINT, hint);
255 signal(SIGTERM, hint);
257 while (run_planner) {
264 #elif defined USE_TMAX
267 while (!p.goal_found() && p.elapsed() < TMAX) {
274 #elif defined USE_PTHREAD
276 RRTNode *ron = nullptr;
277 RRTNode *gon = nullptr;
279 pthread_t rt; // root thread
280 pthread_t gt; // goal thread
281 pthread_t ct; // connect thread
294 pthread_create(&rt, NULL, &next_run, (void *) &ra);
295 pthread_create(>, NULL, &next_run, (void *) &ga);
299 while (!gf && p.elapsed() < TMAX &&
300 p.p_root_.nodes().size() < NOFNODES &&
301 p.p_goal_.nodes().size() < NOFNODES) {
304 for (int i = 0; i < IXSIZE; i++) {
305 for (int j = 0; j < IYSIZE; j++) {
306 if (p.p_root_.ixy_[i][j].changed() &&
307 p.p_goal_.ixy_[i][j].changed()) {
309 for (auto rn: p.p_root_.ixy_[i][j].nodes()) {
310 for (auto gn: p.p_goal_.ixy_[i][j].nodes()) {
311 if (rn->ccost() + gn->ccost() < mc &&
317 mc = rn->ccost() + gn->ccost();
325 if (p.elapsed() >= TMAX)
328 // end of overlap trees
332 pthread_join(rt, NULL);
333 pthread_join(gt, NULL);
334 float nodo = ((float) ndl / (float) tol);
335 std::cerr << "nothing done is " << 100.0 * nodo;
336 std::cerr << "%" << std::endl;
337 //std::cerr << "rgf is " << p.p_root_.goal_found() << std::endl;
338 //std::cerr << "ggf is " << p.p_goal_.goal_found() << std::endl;
339 //std::cerr << "cgf is " << p.goal_found() << std::endl;
340 if (p.p_root_.goal_found() && p.p_root_.goal()->ccost() < mc) {
341 ron = p.p_root_.goal()->parent();
342 gon = p.p_root_.goal();
343 mc = p.p_root_.goal()->ccost();
345 if (p.p_goal_.goal_found() && p.p_goal_.goal()->ccost() < mc) {
346 ron = p.p_goal_.goal();
347 gon = p.p_goal_.goal()->parent();
348 mc = p.p_goal_.goal()->ccost();
350 p.root()->remove_parent(); // needed if p.p_goal_.goal_found()
352 p.goal()->children().clear();
355 while (gon != p.goal()) {
356 p.p_root_.nodes().push_back(new RRTNode(
361 p.p_root_.nodes().back(),
364 p.p_root_.nodes().back()));
365 ron = p.p_root_.nodes().back();
368 ron->add_child(p.goal(), p.p_root_.cost(ron, p.goal()));
370 // end of connect trees
378 jvo["rrte"] = ELAPSED;
383 // statistics to error output
384 std::cerr << "TELAPSED is " << TELAPSED << std::endl;
385 std::cerr << "Elapsed is " << p.elapsed() << std::endl;
386 std::cerr << "Goal found is " << p.goal_found() << std::endl;
387 std::cerr << "#nodes is " << p.nodes().size() << std::endl;
388 std::cerr << "#samples is " << p.samples().size() << std::endl;
389 std::cerr << "`tlog` size is " << p.tlog().size() << std::endl;
390 std::cerr << "trajectories costs:" << std::endl;
391 for (j = 0; j < p.clog().size(); j++)
392 std::cerr << "- " << p.clog()[j] << std::endl;
393 std::cerr << "RRT #nodes:" << std::endl;
394 for (j = 0; j < p.nlog().size(); j++)
395 std::cerr << "- " << p.nlog()[j] << std::endl;
396 std::cerr << "trajectories seconds:" << std::endl;
397 for (j = 0; j < p.slog().size(); j++)
398 std::cerr << "- " << p.slog()[j] << std::endl;
399 std::cerr << "RRT edges (from root) log size: " << p.rlog().size();
400 std::cerr << std::endl;
401 for (auto edges: p.rlog())
402 std::cerr << "- " << edges.size() << std::endl;
405 jvo["elap"] = TELAPSED;
407 jvo["nodo"][0] = nodo;
410 for (j = 0; j < p.clog().size(); j++)
411 jvo["cost"][j] = p.clog()[j];
413 for (j = 0; j < p.nlog().size(); j++)
414 jvo["node"][j] = p.nlog()[j];
416 for (j = 0; j < p.slog().size(); j++)
417 jvo["secs"][j] = p.slog()[j];
421 for (auto traj: p.tlog()) {
424 jvo["traj"][j][i][0] = n->x();
425 jvo["traj"][j][i][1] = n->y();
426 jvo["traj"][j][i][2] = n->h();
427 jvo["traj"][j][i][3] = n->t();
428 jvo["traj"][j][i][4] = n->s();
436 for (auto edges: p.rlog()) {
438 for (auto e: edges) {
439 jvo["edge"][i][j][0][0] = e->init()->x();
440 jvo["edge"][i][j][0][1] = e->init()->y();
441 jvo["edge"][i][j][0][2] = e->init()->h();
442 jvo["edge"][i][j][1][0] = e->goal()->x();
443 jvo["edge"][i][j][1][1] = e->goal()->y();
444 jvo["edge"][i][j][1][2] = e->goal()->h();
450 #ifdef JSONLOGSAMPLES
453 for (auto s: p.samples()) {
454 jvo["samp"][j][0] = s->x();
455 jvo["samp"][j][1] = s->y();
456 jvo["samp"][j][2] = s->h();
461 std::cout << jvo << std::endl;
464 SDL_DestroyWindow(gw);
479 if (SDL_Init(SDL_INIT_VIDEO) < 0) {
480 std::cerr << "SDL could not initialize! SDL_Error: ";
481 std::cerr << SDL_GetError();
482 std::cerr << std::endl;
485 SDL_GL_SetAttribute(SDL_GL_CONTEXT_MAJOR_VERSION, 2);
486 SDL_GL_SetAttribute(SDL_GL_CONTEXT_MINOR_VERSION, 1);
487 gw = SDL_CreateWindow(
489 SDL_WINDOWPOS_UNDEFINED,
490 SDL_WINDOWPOS_UNDEFINED,
493 SDL_WINDOW_OPENGL | SDL_WINDOW_SHOWN);
495 std::cerr << "Window could not be created! SDL_Error: ";
496 std::cerr << SDL_GetError();
497 std::cerr << std::endl;
500 gc = SDL_GL_CreateContext(gw);
502 std::cerr << "OpenGL context couldn't be created! SDL Error: ";
503 std::cerr << SDL_GetError();
504 std::cerr << std::endl;
507 if (SDL_GL_SetSwapInterval(1) < 0) {
508 std::cerr << "Warning: Unable to set VSync! SDL Error: ";
509 std::cerr << SDL_GetError();
510 std::cerr << std::endl;
514 std::cerr << "Unable to initialize OpenGL!";
515 std::cerr << std::endl;
523 GLenum error = GL_NO_ERROR;
524 glMatrixMode(GL_PROJECTION);
526 error = glGetError();
527 if (error != GL_NO_ERROR) {
528 std::cerr << "Error initializing OpenGL! ";
529 std::cerr << gluErrorString(error);
530 std::cerr << std::endl;
533 glMatrixMode(GL_MODELVIEW);
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 glClearColor(1, 1, 1, 1);
543 error = glGetError();
544 if (error != GL_NO_ERROR) {
545 std::cerr << "Error initializing OpenGL! ";
546 std::cerr << gluErrorString(error);
547 std::cerr << std::endl;