]> rtime.felk.cvut.cz Git - hubacji1/psp.git/blob - src/psp.cc
Refactor smaller angle of two code
[hubacji1/psp.git] / 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         else
27                 return true;
28         double heading = atan2(
29                 this->ps().y2() - this->ps().y1(),
30                 this->ps().x2() - this->ps().x1()
31         );
32         while (heading < 0) heading += 2 * M_PI;
33         double h = this->gc().h();
34         while (h < 0) h += 2 * M_PI;
35         if (std::abs(heading - h) < M_PI / 4)
36                 return true;
37         return false;
38 }
39
40 void PSPlanner::gc_to_4()
41 {
42         double angl_slot = atan2(
43                 this->ps().y3() - this->ps().y4(),
44                 this->ps().x3() - this->ps().x4()
45         );
46         double angl_delta = M_PI / 2;
47         if (this->ps().right())
48                 angl_delta = -M_PI / 2;
49         double x = this->ps().x4();
50         double y = this->ps().y4();
51         x += (this->gc().dr() + 0.01) * cos(angl_slot);
52         y += (this->gc().dr() + 0.01) * sin(angl_slot);
53         x += (this->gc().w() / 2 + 0.01) * cos(angl_slot + angl_delta);
54         y += (this->gc().w() / 2 + 0.01) * sin(angl_slot + angl_delta);
55         this->gc().x(x);
56         this->gc().y(y);
57         this->gc().h(angl_slot);
58 }
59
60 std::tuple<double, double, double, double> circle_line_intersection(
61         double cx, double cy, double r,
62         double x1, double y1,
63         double x2, double y2
64 )
65 {
66         double t = (y2 - y1) / (x2 - x1);
67         //double a = 1 + pow(t, 2);
68         //double b = - 2 * cx - 2 * pow(t, 2) * x1 + 2 * t * y1 - 2 * t * cy;
69         //double c = pow(cx, 2) + pow(t, 2) * pow(x1, 2) - 2 * t * y1 * x1
70         //        + pow(y1, 2) + 2 * t * cy * x1 - 2 * y1 * cy + pow(cy, 2)
71         //        - pow(r, 2);
72         double a = 1 + pow(t, 2);
73         double b = - 2 * cx + 2 * t * (-t * x1 + y1) - 2 * cy * t;
74         double c = pow(cx, 2) + pow(cy, 2) - pow(r, 2);
75         c += pow(-t * x1 + y1, 2);
76         c += 2 * cy * t * x1 - 2 * cy * y1;
77         double D = pow(b, 2) - 4 * a * c;
78         if (D < 0)
79                 return std::make_tuple(cx, cy, cx, cy);
80         double res_x1 = (-b + sqrt(D)) / (2 * a);
81         double res_y1 = t * (res_x1 - x1) + y1;
82         double res_x2 = (-b - sqrt(D)) / (2 * a);
83         double res_y2 = t * (res_x2 - x1) + y1;
84         return std::make_tuple(res_x1, res_y1, res_x2, res_y2);
85 }
86
87 double edist(double x1, double y1, double x2, double y2)
88 {
89         return sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2));
90 }
91
92 void PSPlanner::guess_gc()
93 {
94         double x = this->ps().x1();
95         double y = this->ps().y1();
96         double h = this->ps().heading();
97         double dts = + M_PI / 2; // direction to slot
98         if (this->ps().right())
99                 dts = - M_PI / 2;
100         if (this->ps().parallel()) {
101                 x += (this->gc().w() / 2 + 0.01) * cos(h + dts);
102                 x += (this->gc().dr() + 0.01) * cos(h);
103                 y += (this->gc().w() / 2 + 0.01) * sin(h + dts);
104                 y += (this->gc().dr() + 0.01) * sin(h);
105         } else {
106                 // Forward parking
107                 double entry_width = edist(
108                         this->ps().x1(), this->ps().y1(),
109                         this->ps().x4(), this->ps().y4()
110                 );
111                 x += entry_width / 2 * cos(h);
112                 y += entry_width / 2 * sin(h);
113                 h = atan2(
114                         this->ps().y2() - this->ps().y1(),
115                         this->ps().x2() - this->ps().x1()
116                 );
117                 while (h < 0) h += 2 * M_PI;
118
119                 //// This is for backward parking only.
120                 //double entry_width = edist(
121                 //        this->ps().x1(), this->ps().y1(),
122                 //        this->ps().x4(), this->ps().y4()
123                 //);
124                 //double dist_l =
125                 //        this->gc().orradi()
126                 //        - (this->gc().mtr() + this->gc().w() / 2)
127                 //;
128                 //double move1 = dist_l + this->gc().w() / 2;
129                 //double dist_r = entry_width - this->gc().w() - dist_l;
130                 //double move2 = sqrt(
131                 //        pow(this->gc().iradi(), 2)
132                 //        - pow(this->gc().iradi() - dist_r, 2)
133                 //);
134                 //move2 -= this->gc().dr() / 2; // workaround
135                 //x += move1 * cos(h);
136                 //y += move1 * sin(h);
137                 //dts = atan2(
138                 //        this->ps().y2() - this->ps().y1(),
139                 //        this->ps().x2() - this->ps().x1()
140                 //);
141                 //while (dts < 0) dts += 2 * M_PI;
142                 //x += move2 * cos(h + dts);
143                 //y += move2 * sin(h + dts);
144                 //h += dts - M_PI / 2;
145         }
146         while (h > M_PI)
147                 h -= 2 * M_PI;
148         while (h <= -M_PI)
149                 h += 2 * M_PI;
150         this->gc().x(x);
151         this->gc().y(y);
152         this->gc().h(h);
153 }
154
155 std::vector<BicycleCar> PSPlanner::last_maneuver()
156 {
157         std::vector<BicycleCar> lm;
158         if (this->ps().parallel()) {
159                 // zig-zag out from the slot
160                 this->cc() = BicycleCar(this->gc());
161                 this->cc().sp(0.1);
162                 while (!this->left()) {
163                         while (!this->collide() && !this->left()) {
164                                 this->cc().next();
165                                 lm.push_back(BicycleCar(this->cc()));
166                         }
167                         if (this->left() && !this->collide()) {
168                                 break;
169                         } else {
170                                 lm.pop_back();
171                                 this->cc().sp(this->cc().sp() * -1);
172                                 this->cc().next();
173                                 this->cc().st(this->cc().st() * -1);
174                                 this->c_++;
175                                 lm.push_back(BicycleCar(this->cc()));
176                         }
177                 }
178                 if (this->cc().st() < 0) {
179                         this->c_++;
180                         lm.push_back(BicycleCar(this->cc()));
181                 }
182         } else {
183                 // go 1 m forward
184                 this->cc().sp(0.1);
185                 BicycleCar orig_cc(this->cc());
186                 for (unsigned int i = 0; i < 10; i++) {
187                         this->cc().next();
188                         lm.push_back(BicycleCar(this->cc()));
189                 }
190                 this->cc() = BicycleCar(orig_cc);
191         }
192         return lm;
193 }
194
195 bool PSPlanner::left()
196 {
197         double lfx = this->cc().lfx();
198         double lfy = this->cc().lfy();
199         double lrx = this->cc().lrx();
200         double lry = this->cc().lry();
201         double rrx = this->cc().rrx();
202         double rry = this->cc().rry();
203         double rfx = this->cc().rfx();
204         double rfy = this->cc().rfy();
205         double lfs = sgn(
206                 (lfx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
207                 - (lfy - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
208         );
209         double lrs = sgn(
210                 (lrx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
211                 - (lry - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
212         );
213         double rrs = sgn(
214                 (rrx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
215                 - (rry - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
216         );
217         double rfs = sgn(
218                 (rfx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
219                 - (rfy - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
220         );
221         if (this->ps().parallel())
222                 return lfs == rfs && (lfs != lrs || lfs != rrs);
223         else if (!this->forward())
224                 return lfs == rfs && (lfs != lrs || lfs != rrs);
225         else
226                 return lrs == rrs && (lrs != lfs || lrs != rfs);
227 }
228
229 bool PSPlanner::parked()
230 {
231         std::vector<std::tuple<double, double>> slot;
232         slot.push_back(std::make_tuple(this->ps().x1(), this->ps().y1()));
233         slot.push_back(std::make_tuple(this->ps().x2(), this->ps().y2()));
234         slot.push_back(std::make_tuple(this->ps().x3(), this->ps().y3()));
235         slot.push_back(std::make_tuple(this->ps().x4(), this->ps().y4()));
236         return inside(this->gc().lfx(), this->gc().lfy(), slot)
237                 && inside(this->gc().lrx(), this->gc().lry(), slot)
238                 && inside(this->gc().rrx(), this->gc().rry(), slot)
239                 && inside(this->gc().rfx(), this->gc().rfy(), slot);
240 }
241
242 std::vector<BicycleCar> PSPlanner::possible_goals(
243         unsigned int cnt,
244         double dist
245 )
246 {
247         std::vector<BicycleCar> pi;
248         if (this->ps().parallel())
249                 this->cc().sp(1);
250         else
251                 this->cc().sp(-1);
252         this->cc().sp(this->cc().sp() * dist);
253         BicycleCar orig_cc(this->cc());
254         for (unsigned int i = 0; i < cnt; i++) {
255                 this->cc().next();
256                 pi.push_back(BicycleCar(this->cc()));
257         }
258         this->cc() = BicycleCar(orig_cc);
259         if (this->ps().parallel()) {
260                 this->cc().st(0);
261                 for (unsigned int i = 0; i < cnt; i++) {
262                         this->cc().next();
263                         pi.push_back(BicycleCar(this->cc()));
264                 }
265                 this->cc() = BicycleCar(orig_cc);
266         } else {
267                 if (!this->ps().right()) {
268                         this->cc().set_max_steer();
269                         for (unsigned int i = 0; i < cnt; i++) {
270                                 this->cc().next();
271                                 pi.push_back(BicycleCar(this->cc()));
272                         }
273                 } else {
274                         this->cc().set_max_steer();
275                         this->cc().st(this->cc().st() * -1);
276                         for (unsigned int i = 0; i < cnt; i++) {
277                                 this->cc().next();
278                                 pi.push_back(BicycleCar(this->cc()));
279                         }
280                 }
281                 this->cc() = BicycleCar(orig_cc);
282         }
283         return pi;
284 }
285
286 // find entry
287 void PSPlanner::fe()
288 {
289         this->c_ = 0;
290         if (this->ps().parallel()) {
291                 return this->fe_parallel();
292         } else {
293                 this->guess_gc();
294                 this->cc() = BicycleCar(this->gc());
295                 //this->cc().set_max_steer();
296                 //if (this->ps().right())
297                 //        this->cc().st(this->cc().st() * -1);
298                 this->cc().sp(-0.2);
299         }
300 }
301
302 double smaller_angle_of_two(
303         double sx, double sy, // common start point
304         double cx, double cy, // common middle point
305         double x1, double y1, // first ending point
306         double x2, double y2 // second ending point
307 ) {
308         double a1 = ::angle_between_three_points(sx, sy, cx, cy, x1, y1);
309         double a2 = ::angle_between_three_points(sx, sy, cx, cy, x2, y2);
310         return std::min(a1, a2);
311 }
312
313 void PSPlanner::fe_parallel()
314 {
315         BicycleCar bco = BicycleCar(this->gc());
316         this->cc() = BicycleCar();
317         this->cc().sp(-0.01);
318         this->cc().set_max_steer();
319         if (!this->ps().right())
320                 this->cc().st(this->cc().st() * -1);
321         this->cc().h(this->ps().heading());
322         double angl_in_slot = this->ps().heading() - M_PI / 4;
323         if (!this->ps().right())
324                 angl_in_slot += M_PI / 2;
325         this->cc().x(
326                 this->ps().x4()
327                 + this->cc().w()/2 * cos(
328                         this->ps().heading()
329                         + (this->ps().right() ? + M_PI / 2 : - M_PI / 2)
330                 )
331                 + (this->cc().df() + 0.01) * cos(
332                         this->ps().heading() + M_PI
333                 )
334         );
335         this->cc().y(
336                 this->ps().y4()
337                 + this->cc().w()/2 * sin(
338                         this->ps().heading()
339                         + (this->ps().right() ? + M_PI / 2 : - M_PI / 2)
340                 )
341                 + (this->cc().df() + 0.01) * sin(
342                         this->ps().heading() + M_PI
343                 )
344         );
345
346         std::queue<BicycleCar, std::list<BicycleCar>> q;
347         while (!this->collide()) {
348                 q.push(this->cc());
349                 this->cc().rotate(
350                         this->ps().x4(),
351                         this->ps().y4() - 0.01,
352                         ((this->ps().right()) ? 0.001 : -0.001)
353                 );
354         }
355         // BFS - find entry current car `cc` and corresponding goal car `gc`
356         unsigned int iter_cntr = 0;
357         while (!q.empty() && iter_cntr < 30) {
358                 this->cc() = BicycleCar(q.front());
359                 q.pop();
360                 if (this->ps().right() && this->cc().sp() < 0) {
361                         double cclx = this->cc().ccl().x();
362                         double ccly = this->cc().ccl().y();
363                         double ccl_lr = edist(
364                                 cclx, ccly,
365                                 this->cc().lrx(), this->cc().lry()
366                         );
367                         double ccl_rr = edist(
368                                 cclx, ccly,
369                                 this->cc().rrx(), this->cc().rry()
370                         );
371                         double ccl_p1 = edist(
372                                 cclx, ccly,
373                                 this->ps().x1(), this->ps().y1()
374                         );
375                         if (ccl_rr < ccl_p1) {
376                                 // pass parking slot
377                                 continue;
378                         } else if (ccl_rr >= ccl_p1 && ccl_lr < ccl_p1) {
379                                 // partially out of parking slot
380                                 // TODO (p1, p2) x (lr, rr)
381                                 auto cli2 = ::intersect(
382                                         cclx, ccly, ccl_rr,
383                                         this->ps().x2(), this->ps().y2(),
384                                         this->ps().x3(), this->ps().y3()
385                                 );
386                                 double a2 = smaller_angle_of_two(
387                                         this->cc().rrx(), this->cc().rry(),
388                                         cclx, ccly,
389                                         std::get<1>(cli2), std::get<2>(cli2),
390                                         std::get<3>(cli2), std::get<4>(cli2)
391                                 );
392                         } else if (ccl_lr >= ccl_p1) {
393                                 // in parking slot
394                                 // TODO (ccl, lr) x (p1, p2)
395                                 auto cli2 = ::intersect(
396                                         cclx, ccly, ccl_rr,
397                                         this->ps().x2(), this->ps().y2(),
398                                         this->ps().x3(), this->ps().y3()
399                                 );
400                                 double a2 = smaller_angle_of_two(
401                                         this->cc().rrx(), this->cc().rry(),
402                                         cclx, ccly,
403                                         std::get<1>(cli2), std::get<2>(cli2),
404                                         std::get<3>(cli2), std::get<4>(cli2)
405                                 );
406                         }
407
408                         double r1 = sqrt(
409                             pow(this->cc().lry() - ccly, 2)
410                             + pow(this->cc().lrx() - cclx, 2)
411                         );
412                         auto cli1 = ::intersect(
413                             cclx, ccly, r1,
414                             this->ps().x1(), this->ps().y1(),
415                             this->ps().x2(), this->ps().y2()
416                         );
417                         double a11 = ::angle_between_three_points(
418                             this->cc().lrx(), this->cc().lry(),
419                             cclx, ccly,
420                             std::get<1>(cli1), std::get<2>(cli1)
421                         );
422                         double a12 = ::angle_between_three_points(
423                             this->cc().lrx(), this->cc().lry(),
424                             cclx, ccly,
425                             std::get<3>(cli1), std::get<4>(cli1)
426                         );
427                         double a1 = std::min(a11, a12);
428 {
429         double rf = edist(cclx, ccly, this->ps().x1(), this->ps().y1());
430         if (
431                 edist(cclx, ccly, this->cc().lrx(), this->cc().lry()) < rf
432                 && rf < edist(cclx, ccly, this->cc().rrx(), this->cc().rry())
433         ) {
434                 auto clif = ::intersect(
435                         cclx, ccly, rf,
436                         this->cc().lrx(), this->cc().lry(),
437                         this->cc().rrx(), this->cc().rry()
438                 );
439                 double xf = std::get<1>(clif);
440                 double yf = std::get<2>(clif);
441                 if (
442                         edist(
443                                 std::get<3>(clif), std::get<4>(clif),
444                                 this->cc().x(), this->cc().y()
445
446                         )
447                         < edist(xf, yf, this->cc().x(), this->cc().y())
448                 ) {
449                         xf = std::get<3>(clif);
450                         yf = std::get<4>(clif);
451                 }
452                 double af = ::angle_between_three_points(
453                         xf, yf,
454                         cclx, ccly,
455                         this->ps().x1(), this->ps().y1()
456                 );
457                 a1 = af;
458         }
459 }
460
461                         double r2 = sqrt(
462                             pow(this->cc().rry() - ccly, 2)
463                             + pow(this->cc().rrx() - cclx, 2)
464                         );
465                         auto cli2 = ::intersect(
466                             cclx, ccly, r2,
467                             this->ps().x1(), this->ps().y1(),
468                             this->ps().x2(), this->ps().y2()
469                         );
470                         double a21 = ::angle_between_three_points(
471                             this->cc().rrx(), this->cc().rry(),
472                             cclx, ccly,
473                             std::get<1>(cli2), std::get<2>(cli2)
474                         );
475                         double a22 = ::angle_between_three_points(
476                             this->cc().rrx(), this->cc().rry(),
477                             cclx, ccly,
478                             std::get<3>(cli2), std::get<4>(cli2)
479                         );
480                         double a2 = std::min(a21, a22);
481
482                         double r3 = sqrt(
483                             pow(this->cc().rry() - ccly, 2)
484                             + pow(this->cc().rrx() - cclx, 2)
485                         );
486                         auto cli3 = ::intersect(
487                             cclx, ccly, r3,
488                             this->ps().x2(), this->ps().y2(),
489                             this->ps().x3(), this->ps().y3()
490                         );
491                         double a31 = ::angle_between_three_points(
492                             this->cc().rrx(), this->cc().rry(),
493                             cclx, ccly,
494                             std::get<1>(cli3), std::get<2>(cli3)
495                         );
496                         double a32 = ::angle_between_three_points(
497                             this->cc().rrx(), this->cc().rry(),
498                             cclx, ccly,
499                             std::get<3>(cli3), std::get<4>(cli3)
500                         );
501                         double a3 = std::min(a31, a32);
502
503                         if (std::get<0>(cli1) && (
504                             (!std::get<0>(cli2) && !std::get<0>(cli3))
505                             || (a1 < a2 && !std::get<0>(cli3))
506                             || (a1 < a3 && !std::get<0>(cli2))
507                             || (a1 < a2 && a1 < a3)
508                         )) {
509                             this->cc().rotate(cclx, ccly, -a1);
510                         } else if (std::get<0>(cli2) && (
511                             (!std::get<0>(cli1) && !std::get<0>(cli3))
512                             || (a2 < a1 && !std::get<0>(cli3))
513                             || (a2 < a3 && !std::get<0>(cli1))
514                             || (a2 < a1 && a2 < a3)
515                         )) {
516                             this->cc().rotate(cclx, ccly, -a2);
517                         } else if (std::get<0>(cli3) && (
518                             (!std::get<0>(cli1) && !std::get<0>(cli2))
519                             || (a3 < a1 && !std::get<0>(cli2))
520                             || (a3 < a2 && !std::get<0>(cli1))
521                             || (a3 < a1 && a3 < a2)
522                         )) {
523                             this->cc().rotate(cclx, ccly, -a3);
524                         } else {
525                             continue;
526                         }
527                         if (::right_side_of_line(
528                             this->cc().x(), this->cc().y(),
529                             this->cc().x() + cos(this->ps().heading()),
530                             this->cc().y() + sin(this->ps().heading()),
531                             this->cc().x() + cos(this->cc().h()),
532                             this->cc().y() + sin(this->cc().h())
533                         ))
534                             continue;
535                 } else if (this->ps().right() && this->cc().sp() > 0) {
536                         double ccrx = this->cc().ccr().x();
537                         double ccry = this->cc().ccr().y();
538 {
539         double rf = sqrt(
540                 pow(this->cc().lfy() - ccry, 2)
541                 + pow(this->cc().lfx() - ccrx, 2)
542         );
543         auto clif = ::intersect(
544                 ccrx, ccry, rf,
545                 this->ps().x1(), this->ps().y1(),
546                 this->ps().x4(), this->ps().y4()
547         );
548         if (std::get<0>(clif)) {
549                 double xf = std::get<1>(clif);
550                 double yf = std::get<2>(clif);
551                 if (
552                         edist(
553                                 this->ps().x4(),
554                                 this->ps().y4(),
555                                 std::get<3>(clif),
556                                 std::get<4>(clif)
557                         ) < edist(
558                                 this->ps().x4(),
559                                 this->ps().y4(),
560                                 xf, yf
561                         )
562                 ) {
563                         xf = std::get<3>(clif);
564                         yf = std::get<4>(clif);
565                 }
566                 auto af = ::angle_between_three_points(
567                         this->cc().lfx(),
568                         this->cc().lfy(),
569                         ccrx, ccry,
570                         xf, yf
571                 );
572                 auto tmp_cc = BicycleCar(this->cc());
573                 this->cc().rotate(ccrx, ccry, -af);
574                 if (
575                         !this->collide()
576                         && (edist(
577                                 this->ps().x1(), this->ps().y1(),
578                                 xf, yf
579                         ) < edist(
580                                 this->ps().x1(), this->ps().y1(),
581                                 this->ps().x4(), this->ps().y4()
582                         ))
583                 ) {
584                         this->cc().sp(-0.01);
585                         this->cc().set_max_steer();
586                         this->cc().st(this->cc().st() * -1);
587                         this->gc() = BicycleCar(this->cc());
588                         goto successfinish;
589                 } else {
590                         this->cc() = BicycleCar(tmp_cc);
591                 }
592         } else {
593                 // should be parked and found in previous iteration or continue
594                 // with the parking process
595         }
596 }
597                         double r1 = sqrt(
598                             pow(this->cc().rfy() - ccry, 2)
599                             + pow(this->cc().rfx() - ccrx, 2)
600                         );
601                         auto cli1 = ::intersect(
602                             ccrx, ccry, r1,
603                             this->ps().x3(), this->ps().y3(),
604                             this->ps().x4(), this->ps().y4()
605                         );
606                         double a11 = ::angle_between_three_points(
607                             this->cc().lrx(), this->cc().lry(),
608                             ccrx, ccry,
609                             std::get<1>(cli1), std::get<2>(cli1)
610                         );
611                         double a12 = ::angle_between_three_points(
612                             this->cc().lrx(), this->cc().lry(),
613                             ccrx, ccry,
614                             std::get<3>(cli1), std::get<4>(cli1)
615                         );
616                         double a1 = std::min(a11, a12);
617
618                         double r2 = sqrt(
619                             pow(this->cc().lfy() - ccry, 2)
620                             + pow(this->cc().lfx() - ccrx, 2)
621                         );
622                         auto cli2 = ::intersect(
623                             ccrx, ccry, r2,
624                             this->ps().x3(), this->ps().y3(),
625                             this->ps().x4(), this->ps().y4()
626                         );
627                         double a21 = ::angle_between_three_points(
628                             this->cc().rrx(), this->cc().rry(),
629                             ccrx, ccry,
630                             std::get<1>(cli2), std::get<2>(cli2)
631                         );
632                         double a22 = ::angle_between_three_points(
633                             this->cc().rrx(), this->cc().rry(),
634                             ccrx, ccry,
635                             std::get<3>(cli2), std::get<4>(cli2)
636                         );
637                         double a2 = std::min(a21, a22);
638
639                         double r3 = sqrt(
640                             pow(this->cc().rfy() - ccry, 2)
641                             + pow(this->cc().rfx() - ccrx, 2)
642                         );
643                         auto cli3 = ::intersect(
644                             ccrx, ccry, r3,
645                             this->ps().x3(), this->ps().y3(),
646                             this->ps().x2(), this->ps().y2()
647                         );
648                         double a31 = ::angle_between_three_points(
649                             this->cc().rrx(), this->cc().rry(),
650                             ccrx, ccry,
651                             std::get<1>(cli3), std::get<2>(cli3)
652                         );
653                         double a32 = ::angle_between_three_points(
654                             this->cc().rrx(), this->cc().rry(),
655                             ccrx, ccry,
656                             std::get<3>(cli3), std::get<4>(cli3)
657                         );
658                         double a3 = std::min(a31, a32);
659
660                         if (std::get<0>(cli1) && (
661                             (!std::get<0>(cli2) && !std::get<0>(cli3))
662                             || (a1 < a2 && !std::get<0>(cli3))
663                             || (a1 < a3 && !std::get<0>(cli2))
664                             || (a1 < a2 && a1 < a3)
665                         )) {
666                             this->cc().rotate(ccrx, ccry, -a1);
667                         } else if (std::get<0>(cli2) && (
668                             (!std::get<0>(cli1) && !std::get<0>(cli3))
669                             || (a2 < a1 && !std::get<0>(cli3))
670                             || (a2 < a3 && !std::get<0>(cli1))
671                             || (a2 < a1 && a2 < a3)
672                         )) {
673                             this->cc().rotate(ccrx, ccry, -a2);
674                         } else if (std::get<0>(cli3) && (
675                             (!std::get<0>(cli1) && !std::get<0>(cli2))
676                             || (a3 < a1 && !std::get<0>(cli2))
677                             || (a3 < a2 && !std::get<0>(cli1))
678                             || (a3 < a1 && a3 < a2)
679                         )) {
680                             this->cc().rotate(ccrx, ccry, -a3);
681                         } else {
682                             continue;
683                         }
684                 } else {
685                         // TODO left parking slot (both forward, backward)
686                 }
687                 this->cc().sp(this->cc().sp() * -1);
688                 this->cc().next();
689                 this->gc() = BicycleCar(this->cc());
690                 if (this->parked())
691                         goto successfinish;
692                 this->cc().st(this->cc().st() * -1);
693                 q.push(BicycleCar(this->cc()));
694                 if (sgn(this->cc().st()) == sgn(q.front().st()))
695                         iter_cntr++;
696         }
697         // fallback to fer
698         this->gc() = BicycleCar(bco);
699 successfinish:
700         return this->fer_parallel();
701 }
702
703 void PSPlanner::fe_perpendicular()
704 {
705         // TODO Try multiple angles when going from parking slot.
706         //
707         //      Do not use just the maximum steer angle. Test angles
708         //      until the whole current car `cc` is out of the parking
709         //      slot `ps`.
710         //
711         //      Another approach could be testing angles from the
712         //      beginning of the escape parkig slot maneuver.
713         if (this->forward())
714                 this->cc().sp(-0.01);
715         else
716                 this->cc().sp(0.01);
717         while (!this->left())
718                 this->cc().next();
719         return;
720 }
721
722 void PSPlanner::fer()
723 {
724         this->c_ = 0;
725         if (this->ps().parallel()) {
726                 this->guess_gc();
727                 this->cc() = BicycleCar(this->gc());
728                 this->cc().set_max_steer();
729                 if (!this->ps().right())
730                         this->cc().st(this->cc().st() * -1);
731                 this->cc().sp(0.01);
732                 return this->fer_parallel();
733         } else {
734                 return this->fer_perpendicular();
735         }
736 }
737
738 void PSPlanner::fer_parallel()
739 {
740         this->cusps_.clear();
741         while (!this->left()) {
742                 while (!this->collide() && !this->left())
743                         this->cc().next();
744                 if (this->left() && !this->collide()) {
745                         break;
746                 } else {
747                         this->cc().sp(this->cc().sp() * -1);
748                         this->cc().next();
749                         this->cc().st(this->cc().st() * -1);
750                         this->c_++;
751                         this->cusps_.push_back(this->cc());
752                 }
753         }
754         if (this->cc().st() < 0) {
755                 this->c_++;
756                 this->cusps_.push_back(this->cc());
757         }
758 }
759
760 void PSPlanner::fer_perpendicular()
761 {
762         bool delta_use[] = {true, true, true};
763         double cc_h = this->cc().h();
764         double x;
765         double y;
766         // check inner radius
767         if (this->forward()) {
768                 x = this->ps().x1();
769                 y = this->ps().y1();
770         } else {
771                 x = this->ps().x4();
772                 y = this->ps().y4();
773         }
774         double x1;
775         double y1;
776         if (this->ps().right()) {
777                 x1 = this->cc().ccr().x();
778                 y1 = this->cc().ccr().y();
779         } else {
780                 x1 = this->cc().ccl().x();
781                 y1 = this->cc().ccl().y();
782         }
783         double IR = this->cc().iradi();
784         double a = 1;
785         double b;
786         if (this->forward())
787                 b = (x - x1) * 2 * cos(cc_h) + (y - y1) * 2 * sin(cc_h);
788         else
789                 b = (x1 - x) * 2 * cos(cc_h) + (y1 - y) * 2 * sin(cc_h);
790         double c = pow(x - x1, 2) + pow(y - y1, 2) - pow(IR, 2);
791         double D = pow(b, 2) - 4 * a * c;
792         double delta;
793         delta = -b - sqrt(D);
794         delta /= 2 * a;
795         double delta_1 = delta;
796         if (D < 0)
797                 delta_use[0] = false;
798         // check outer radius
799         if (this->forward()) {
800                 x = this->ps().x4();
801                 y = this->ps().y4();
802         } else {
803                 x = this->ps().x1();
804                 y = this->ps().y1();
805         }
806         IR = this->cc().ofradi();
807         a = 1;
808         if (this->forward())
809                 b = (x - x1) * 2 * cos(cc_h) + (y - y1) * 2 * sin(cc_h);
810         else
811                 b = (x1 - x) * 2 * cos(cc_h) + (y1 - y) * 2 * sin(cc_h);
812         c = pow(x - x1, 2) + pow(y - y1, 2) - pow(IR, 2);
813         D = pow(b, 2) - 4 * a * c;
814         if (this->forward()) {
815                 delta = -b + sqrt(D);
816                 delta /= 2 * a;
817         }
818         double delta_2 = delta;
819         if (D < 0)
820                 delta_use[1] = false;
821         delta = -b - sqrt(D);
822         delta /= 2 * a;
823         double delta_3 = delta;
824         if (D < 0)
825                 delta_use[2] = false;
826         if (delta_use[0] && delta_use[1] && delta_use[2])
827                 delta = std::max(delta_1, std::max(delta_2, delta_3));
828         else if (delta_use[0] && delta_use[1])
829                 delta = std::max(delta_1, delta_2);
830         else if (delta_use[0] && delta_use[2])
831                 delta = std::max(delta_1, delta_3);
832         else if (delta_use[1] && delta_use[2])
833                 delta = std::max(delta_2, delta_3);
834         else if (delta_use[0])
835                 delta = delta_1;
836         else if (delta_use[1])
837                 delta = delta_2;
838         else if (delta_use[2])
839                 delta = delta_3;
840         else
841                 return;
842         // current car `cc` can get out of slot with max steer
843         this->cc().x(this->cc().x() + delta * cos(cc_h));
844         this->cc().y(this->cc().y() + delta * sin(cc_h));
845         this->cc().h(cc_h);
846         // get current car `cc` out of slot
847         if (this->forward())
848                 this->cc().sp(-0.01);
849         else
850                 this->cc().sp(0.01);
851         this->cc().set_max_steer();
852         if (this->ps().right())
853                 this->cc().st(this->cc().st() * -1);
854         while (!this->left()) {
855                 while (!this->collide() && !this->left())
856                         this->cc().next();
857                 if (this->left() && !this->collide()) {
858                         break;
859                 } else {
860                         this->cc().sp(this->cc().sp() * -1);
861                         this->cc().next();
862                         this->cc().st(this->cc().st() * -1);
863                 }
864         }
865 }
866
867 PSPlanner::PSPlanner()
868 {
869 }