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/>.
20 #include <jsoncpp/json/json.h>
26 #include "rrtplanner.h"
33 //#define JSONLOGEDGES
34 //#define JSONLOGSAMPLES
37 //#define USE_INTERRUPT
49 bool run_planner = true;
51 SDL_Window* gw = NULL;
68 void *next_run(void *arg)
70 struct next_arg *na = (struct next_arg *) arg;
71 T2 *lp = (T2 *) na->p;
73 while (!*gf && lp->elapsed() < TMAX) {
89 Json::Value jvi; // JSON input
90 Json::Value jvo; // JSON output
94 std::string encoding = jvi.get("encoding", "UTF-8" ).asString();
98 jvi["init"][0].asFloat(),
99 jvi["init"][1].asFloat(),
100 jvi["init"][2].asFloat()),
102 jvi["goal"][0].asFloat(),
103 jvi["goal"][1].asFloat(),
104 jvi["goal"][2].asFloat()));
105 std::vector<CircleObstacle> co;
106 std::vector<SegmentObstacle> so;
107 for (auto o: jvi["obst"]) {
108 if (o["circle"] != Json::nullValue) {
109 co.push_back(CircleObstacle(
110 o["circle"][0].asFloat(),
111 o["circle"][1].asFloat(),
112 o["circle"][2].asFloat()));
114 if (o["segment"] != Json::nullValue) {
115 so.push_back(SegmentObstacle(
117 o["segment"][0][0].asFloat(),
118 o["segment"][0][1].asFloat(),
121 o["segment"][1][0].asFloat(),
122 o["segment"][1][1].asFloat(),
126 p.link_obstacles(&co, &so);
131 std::vector<RRTNode *> steered;
132 for (auto jn: jvi["traj"][0]) {
133 steered.push_back(new RRTNode(
140 std::reverse(steered.begin(), steered.end());
141 RRTNode *pn = p.root();
142 for (auto n: steered) {
145 pn->add_child(n, p.cost(pn, n));
149 pn->add_child(p.goal(), p.cost(pn, p.goal()));
158 #elif defined USE_INTERRUPT
159 signal(SIGINT, hint);
160 signal(SIGTERM, hint);
162 while (run_planner) {
169 #elif defined USE_TMAX
172 while (!p.goal_found() && p.elapsed() < TMAX) {
178 #elif defined USE_PTHREAD
180 RRTNode *ron = nullptr;
181 RRTNode *gon = nullptr;
183 pthread_t rt; // root thread
184 pthread_t gt; // goal thread
185 pthread_t ct; // connect thread
198 pthread_create(&rt, NULL, &next_run, (void *) &ra);
199 pthread_create(>, NULL, &next_run, (void *) &ga);
200 volatile int nofrn = 0;
201 volatile int nofgn = 0;
202 RRTNode *rn = nullptr;
203 RRTNode *gn = nullptr;
204 while (!gf && p.elapsed() < TMAX) {
206 nofrn = p.p_root_.nodes().size() - 1; // TODO workaround
207 nofgn = p.p_goal_.nodes().size() - 1;
208 for (int i = 0; i < nofrn; i++) {
209 rn = p.p_root_.nodes()[i];
210 if (rn->parent() == nullptr)
212 for (int j = 0; j < nofgn; j++) {
213 gn = p.p_goal_.nodes()[j];
214 if (gn->parent() == nullptr)
216 if (rn->ccost() + gn->ccost() < mc &&
222 mc = rn->ccost() + gn->ccost();
226 // end of overlap trees
229 pthread_join(rt, NULL);
230 pthread_join(gt, NULL);
231 if (p.p_root_.goal_found() && p.p_root_.goal()->ccost() < mc) {
232 ron = p.p_root_.goal()->parent();
233 gon = p.p_root_.goal();
234 mc = p.p_root_.goal()->ccost();
236 if (p.p_goal_.goal_found() && p.p_goal_.goal()->ccost() < mc) {
237 ron = p.p_goal_.goal();
238 gon = p.p_goal_.goal()->parent();
239 mc = p.p_goal_.goal()->ccost();
242 while (gon != p.goal()) {
243 p.p_root_.nodes().push_back(new RRTNode(
248 p.p_root_.nodes().back(),
251 p.p_root_.nodes().back()));
252 ron = p.p_root_.nodes().back();
255 ron->add_child(p.goal(), p.p_root_.cost(ron, p.goal()));
256 // end of connect trees
257 p.root()->remove_parent(); // needed if p.p_goal_.goal_found()
267 // statistics to error output
268 std::cerr << "Elapsed is " << p.elapsed() << std::endl;
269 std::cerr << "Goal found is " << p.goal_found() << std::endl;
270 std::cerr << "#nodes is " << p.nodes().size() << std::endl;
271 std::cerr << "#samples is " << p.samples().size() << std::endl;
272 std::cerr << "`tlog` size is " << p.tlog().size() << std::endl;
273 std::cerr << "trajectories costs:" << std::endl;
274 for (j = 0; j < p.clog().size(); j++)
275 std::cerr << "- " << p.clog()[j] << std::endl;
276 std::cerr << "RRT #nodes:" << std::endl;
277 for (j = 0; j < p.nlog().size(); j++)
278 std::cerr << "- " << p.nlog()[j] << std::endl;
279 std::cerr << "trajectories seconds:" << std::endl;
280 for (j = 0; j < p.slog().size(); j++)
281 std::cerr << "- " << p.slog()[j] << std::endl;
282 std::cerr << "RRT edges (from root) log size: " << p.rlog().size();
283 std::cerr << std::endl;
284 for (auto edges: p.rlog())
285 std::cerr << "- " << edges.size() << std::endl;
288 jvo["elap"] = p.elapsed();
290 for (j = 0; j < p.clog().size(); j++)
291 jvo["cost"][j] = p.clog()[j];
293 for (j = 0; j < p.nlog().size(); j++)
294 jvo["node"][j] = p.nlog()[j];
296 for (j = 0; j < p.slog().size(); j++)
297 jvo["secs"][j] = p.slog()[j];
301 for (auto traj: p.tlog()) {
304 jvo["traj"][j][i][0] = n->x();
305 jvo["traj"][j][i][1] = n->y();
306 jvo["traj"][j][i][2] = n->h();
307 jvo["traj"][j][i][3] = n->t();
308 jvo["traj"][j][i][4] = n->s();
316 for (auto edges: p.rlog()) {
318 for (auto e: edges) {
319 jvo["edge"][i][j][0][0] = e->init()->x();
320 jvo["edge"][i][j][0][1] = e->init()->y();
321 jvo["edge"][i][j][0][2] = e->init()->h();
322 jvo["edge"][i][j][1][0] = e->goal()->x();
323 jvo["edge"][i][j][1][1] = e->goal()->y();
324 jvo["edge"][i][j][1][2] = e->goal()->h();
330 #ifdef JSONLOGSAMPLES
333 for (auto s: p.samples()) {
334 jvo["samp"][j][0] = s->x();
335 jvo["samp"][j][1] = s->y();
336 jvo["samp"][j][2] = s->h();
341 std::cout << jvo << std::endl;
344 SDL_DestroyWindow(gw);
358 if (SDL_Init(SDL_INIT_VIDEO) < 0) {
359 std::cerr << "SDL could not initialize! SDL_Error: ";
360 std::cerr << SDL_GetError();
361 std::cerr << std::endl;
364 SDL_GL_SetAttribute(SDL_GL_CONTEXT_MAJOR_VERSION, 2);
365 SDL_GL_SetAttribute(SDL_GL_CONTEXT_MINOR_VERSION, 1);
366 gw = SDL_CreateWindow(
368 SDL_WINDOWPOS_UNDEFINED,
369 SDL_WINDOWPOS_UNDEFINED,
372 SDL_WINDOW_OPENGL | SDL_WINDOW_SHOWN);
374 std::cerr << "Window could not be created! SDL_Error: ";
375 std::cerr << SDL_GetError();
376 std::cerr << std::endl;
379 gc = SDL_GL_CreateContext(gw);
381 std::cerr << "OpenGL context couldn't be created! SDL Error: ";
382 std::cerr << SDL_GetError();
383 std::cerr << std::endl;
386 if (SDL_GL_SetSwapInterval(1) < 0) {
387 std::cerr << "Warning: Unable to set VSync! SDL Error: ";
388 std::cerr << SDL_GetError();
389 std::cerr << std::endl;
393 std::cerr << "Unable to initialize OpenGL!";
394 std::cerr << std::endl;
402 GLenum error = GL_NO_ERROR;
403 glMatrixMode(GL_PROJECTION);
405 error = glGetError();
406 if (error != GL_NO_ERROR) {
407 std::cerr << "Error initializing OpenGL! ";
408 std::cerr << gluErrorString(error);
409 std::cerr << std::endl;
412 glMatrixMode(GL_MODELVIEW);
414 error = glGetError();
415 if (error != GL_NO_ERROR) {
416 std::cerr << "Error initializing OpenGL! ";
417 std::cerr << gluErrorString(error);
418 std::cerr << std::endl;
421 glClearColor(1, 1, 1, 1);
422 error = glGetError();
423 if (error != GL_NO_ERROR) {
424 std::cerr << "Error initializing OpenGL! ";
425 std::cerr << gluErrorString(error);
426 std::cerr << std::endl;