#include <cmath>
+#include <list>
+#include <queue>
#include "psp.h"
bool PSPlanner::collide()
{
- if(std::get<0>(intersect(
- this->cc().lfx(), this->cc().lfy(),
- this->cc().lrx(), this->cc().lry(),
- this->ps().x1(), this->ps().y1(),
- this->ps().x2(), this->ps().y2()
- )))
- return true;
- if(std::get<0>(intersect(
- this->cc().rfx(), this->cc().rfy(),
- this->cc().rrx(), this->cc().rry(),
- this->ps().x1(), this->ps().y1(),
- this->ps().x2(), this->ps().y2()
- )))
- return true;
- if(std::get<0>(intersect(
- this->cc().lfx(), this->cc().lfy(),
- this->cc().rfx(), this->cc().rfy(),
- this->ps().x1(), this->ps().y1(),
- this->ps().x2(), this->ps().y2()
- )))
- return true;
- if(std::get<0>(intersect(
- this->cc().lrx(), this->cc().lry(),
- this->cc().rrx(), this->cc().rry(),
- this->ps().x1(), this->ps().y1(),
- this->ps().x2(), this->ps().y2()
- )))
- return true;
- if(std::get<0>(intersect(
- this->cc().lfx(), this->cc().lfy(),
- this->cc().lrx(), this->cc().lry(),
- this->ps().x2(), this->ps().y2(),
- this->ps().x3(), this->ps().y3()
- )))
- return true;
- if(std::get<0>(intersect(
- this->cc().rfx(), this->cc().rfy(),
- this->cc().rrx(), this->cc().rry(),
- this->ps().x2(), this->ps().y2(),
- this->ps().x3(), this->ps().y3()
- )))
- return true;
- if(std::get<0>(intersect(
- this->cc().lfx(), this->cc().lfy(),
- this->cc().rfx(), this->cc().rfy(),
- this->ps().x2(), this->ps().y2(),
- this->ps().x3(), this->ps().y3()
- )))
- return true;
- if(std::get<0>(intersect(
- this->cc().lrx(), this->cc().lry(),
- this->cc().rrx(), this->cc().rry(),
- this->ps().x2(), this->ps().y2(),
- this->ps().x3(), this->ps().y3()
- )))
- return true;
- if(std::get<0>(intersect(
- this->cc().lfx(), this->cc().lfy(),
- this->cc().lrx(), this->cc().lry(),
- this->ps().x3(), this->ps().y3(),
- this->ps().x4(), this->ps().y4()
- )))
- return true;
- if(std::get<0>(intersect(
- this->cc().rfx(), this->cc().rfy(),
- this->cc().rrx(), this->cc().rry(),
- this->ps().x3(), this->ps().y3(),
- this->ps().x4(), this->ps().y4()
- )))
- return true;
- if(std::get<0>(intersect(
- this->cc().lfx(), this->cc().lfy(),
- this->cc().rfx(), this->cc().rfy(),
- this->ps().x3(), this->ps().y3(),
- this->ps().x4(), this->ps().y4()
- )))
- return true;
- if(std::get<0>(intersect(
- this->cc().lrx(), this->cc().lry(),
- this->cc().rrx(), this->cc().rry(),
- this->ps().x3(), this->ps().y3(),
- this->ps().x4(), this->ps().y4()
- )))
+ std::vector<std::tuple<double, double>> bc;
+ bc.push_back(std::make_tuple(this->cc().lfx(), this->cc().lfy()));
+ bc.push_back(std::make_tuple(this->cc().lrx(), this->cc().lry()));
+ bc.push_back(std::make_tuple(this->cc().rrx(), this->cc().rry()));
+ bc.push_back(std::make_tuple(this->cc().rfx(), this->cc().rfy()));
+ bc.push_back(std::make_tuple(this->cc().lfx(), this->cc().lfy()));
+ std::vector<std::tuple<double, double>> ps;
+ ps.push_back(std::make_tuple(this->ps().x1(), this->ps().y1()));
+ ps.push_back(std::make_tuple(this->ps().x2(), this->ps().y2()));
+ ps.push_back(std::make_tuple(this->ps().x3(), this->ps().y3()));
+ ps.push_back(std::make_tuple(this->ps().x4(), this->ps().y4()));
+ return std::get<0>(::collide(bc, ps));
+}
+
+bool PSPlanner::forward()
+{
+ if (this->ps().parallel())
+ return false;
+ double heading = atan2(
+ this->ps().y2() - this->ps().y1(),
+ this->ps().x2() - this->ps().x1()
+ );
+ while (heading < 0) heading += 2 * M_PI;
+ double h = this->gc().h();
+ while (h < 0) h += 2 * M_PI;
+ if (std::abs(heading - h) < M_PI / 4)
return true;
return false;
}
+void PSPlanner::guess_gc()
+{
+ double x = this->ps().x1();
+ double y = this->ps().y1();
+ double h = this->ps().heading();
+ double dts = + M_PI / 2; // direction to slot
+ if (this->ps().right())
+ dts = - M_PI / 2;
+ dts *= 0.99; // precision workaround
+ if (this->ps().parallel()) {
+ x += (this->gc().w() / 2 + 0.01) * cos(h + dts);
+ x += (this->gc().dr() + 0.01) * cos(h);
+ y += (this->gc().w() / 2 + 0.01) * sin(h + dts);
+ y += (this->gc().dr() + 0.01) * sin(h);
+ } else {
+ dts = atan2(
+ this->ps().y2() - this->ps().y1(),
+ this->ps().x2() - this->ps().x1()
+ );
+ dts *= 1.01; // precision workaround
+ if (std::abs(dts - this->ps().heading()) < M_PI / 2) {
+ x = this->ps().x4();
+ y = this->ps().y4();
+ h = dts;
+ x += (this->gc().dr() + 0.01) * cos(h);
+ y += (this->gc().dr() + 0.01) * sin(h);
+ if (this->ps().right())
+ dts -= M_PI / 2;
+ else
+ dts += M_PI / 2;
+ x += (this->gc().w() / 2 + 0.01) * cos(dts);
+ y += (this->gc().w() / 2 + 0.01) * sin(dts);
+ } else {
+ h = dts + M_PI;
+ x += -(this->gc().df() + 0.01) * cos(h);
+ y += -(this->gc().df() + 0.01) * sin(h);
+ if (this->ps().right())
+ dts += M_PI / 2;
+ else
+ dts -= M_PI / 2;
+ x += (this->gc().w() / 2 + 0.01) * cos(dts);
+ y += (this->gc().w() / 2 + 0.01) * sin(dts);
+ }
+ }
+ while (h > M_PI)
+ h -= 2 * M_PI;
+ while (h <= -M_PI)
+ h += 2 * M_PI;
+ this->gc().x(x);
+ this->gc().y(y);
+ this->gc().h(h);
+}
+
bool PSPlanner::left()
{
double lfx = this->cc().lfx();
bool PSPlanner::parked()
{
- return false;
+ std::vector<std::tuple<double, double>> slot;
+ slot.push_back(std::make_tuple(this->ps().x1(), this->ps().y1()));
+ slot.push_back(std::make_tuple(this->ps().x2(), this->ps().y2()));
+ slot.push_back(std::make_tuple(this->ps().x3(), this->ps().y3()));
+ slot.push_back(std::make_tuple(this->ps().x4(), this->ps().y4()));
+ return inside(this->gc().lfx(), this->gc().lfy(), slot)
+ && inside(this->gc().lrx(), this->gc().lry(), slot)
+ && inside(this->gc().rrx(), this->gc().rry(), slot)
+ && inside(this->gc().rfx(), this->gc().rfy(), slot);
+}
+
+std::vector<BicycleCar> PSPlanner::possible_inits(
+ unsigned int cnt,
+ double dist
+)
+{
+ std::vector<BicycleCar> pi;
+ this->cc().sp(this->cc().sp() * dist);
+ this->cc().st(this->cc().st() * 1);
+ BicycleCar orig_cc(this->cc());
+ for (unsigned int i = 0; i < cnt; i++) {
+ this->cc().next();
+ pi.push_back(BicycleCar(this->cc()));
+ }
+ this->cc() = BicycleCar(orig_cc);
+ return pi;
}
// find entry
void PSPlanner::fe_parallel()
{
+ // angle for distance from "entry" corner
+ double dist_angl = this->ps().heading() + M_PI;
+ dist_angl += (this->ps().right()) ? - M_PI / 4 : + M_PI / 4;
+ // set bicycle car `bci` basic dimensions and heading
+ BicycleCar bci = BicycleCar(this->gc());
+ BicycleCar bco = BicycleCar(this->gc());
+ bci.h(this->ps().heading());
+ // move 0.01 from the "entry" corner
+ bci.x(this->ps().x4() + 0.01 * cos(dist_angl));
+ bci.y(this->ps().y4() + 0.01 * sin(dist_angl));
+ // align with parking "top" of slot (move backward)
+ dist_angl = bci.h() + M_PI;
+ bci.x(bci.x() + bci.df() * cos(dist_angl));
+ bci.y(bci.y() + bci.df() * sin(dist_angl));
+ // align with "entry" to pakring slot (move outside)
+ dist_angl = this->ps().heading();
+ dist_angl += (this->ps().right()) ? + M_PI / 2 : - M_PI / 2;
+ bci.x(bci.x() + bci.w() / 2 * cos(dist_angl));
+ bci.y(bci.y() + bci.w() / 2 * sin(dist_angl));
+ // set default speed, steer
+ bci.st(bci.wb() / bci.mtr());
+ if (!this->ps().right())
+ bci.st(bci.st() * -1);
+ bci.sp(-0.01);
+ // BFS - init all starts
+ // see https://courses.cs.washington.edu/courses/cse326/03su/homework/hw3/bfs.html
+ double dist_diag = sqrt(pow(bci.w() / 2, 2) + pow(bci.df(), 2));
+ if (this->ps().right())
+ dist_angl = atan2(bci.y() - bci.rfy(), bci.x() - bci.rfx());
+ else
+ dist_angl = atan2(bci.y() - bci.lfy(), bci.x() - bci.lfx());
+ double DIST_ANGL = dist_angl;
+ std::queue<BicycleCar, std::list<BicycleCar>> q;
+ while (
+ (
+ this->ps().right()
+ && dist_angl < DIST_ANGL + 3 * M_PI / 4
+ )
+ || (
+ !this->ps().right()
+ && dist_angl > DIST_ANGL - 3 * M_PI / 4
+ )
+ ) {
+ this->cc() = BicycleCar(bci);
+ if (this->ps().right()) {
+ this->cc().x(bci.rfx() + dist_diag * cos(dist_angl));
+ this->cc().y(bci.rfy() + dist_diag * sin(dist_angl));
+ } else {
+ this->cc().x(bci.lfx() + dist_diag * cos(dist_angl));
+ this->cc().y(bci.lfy() + dist_diag * sin(dist_angl));
+ }
+ this->cc().h(this->ps().heading() + dist_angl - DIST_ANGL);
+ if (!this->collide()) {
+ q.push(BicycleCar(this->cc()));
+ }
+ dist_angl += (this->ps().right()) ? + 0.01 : - 0.01;
+ }
+ // BFS - find entry current car `cc` and corresponding goal car `gc`
+ unsigned int iter_cntr = 0;
+ while (!q.empty() && iter_cntr < 9) {
+ this->cc() = BicycleCar(q.front());
+ q.pop();
+ while (
+ !this->collide()
+ && (std::abs(
+ this->cc().h() - this->ps().heading()
+ ) > M_PI / 32)
+ && (std::abs(
+ this->cc().h() - this->ps().heading()
+ ) < M_PI / 2)
+ )
+ this->cc().next();
+ this->cc().sp(this->cc().sp() * -1);
+ this->cc().next();
+ this->gc() = BicycleCar(this->cc());
+ if (this->parked())
+ goto successfinish;
+ this->cc().st(this->cc().st() * -1);
+ q.push(BicycleCar(this->cc()));
+ if (sgn(this->cc().st()) == sgn(q.front().st()))
+ iter_cntr++;
+ }
+ // fallback to fer
+ this->gc() = BicycleCar(bco);
+successfinish:
+ return this->fer_parallel();
}
void PSPlanner::fe_perpendicular()
//
// Another approach could be testing angles from the
// beginning of the escape parkig slot maneuver.
- return fer_perpendicular();
+ if (this->forward())
+ this->cc().sp(-0.01);
+ else
+ this->cc().sp(0.01);
+ while (!this->left())
+ this->cc().next();
+ return;
}
void PSPlanner::fer()
this->cc().st(this->cc().wb() / this->cc().mtr());
if (!this->ps().right())
this->cc().st(this->cc().st() * -1);
- this->cc().sp(0.1);
+ this->cc().sp(0.01);
while (!this->left()) {
while (!this->collide() && !this->left())
this->cc().next();
void PSPlanner::fer_perpendicular()
{
+ bool delta_use[] = {true, true, true};
double cc_h = this->cc().h();
double x;
double y;
else
b = (x1 - x) * 2 * cos(cc_h) + (y1 - y) * 2 * sin(cc_h);
double c = pow(x - x1, 2) + pow(y - y1, 2) - pow(IR, 2);
- double D = D = pow(b, 2) - 4 * a * c;
+ double D = pow(b, 2) - 4 * a * c;
double delta;
delta = -b - sqrt(D);
delta /= 2 * a;
double delta_1 = delta;
+ if (D < 0)
+ delta_use[0] = false;
// check outer radius
if (this->forward()) {
x = this->ps().x4();
delta /= 2 * a;
}
double delta_2 = delta;
+ if (D < 0)
+ delta_use[1] = false;
delta = -b - sqrt(D);
delta /= 2 * a;
double delta_3 = delta;
- delta = std::max(delta_1, std::max(delta_2, delta_3));
+ if (D < 0)
+ delta_use[2] = false;
+ if (delta_use[0] && delta_use[1] && delta_use[22])
+ delta = std::max(delta_1, std::max(delta_2, delta_3));
+ else if (delta_use[0] && delta_use[1])
+ delta = std::max(delta_1, delta_2);
+ else if (delta_use[0] && delta_use[2])
+ delta = std::max(delta_1, delta_3);
+ else if (delta_use[1] && delta_use[2])
+ delta = std::max(delta_2, delta_3);
+ else if (delta_use[0])
+ delta = delta_1;
+ else if (delta_use[1])
+ delta = delta_2;
+ else if (delta_use[2])
+ delta = delta_3;
+ else
+ return;
// current car `cc` can get out of slot with max steer
this->cc().x(this->cc().x() + delta * cos(cc_h));
this->cc().y(this->cc().y() + delta * sin(cc_h));
this->cc().h(cc_h);
// get current car `cc` out of slot
if (this->forward())
- this->cc().sp(-0.1);
+ this->cc().sp(-0.01);
else
- this->cc().sp(0.1);
+ this->cc().sp(0.01);
this->cc().st(this->cc().wb() / this->cc().mtr());
if (this->ps().right())
this->cc().st(this->cc().st() * -1);
}
}
-bool PSPlanner::forward()
-{
- double heading = this->ps().heading();
- while (heading < 0) heading += 2 * M_PI;
- if (!this->ps().parallel())
- heading -= M_PI / 2;
- double h = this->gc().h();
- while (h < 0) h += 2 * M_PI;
- if (-0.00001 < heading - h && heading - h < 0.00001)
- return true;
- else
- return false;
-}
-
PSPlanner::PSPlanner()
{
}
-
-std::tuple<bool, double, double> intersect(
- double x1, double y1,
- double x2, double y2,
- double x3, double y3,
- double x4, double y4
-)
-{
- double deno = (x1 - x2) * (y3 - y4) - (y1 - y2) * (x3 - x4);
- if (deno == 0)
- return std::make_tuple(false, 0, 0);
- double t = (x1 - x3) * (y3 - y4) - (y1 - y3) * (x3 - x4);
- t /= deno;
- double u = (x1 - x2) * (y1 - y3) - (y1 - y2) * (x1 - x3);
- u *= -1;
- u /= deno;
- if (t < 0 || t > 1 || u < 0 || u > 1)
- return std::make_tuple(false, 0, 0);
- return std::make_tuple(true, x1 + t * (x2 - x1), y1 + t * (y2 - y1));
-}
projects / hubacji1 / psp.git / blobdiff