decision_control/slotplanner.cc

   1 /*
   2 This file is part of I am car.
   3
   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.
   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 <cmath>
  19 #include "bcar.h"
  20 #include "slotplanner.h"
  21
  22 ParallelSlot::ParallelSlot()
  23 {}
  24
  25 // getter
  26 std::vector<std::vector<RRTNode *>> &ParallelSlot::cusp()
  27 {
  28         return this->cusp_;
  29 }
  30
  31 float ParallelSlot::DH() const
  32 {
  33         return this->DH_;
  34 }
  35
  36 PolygonObstacle &ParallelSlot::slot()
  37 {
  38         return this->slot_;
  39 }
  40
  41 // setter
  42 void ParallelSlot::DH(float dh)
  43 {
  44         this->DH_ = dh;
  45 }
  46
  47 // other
  48 RRTNode *ParallelSlot::fposecenter()
  49 {
  50         if (this->slot().bnodes().front()->y() >
  51                         this->slot().bnodes().back()->y())
  52                 return this->slot().bnodes().front();
  53         else
  54                 return this->slot().bnodes().back();
  55 }
  56
  57 bool ParallelSlot::flast(
  58         RRTNode *P,
  59         bool right,
  60         int il,
  61         std::vector<RRTNode *> &cusp
  62 )
  63 {
  64         BicycleCar *B = new BicycleCar(P->x(), P->y(), P->h());
  65         RRTNode *cc;
  66         if (right)
  67                 cc = BicycleCar(B->x(), B->y(), B->h()).ccr();
  68         else
  69                 cc = BicycleCar(B->x(), B->y(), B->h()).ccl();
  70         BicycleCar *p;
  71         int i = 1;
  72         p = B->move(cc, i * this->DH());
  73         while (!this->slot().collide(p->frame()) && p->x() <= 0) {
  74                 if (p->rfx() <= 0 && p->rrx() <= 0) {
  75                         i += 1;
  76                         break;
  77                 }
  78                 i += 1;
  79                 delete p;
  80                 p = B->move(cc, i * this->DH());
  81         }
  82         delete p;
  83         p = B->move(cc, (i - 1) * this->DH());
  84         if (p->rfx() <= 0 && p->rrx() <= 0) {
  85                 cusp.push_back(p);
  86                 return true;
  87         } else if (il < 8) {
  88                 cusp.push_back(p);
  89                 return this->flast(p, !right, il + 1, cusp);
  90         }
  91         return false;
  92 }
  93
  94 void ParallelSlot::fpose()
  95 {
  96         BicycleCar *CC = new BicycleCar(
  97                 this->fposecenter()->x(),
  98                 this->fposecenter()->y() - 0.01,
  99                 M_PI / 2
 100         );
 101         BicycleCar *B = new BicycleCar(
 102                 CC->x() + CC->width() / 2,
 103                 CC->y() - (CC->length() + CC->wheelbase()) / 2,
 104                 M_PI / 2
 105         );
 106         this->DH(0.01 / CC->out_radi());
 107         BicycleCar *p;
 108         int i = 0;
 109         p = B->move(CC, -i * 0.01 / CC->diag_radi());
 110         while (!this->slot().collide(p->frame())) {
 111                 std::vector<RRTNode *> tmpcusp;
 112                 tmpcusp.push_back(new BicycleCar(p->x(), p->y(), p->h()));
 113                 if (this->flast(p, true, 0, tmpcusp)) {
 114                         this->cusp().push_back(tmpcusp);
 115                 }
 116                 i += 1;
 117                 delete p;
 118                 p = B->move(CC, -i * 0.01 / CC->diag_radi());
 119         }
 120 }