blob: de6b757a5806cb4e43e3b5ddc45aad2d48499497 [file] [log] [blame]
James Kuszmaulfb0e0ae2014-03-25 07:04:47 -07001#include "frc971/control_loops/coerce_goal.h"
2
3#include "Eigen/Dense"
4
5#include "aos/controls/polytope.h"
6
7namespace frc971 {
8namespace control_loops {
9
Brian Silverman6dd2c532014-03-29 23:34:39 -070010Eigen::Matrix<double, 2, 1> DoCoerceGoal(const aos::controls::HPolytope<2> &region,
11 const Eigen::Matrix<double, 1, 2> &K,
12 double w,
13 const Eigen::Matrix<double, 2, 1> &R,
14 bool *is_inside) {
James Kuszmaulfb0e0ae2014-03-25 07:04:47 -070015 if (region.IsInside(R)) {
Brian Silverman6dd2c532014-03-29 23:34:39 -070016 if (is_inside) *is_inside = true;
James Kuszmaulfb0e0ae2014-03-25 07:04:47 -070017 return R;
18 }
19 Eigen::Matrix<double, 2, 1> parallel_vector;
20 Eigen::Matrix<double, 2, 1> perpendicular_vector;
21 perpendicular_vector = K.transpose().normalized();
22 parallel_vector << perpendicular_vector(1, 0), -perpendicular_vector(0, 0);
23
24 aos::controls::HPolytope<1> t_poly(
25 region.H() * parallel_vector,
26 region.k() - region.H() * perpendicular_vector * w);
27
28 Eigen::Matrix<double, 1, Eigen::Dynamic> vertices = t_poly.Vertices();
29 if (vertices.innerSize() > 0) {
30 double min_distance_sqr = 0;
31 Eigen::Matrix<double, 2, 1> closest_point;
32 for (int i = 0; i < vertices.innerSize(); i++) {
33 Eigen::Matrix<double, 2, 1> point;
34 point = parallel_vector * vertices(0, i) + perpendicular_vector * w;
35 const double length = (R - point).squaredNorm();
36 if (i == 0 || length < min_distance_sqr) {
37 closest_point = point;
38 min_distance_sqr = length;
39 }
40 }
Brian Silverman6dd2c532014-03-29 23:34:39 -070041 if (is_inside) *is_inside = true;
James Kuszmaulfb0e0ae2014-03-25 07:04:47 -070042 return closest_point;
43 } else {
44 Eigen::Matrix<double, 2, Eigen::Dynamic> region_vertices =
45 region.Vertices();
46 double min_distance = INFINITY;
47 int closest_i = 0;
48 for (int i = 0; i < region_vertices.outerSize(); i++) {
49 const double length = ::std::abs(
50 (perpendicular_vector.transpose() * (region_vertices.col(i)))(0, 0));
51 if (i == 0 || length < min_distance) {
52 closest_i = i;
53 min_distance = length;
54 }
55 }
Brian Silverman6dd2c532014-03-29 23:34:39 -070056 if (is_inside) *is_inside = false;
James Kuszmaulf63b0ae2014-03-25 16:52:11 -070057 return (Eigen::Matrix<double, 2, 1>() << region_vertices(0, closest_i),
58 region_vertices(1, closest_i)).finished();
James Kuszmaulfb0e0ae2014-03-25 07:04:47 -070059 }
60}
61
62} // namespace control_loops
63} // namespace frc971