src/psp.cc

   1 #include <cmath>
   2 #include <list>
   3 #include <queue>
   4 #include "psp.h"
   5
   6 bool PSPlanner::collide()
   7 {
   8         std::vector<std::tuple<double, double>> bc;
   9         bc.push_back(std::make_tuple(this->cc().lfx(), this->cc().lfy()));
  10         bc.push_back(std::make_tuple(this->cc().lrx(), this->cc().lry()));
  11         bc.push_back(std::make_tuple(this->cc().rrx(), this->cc().rry()));
  12         bc.push_back(std::make_tuple(this->cc().rfx(), this->cc().rfy()));
  13         bc.push_back(std::make_tuple(this->cc().lfx(), this->cc().lfy()));
  14         std::vector<std::tuple<double, double>> ps;
  15         ps.push_back(std::make_tuple(this->ps().x1(), this->ps().y1()));
  16         ps.push_back(std::make_tuple(this->ps().x2(), this->ps().y2()));
  17         ps.push_back(std::make_tuple(this->ps().x3(), this->ps().y3()));
  18         ps.push_back(std::make_tuple(this->ps().x4(), this->ps().y4()));
  19         return std::get<0>(::collide(bc, ps));
  20 }
  21
  22 bool PSPlanner::forward()
  23 {
  24         if (this->ps().parallel())
  25                 return false;
  26         double heading = atan2(
  27                 this->ps().y2() - this->ps().y1(),
  28                 this->ps().x2() - this->ps().x1()
  29         );
  30         while (heading < 0) heading += 2 * M_PI;
  31         double h = this->gc().h();
  32         while (h < 0) h += 2 * M_PI;
  33         if (std::abs(heading - h) < M_PI / 4)
  34                 return true;
  35         return false;
  36 }
  37
  38 void PSPlanner::gc_to_4()
  39 {
  40         double angl_slot = atan2(
  41                 this->ps().y3() - this->ps().y4(),
  42                 this->ps().x3() - this->ps().x4()
  43         );
  44         double angl_delta = M_PI / 2;
  45         if (this->ps().right())
  46                 angl_delta = -M_PI / 2;
  47         double x = this->ps().x4();
  48         double y = this->ps().y4();
  49         x += (this->gc().dr() + 0.01) * cos(angl_slot);
  50         y += (this->gc().dr() + 0.01) * sin(angl_slot);
  51         x += (this->gc().w() / 2 + 0.01) * cos(angl_slot + angl_delta);
  52         y += (this->gc().w() / 2 + 0.01) * sin(angl_slot + angl_delta);
  53         this->gc().x(x);
  54         this->gc().y(y);
  55         this->gc().h(angl_slot);
  56 }
  57
  58 std::tuple<double, double, double, double> circle_line_intersection(
  59         double cx, double cy, double r,
  60         double x1, double y1,
  61         double x2, double y2
  62 )
  63 {
  64         double t = (y2 - y1) / (x2 - x1);
  65         //double a = 1 + pow(t, 2);
  66         //double b = - 2 * cx - 2 * pow(t, 2) * x1 + 2 * t * y1 - 2 * t * cy;
  67         //double c = pow(cx, 2) + pow(t, 2) * pow(x1, 2) - 2 * t * y1 * x1
  68         //        + pow(y1, 2) + 2 * t * cy * x1 - 2 * y1 * cy + pow(cy, 2)
  69         //        - pow(r, 2);
  70         double a = 1 + pow(t, 2);
  71         double b = - 2 * cx + 2 * t * (-t * x1 + y1) - 2 * cy * t;
  72         double c = pow(cx, 2) + pow(cy, 2) - pow(r, 2);
  73         c += pow(-t * x1 + y1, 2);
  74         c += 2 * cy * t * x1 - 2 * cy * y1;
  75         double D = pow(b, 2) - 4 * a * c;
  76         if (D < 0)
  77                 return std::make_tuple(cx, cy, cx, cy);
  78         double res_x1 = (-b + sqrt(D)) / (2 * a);
  79         double res_y1 = t * (res_x1 - x1) + y1;
  80         double res_x2 = (-b - sqrt(D)) / (2 * a);
  81         double res_y2 = t * (res_x2 - x1) + y1;
  82         return std::make_tuple(res_x1, res_y1, res_x2, res_y2);
  83 }
  84
  85 double edist(double x1, double y1, double x2, double y2)
  86 {
  87         return sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2));
  88 }
  89
  90 void PSPlanner::guess_gc()
  91 {
  92         double x = this->ps().x1();
  93         double y = this->ps().y1();
  94         double h = this->ps().heading();
  95         double dts = + M_PI / 2; // direction to slot
  96         if (this->ps().right())
  97                 dts = - M_PI / 2;
  98         if (this->ps().parallel()) {
  99                 x += (this->gc().w() / 2 + 0.01) * cos(h + dts);
 100                 x += (this->gc().dr() + 0.01) * cos(h);
 101                 y += (this->gc().w() / 2 + 0.01) * sin(h + dts);
 102                 y += (this->gc().dr() + 0.01) * sin(h);
 103         } else {
 104                 // This is for backward parking only.
 105                 double entry_width = edist(
 106                         this->ps().x1(), this->ps().y1(),
 107                         this->ps().x4(), this->ps().y4()
 108                 );
 109                 double dist_l =
 110                         this->gc().orradi()
 111                         - (this->gc().mtr() + this->gc().w() / 2)
 112                 ;
 113                 double move1 = dist_l + this->gc().w() / 2;
 114                 double dist_r = entry_width - this->gc().w() - dist_l;
 115                 double move2 = sqrt(
 116                         pow(this->gc().iradi(), 2)
 117                         - pow(this->gc().iradi() - dist_r, 2)
 118                 );
 119                 move2 -= this->gc().dr() / 2; // workaround
 120                 x += move1 * cos(h);
 121                 y += move1 * sin(h);
 122                 x += move2 * cos(h + dts);
 123                 y += move2 * sin(h + dts);
 124                 h += dts + M_PI;
 125         }
 126         while (h > M_PI)
 127                 h -= 2 * M_PI;
 128         while (h <= -M_PI)
 129                 h += 2 * M_PI;
 130         this->gc().x(x);
 131         this->gc().y(y);
 132         this->gc().h(h);
 133 }
 134
 135 bool PSPlanner::left()
 136 {
 137         double lfx = this->cc().lfx();
 138         double lfy = this->cc().lfy();
 139         double lrx = this->cc().lrx();
 140         double lry = this->cc().lry();
 141         double rrx = this->cc().rrx();
 142         double rry = this->cc().rry();
 143         double rfx = this->cc().rfx();
 144         double rfy = this->cc().rfy();
 145         double lfs = sgn(
 146                 (lfx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
 147                 - (lfy - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
 148         );
 149         double lrs = sgn(
 150                 (lrx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
 151                 - (lry - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
 152         );
 153         double rrs = sgn(
 154                 (rrx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
 155                 - (rry - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
 156         );
 157         double rfs = sgn(
 158                 (rfx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
 159                 - (rfy - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
 160         );
 161         if (this->ps().parallel())
 162                 return lfs == rfs && (lfs != lrs || lfs != rrs);
 163         else if (!this->forward())
 164                 return lfs == rfs && (lfs != lrs || lfs != rrs);
 165         else
 166                 return lrs == rrs && (lrs != lfs || lrs != rfs);
 167 }
 168
 169 bool PSPlanner::parked()
 170 {
 171         std::vector<std::tuple<double, double>> slot;
 172         slot.push_back(std::make_tuple(this->ps().x1(), this->ps().y1()));
 173         slot.push_back(std::make_tuple(this->ps().x2(), this->ps().y2()));
 174         slot.push_back(std::make_tuple(this->ps().x3(), this->ps().y3()));
 175         slot.push_back(std::make_tuple(this->ps().x4(), this->ps().y4()));
 176         return inside(this->gc().lfx(), this->gc().lfy(), slot)
 177                 && inside(this->gc().lrx(), this->gc().lry(), slot)
 178                 && inside(this->gc().rrx(), this->gc().rry(), slot)
 179                 && inside(this->gc().rfx(), this->gc().rfy(), slot);
 180 }
 181
 182 std::vector<BicycleCar> PSPlanner::possible_goals(
 183         unsigned int cnt,
 184         double dist
 185 )
 186 {
 187         std::vector<BicycleCar> pi;
 188         if (this->cc().sp() > 0)
 189                 this->cc().sp(1);
 190         else
 191                 this->cc().sp(-1);
 192         this->cc().sp(this->cc().sp() * dist);
 193         this->cc().st(this->cc().st() * 1);
 194         BicycleCar orig_cc(this->cc());
 195         for (unsigned int i = 0; i < cnt; i++) {
 196                 this->cc().next();
 197                 pi.push_back(BicycleCar(this->cc()));
 198         }
 199         this->cc() = BicycleCar(orig_cc);
 200         return pi;
 201 }
 202
 203 // find entry
 204 void PSPlanner::fe()
 205 {
 206         this->c_ = 0;
 207         if (this->ps().parallel()) {
 208                 return this->fe_parallel();
 209         } else {
 210                 this->guess_gc();
 211                 this->cc() = BicycleCar(this->gc());
 212                 return this->fer_perpendicular();
 213         }
 214 }
 215
 216 void PSPlanner::fe_parallel()
 217 {
 218         BicycleCar bco = BicycleCar(this->gc());
 219         this->cc() = BicycleCar();
 220         this->cc().sp(-0.01);
 221         this->cc().set_max_steer();
 222         if (!this->ps().right())
 223                 this->cc().st(this->cc().st() * -1);
 224         this->cc().h(this->ps().heading());
 225         double angl_in_slot = this->ps().heading() - M_PI / 4;
 226         if (!this->ps().right())
 227                 angl_in_slot += M_PI / 2;
 228         this->cc().x(
 229                 this->ps().x4()
 230                 + this->cc().w()/2 * cos(
 231                         this->ps().heading()
 232                         + (this->ps().right() ? + M_PI / 2 : - M_PI / 2)
 233                 )
 234                 + (this->cc().df() + 0.01) * cos(
 235                         this->ps().heading() + M_PI
 236                 )
 237         );
 238         this->cc().y(
 239                 this->ps().y4()
 240                 + this->cc().w()/2 * sin(
 241                         this->ps().heading()
 242                         + (this->ps().right() ? + M_PI / 2 : - M_PI / 2)
 243                 )
 244                 + (this->cc().df() + 0.01) * sin(
 245                         this->ps().heading() + M_PI
 246                 )
 247         );
 248
 249         std::queue<BicycleCar, std::list<BicycleCar>> q;
 250         while (!this->collide()) {
 251                 q.push(this->cc());
 252                 this->cc().rotate(
 253                         this->ps().x4(),
 254                         this->ps().y4() - 0.01,
 255                         ((this->ps().right()) ? 0.01 : -0.01)
 256                 );
 257         }
 258         // BFS - find entry current car `cc` and corresponding goal car `gc`
 259         unsigned int iter_cntr = 0;
 260         while (!q.empty() && iter_cntr < 30) {
 261                 this->cc() = BicycleCar(q.front());
 262                 q.pop();
 263                 while (
 264                         !this->collide()
 265                         && (std::abs(
 266                                 this->cc().h() - this->ps().heading()
 267                         ) > M_PI / 32)
 268                         && (std::abs(
 269                                 this->cc().h() - this->ps().heading()
 270                         ) < M_PI / 2)
 271                 )
 272                         this->cc().next();
 273                 this->cc().sp(this->cc().sp() * -1);
 274                 this->cc().next();
 275                 this->gc() = BicycleCar(this->cc());
 276                 if (this->parked())
 277                         goto successfinish;
 278                 this->cc().st(this->cc().st() * -1);
 279                 q.push(BicycleCar(this->cc()));
 280                 if (sgn(this->cc().st()) == sgn(q.front().st()))
 281                         iter_cntr++;
 282         }
 283         // fallback to fer
 284         this->gc() = BicycleCar(bco);
 285 successfinish:
 286         return this->fer_parallel();
 287 }
 288
 289 void PSPlanner::fe_perpendicular()
 290 {
 291         // TODO Try multiple angles when going from parking slot.
 292         //
 293         //      Do not use just the maximum steer angle. Test angles
 294         //      until the whole current car `cc` is out of the parking
 295         //      slot `ps`.
 296         //
 297         //      Another approach could be testing angles from the
 298         //      beginning of the escape parkig slot maneuver.
 299         if (this->forward())
 300                 this->cc().sp(-0.01);
 301         else
 302                 this->cc().sp(0.01);
 303         while (!this->left())
 304                 this->cc().next();
 305         return;
 306 }
 307
 308 void PSPlanner::fer()
 309 {
 310         this->c_ = 0;
 311         if (this->ps().parallel()) {
 312                 this->guess_gc();
 313                 this->cc() = BicycleCar(this->gc());
 314                 this->cc().set_max_steer();
 315                 if (!this->ps().right())
 316                         this->cc().st(this->cc().st() * -1);
 317                 this->cc().sp(0.01);
 318                 return this->fer_parallel();
 319         } else {
 320                 return this->fer_perpendicular();
 321         }
 322 }
 323
 324 void PSPlanner::fer_parallel()
 325 {
 326         this->cusps_.clear();
 327         while (!this->left()) {
 328                 while (!this->collide() && !this->left())
 329                         this->cc().next();
 330                 if (this->left() && !this->collide()) {
 331                         break;
 332                 } else {
 333                         this->cc().sp(this->cc().sp() * -1);
 334                         this->cc().next();
 335                         this->cc().st(this->cc().st() * -1);
 336                         this->c_++;
 337                         this->cusps_.push_back(this->cc());
 338                 }
 339         }
 340         if (this->cc().st() < 0) {
 341                 this->c_++;
 342                 this->cusps_.push_back(this->cc());
 343         }
 344 }
 345
 346 void PSPlanner::fer_perpendicular()
 347 {
 348         bool delta_use[] = {true, true, true};
 349         double cc_h = this->cc().h();
 350         double x;
 351         double y;
 352         // check inner radius
 353         if (this->forward()) {
 354                 x = this->ps().x1();
 355                 y = this->ps().y1();
 356         } else {
 357                 x = this->ps().x4();
 358                 y = this->ps().y4();
 359         }
 360         double x1;
 361         double y1;
 362         if (this->ps().right()) {
 363                 x1 = this->cc().ccr().x();
 364                 y1 = this->cc().ccr().y();
 365         } else {
 366                 x1 = this->cc().ccl().x();
 367                 y1 = this->cc().ccl().y();
 368         }
 369         double IR = this->cc().iradi();
 370         double a = 1;
 371         double b;
 372         if (this->forward())
 373                 b = (x - x1) * 2 * cos(cc_h) + (y - y1) * 2 * sin(cc_h);
 374         else
 375                 b = (x1 - x) * 2 * cos(cc_h) + (y1 - y) * 2 * sin(cc_h);
 376         double c = pow(x - x1, 2) + pow(y - y1, 2) - pow(IR, 2);
 377         double D = pow(b, 2) - 4 * a * c;
 378         double delta;
 379         delta = -b - sqrt(D);
 380         delta /= 2 * a;
 381         double delta_1 = delta;
 382         if (D < 0)
 383                 delta_use[0] = false;
 384         // check outer radius
 385         if (this->forward()) {
 386                 x = this->ps().x4();
 387                 y = this->ps().y4();
 388         } else {
 389                 x = this->ps().x1();
 390                 y = this->ps().y1();
 391         }
 392         IR = this->cc().ofradi();
 393         a = 1;
 394         if (this->forward())
 395                 b = (x - x1) * 2 * cos(cc_h) + (y - y1) * 2 * sin(cc_h);
 396         else
 397                 b = (x1 - x) * 2 * cos(cc_h) + (y1 - y) * 2 * sin(cc_h);
 398         c = pow(x - x1, 2) + pow(y - y1, 2) - pow(IR, 2);
 399         D = pow(b, 2) - 4 * a * c;
 400         if (this->forward()) {
 401                 delta = -b + sqrt(D);
 402                 delta /= 2 * a;
 403         }
 404         double delta_2 = delta;
 405         if (D < 0)
 406                 delta_use[1] = false;
 407         delta = -b - sqrt(D);
 408         delta /= 2 * a;
 409         double delta_3 = delta;
 410         if (D < 0)
 411                 delta_use[2] = false;
 412         if (delta_use[0] && delta_use[1] && delta_use[2])
 413                 delta = std::max(delta_1, std::max(delta_2, delta_3));
 414         else if (delta_use[0] && delta_use[1])
 415                 delta = std::max(delta_1, delta_2);
 416         else if (delta_use[0] && delta_use[2])
 417                 delta = std::max(delta_1, delta_3);
 418         else if (delta_use[1] && delta_use[2])
 419                 delta = std::max(delta_2, delta_3);
 420         else if (delta_use[0])
 421                 delta = delta_1;
 422         else if (delta_use[1])
 423                 delta = delta_2;
 424         else if (delta_use[2])
 425                 delta = delta_3;
 426         else
 427                 return;
 428         // current car `cc` can get out of slot with max steer
 429         this->cc().x(this->cc().x() + delta * cos(cc_h));
 430         this->cc().y(this->cc().y() + delta * sin(cc_h));
 431         this->cc().h(cc_h);
 432         // get current car `cc` out of slot
 433         if (this->forward())
 434                 this->cc().sp(-0.01);
 435         else
 436                 this->cc().sp(0.01);
 437         this->cc().set_max_steer();
 438         if (this->ps().right())
 439                 this->cc().st(this->cc().st() * -1);
 440         while (!this->left()) {
 441                 while (!this->collide() && !this->left())
 442                         this->cc().next();
 443                 if (this->left() && !this->collide()) {
 444                         break;
 445                 } else {
 446                         this->cc().sp(this->cc().sp() * -1);
 447                         this->cc().next();
 448                         this->cc().st(this->cc().st() * -1);
 449                 }
 450         }
 451 }
 452
 453 PSPlanner::PSPlanner()
 454 {
 455 }