6 WVTEST_MAIN("parallel parking slot planner")
9 psp.ps().border(3, 3, 5, 3, 5, 8, 3, 8);
20 psp.cc() = BicycleCar(psp.gc());
23 WVPASS(!psp.collide());
24 WVPASS(psp.forward());
25 WVPASSEQ_DOUBLE(psp.ps().heading(), psp.gc().h(), 0.00001);
27 std::vector<std::tuple<double, double>> slot;
28 slot.push_back(std::make_tuple(psp.ps().x1(), psp.ps().y1()));
29 slot.push_back(std::make_tuple(psp.ps().x2(), psp.ps().y2()));
30 slot.push_back(std::make_tuple(psp.ps().x3(), psp.ps().y3()));
31 slot.push_back(std::make_tuple(psp.ps().x4(), psp.ps().y4()));
32 WVPASS(inside(psp.gc().x(), psp.gc().y(), slot));
33 WVPASS(inside(psp.gc().lfx(), psp.gc().lfy(), slot));
34 WVPASS(inside(psp.gc().lrx(), psp.gc().lry(), slot));
35 WVPASS(inside(psp.gc().rrx(), psp.gc().rry(), slot));
36 WVPASS(inside(psp.gc().rfx(), psp.gc().rfy(), slot));
40 tpsp.ps().border(2, 3, 4, 3, 4, 8, 2, 8);
41 tpsp.gc() = BicycleCar(psp.gc());
42 tpsp.cc() = BicycleCar(tpsp.gc());
43 WVPASS(tpsp.collide());
45 tpsp.ps().border(3, 4.1, 3, 2.1, 8, 2.1, 8, 4.1);
48 // entry point found by reverse
55 psp.cc() = BicycleCar(psp.gc());
62 WVTEST_MAIN("backward perpendicullar parking slot planner")
65 psp.ps().border(3, 3, 8, 3, 8, 5, 3, 5);
76 psp.cc() = BicycleCar(psp.gc());
79 WVPASS(!psp.collide());
80 WVPASS(!psp.forward());
81 WVPASSEQ_DOUBLE(psp.ps().heading() + M_PI / 2, psp.gc().h(), 0.00001);
84 // entry point found by reverse
91 psp.cc() = BicycleCar(psp.gc());
98 WVTEST_MAIN("forward perpendicullar parking slot planner")
101 psp.ps().border(3, 3, 8, 3, 8, 5, 3, 5);
110 psp.gc().df(2 + 0.5);
112 psp.cc() = BicycleCar(psp.gc());
115 WVPASS(!psp.collide());
116 WVPASS(psp.forward());
117 WVPASSEQ_DOUBLE(psp.ps().heading() - M_PI / 2, psp.gc().h(), 0.00001);
118 WVPASS(psp.parked());
120 // entry point found by reverse
124 WVPASS(psp.parked());
127 psp.cc() = BicycleCar(psp.gc());
131 WVPASS(psp.parked());