2 This file is part of I am car.
4 I am car is free 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/>.
35 extern SDL_Window* gw;
36 extern SDL_GLContext gc;
40 for (auto n: this->nodes_)
43 for (auto n: this->dnodes_)
44 if (n != this->root_ && n != this->goal_)
46 for (auto s: this->samples_)
49 for (auto edges: this->rlog_)
60 this->nodes_.push_back(this->root_);
61 this->add_iy(this->root_);
64 RRTBase::RRTBase(RRTNode *init, RRTNode *goal):
68 this->nodes_.push_back(init);
73 RRTNode *RRTBase::root()
78 RRTNode *RRTBase::goal()
83 std::vector<RRTNode *> &RRTBase::nodes()
88 std::vector<RRTNode *> &RRTBase::dnodes()
93 std::vector<RRTNode *> &RRTBase::samples()
95 return this->samples_;
98 std::vector<CircleObstacle> *RRTBase::co()
100 return this->cobstacles_;
103 std::vector<SegmentObstacle> *RRTBase::so()
105 return this->sobstacles_;
108 std::vector<float> &RRTBase::clog()
113 std::vector<float> &RRTBase::nlog()
118 std::vector<std::vector<RRTEdge *>> &RRTBase::rlog()
123 std::vector<float> &RRTBase::slog()
128 std::vector<std::vector<RRTNode *>> &RRTBase::tlog()
133 bool RRTBase::goal_found()
135 return this->goal_found_;
138 float RRTBase::elapsed()
140 std::chrono::duration<float> dt;
141 dt = std::chrono::duration_cast<std::chrono::duration<float>>(
142 this->tend_ - this->tstart_);
147 void RRTBase::root(RRTNode *node)
152 void RRTBase::goal(RRTNode *node)
157 bool RRTBase::logr(RRTNode *root)
159 std::vector<RRTEdge *> e; // Edges to log
160 std::vector<RRTNode *> s; // DFS stack
161 std::vector<RRTNode *> r; // reset visited_
164 while (s.size() > 0) {
169 for (auto ch: tmp->children()) {
171 e.push_back(new RRTEdge(tmp, ch));
177 this->rlog_.push_back(e);
181 float RRTBase::ocost(RRTNode *n)
184 for (auto o: *this->cobstacles_)
185 if (o.dist_to(n) < dist)
187 for (auto o: *this->sobstacles_)
188 if (o.dist_to(n) < dist)
190 return n->ocost(dist);
193 bool RRTBase::tlog(std::vector<RRTNode *> t)
196 this->slog_.push_back(this->elapsed());
197 this->clog_.push_back(t.front()->ccost() - t.back()->ccost());
198 this->nlog_.push_back(this->nodes_.size());
199 this->tlog_.push_back(t);
206 void RRTBase::tstart()
208 this->tstart_ = std::chrono::high_resolution_clock::now();
213 this->tend_ = std::chrono::high_resolution_clock::now();
216 bool RRTBase::link_obstacles(
217 std::vector<CircleObstacle> *cobstacles,
218 std::vector<SegmentObstacle> *sobstacles)
220 this->cobstacles_ = cobstacles;
221 this->sobstacles_ = sobstacles;
222 if (!this->cobstacles_ || !this->sobstacles_) {
228 bool RRTBase::add_iy(RRTNode *n)
235 this->iy_[i].push_back(n);
239 bool RRTBase::goal_found(bool f)
241 this->goal_found_ = f;
246 bool RRTBase::glplot()
248 glClear(GL_COLOR_BUFFER_BIT);
253 for (auto o: *this->sobstacles_) {
255 glVertex2f(GLVERTEX(o.init()));
256 glVertex2f(GLVERTEX(o.goal()));
263 glVertex2f(GLVERTEX(this->root_));
264 glVertex2f(GLVERTEX(this->goal_));
267 if (this->samples_.size() > 0) {
271 glVertex2f(GLVERTEX(this->samples_.back()));
275 std::vector<RRTNode *> s; // DFS stack
276 std::vector<RRTNode *> r; // reset visited_
279 s.push_back(this->root_);
280 while (s.size() > 0) {
285 for (auto ch: tmp->children()) {
287 glColor3f(0.5, 0.5, 0.5);
288 glVertex2f(GLVERTEX(tmp));
289 glVertex2f(GLVERTEX(ch));
294 // Plot nodes (from goal)
296 s.push_back(this->goal_);
297 while (s.size() > 0) {
302 for (auto ch: tmp->children()) {
304 glColor3f(0.5, 0.5, 0.5);
305 glVertex2f(GLVERTEX(tmp));
306 glVertex2f(GLVERTEX(ch));
311 std::vector<RRTNode *> cusps;
312 // Plot last trajectory
313 if (this->tlog().size() > 0) {
316 for (auto n: this->tlog().back()) {
319 glVertex2f(GLVERTEX(n));
320 glVertex2f(GLVERTEX(n->parent()));
321 if (sgn(n->s()) != sgn(n->parent()->s()))
330 for (auto n: cusps) {
332 glVertex2f(GLVERTEX(n));
335 SDL_GL_SwapWindow(gw);
341 bool RRTBase::goal_found(
343 float (*cost)(RRTNode *, RRTNode* ))
345 float xx = pow(node->x() - this->goal_->x(), 2);
346 float yy = pow(node->y() - this->goal_->y(), 2);
347 float dh = std::abs(node->h() - this->goal_->h());
348 if (IS_NEAR(node, this->goal_)) {
349 if (this->goal_found_) {
350 if (node->ccost() + (*cost)(node, this->goal_) <
351 this->goal_->ccost()) {
352 RRTNode *op; // old parent
353 float oc; // old cumulative cost
354 float od; // old direct cost
355 op = this->goal_->parent();
356 oc = this->goal_->ccost();
357 od = this->goal_->dcost();
358 node->add_child(this->goal_,
359 (*cost)(node, this->goal_));
360 if (this->collide(node, this->goal_)) {
361 node->children().pop_back();
362 this->goal_->parent(op);
363 this->goal_->ccost(oc);
364 this->goal_->dcost(od);
366 op->rem_child(this->goal_);
375 (*cost)(node, this->goal_));
376 if (this->collide(node, this->goal_)) {
377 node->children().pop_back();
378 this->goal_->remove_parent();
381 this->goal_found_ = true;
388 bool RRTBase::collide(RRTNode *init, RRTNode *goal)
390 std::vector<RRTEdge *> edges;
392 volatile bool col = false;
394 while (tmp != init) {
395 BicycleCar bc(tmp->x(), tmp->y(), tmp->h());
396 std::vector<RRTEdge *> bcframe = bc.frame();
397 #pragma omp parallel for reduction(|: col)
398 for (i = 0; i < (*this->cobstacles_).size(); i++) {
399 if ((*this->cobstacles_)[i].collide(tmp)) {
402 for (auto &e: bcframe) {
403 if ((*this->cobstacles_)[i].collide(e)) {
409 for (auto e: bcframe) {
414 for (auto e: edges) {
419 #pragma omp parallel for reduction(|: col)
420 for (i = 0; i < (*this->sobstacles_).size(); i++) {
421 for (auto &e: bcframe) {
422 if ((*this->sobstacles_)[i].collide(e)) {
428 for (auto e: bcframe) {
433 for (auto e: edges) {
438 if (!tmp->parent()) {
441 edges.push_back(new RRTEdge(tmp, tmp->parent()));
443 for (auto e: bcframe) {
449 for (auto &e: edges) {
450 #pragma omp parallel for reduction(|: col)
451 for (i = 0; i < (*this->cobstacles_).size(); i++) {
452 if ((*this->cobstacles_)[i].collide(e)) {
457 for (auto e: edges) {
462 #pragma omp parallel for reduction(|: col)
463 for (i = 0; i < (*this->sobstacles_).size(); i++) {
464 if ((*this->sobstacles_)[i].collide(e)) {
469 for (auto e: edges) {
475 for (auto e: edges) {
481 class RRTNodeDijkstra {
483 RRTNodeDijkstra(int i):
489 RRTNodeDijkstra(int i, float c):
495 RRTNodeDijkstra(int i, int p, float c):
514 class RRTNodeDijkstraComparator {
517 const RRTNodeDijkstra& n1,
518 const RRTNodeDijkstra& n2)
524 bool RRTBase::optp_dijkstra(
525 std::vector<RRTNode *> &cusps,
526 std::vector<int> &npi)
528 std::vector<RRTNodeDijkstra> dnodes;
529 for (unsigned int i = 0; i < cusps.size(); i++)
531 dnodes.push_back(RRTNodeDijkstra(
536 dnodes.push_back(RRTNodeDijkstra(
542 std::vector<RRTNodeDijkstra>,
543 RRTNodeDijkstraComparator> pq;
544 RRTNodeDijkstra tmp = dnodes[0];
546 float ch_cost = 9999;
547 std::vector<RRTNode *> steered;
548 while (!pq.empty()) {
551 for (unsigned int i = tmp.ni + 1; i < cusps.size(); i++) {
552 ch_cost = dnodes[tmp.ni].c +
553 this->cost(cusps[tmp.ni], cusps[i]);
554 steered = this->steer(cusps[tmp.ni], cusps[i]);
555 for (unsigned int j = 0; j < steered.size() - 1; j++)
556 steered[j]->add_child(steered[j + 1], 1);
559 steered[steered.size() - 1]))
561 if (ch_cost < dnodes[i].c) {
562 dnodes[i].c = ch_cost;
563 dnodes[i].pi = tmp.ni;
567 for (auto n: steered)
571 unsigned int tmpi = 0;
572 for (auto n: dnodes) {
573 if (n.v && n.ni > tmpi)
578 tmpi = dnodes[tmpi].pi;
581 std::reverse(npi.begin(), npi.end());
585 bool RRTBase::optp_rrp(
586 std::vector<RRTNode *> &cusps,
587 std::vector<int> &npi)
589 std::vector<RRTNode *> steered;
590 std::vector<int> candidates;
591 RRTNode *x_j = nullptr;
592 RRTNode *x_i = nullptr;
593 int j = cusps.size() - 1;
607 for (int i = 0; i < j; i++) {
608 steered = this->steer(cusps[i], x_j);
609 for (unsigned int k = 0; k < steered.size() - 1; k++)
610 steered[k]->add_child(steered[k + 1], 1);
613 steered[steered.size() - 1]))
614 candidates.push_back(i);
616 if (candidates.size() <= 0)
618 i_min = candidates[0];
621 for (auto c: candidates) {
623 dx = x_j->x() - x_i->x();
624 dy = x_j->y() - x_i->y();
625 ed = EDIST(x_i, x_j);
626 th_i = (cos(x_i->h()) * dx + sin(x_i->h()) * dy) / ed;
627 th_j = (cos(x_j->h()) * dx + sin(x_j->h()) * dy) / ed;
638 std::reverse(npi.begin(), npi.end());
642 bool RRTBase::optp_smart(
643 std::vector<RRTNode *> &cusps,
644 std::vector<int> &npi)
646 std::vector<RRTNode *> steered;
647 int li = cusps.size() - 1;
651 steered = this->steer(cusps[ai - 1], cusps[li]);
652 for (unsigned int j = 0; j < steered.size() - 1; j++)
653 steered[j]->add_child(steered[j + 1], 1);
654 if (this->collide(steered[0], steered[steered.size() - 1])) {
659 for (auto n: steered)
663 std::reverse(npi.begin(), npi.end());
667 bool RRTBase::opt_path()
669 if (this->tlog().size() == 0)
671 float oc = this->tlog().back().front()->ccost();
672 std::vector<RRTNode *> tmp_cusps;
673 for (auto n: this->tlog().back()) {
674 if (sgn(n->s()) == 0) {
675 tmp_cusps.push_back(n);
676 } else if (n->parent() &&
677 sgn(n->s()) != sgn(n->parent()->s())) {
678 tmp_cusps.push_back(n);
679 tmp_cusps.push_back(n->parent());
681 //tmp_cusps.push_back(n);
683 if (tmp_cusps.size() < 2)
685 std::vector<RRTNode *> cusps;
686 for (unsigned int i = 0; i < tmp_cusps.size(); i++) {
687 if (tmp_cusps[i] != tmp_cusps[(i + 1) % tmp_cusps.size()])
688 cusps.push_back(tmp_cusps[i]);
690 std::reverse(cusps.begin(), cusps.end());
691 std::vector<int> npi; // new path indexes
692 if (!this->optp_dijkstra(cusps, npi))
694 RRTNode *pn = cusps[npi[0]];
695 RRTNode *tmp = nullptr;
697 for (unsigned int i = 0; i < npi.size() - 1; i++) {
699 for (auto ns: this->steer(cusps[npi[i]], cusps[npi[i + 1]])) {
702 } else if (IS_NEAR(cusps[npi[i]], ns)) {
704 while (tmp && tmp != cusps[npi[i]]) {
710 } else if (IS_NEAR(ns, cusps[npi[i + 1]])) {
712 cusps[npi[i + 1]]->parent()->rem_child(
716 this->cost(pn, cusps[npi[i + 1]]));
719 pn->add_child(ns, this->cost(pn, ns));
724 this->root()->update_ccost();
725 if (this->tlog().back().front()->ccost() < oc)
730 bool RRTBase::rebase(RRTNode *nr)
732 if (!nr || this->goal_ == nr || this->root_ == nr)
734 std::vector<RRTNode *> s; // DFS stack
737 unsigned int to_del = 0;
739 s.push_back(this->root_);
740 while (s.size() > 0) {
743 for (auto ch: tmp->children()) {
747 to_del = this->nodes_.size();
748 #pragma omp parallel for reduction(min: to_del)
749 for (i = 0; i < this->nodes_.size(); i++) {
750 if (this->nodes_[i] == tmp)
753 if (to_del < this->nodes_.size())
754 this->nodes_.erase(this->nodes_.begin() + to_del);
756 to_del = this->iy_[iy].size();
757 #pragma omp parallel for reduction(min: to_del)
758 for (i = 0; i < this->iy_[iy].size(); i++) {
759 if (this->iy_[iy][i] == tmp)
762 if (to_del < this->iy_[iy].size())
763 this->iy_[iy].erase(this->iy_[iy].begin() + to_del);
764 this->dnodes().push_back(tmp);
767 this->root_->remove_parent();
771 std::vector<RRTNode *> RRTBase::findt()
773 return this->findt(this->goal_);
776 std::vector<RRTNode *> RRTBase::findt(RRTNode *n)
778 std::vector<RRTNode *> nodes;
779 if (!n || !n->parent())
789 RRTNode *RRTBase::sample()
794 float RRTBase::cost(RRTNode *init, RRTNode *goal)
796 return co2(init, goal);
799 RRTNode *RRTBase::nn(RRTNode *rs)
801 return nn4(this->iy_, rs, nullptr);
802 //return nn3(this->iy_, rs, nullptr);
805 std::vector<RRTNode *> RRTBase::nv(RRTNode *node, float dist)
807 std::vector<RRTNode *> nvs;
808 unsigned int iy = IYI(node->y());
809 unsigned int iy_dist = floor(dist / IYSTEP) + 1;
810 unsigned int i = 0; // vector index
811 unsigned int j = 0; // array index
812 unsigned int jmin = 0; // minimal j index
813 unsigned int jmax = 0; // maximal j index
815 jmin = (jmin > 0) ? jmin : 0;
816 jmax = iy + iy_dist + 1;
817 jmax = (jmax < IYSIZE) ? jmax : IYSIZE;
818 #pragma omp parallel for reduction(merge: nvs)
819 for (j = jmin; j < jmax; j++) {
820 #pragma omp parallel for reduction(merge: nvs)
821 for (i = 0; i < this->iy_[j].size(); i++) {
822 if (this->cost(this->iy_[j][i], node) < dist) {
823 nvs.push_back(this->iy_[j][i]);
830 std::vector<RRTNode *> RRTBase::steer(RRTNode *init, RRTNode *goal)
832 return st3(init, goal);