6 bool PSPlanner::collide()
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));
22 bool PSPlanner::forward()
24 if (this->ps().parallel())
28 double heading = atan2(
29 this->ps().y2() - this->ps().y1(),
30 this->ps().x2() - this->ps().x1()
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)
40 void PSPlanner::gc_to_4()
42 double angl_slot = atan2(
43 this->ps().y3() - this->ps().y4(),
44 this->ps().x3() - this->ps().x4()
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);
57 this->gc().h(angl_slot);
60 std::tuple<double, double, double, double> circle_line_intersection(
61 double cx, double cy, double r,
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)
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;
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);
87 double edist(double x1, double y1, double x2, double y2)
89 return sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2));
92 void PSPlanner::guess_gc()
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())
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);
107 double entry_width = edist(
108 this->ps().x1(), this->ps().y1(),
109 this->ps().x4(), this->ps().y4()
111 x += entry_width / 2 * cos(h);
112 y += entry_width / 2 * sin(h);
114 this->ps().y2() - this->ps().y1(),
115 this->ps().x2() - this->ps().x1()
117 while (h < 0) h += 2 * M_PI;
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()
125 // this->gc().orradi()
126 // - (this->gc().mtr() + this->gc().w() / 2)
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)
134 //move2 -= this->gc().dr() / 2; // workaround
135 //x += move1 * cos(h);
136 //y += move1 * sin(h);
138 // this->ps().y2() - this->ps().y1(),
139 // this->ps().x2() - this->ps().x1()
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;
155 std::vector<BicycleCar> PSPlanner::last_maneuver()
157 std::vector<BicycleCar> lm;
158 if (this->ps().parallel()) {
159 // zig-zag out from the slot
160 this->cc() = BicycleCar(this->gc());
162 while (!this->left()) {
163 while (!this->collide() && !this->left()) {
165 lm.push_back(BicycleCar(this->cc()));
167 if (this->left() && !this->collide()) {
171 this->cc().sp(this->cc().sp() * -1);
173 this->cc().st(this->cc().st() * -1);
175 lm.push_back(BicycleCar(this->cc()));
178 if (this->cc().st() < 0) {
180 lm.push_back(BicycleCar(this->cc()));
185 BicycleCar orig_cc(this->cc());
186 for (unsigned int i = 0; i < 10; i++) {
188 lm.push_back(BicycleCar(this->cc()));
190 this->cc() = BicycleCar(orig_cc);
195 bool PSPlanner::left()
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();
206 (lfx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
207 - (lfy - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
210 (lrx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
211 - (lry - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
214 (rrx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
215 - (rry - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
218 (rfx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
219 - (rfy - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
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);
226 return lrs == rrs && (lrs != lfs || lrs != rfs);
229 bool PSPlanner::parked()
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);
242 std::vector<BicycleCar> PSPlanner::possible_goals(
247 std::vector<BicycleCar> pi;
248 if (this->ps().parallel())
252 this->cc().sp(this->cc().sp() * dist);
253 BicycleCar orig_cc(this->cc());
254 for (unsigned int i = 0; i < cnt; i++) {
256 pi.push_back(BicycleCar(this->cc()));
258 this->cc() = BicycleCar(orig_cc);
259 if (this->ps().parallel()) {
261 for (unsigned int i = 0; i < cnt; i++) {
263 pi.push_back(BicycleCar(this->cc()));
265 this->cc() = BicycleCar(orig_cc);
267 if (!this->ps().right()) {
268 this->cc().set_max_steer();
269 for (unsigned int i = 0; i < cnt; i++) {
271 pi.push_back(BicycleCar(this->cc()));
274 this->cc().set_max_steer();
275 this->cc().st(this->cc().st() * -1);
276 for (unsigned int i = 0; i < cnt; i++) {
278 pi.push_back(BicycleCar(this->cc()));
281 this->cc() = BicycleCar(orig_cc);
290 if (this->ps().parallel()) {
291 return this->fe_parallel();
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);
302 void PSPlanner::fe_parallel()
304 BicycleCar bco = BicycleCar(this->gc());
305 this->cc() = BicycleCar();
306 this->cc().sp(-0.01);
307 this->cc().set_max_steer();
308 if (!this->ps().right())
309 this->cc().st(this->cc().st() * -1);
310 this->cc().h(this->ps().heading());
311 double angl_in_slot = this->ps().heading() - M_PI / 4;
312 if (!this->ps().right())
313 angl_in_slot += M_PI / 2;
316 + this->cc().w()/2 * cos(
318 + (this->ps().right() ? + M_PI / 2 : - M_PI / 2)
320 + (this->cc().df() + 0.01) * cos(
321 this->ps().heading() + M_PI
326 + this->cc().w()/2 * sin(
328 + (this->ps().right() ? + M_PI / 2 : - M_PI / 2)
330 + (this->cc().df() + 0.01) * sin(
331 this->ps().heading() + M_PI
335 std::queue<BicycleCar, std::list<BicycleCar>> q;
336 while (!this->collide()) {
340 this->ps().y4() - 0.01,
341 ((this->ps().right()) ? 0.001 : -0.001)
344 // BFS - find entry current car `cc` and corresponding goal car `gc`
345 unsigned int iter_cntr = 0;
346 while (!q.empty() && iter_cntr < 30) {
347 this->cc() = BicycleCar(q.front());
349 if (this->ps().right() && this->cc().sp() < 0) {
350 double cclx = this->cc().ccl().x();
351 double ccly = this->cc().ccl().y();
354 pow(this->cc().lry() - ccly, 2)
355 + pow(this->cc().lrx() - cclx, 2)
357 auto cli1 = ::intersect(
359 this->ps().x1(), this->ps().y1(),
360 this->ps().x2(), this->ps().y2()
362 double a11 = ::angle_between_three_points(
363 this->cc().lrx(), this->cc().lry(),
365 std::get<1>(cli1), std::get<2>(cli1)
367 double a12 = ::angle_between_three_points(
368 this->cc().lrx(), this->cc().lry(),
370 std::get<3>(cli1), std::get<4>(cli1)
372 double a1 = std::min(a11, a12);
375 pow(this->cc().rry() - ccly, 2)
376 + pow(this->cc().rrx() - cclx, 2)
378 auto cli2 = ::intersect(
380 this->ps().x1(), this->ps().y1(),
381 this->ps().x2(), this->ps().y2()
383 double a21 = ::angle_between_three_points(
384 this->cc().rrx(), this->cc().rry(),
386 std::get<1>(cli2), std::get<2>(cli2)
388 double a22 = ::angle_between_three_points(
389 this->cc().rrx(), this->cc().rry(),
391 std::get<3>(cli2), std::get<4>(cli2)
393 double a2 = std::min(a21, a22);
396 pow(this->cc().rry() - ccly, 2)
397 + pow(this->cc().rrx() - cclx, 2)
399 auto cli3 = ::intersect(
401 this->ps().x2(), this->ps().y2(),
402 this->ps().x3(), this->ps().y3()
404 double a31 = ::angle_between_three_points(
405 this->cc().rrx(), this->cc().rry(),
407 std::get<1>(cli3), std::get<2>(cli3)
409 double a32 = ::angle_between_three_points(
410 this->cc().rrx(), this->cc().rry(),
412 std::get<3>(cli3), std::get<4>(cli3)
414 double a3 = std::min(a31, a32);
416 if (std::get<0>(cli1) && (
417 (!std::get<0>(cli2) && !std::get<0>(cli3))
418 || (a1 < a2 && !std::get<0>(cli3))
419 || (a1 < a3 && !std::get<0>(cli2))
420 || (a1 < a2 && a1 < a3)
422 this->cc().rotate(cclx, ccly, -a1);
423 } else if (std::get<0>(cli2) && (
424 (!std::get<0>(cli1) && !std::get<0>(cli3))
425 || (a2 < a1 && !std::get<0>(cli3))
426 || (a2 < a3 && !std::get<0>(cli1))
427 || (a2 < a1 && a2 < a3)
429 this->cc().rotate(cclx, ccly, -a2);
430 } else if (std::get<0>(cli3) && (
431 (!std::get<0>(cli1) && !std::get<0>(cli2))
432 || (a3 < a1 && !std::get<0>(cli2))
433 || (a3 < a2 && !std::get<0>(cli1))
434 || (a3 < a1 && a3 < a2)
436 this->cc().rotate(cclx, ccly, -a3);
440 } else if (this->ps().right() && this->cc().sp() > 0) {
441 // TODO right parking slot (forward)
443 // TODO left parking slot (both forward, backward)
445 this->cc().sp(this->cc().sp() * -1);
447 this->gc() = BicycleCar(this->cc());
450 this->cc().st(this->cc().st() * -1);
451 q.push(BicycleCar(this->cc()));
452 if (sgn(this->cc().st()) == sgn(q.front().st()))
456 this->gc() = BicycleCar(bco);
458 return this->fer_parallel();
461 void PSPlanner::fe_perpendicular()
463 // TODO Try multiple angles when going from parking slot.
465 // Do not use just the maximum steer angle. Test angles
466 // until the whole current car `cc` is out of the parking
469 // Another approach could be testing angles from the
470 // beginning of the escape parkig slot maneuver.
472 this->cc().sp(-0.01);
475 while (!this->left())
480 void PSPlanner::fer()
483 if (this->ps().parallel()) {
485 this->cc() = BicycleCar(this->gc());
486 this->cc().set_max_steer();
487 if (!this->ps().right())
488 this->cc().st(this->cc().st() * -1);
490 return this->fer_parallel();
492 return this->fer_perpendicular();
496 void PSPlanner::fer_parallel()
498 this->cusps_.clear();
499 while (!this->left()) {
500 while (!this->collide() && !this->left())
502 if (this->left() && !this->collide()) {
505 this->cc().sp(this->cc().sp() * -1);
507 this->cc().st(this->cc().st() * -1);
509 this->cusps_.push_back(this->cc());
512 if (this->cc().st() < 0) {
514 this->cusps_.push_back(this->cc());
518 void PSPlanner::fer_perpendicular()
520 bool delta_use[] = {true, true, true};
521 double cc_h = this->cc().h();
524 // check inner radius
525 if (this->forward()) {
534 if (this->ps().right()) {
535 x1 = this->cc().ccr().x();
536 y1 = this->cc().ccr().y();
538 x1 = this->cc().ccl().x();
539 y1 = this->cc().ccl().y();
541 double IR = this->cc().iradi();
545 b = (x - x1) * 2 * cos(cc_h) + (y - y1) * 2 * sin(cc_h);
547 b = (x1 - x) * 2 * cos(cc_h) + (y1 - y) * 2 * sin(cc_h);
548 double c = pow(x - x1, 2) + pow(y - y1, 2) - pow(IR, 2);
549 double D = pow(b, 2) - 4 * a * c;
551 delta = -b - sqrt(D);
553 double delta_1 = delta;
555 delta_use[0] = false;
556 // check outer radius
557 if (this->forward()) {
564 IR = this->cc().ofradi();
567 b = (x - x1) * 2 * cos(cc_h) + (y - y1) * 2 * sin(cc_h);
569 b = (x1 - x) * 2 * cos(cc_h) + (y1 - y) * 2 * sin(cc_h);
570 c = pow(x - x1, 2) + pow(y - y1, 2) - pow(IR, 2);
571 D = pow(b, 2) - 4 * a * c;
572 if (this->forward()) {
573 delta = -b + sqrt(D);
576 double delta_2 = delta;
578 delta_use[1] = false;
579 delta = -b - sqrt(D);
581 double delta_3 = delta;
583 delta_use[2] = false;
584 if (delta_use[0] && delta_use[1] && delta_use[2])
585 delta = std::max(delta_1, std::max(delta_2, delta_3));
586 else if (delta_use[0] && delta_use[1])
587 delta = std::max(delta_1, delta_2);
588 else if (delta_use[0] && delta_use[2])
589 delta = std::max(delta_1, delta_3);
590 else if (delta_use[1] && delta_use[2])
591 delta = std::max(delta_2, delta_3);
592 else if (delta_use[0])
594 else if (delta_use[1])
596 else if (delta_use[2])
600 // current car `cc` can get out of slot with max steer
601 this->cc().x(this->cc().x() + delta * cos(cc_h));
602 this->cc().y(this->cc().y() + delta * sin(cc_h));
604 // get current car `cc` out of slot
606 this->cc().sp(-0.01);
609 this->cc().set_max_steer();
610 if (this->ps().right())
611 this->cc().st(this->cc().st() * -1);
612 while (!this->left()) {
613 while (!this->collide() && !this->left())
615 if (this->left() && !this->collide()) {
618 this->cc().sp(this->cc().sp() * -1);
620 this->cc().st(this->cc().st() * -1);
625 PSPlanner::PSPlanner()