+#include <cmath>
#include "bcar.hh"
-#include "pslot.hh"
-// kinematic constraints
-bool BicycleCar::drivable(const BicycleCar &bc) const
+using namespace bcar;
+
+Point::Point(double x, double y) : x_(x), y_(y)
+{
+}
+
+Point::Point() : Point::Point(0.0, 0.0)
+{
+}
+
+double
+Point::x() const
+{
+ return this->x_;
+}
+
+void
+Point::x(double x)
+{
+ this->x_ = x;
+}
+
+double
+Point::y() const
+{
+ return this->y_;
+}
+
+void
+Point::y(double y)
+{
+ this->y_ = y;
+}
+
+double
+Point::min_angle_between(Point const& p1, Point const& p2) const
+{
+ double d1x = p1.x() - this->x();
+ double d1y = p1.y() - this->y();
+ double d2x = p2.x() - p1.x();
+ double d2y = p2.y() - p1.y();
+
+ double dot = d1x*d2x + d1y*d2y;
+ double d1 = sqrt(d1x*d1x + d1y*d1y);
+ double d2 = sqrt(d2x*d2x + d2y*d2y);
+
+ double delta = acos(dot / (d1 * d2));
+ return std::min(delta, M_PI - delta);
+}
+
+bool
+Point::inside_of(std::vector<Point> const& poly) const
+{
+ unsigned int num = poly.size();
+ unsigned int j = num - 1;
+ bool c = false;
+ for (unsigned int i = 0; i < num; i++) {
+ if (this->x() == poly[i].x() && this->y() == poly[i].y()) {
+ return true;
+ }
+ if ((poly[i].y() > this->y()) != (poly[j].y() > this->y())) {
+ auto slope1 = this->x() - poly[i].x();
+ slope1 *= poly[j].y() - poly[i].y();
+ auto slope2 = poly[j].x() - poly[i].x();
+ slope2 *= this->y() - poly[i].y();
+ auto slope = slope1 - slope2;
+ if (slope == 0.0) {
+ return true;
+ }
+ if ((slope < 0.0) != (poly[j].y() < poly[i].y())) {
+ c = !c;
+ }
+ }
+ j = i;
+ }
+ return c;
+}
+
+Line::Line(Point const& fp, Point const& lp): first(fp), last(lp),
+ intersection1(Point(0.0, 0.0)), intersection2(Point(0.0, 0.0))
+{
+}
+
+Point
+Line::fp() const&
+{
+ return this->first;
+}
+
+Point
+Line::lp() const&
+{
+ return this->last;
+}
+
+Point
+Line::in1() const&
+{
+ return this->intersection1;
+}
+
+Point
+Line::in2() const&
+{
+ return this->intersection2;
+}
+
+bool
+Line::intersects_with(Line const& li)
+{
+ auto x1 = this->fp().x();
+ auto y1 = this->fp().y();
+ auto x2 = this->lp().x();
+ auto y2 = this->lp().y();
+ auto x3 = li.fp().x();
+ auto y3 = li.fp().y();
+ auto x4 = li.lp().x();
+ auto y4 = li.lp().y();
+ double deno = (x1 - x2) * (y3 - y4) - (y1 - y2) * (x3 - x4);
+ if (deno == 0.0) {
+ return false;
+ }
+ double t = (x1 - x3) * (y3 - y4) - (y1 - y3) * (x3 - x4);
+ t /= deno;
+ double u = (x1 - x2) * (y1 - y3) - (y1 - y2) * (x1 - x3);
+ u *= -1.0;
+ u /= deno;
+ if (t < 0.0 || t > 1.0 || u < 0.0 || u > 1.0) {
+ false;
+ }
+ this->intersection1.x(x1 + t * (x2 - x1));
+ this->intersection1.y(y1 + t * (y2 - y1));
+ return true;
+}
+
+bool
+Line::intersects_with(Point const& c, double const r)
+{
+ auto x1 = this->fp().x();
+ auto y1 = this->fp().y();
+ auto x2 = this->lp().x();
+ auto y2 = this->lp().y();
+ auto cx = c.x();
+ auto cy = c.y();
+ x2 -= cx;
+ x1 -= cx;
+ y2 -= cy;
+ y1 -= cy;
+ if (y1 == y2) {
+ y1 += 0.00001;
+ }
+ double dx = x2 - x1;
+ double dy = y2 - y1;
+ double dr = sqrt(dx*dx + dy*dy);
+ double D = x1*y2 - x2*y1;
+ if (r*r * dr*dr - D*D < 0.0) {
+ return false;
+ }
+ // intersection coordinates
+ double ix1 = (D*dy + sgn(dy)*dx*sqrt(r*r * dr*dr - D*D)) / (dr*dr);
+ ix1 += cx;
+ double ix2 = (D*dy - sgn(dy)*dx*sqrt(r*r * dr*dr - D*D)) / (dr*dr);
+ ix2 += cx;
+ double iy1 = (-D*dx + std::abs(dy)*sqrt(r*r * dr*dr - D*D)) / (dr*dr);
+ iy1 += cy;
+ double iy2 = (-D*dx - std::abs(dy)*sqrt(r*r * dr*dr - D*D)) / (dr*dr);
+ iy2 += cy;
+ this->intersection1.x(ix1);
+ this->intersection1.y(iy1);
+ this->intersection2.x(ix2);
+ this->intersection2.y(iy2);
+ return true;
+}
+
+bool
+Line::is_on_right_side(Point const& p) const
+{
+ auto x1 = this->fp().x();
+ auto y1 = this->fp().y();
+ auto x2 = this->lp().x();
+ auto y2 = this->lp().y();
+ auto x3 = p.x();
+ auto y3 = p.y();
+ if (sgn((x3 - x1) * (y2 - y1) - (y3 - y1) * (x2 - x1)) < 0.0) {
+ return false;
+ } else {
+ return true;
+ }
+}
+
+double
+Pose::x() const
+{
+ return this->x_;
+}
+
+void
+Pose::x(double x)
+{
+ this->x_ = x;
+}
+
+double
+Pose::y() const
+{
+ return this->y_;
+}
+
+void
+Pose::y(double y)
+{
+ this->y_ = y;
+}
+
+double
+Pose::h() const
+{
+ return this->h_;
+}
+
+void
+Pose::h(double h)
+{
+ while (h < -M_PI) {
+ h += 2 * M_PI;
+ }
+ while (h > +M_PI) {
+ h -= 2 * M_PI;
+ }
+ this->h_ = h;
+}
+
+void
+Pose::rotate(Point const& c, double const angl)
+{
+ double px = this->x();
+ double py = this->y();
+ px -= c.x();
+ py -= c.y();
+ double nx = px * cos(angl) - py * sin(angl);
+ double ny = px * sin(angl) + py * cos(angl);
+ this->h(this->h() + angl);
+ this->x(nx + c.x());
+ this->y(ny + c.y());
+}
+
+std::ostream&
+operator<<(std::ostream& out, Pose const& p)
+{
+ out << "[" << p.x() << "," << p.y() << "," << p.h() << "]";
+ return out;
+}
+
+double
+CarSize::ctc() const
+{
+ return this->curb_to_curb;
+}
+
+void
+CarSize::ctc(double ctc)
+{
+ this->curb_to_curb = ctc;
+}
+
+double
+CarSize::wb() const
+{
+ return this->wheelbase;
+}
+
+void
+CarSize::wb(double wb)
+{
+ this->wheelbase = wb;
+}
+
+double
+CarSize::w() const
+{
+ return this->width;
+}
+
+void
+CarSize::w(double w)
+{
+ this->width = w;
+}
+
+double
+CarSize::len() const
+{
+ return this->length;
+}
+
+void
+CarSize::len(double len)
+{
+ this->length = len;
+}
+
+double
+CarSize::df() const
+{
+ return this->distance_to_front;
+}
+
+void
+CarSize::df(double df)
+{
+ this->distance_to_front = df;
+}
+
+double
+CarSize::dr() const
+{
+ return this->len() - this->df();
+}
+
+double
+CarSize::mtr() const
+{
+ auto ctc2 = pow(this->ctc() / 2.0, 2.0);
+ auto wb2 = pow(this->wb(), 2.0);
+ return sqrt(ctc2 - wb2) - this->w() / 2.0;
+}
+
+double
+CarMove::sp() const
+{
+ return this->speed;
+}
+
+void
+CarMove::sp(double sp)
+{
+ this->speed = sp;
+}
+
+double
+CarMove::st() const
+{
+ return this->steer;
+}
+
+void
+CarMove::st(double st)
+{
+ this->steer = st;
+}
+
+bool
+BicycleCar::drivable(BicycleCar const& bc) const
{
return this->drivable(bc, bc.h(), bc.h());
}
-bool BicycleCar::drivable(const BicycleCar &bc, double b, double e) const
+
+bool
+BicycleCar::drivable(BicycleCar const& bc, double b, double e) const
{
// assert bc.h() == (b + e) / 2.0
double a_1 = atan2(bc.y() - this->y(), bc.x() - this->x()) - this->h();
BicycleCar z(*this); // zone border
z.h(e);
h_d = bc.h() - this->h();
- z.rotate(this->ccl().x(), this->ccl().y(), h_d);
+ z.rotate(this->ccl(), h_d);
// assert z.h() == bc.h()
if (bc.y() == z.y() && bc.x() == z.x()) // bc on zone border
return true;
BicycleCar z(*this); // zone border
z.h(e);
h_d = bc.h() - this->h();
- z.rotate(this->ccl().x(), this->ccl().y(), h_d);
+ z.rotate(this->ccl(), h_d);
// assert z.h() == bc.h()
if (bc.y() == z.y() && bc.x() == z.x()) // bc on zone border
return true;
BicycleCar z(*this); // zone border
z.h(b);
h_d = bc.h() - this->h();
- z.rotate(this->ccr().x(), this->ccr().y(), h_d);
+ z.rotate(this->ccr(), h_d);
// assert z.h() == bc.h()
if (bc.y() == z.y() && bc.x() == z.x()) // bc on zone border
return true;
BicycleCar z(*this); // zone border
z.h(b);
h_d = bc.h() - this->h();
- z.rotate(this->ccr().x(), this->ccr().y(), h_d);
+ z.rotate(this->ccr(), h_d);
// assert z.h() == bc.h()
if (bc.y() == z.y() && bc.x() == z.x()) // bc on zone border
return true;
return false;
}
-double BicycleCar::iradi() const
+double
+BicycleCar::iradi() const
{
return this->mtr() - this->w() / 2;
}
-double BicycleCar::ofradi() const
+double
+BicycleCar::ofradi() const
{
- return sqrt(pow(this->mtr() + this->w() / 2, 2) + pow(this->df(), 2));
+ auto mtrw2 = pow(this->mtr() + this->w() / 2.0, 2.0);
+ auto df2 = pow(this->df(), 2.0);
+ return sqrt(mtrw2 + df2);
}
-double BicycleCar::orradi() const
+double
+BicycleCar::orradi() const
{
- return sqrt(pow(this->mtr() + this->w() / 2, 2) + pow(this->dr(), 2));
+ auto mtrw2 = pow(this->mtr() + this->w() / 2.0, 2.0);
+ auto dr2 = pow(this->dr(), 2.0);
+ return sqrt(mtrw2 + dr2);
}
-double BicycleCar::perfect_parking_slot_len() const
+double
+BicycleCar::perfect_parking_slot_len() const
{
- // see Simon R. Blackburn *The Geometry of Perfect Parking*
- // see https://www.ma.rhul.ac.uk/SRBparking
- double r = this->ctc() / 2;
- double l = this->wb();
- double k = this->df() - this->wb();
- double w = this->w();
- return
- this->l()
- + sqrt(
- (r*r - l*l)
- + pow(l + k, 2)
- - pow(sqrt(r*r - l*l) - w, 2)
- )
- - l
- - k
- ;
+ auto r = this->ctc() / 2.0;
+ auto l = this->wb();
+ auto k = this->df() - this->wb();
+ auto w = this->w();
+ auto r2l2 = r * r - l * l;
+ auto s = r2l2 + pow(l + k, 2.0) - pow(sqrt(r2l2) - w, 2.0);
+ return this->len() + sqrt(s) - l - k;
}
-void BicycleCar::set_max_steer()
+void
+BicycleCar::set_max_steer()
{
this->st(atan(this->wb() / this->mtr()));
}
-// car frame
-double BicycleCar::lfx() const
+double
+BicycleCar::lfx() const
{
double lfx = this->x();
- lfx += (this->w() / 2) * cos(this->h() + M_PI / 2);
+ lfx += (this->w() / 2.0) * cos(this->h() + M_PI / 2.0);
lfx += this->df() * cos(this->h());
- lfx += this->sd() * cos(this->h());
return lfx;
}
-double BicycleCar::lfy() const
+double
+BicycleCar::lfy() const
{
double lfy = this->y();
- lfy += (this->w() / 2) * sin(this->h() + M_PI / 2);
+ lfy += (this->w() / 2.0) * sin(this->h() + M_PI / 2.0);
lfy += this->df() * sin(this->h());
- lfy += this->sd() * sin(this->h());
return lfy;
}
-double BicycleCar::lrx() const
+double
+BicycleCar::lrx() const
{
double lrx = this->x();
- lrx += (this->w() / 2) * cos(this->h() + M_PI / 2);
+ lrx += (this->w() / 2.0) * cos(this->h() + M_PI / 2.0);
lrx += -this->dr() * cos(this->h());
- lrx += -this->sd() * cos(this->h());
return lrx;
}
-double BicycleCar::lry() const
+double
+BicycleCar::lry() const
{
double lry = this->y();
- lry += (this->w() / 2) * sin(this->h() + M_PI / 2);
+ lry += (this->w() / 2.0) * sin(this->h() + M_PI / 2.0);
lry += -this->dr() * sin(this->h());
- lry += -this->sd() * sin(this->h());
return lry;
}
-double BicycleCar::rrx() const
+double
+BicycleCar::rrx() const
{
double rrx = this->x();
- rrx += (this->w() / 2) * cos(this->h() - M_PI / 2);
+ rrx += (this->w() / 2.0) * cos(this->h() - M_PI / 2.0);
rrx += -this->dr() * cos(this->h());
- rrx += -this->sd() * cos(this->h());
return rrx;
}
-double BicycleCar::rry() const
+double
+BicycleCar::rry() const
{
double rry = this->y();
- rry += (this->w() / 2) * sin(this->h() - M_PI / 2);
+ rry += (this->w() / 2.0) * sin(this->h() - M_PI / 2.0);
rry += -this->dr() * sin(this->h());
- rry += -this->sd() * sin(this->h());
return rry;
}
-double BicycleCar::rfx() const
+double
+BicycleCar::rfx() const
{
double rfx = this->x();
- rfx += (this->w() / 2) * cos(this->h() - M_PI / 2);
+ rfx += (this->w() / 2.0) * cos(this->h() - M_PI / 2.0);
rfx += this->df() * cos(this->h());
- rfx += this->sd() * cos(this->h());
return rfx;
}
-double BicycleCar::rfy() const
+double
+BicycleCar::rfy() const
{
double rfy = this->y();
- rfy += (this->w() / 2) * sin(this->h() - M_PI / 2);
+ rfy += (this->w() / 2.0) * sin(this->h() - M_PI / 2.0);
rfy += this->df() * sin(this->h());
- rfy += this->sd() * sin(this->h());
return rfy;
}
-double BicycleCar::ralx() const
+double
+BicycleCar::ralx() const
{
double lrx = this->x();
- lrx += (this->w() / 2) * cos(this->h() + M_PI / 2);
+ lrx += (this->w() / 2.0) * cos(this->h() + M_PI / 2.0);
return lrx;
}
-double BicycleCar::raly() const
+double
+BicycleCar::raly() const
{
double lry = this->y();
- lry += (this->w() / 2) * sin(this->h() + M_PI / 2);
+ lry += (this->w() / 2.0) * sin(this->h() + M_PI / 2.0);
return lry;
}
-double BicycleCar::rarx() const
+double
+BicycleCar::rarx() const
{
double rrx = this->x();
- rrx += (this->w() / 2) * cos(this->h() - M_PI / 2);
+ rrx += (this->w() / 2.0) * cos(this->h() - M_PI / 2.0);
return rrx;
}
-double BicycleCar::rary() const
+double
+BicycleCar::rary() const
{
double rry = this->y();
- rry += (this->w() / 2) * sin(this->h() - M_PI / 2);
+ rry += (this->w() / 2.0) * sin(this->h() - M_PI / 2.0);
return rry;
}
-BicycleCar BicycleCar::ccl() const
+Point
+BicycleCar::ccl() const
{
- BicycleCar bc;
- bc.x(this->x() + this->mtr() * cos(this->h() + M_PI / 2));
- bc.y(this->y() + this->mtr() * sin(this->h() + M_PI / 2));
- bc.h(this->h());
- return bc;
+ return Point(
+ this->x() + this->mtr() * cos(this->h() + M_PI / 2.0),
+ this->y() + this->mtr() * sin(this->h() + M_PI / 2.0)
+ );
}
-BicycleCar BicycleCar::ccr() const
+Point
+BicycleCar::ccr() const
{
- BicycleCar bc;
- bc.x(this->x() + this->mtr() * cos(this->h() - M_PI / 2));
- bc.y(this->y() + this->mtr() * sin(this->h() - M_PI / 2));
- bc.h(this->h());
- return bc;
+ return Point(
+ this->x() + this->mtr() * cos(this->h() - M_PI / 2.0),
+ this->y() + this->mtr() * sin(this->h() - M_PI / 2.0)
+ );
}
-// moving
-void BicycleCar::next()
+void
+BicycleCar::next()
{
this->x(this->x() + this->sp() * cos(this->h()));
this->y(this->y() + this->sp() * sin(this->h()));
this->h(this->h() + this->sp() / this->wb() * tan(this->st()));
}
-
-void BicycleCar::rotate(double cx, double cy, double angl)
-{
- double px = this->x();
- double py = this->y();
- px -= cx;
- py -= cy;
- double nx = px * cos(angl) - py * sin(angl);
- double ny = px * sin(angl) + py * cos(angl);
- this->h(this->h() + angl);
- this->x(nx + cx);
- this->y(ny + cy);
-}
-
-BicycleCar::BicycleCar()
-{
- // TODO according to mtr_ FIXME
- this->mtr_ = sqrt(
- pow(10.82 / 2, 2)
- - pow(this->wb(), 2)
- )
- - this->w() / 2
- ;
-}
-
-std::tuple<bool, unsigned int, unsigned int>
-collide(
- std::vector<std::tuple<double, double>> &p1,
- std::vector<std::tuple<double, double>> &p2
-)
-{
- for (unsigned int i = 0; i < p1.size() - 1; i++) {
- for (unsigned int j = 0; j < p2.size() - 1; j++) {
- auto x = intersect(
- std::get<0>(p1[i]),
- std::get<1>(p1[i]),
- std::get<0>(p1[i + 1]),
- std::get<1>(p1[i + 1]),
- std::get<0>(p2[j]),
- std::get<1>(p2[j]),
- std::get<0>(p2[j + 1]),
- std::get<1>(p2[j + 1])
- );
- if (std::get<0>(x))
- return std::make_tuple(true, i, j);
- }
- }
- return std::make_tuple(false, 0, 0);
-}
-
-bool
-inside(double x, double y, std::vector<std::tuple<double, double>> &poly)
-{
- unsigned int i = 0;
- unsigned int j = 3;
- bool inside = false;
- for (i = 0; i < 4; i++) {
- if (
- (std::get<1>(poly[i]) > y) != (std::get<1>(poly[j]) > y)
- && (
- x < std::get<0>(poly[i])
- + (std::get<0>(poly[j]) - std::get<0>(poly[i]))
- * (y - std::get<1>(poly[i]))
- / (std::get<1>(poly[j]) - std::get<1>(poly[i]))
- )
- )
- inside = !inside;
- j = i;
- }
- return inside;
-}
-
-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));
-}
-
-std::tuple<bool, double, double, double, double>
-intersect(
- double cx, double cy, double r,
- double x1, double y1,
- double x2, double y2
-) {
- x2 -= cx;
- x1 -= cx;
- y2 -= cy;
- y1 -= cy;
- if (y1 == y2)
- y1 += 0.00001;
- double dx = x2 - x1;
- double dy = y2 - y1;
- double dr = sqrt(dx*dx + dy*dy);
- double D = x1*y2 - x2*y1;
- if (r*r * dr*dr - D*D < 0)
- return std::make_tuple(false, 0, 0, 0, 0);
- // intersection coordinates
- double ix1 = (D*dy + sgn(dy)*dx*sqrt(r*r * dr*dr - D*D)) / (dr*dr);
- ix1 += cx;
- double ix2 = (D*dy - sgn(dy)*dx*sqrt(r*r * dr*dr - D*D)) / (dr*dr);
- ix2 += cx;
- double iy1 = (-D*dx + std::abs(dy)*sqrt(r*r * dr*dr - D*D)) / (dr*dr);
- iy1 += cy;
- double iy2 = (-D*dx - std::abs(dy)*sqrt(r*r * dr*dr - D*D)) / (dr*dr);
- iy2 += cy;
- return std::make_tuple(true, ix1, iy1, ix2, iy2);
-}
-
-double
-angle_between_three_points(
- double x1, double y1,
- double x2, double y2,
- double x3, double y3
-) {
- double d1x = x2 - x1;
- double d1y = y2 - y1;
- double d2x = x3 - x2;
- double d2y = y3 - y2;
-
- double dot = d1x*d2x + d1y*d2y;
- double d1 = sqrt(d1x*d1x + d1y*d1y);
- double d2 = sqrt(d2x*d2x + d2y*d2y);
-
- double delta = acos(dot / (d1 * d2));
- return std::min(delta, M_PI - delta);
-}
-
-bool
-right_side_of_line(
- double x1, double y1,
- double x2, double y2,
- double x3, double y3
-) {
- if (sgn((x3 - x1) * (y2 - y1) - (y3 - y1) * (x2 - x1)) < 0)
- return false;
- else
- return true;
-}