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                 if (std::abs(
 105                         atan2(
 106                                 this->ps().y2() - this->ps().y1(),
 107                                 this->ps().x2() - this->ps().x1()
 108                         )
 109                         - this->ps().heading()
 110                 ) < M_PI / 2) {
 111                         // forward parking
 112                         this->gc_to_4();
 113                         double bx;
 114                         double by;
 115                         double cx;
 116                         double cy;
 117                         if (this->ps().right()) {
 118                                 bx = this->gc().lfx();
 119                                 by = this->gc().lfy();
 120                                 cx = this->gc().ccr().x();
 121                                 cy = this->gc().ccr().y();
 122                         } else {
 123                                 bx = this->gc().rfx();
 124                                 by = this->gc().rfy();
 125                                 cx = this->gc().ccl().x();
 126                                 cy = this->gc().ccl().y();
 127                         }
 128                         double radi_angl = atan2(by - cy, bx - cx);
 129                         radi_angl += dts;
 130                         double angl_delta = this->gc().h() - radi_angl;
 131                         this->gc().rotate(bx, by, angl_delta);
 132                         // TODO there is a bug somewhere :/
 133                         //
 134                         // cli returns not exact intersection, therefore the
 135                         // distance to x1, y1 of border is shorter. Then, when
 136                         // moving, the distance `dist_o` is not sufficient and
 137                         // car still collide with parking slot. It shouldn't be
 138                         // problem until it collides with obstacle.
 139                         //
 140                         if (this->ps().right()) {
 141                                 cx = this->gc().ccr().x();
 142                                 cy = this->gc().ccr().y();
 143                         } else {
 144                                 cx = this->gc().ccl().x();
 145                                 cy = this->gc().ccl().y();
 146                         }
 147                         auto cli = circle_line_intersection(
 148                                 cx, cy, this->gc().iradi(),
 149                                 this->ps().x1(), this->ps().y1(),
 150                                 this->ps().x2(), this->ps().y2()
 151                         );
 152                         double d1 = edist(
 153                                 this->ps().x1(), this->ps().y1(),
 154                                 std::get<0>(cli), std::get<1>(cli)
 155                         );
 156                         double d2 = edist(
 157                                 this->ps().x1(), this->ps().y1(),
 158                                 std::get<2>(cli), std::get<3>(cli)
 159                         );
 160                         double dist_o = std::min<double>(d1, d2);
 161                         double angl_o = atan2(
 162                                 this->ps().y4() - this->ps().y3(),
 163                                 this->ps().x4() - this->ps().x3()
 164                         );
 165                         // projection
 166                         double angl_d = atan2(
 167                                 this->ps().y1() - this->ps().y2(),
 168                                 this->ps().x1() - this->ps().x2()
 169                         );
 170                         angl_d -= angl_o;
 171                         dist_o *= cos(angl_d);
 172                         this->gc().x(this->gc().x() + dist_o * cos(angl_o));
 173                         this->gc().y(this->gc().y() + dist_o * sin(angl_o));
 174                         // --- ENDTODO ---
 175                         this->gc().sp(-0.01);
 176                         this->gc().st(dts);
 177                         return;
 178                 } else {
 179                         dts = atan2(
 180                                 this->ps().y2() - this->ps().y1(),
 181                                 this->ps().x2() - this->ps().x1()
 182                         );
 183                         dts *= 1.01; // precision workaround
 184                         // backward parking
 185                         h = dts + M_PI;
 186                         x += -(this->gc().df() + 0.01) * cos(h);
 187                         y += -(this->gc().df() + 0.01) * sin(h);
 188                         if (this->ps().right())
 189                                 dts += M_PI / 2;
 190                         else
 191                                 dts -= M_PI / 2;
 192                         x += (this->gc().w() / 2 + 0.01) * cos(dts);
 193                         y += (this->gc().w() / 2 + 0.01) * sin(dts);
 194                 }
 195         }
 196         while (h > M_PI)
 197                 h -= 2 * M_PI;
 198         while (h <= -M_PI)
 199                 h += 2 * M_PI;
 200         this->gc().x(x);
 201         this->gc().y(y);
 202         this->gc().h(h);
 203 }
 204
 205 bool PSPlanner::left()
 206 {
 207         double lfx = this->cc().lfx();
 208         double lfy = this->cc().lfy();
 209         double lrx = this->cc().lrx();
 210         double lry = this->cc().lry();
 211         double rrx = this->cc().rrx();
 212         double rry = this->cc().rry();
 213         double rfx = this->cc().rfx();
 214         double rfy = this->cc().rfy();
 215         double lfs = sgn(
 216                 (lfx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
 217                 - (lfy - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
 218         );
 219         double lrs = sgn(
 220                 (lrx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
 221                 - (lry - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
 222         );
 223         double rrs = sgn(
 224                 (rrx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
 225                 - (rry - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
 226         );
 227         double rfs = sgn(
 228                 (rfx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
 229                 - (rfy - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
 230         );
 231         if (this->ps().parallel())
 232                 return lfs == rfs && (lfs != lrs || lfs != rrs);
 233         else if (!this->forward())
 234                 return lfs == rfs && (lfs != lrs || lfs != rrs);
 235         else
 236                 return lrs == rrs && (lrs != lfs || lrs != rfs);
 237 }
 238
 239 bool PSPlanner::parked()
 240 {
 241         std::vector<std::tuple<double, double>> slot;
 242         slot.push_back(std::make_tuple(this->ps().x1(), this->ps().y1()));
 243         slot.push_back(std::make_tuple(this->ps().x2(), this->ps().y2()));
 244         slot.push_back(std::make_tuple(this->ps().x3(), this->ps().y3()));
 245         slot.push_back(std::make_tuple(this->ps().x4(), this->ps().y4()));
 246         return inside(this->gc().lfx(), this->gc().lfy(), slot)
 247                 && inside(this->gc().lrx(), this->gc().lry(), slot)
 248                 && inside(this->gc().rrx(), this->gc().rry(), slot)
 249                 && inside(this->gc().rfx(), this->gc().rfy(), slot);
 250 }
 251
 252 std::vector<BicycleCar> PSPlanner::possible_goals(
 253         unsigned int cnt,
 254         double dist
 255 )
 256 {
 257         std::vector<BicycleCar> pi;
 258         if (this->cc().sp() > 0)
 259                 this->cc().sp(1);
 260         else
 261                 this->cc().sp(-1);
 262         this->cc().sp(this->cc().sp() * dist);
 263         this->cc().st(this->cc().st() * 1);
 264         BicycleCar orig_cc(this->cc());
 265         for (unsigned int i = 0; i < cnt; i++) {
 266                 this->cc().next();
 267                 pi.push_back(BicycleCar(this->cc()));
 268         }
 269         this->cc() = BicycleCar(orig_cc);
 270         return pi;
 271 }
 272
 273 // find entry
 274 void PSPlanner::fe()
 275 {
 276         if (this->ps().parallel())
 277                 return this->fe_parallel();
 278         else
 279                 return this->fe_perpendicular();
 280 }
 281
 282 void PSPlanner::fe_parallel()
 283 {
 284         BicycleCar bco = BicycleCar(this->gc());
 285         this->cc() = BicycleCar();
 286         this->cc().sp(-0.01);
 287         this->cc().set_max_steer();
 288         if (!this->ps().right())
 289                 this->cc().st(this->cc().st() * -1);
 290         this->cc().h(this->ps().heading());
 291         double angl_in_slot = this->ps().heading() - M_PI / 4;
 292         if (!this->ps().right())
 293                 angl_in_slot += M_PI / 2;
 294         this->cc().x(
 295                 this->ps().x4()
 296                 + this->cc().w()/2 * cos(
 297                         this->ps().heading()
 298                         + (this->ps().right() ? + M_PI / 2 : - M_PI / 2)
 299                 )
 300                 + (this->cc().df() + 0.01) * cos(
 301                         this->ps().heading() + M_PI
 302                 )
 303         );
 304         this->cc().y(
 305                 this->ps().y4()
 306                 + this->cc().w()/2 * sin(
 307                         this->ps().heading()
 308                         + (this->ps().right() ? + M_PI / 2 : - M_PI / 2)
 309                 )
 310                 + (this->cc().df() + 0.01) * sin(
 311                         this->ps().heading() + M_PI
 312                 )
 313         );
 314
 315         std::queue<BicycleCar, std::list<BicycleCar>> q;
 316         while (!this->collide()) {
 317                 q.push(this->cc());
 318                 this->cc().rotate(
 319                         this->ps().x4(),
 320                         this->ps().y4() - 0.01,
 321                         0.01
 322                 );
 323         }
 324         // BFS - find entry current car `cc` and corresponding goal car `gc`
 325         unsigned int iter_cntr = 0;
 326         while (!q.empty() && iter_cntr < 30) {
 327                 this->cc() = BicycleCar(q.front());
 328                 q.pop();
 329                 while (
 330                         !this->collide()
 331                         && (std::abs(
 332                                 this->cc().h() - this->ps().heading()
 333                         ) > M_PI / 32)
 334                         && (std::abs(
 335                                 this->cc().h() - this->ps().heading()
 336                         ) < M_PI / 2)
 337                 )
 338                         this->cc().next();
 339                 this->cc().sp(this->cc().sp() * -1);
 340                 this->cc().next();
 341                 this->gc() = BicycleCar(this->cc());
 342                 if (this->parked())
 343                         goto successfinish;
 344                 this->cc().st(this->cc().st() * -1);
 345                 q.push(BicycleCar(this->cc()));
 346                 if (sgn(this->cc().st()) == sgn(q.front().st()))
 347                         iter_cntr++;
 348         }
 349         // fallback to fer
 350         this->gc() = BicycleCar(bco);
 351 successfinish:
 352         return this->fer_parallel();
 353 }
 354
 355 void PSPlanner::fe_perpendicular()
 356 {
 357         // TODO Try multiple angles when going from parking slot.
 358         //
 359         //      Do not use just the maximum steer angle. Test angles
 360         //      until the whole current car `cc` is out of the parking
 361         //      slot `ps`.
 362         //
 363         //      Another approach could be testing angles from the
 364         //      beginning of the escape parkig slot maneuver.
 365         if (this->forward())
 366                 this->cc().sp(-0.01);
 367         else
 368                 this->cc().sp(0.01);
 369         while (!this->left())
 370                 this->cc().next();
 371         return;
 372 }
 373
 374 void PSPlanner::fer()
 375 {
 376         this->c_ = 0;
 377         if (this->ps().parallel()) {
 378                 this->guess_gc();
 379                 this->cc() = BicycleCar(this->gc());
 380                 this->cc().set_max_steer();
 381                 if (!this->ps().right())
 382                         this->cc().st(this->cc().st() * -1);
 383                 this->cc().sp(0.01);
 384                 return this->fer_parallel();
 385         } else {
 386                 return this->fer_perpendicular();
 387         }
 388 }
 389
 390 void PSPlanner::fer_parallel()
 391 {
 392         this->cusps_.clear();
 393         while (!this->left()) {
 394                 while (!this->collide() && !this->left())
 395                         this->cc().next();
 396                 if (this->left() && !this->collide()) {
 397                         break;
 398                 } else {
 399                         this->cc().sp(this->cc().sp() * -1);
 400                         this->cc().next();
 401                         this->cc().st(this->cc().st() * -1);
 402                         this->c_++;
 403                         this->cusps_.push_back(this->cc());
 404                 }
 405         }
 406         if (this->cc().st() < 0) {
 407                 this->c_++;
 408                 this->cusps_.push_back(this->cc());
 409         }
 410 }
 411
 412 void PSPlanner::fer_perpendicular()
 413 {
 414         bool delta_use[] = {true, true, true};
 415         double cc_h = this->cc().h();
 416         double x;
 417         double y;
 418         // check inner radius
 419         if (this->forward()) {
 420                 x = this->ps().x1();
 421                 y = this->ps().y1();
 422         } else {
 423                 x = this->ps().x4();
 424                 y = this->ps().y4();
 425         }
 426         double x1;
 427         double y1;
 428         if (this->ps().right()) {
 429                 x1 = this->cc().ccr().x();
 430                 y1 = this->cc().ccr().y();
 431         } else {
 432                 x1 = this->cc().ccl().x();
 433                 y1 = this->cc().ccl().y();
 434         }
 435         double IR = this->cc().iradi();
 436         double a = 1;
 437         double b;
 438         if (this->forward())
 439                 b = (x - x1) * 2 * cos(cc_h) + (y - y1) * 2 * sin(cc_h);
 440         else
 441                 b = (x1 - x) * 2 * cos(cc_h) + (y1 - y) * 2 * sin(cc_h);
 442         double c = pow(x - x1, 2) + pow(y - y1, 2) - pow(IR, 2);
 443         double D = pow(b, 2) - 4 * a * c;
 444         double delta;
 445         delta = -b - sqrt(D);
 446         delta /= 2 * a;
 447         double delta_1 = delta;
 448         if (D < 0)
 449                 delta_use[0] = false;
 450         // check outer radius
 451         if (this->forward()) {
 452                 x = this->ps().x4();
 453                 y = this->ps().y4();
 454         } else {
 455                 x = this->ps().x1();
 456                 y = this->ps().y1();
 457         }
 458         IR = this->cc().ofradi();
 459         a = 1;
 460         if (this->forward())
 461                 b = (x - x1) * 2 * cos(cc_h) + (y - y1) * 2 * sin(cc_h);
 462         else
 463                 b = (x1 - x) * 2 * cos(cc_h) + (y1 - y) * 2 * sin(cc_h);
 464         c = pow(x - x1, 2) + pow(y - y1, 2) - pow(IR, 2);
 465         D = pow(b, 2) - 4 * a * c;
 466         if (this->forward()) {
 467                 delta = -b + sqrt(D);
 468                 delta /= 2 * a;
 469         }
 470         double delta_2 = delta;
 471         if (D < 0)
 472                 delta_use[1] = false;
 473         delta = -b - sqrt(D);
 474         delta /= 2 * a;
 475         double delta_3 = delta;
 476         if (D < 0)
 477                 delta_use[2] = false;
 478         if (delta_use[0] && delta_use[1] && delta_use[22])
 479                 delta = std::max(delta_1, std::max(delta_2, delta_3));
 480         else if (delta_use[0] && delta_use[1])
 481                 delta = std::max(delta_1, delta_2);
 482         else if (delta_use[0] && delta_use[2])
 483                 delta = std::max(delta_1, delta_3);
 484         else if (delta_use[1] && delta_use[2])
 485                 delta = std::max(delta_2, delta_3);
 486         else if (delta_use[0])
 487                 delta = delta_1;
 488         else if (delta_use[1])
 489                 delta = delta_2;
 490         else if (delta_use[2])
 491                 delta = delta_3;
 492         else
 493                 return;
 494         // current car `cc` can get out of slot with max steer
 495         this->cc().x(this->cc().x() + delta * cos(cc_h));
 496         this->cc().y(this->cc().y() + delta * sin(cc_h));
 497         this->cc().h(cc_h);
 498         // get current car `cc` out of slot
 499         if (this->forward())
 500                 this->cc().sp(-0.01);
 501         else
 502                 this->cc().sp(0.01);
 503         this->cc().set_max_steer();
 504         if (this->ps().right())
 505                 this->cc().st(this->cc().st() * -1);
 506         while (!this->left()) {
 507                 while (!this->collide() && !this->left())
 508                         this->cc().next();
 509                 if (this->left() && !this->collide()) {
 510                         break;
 511                 } else {
 512                         this->cc().sp(this->cc().sp() * -1);
 513                         this->cc().next();
 514                         this->cc().st(this->cc().st() * -1);
 515                 }
 516         }
 517 }
 518
 519 PSPlanner::PSPlanner()
 520 {
 521 }