James Kuszmaul | fb0e0ae | 2014-03-25 07:04:47 -0700 | [diff] [blame] | 1 | #include "frc971/control_loops/coerce_goal.h" |
| 2 | |
| 3 | #include "Eigen/Dense" |
| 4 | |
Brian | a6553ed | 2014-04-02 21:26:46 -0700 | [diff] [blame] | 5 | #include "aos/common/controls/polytope.h" |
James Kuszmaul | fb0e0ae | 2014-03-25 07:04:47 -0700 | [diff] [blame] | 6 | |
| 7 | namespace frc971 { |
| 8 | namespace control_loops { |
| 9 | |
Brian Silverman | 4e1b066 | 2016-01-31 18:03:19 -0500 | [diff] [blame^] | 10 | Eigen::Matrix<double, 2, 1> DoCoerceGoal( |
| 11 | const aos::controls::HPolytope<2> ®ion, |
| 12 | const Eigen::Matrix<double, 1, 2> &K, double w, |
| 13 | const Eigen::Matrix<double, 2, 1> &R, bool *is_inside) { |
James Kuszmaul | fb0e0ae | 2014-03-25 07:04:47 -0700 | [diff] [blame] | 14 | if (region.IsInside(R)) { |
Brian Silverman | 6dd2c53 | 2014-03-29 23:34:39 -0700 | [diff] [blame] | 15 | if (is_inside) *is_inside = true; |
James Kuszmaul | fb0e0ae | 2014-03-25 07:04:47 -0700 | [diff] [blame] | 16 | return R; |
| 17 | } |
| 18 | Eigen::Matrix<double, 2, 1> parallel_vector; |
| 19 | Eigen::Matrix<double, 2, 1> perpendicular_vector; |
| 20 | perpendicular_vector = K.transpose().normalized(); |
| 21 | parallel_vector << perpendicular_vector(1, 0), -perpendicular_vector(0, 0); |
| 22 | |
| 23 | aos::controls::HPolytope<1> t_poly( |
| 24 | region.H() * parallel_vector, |
| 25 | region.k() - region.H() * perpendicular_vector * w); |
| 26 | |
| 27 | Eigen::Matrix<double, 1, Eigen::Dynamic> vertices = t_poly.Vertices(); |
| 28 | if (vertices.innerSize() > 0) { |
| 29 | double min_distance_sqr = 0; |
| 30 | Eigen::Matrix<double, 2, 1> closest_point; |
| 31 | for (int i = 0; i < vertices.innerSize(); i++) { |
| 32 | Eigen::Matrix<double, 2, 1> point; |
| 33 | point = parallel_vector * vertices(0, i) + perpendicular_vector * w; |
| 34 | const double length = (R - point).squaredNorm(); |
| 35 | if (i == 0 || length < min_distance_sqr) { |
| 36 | closest_point = point; |
| 37 | min_distance_sqr = length; |
| 38 | } |
| 39 | } |
Brian Silverman | 6dd2c53 | 2014-03-29 23:34:39 -0700 | [diff] [blame] | 40 | if (is_inside) *is_inside = true; |
James Kuszmaul | fb0e0ae | 2014-03-25 07:04:47 -0700 | [diff] [blame] | 41 | return closest_point; |
| 42 | } else { |
| 43 | Eigen::Matrix<double, 2, Eigen::Dynamic> region_vertices = |
| 44 | region.Vertices(); |
Brian Silverman | 4e1b066 | 2016-01-31 18:03:19 -0500 | [diff] [blame^] | 45 | CHECK_GT(region_vertices.outerSize(), 0); |
James Kuszmaul | fb0e0ae | 2014-03-25 07:04:47 -0700 | [diff] [blame] | 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 Silverman | 6dd2c53 | 2014-03-29 23:34:39 -0700 | [diff] [blame] | 56 | if (is_inside) *is_inside = false; |
James Kuszmaul | f63b0ae | 2014-03-25 16:52:11 -0700 | [diff] [blame] | 57 | return (Eigen::Matrix<double, 2, 1>() << region_vertices(0, closest_i), |
| 58 | region_vertices(1, closest_i)).finished(); |
James Kuszmaul | fb0e0ae | 2014-03-25 07:04:47 -0700 | [diff] [blame] | 59 | } |
| 60 | } |
| 61 | |
| 62 | } // namespace control_loops |
| 63 | } // namespace frc971 |