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 double heading = this->ps().heading();
25 while (heading < 0) heading += 2 * M_PI;
26 if (!this->ps().parallel())
28 double h = this->gc().h();
29 while (h < 0) h += 2 * M_PI;
30 if (-0.00001 < heading - h && heading - h < 0.00001)
36 void PSPlanner::guess_gc()
38 double x = this->ps().x1();
39 double y = this->ps().y1();
40 double h = this->ps().heading();
41 double dts = + M_PI / 2; // direction to slot
42 if (this->ps().right())
44 if (this->ps().parallel()) {
45 x += (this->gc().w() + 0.01) * cos(h + dts);
46 x += (this->gc().dr() + 0.01) * cos(h);
47 y += (this->gc().w() + 0.01) * sin(h + dts);
48 y += (this->gc().dr() + 0.01) * sin(h);
50 x += (this->ps().x4() - this->ps().x1()) / 2;
51 x += (this->gc().df() + 0.01) * cos(h + dts);
52 y += (this->ps().y4() - this->ps().y1()) / 2;
53 y += (this->gc().df() + 0.01) * sin(h + dts);
54 if (this->ps().right())
68 bool PSPlanner::left()
70 double lfx = this->cc().lfx();
71 double lfy = this->cc().lfy();
72 double lrx = this->cc().lrx();
73 double lry = this->cc().lry();
74 double rrx = this->cc().rrx();
75 double rry = this->cc().rry();
76 double rfx = this->cc().rfx();
77 double rfy = this->cc().rfy();
79 (lfx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
80 - (lfy - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
83 (lrx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
84 - (lry - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
87 (rrx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
88 - (rry - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
91 (rfx - this->ps().x1()) * (this->ps().y4() - this->ps().y1())
92 - (rfy - this->ps().y1()) * (this->ps().x4() - this->ps().x1())
94 if (this->ps().parallel())
95 return lfs == rfs && (lfs != lrs || lfs != rrs);
96 else if (!this->forward())
97 return lfs == rfs && (lfs != lrs || lfs != rrs);
99 return lrs == rrs && (lrs != lfs || lrs != rfs);
102 bool PSPlanner::parked()
104 std::vector<std::tuple<double, double>> slot;
105 slot.push_back(std::make_tuple(this->ps().x1(), this->ps().y1()));
106 slot.push_back(std::make_tuple(this->ps().x2(), this->ps().y2()));
107 slot.push_back(std::make_tuple(this->ps().x3(), this->ps().y3()));
108 slot.push_back(std::make_tuple(this->ps().x4(), this->ps().y4()));
109 return inside(this->gc().lfx(), this->gc().lfy(), slot)
110 && inside(this->gc().lrx(), this->gc().lry(), slot)
111 && inside(this->gc().rrx(), this->gc().rry(), slot)
112 && inside(this->gc().rfx(), this->gc().rfy(), slot);
115 std::vector<BicycleCar> PSPlanner::possible_inits()
117 std::vector<BicycleCar> pi;
124 if (this->ps().parallel())
125 return this->fe_parallel();
127 return this->fe_perpendicular();
130 void PSPlanner::fe_parallel()
132 // angle for distance from "entry" corner
133 double dist_angl = this->ps().heading() + M_PI;
134 dist_angl += (this->ps().right()) ? - M_PI / 4 : + M_PI / 4;
135 // set bicycle car `bci` basic dimensions and heading
136 BicycleCar bci = BicycleCar(this->gc());
137 BicycleCar bco = BicycleCar(this->gc());
138 bci.h(this->ps().heading());
139 // move 0.01 from the "entry" corner
140 bci.x(this->ps().x4() + 0.01 * cos(dist_angl));
141 bci.y(this->ps().y4() + 0.01 * sin(dist_angl));
142 // align with parking "top" of slot (move backward)
143 dist_angl = bci.h() + M_PI;
144 bci.x(bci.x() + bci.df() * cos(dist_angl));
145 bci.y(bci.y() + bci.df() * sin(dist_angl));
146 // align with "entry" to pakring slot (move outside)
147 dist_angl = this->ps().heading();
148 dist_angl += (this->ps().right()) ? + M_PI / 2 : - M_PI / 2;
149 bci.x(bci.x() + bci.w() / 2 * cos(dist_angl));
150 bci.y(bci.y() + bci.w() / 2 * sin(dist_angl));
151 // BFS - init all starts
152 // see https://courses.cs.washington.edu/courses/cse326/03su/homework/hw3/bfs.html
153 double dist_diag = sqrt(pow(bci.w() / 2, 2) + pow(bci.df(), 2));
154 if (this->ps().right())
155 dist_angl = atan2(bci.y() - bci.rfy(), bci.x() - bci.rfx());
157 dist_angl = atan2(bci.y() - bci.lfy(), bci.x() - bci.lfx());
158 double DIST_ANGL = dist_angl;
159 std::queue<BicycleCar, std::list<BicycleCar>> q;
163 && dist_angl < DIST_ANGL + 3 * M_PI / 4
167 && dist_angl > DIST_ANGL - 3 * M_PI / 4
170 this->cc() = BicycleCar(bci);
171 if (this->ps().right()) {
172 this->cc().x(bci.rfx() + dist_diag * cos(dist_angl));
173 this->cc().y(bci.rfy() + dist_diag * sin(dist_angl));
175 this->cc().x(bci.lfx() + dist_diag * cos(dist_angl));
176 this->cc().y(bci.lfy() + dist_diag * sin(dist_angl));
178 this->cc().h(this->ps().heading() + dist_angl - DIST_ANGL);
179 if (!this->collide()) {
180 this->cc().st(this->cc().wb() / this->cc().mtr());
181 if (!this->ps().right())
182 this->cc().st(this->cc().st() * -1);
183 this->cc().sp(-0.01);
184 q.push(BicycleCar(this->cc()));
186 dist_angl += (this->ps().right()) ? + 0.01 : - 0.01;
188 // BFS - find entry current car `cc` and corresponding goal car `gc`
189 unsigned int iter_cntr;
190 while (!q.empty() && iter_cntr < 9) {
191 this->cc() = BicycleCar(q.front());
196 this->cc().h() - this->ps().heading()
200 this->cc().sp(this->cc().sp() * -1);
202 this->gc() = BicycleCar(this->cc());
205 this->cc().st(this->cc().st() * -1);
206 q.push(BicycleCar(this->cc()));
207 if (sgn(this->cc().st()) == sgn(q.front().st()))
211 this->gc() = BicycleCar(bco);
213 return this->fer_parallel();
216 void PSPlanner::fe_perpendicular()
218 // TODO Try multiple angles when going from parking slot.
220 // Do not use just the maximum steer angle. Test angles
221 // until the whole current car `cc` is out of the parking
224 // Another approach could be testing angles from the
225 // beginning of the escape parkig slot maneuver.
226 return fer_perpendicular();
229 void PSPlanner::fer()
231 if (this->ps().parallel())
232 return this->fer_parallel();
234 return this->fer_perpendicular();
237 void PSPlanner::fer_parallel()
239 this->cc().st(this->cc().wb() / this->cc().mtr());
240 if (!this->ps().right())
241 this->cc().st(this->cc().st() * -1);
243 while (!this->left()) {
244 while (!this->collide() && !this->left())
246 if (this->left() && !this->collide()) {
249 this->cc().sp(this->cc().sp() * -1);
251 this->cc().st(this->cc().st() * -1);
256 void PSPlanner::fer_perpendicular()
258 bool delta_use[] = {true, true, true};
259 double cc_h = this->cc().h();
262 // check inner radius
263 if (this->forward()) {
272 if (this->ps().right()) {
273 x1 = this->cc().ccr().x();
274 y1 = this->cc().ccr().y();
276 x1 = this->cc().ccl().x();
277 y1 = this->cc().ccl().y();
279 double IR = this->cc().iradi();
283 b = (x - x1) * 2 * cos(cc_h) + (y - y1) * 2 * sin(cc_h);
285 b = (x1 - x) * 2 * cos(cc_h) + (y1 - y) * 2 * sin(cc_h);
286 double c = pow(x - x1, 2) + pow(y - y1, 2) - pow(IR, 2);
287 double D = pow(b, 2) - 4 * a * c;
289 delta = -b - sqrt(D);
291 double delta_1 = delta;
293 delta_use[0] = false;
294 // check outer radius
295 if (this->forward()) {
302 IR = this->cc().ofradi();
305 b = (x - x1) * 2 * cos(cc_h) + (y - y1) * 2 * sin(cc_h);
307 b = (x1 - x) * 2 * cos(cc_h) + (y1 - y) * 2 * sin(cc_h);
308 c = pow(x - x1, 2) + pow(y - y1, 2) - pow(IR, 2);
309 D = pow(b, 2) - 4 * a * c;
310 if (this->forward()) {
311 delta = -b + sqrt(D);
314 double delta_2 = delta;
316 delta_use[1] = false;
317 delta = -b - sqrt(D);
319 double delta_3 = delta;
321 delta_use[2] = false;
322 if (delta_use[0] && delta_use[1] && delta_use[22])
323 delta = std::max(delta_1, std::max(delta_2, delta_3));
324 else if (delta_use[0] && delta_use[1])
325 delta = std::max(delta_1, delta_2);
326 else if (delta_use[0] && delta_use[2])
327 delta = std::max(delta_1, delta_3);
328 else if (delta_use[1] && delta_use[2])
329 delta = std::max(delta_2, delta_3);
330 else if (delta_use[0])
332 else if (delta_use[1])
334 else if (delta_use[2])
338 // current car `cc` can get out of slot with max steer
339 this->cc().x(this->cc().x() + delta * cos(cc_h));
340 this->cc().y(this->cc().y() + delta * sin(cc_h));
342 // get current car `cc` out of slot
347 this->cc().st(this->cc().wb() / this->cc().mtr());
348 if (this->ps().right())
349 this->cc().st(this->cc().st() * -1);
350 while (!this->left()) {
351 while (!this->collide() && !this->left())
353 if (this->left() && !this->collide()) {
356 this->cc().sp(this->cc().sp() * -1);
358 this->cc().st(this->cc().st() * -1);
363 PSPlanner::PSPlanner()