blob: 1572526359c0ebcd0ff29677781bd15c8f95e996 [file] [log] [blame]
Austin Schuh941b46d2018-12-19 18:06:05 +11001#include "frc971/control_loops/drivetrain/distance_spline.h"
2
Austin Schuha6e7b212019-01-20 13:53:01 -08003#include "aos/logging/logging.h"
Austin Schuh941b46d2018-12-19 18:06:05 +11004#include "frc971/control_loops/drivetrain/spline.h"
5
6namespace frc971 {
7namespace control_loops {
8namespace drivetrain {
9
Austin Schuh280996e2019-01-19 17:43:37 -080010::std::vector<double> DistanceSpline::BuildDistances(size_t num_alpha) {
11 num_alpha = num_alpha == 0 ? 100 * splines_.size() : num_alpha;
12 ::std::vector<double> distances;
13 distances.push_back(0.0);
Austin Schuh941b46d2018-12-19 18:06:05 +110014
Austin Schuha6e7b212019-01-20 13:53:01 -080015 if (splines_.size() > 1) {
16 // We've got a multispline to follow!
17 // Confirm that the ends line up to the correct number of derivitives.
18 for (size_t i = 1; i < splines_.size(); ++i) {
19 const Spline &spline0 = splines_[i - 1];
20 const Spline &spline1 = splines_[i];
21
22 const ::Eigen::Matrix<double, 2, 1> end0 = spline0.Point(1.0);
23 const ::Eigen::Matrix<double, 2, 1> start1 = spline1.Point(0.0);
24
25 if (!end0.isApprox(start1, 1e-6)) {
26 LOG(ERROR, "Splines %d and %d don't line up. [%f, %f] != [%f, %f]\n",
27 static_cast<int>(i - 1), static_cast<int>(i), end0(0, 0),
28 end0(1, 0), start1(0, 0), start1(1, 0));
29 }
30
31 const ::Eigen::Matrix<double, 2, 1> dend0 = spline0.DPoint(1.0);
32 const ::Eigen::Matrix<double, 2, 1> dstart1 = spline1.DPoint(0.0);
33
34 if (!dend0.isApprox(dstart1, 1e-6)) {
35 LOG(ERROR,
36 "Splines %d and %d don't line up in the first derivitive. [%f, "
37 "%f] != [%f, %f]\n",
38 static_cast<int>(i - 1), static_cast<int>(i), dend0(0, 0),
39 dend0(1, 0), dstart1(0, 0), dstart1(1, 0));
40 }
41
42 const ::Eigen::Matrix<double, 2, 1> ddend0 = spline0.DDPoint(1.0);
43 const ::Eigen::Matrix<double, 2, 1> ddstart1 = spline1.DDPoint(0.0);
44
45 if (!ddend0.isApprox(ddstart1, 1e-6)) {
46 LOG(ERROR,
47 "Splines %d and %d don't line up in the second derivitive. [%f, "
48 "%f] != [%f, %f]\n",
49 static_cast<int>(i - 1), static_cast<int>(i), ddend0(0, 0),
50 ddend0(1, 0), ddstart1(0, 0), ddstart1(1, 0));
51 }
52 }
53 }
54
Austin Schuh280996e2019-01-19 17:43:37 -080055 const double dalpha =
56 static_cast<double>(splines_.size()) / static_cast<double>(num_alpha - 1);
Austin Schuh941b46d2018-12-19 18:06:05 +110057 double last_alpha = 0.0;
Austin Schuh280996e2019-01-19 17:43:37 -080058 for (size_t i = 1; i < num_alpha; ++i) {
Austin Schuh941b46d2018-12-19 18:06:05 +110059 const double alpha = dalpha * i;
Austin Schuh280996e2019-01-19 17:43:37 -080060 distances.push_back(distances.back() +
61 GaussianQuadrature5(
62 [this](double alpha) {
63 const size_t spline_index = ::std::min(
64 static_cast<size_t>(::std::floor(alpha)),
65 splines_.size() - 1);
66 return this->splines_[spline_index]
67 .DPoint(alpha - spline_index)
68 .norm();
69 },
70 last_alpha, alpha));
Austin Schuh941b46d2018-12-19 18:06:05 +110071 last_alpha = alpha;
72 }
Austin Schuh280996e2019-01-19 17:43:37 -080073 return distances;
Austin Schuh941b46d2018-12-19 18:06:05 +110074}
75
Austin Schuh280996e2019-01-19 17:43:37 -080076DistanceSpline::DistanceSpline(::std::vector<Spline> &&splines, int num_alpha)
77 : splines_(::std::move(splines)), distances_(BuildDistances(num_alpha)) {}
78
79DistanceSpline::DistanceSpline(const Spline &spline, int num_alpha)
80 : splines_({spline}), distances_(BuildDistances(num_alpha)) {}
81
Austin Schuh941b46d2018-12-19 18:06:05 +110082::Eigen::Matrix<double, 2, 1> DistanceSpline::DDXY(double distance) const {
Austin Schuh280996e2019-01-19 17:43:37 -080083 const AlphaAndIndex a = DistanceToAlpha(distance);
84 const ::Eigen::Matrix<double, 2, 1> dspline_point =
85 splines_[a.index].DPoint(a.alpha);
86 const ::Eigen::Matrix<double, 2, 1> ddspline_point =
87 splines_[a.index].DDPoint(a.alpha);
Austin Schuh941b46d2018-12-19 18:06:05 +110088
89 const double squared_norm = dspline_point.squaredNorm();
90
91 return ddspline_point / squared_norm -
92 dspline_point * (dspline_point(0) * ddspline_point(0) +
93 dspline_point(1) * ddspline_point(1)) /
94 ::std::pow(squared_norm, 2);
95}
96
97double DistanceSpline::DDTheta(double distance) const {
Austin Schuh280996e2019-01-19 17:43:37 -080098 const AlphaAndIndex a = DistanceToAlpha(distance);
Austin Schuh941b46d2018-12-19 18:06:05 +110099
100 // TODO(austin): We are re-computing DPoint here even worse
Austin Schuh280996e2019-01-19 17:43:37 -0800101 const ::Eigen::Matrix<double, 2, 1> dspline_point =
102 splines_[a.index].DPoint(a.alpha);
103 const ::Eigen::Matrix<double, 2, 1> ddspline_point =
104 splines_[a.index].DDPoint(a.alpha);
Austin Schuh941b46d2018-12-19 18:06:05 +1100105
Austin Schuh280996e2019-01-19 17:43:37 -0800106 const double dtheta = splines_[a.index].DTheta(a.alpha);
107 const double ddtheta = splines_[a.index].DDTheta(a.alpha);
Austin Schuh941b46d2018-12-19 18:06:05 +1100108
109 const double squared_norm = dspline_point.squaredNorm();
110
111 return ddtheta / squared_norm -
112 dtheta * (dspline_point(0) * ddspline_point(0) +
113 dspline_point(1) * ddspline_point(1)) /
114 ::std::pow(squared_norm, 2);
115}
116
Austin Schuh280996e2019-01-19 17:43:37 -0800117DistanceSpline::AlphaAndIndex DistanceSpline::DistanceToAlpha(
118 double distance) const {
Austin Schuh941b46d2018-12-19 18:06:05 +1100119 if (distance <= 0.0) {
Austin Schuh280996e2019-01-19 17:43:37 -0800120 return {0, 0.0};
Austin Schuh941b46d2018-12-19 18:06:05 +1100121 }
122 if (distance >= length()) {
Austin Schuh280996e2019-01-19 17:43:37 -0800123 return {splines_.size() - 1, 1.0};
Austin Schuh941b46d2018-12-19 18:06:05 +1100124 }
125
126 // Find the distance right below our number using a binary search.
127 size_t after = ::std::distance(
128 distances_.begin(),
129 ::std::lower_bound(distances_.begin(), distances_.end(), distance));
130 size_t before = after - 1;
131 const double distance_step_size =
Austin Schuh280996e2019-01-19 17:43:37 -0800132 (splines_.size() / static_cast<double>(distances_.size() - 1));
Austin Schuh941b46d2018-12-19 18:06:05 +1100133
Austin Schuh280996e2019-01-19 17:43:37 -0800134 const double alpha = (distance - distances_[before]) /
135 (distances_[after] - distances_[before]) *
136 distance_step_size +
137 static_cast<double>(before) * distance_step_size;
138 const size_t index = static_cast<size_t>(::std::floor(alpha));
139
140 return {index, alpha - index};
Austin Schuh941b46d2018-12-19 18:06:05 +1100141}
142
143} // namespace drivetrain
144} // namespace control_loops
145} // namespace frc971