Austin Schuh | a647d60 | 2018-02-18 14:05:15 -0800 | [diff] [blame] | 1 | #include "frc971/control_loops/jacobian.h" |
| 2 | |
| 3 | #include "gtest/gtest.h" |
| 4 | |
Stephan Pleines | f63bde8 | 2024-01-13 15:59:33 -0800 | [diff] [blame] | 5 | namespace frc971::control_loops::testing { |
Austin Schuh | a647d60 | 2018-02-18 14:05:15 -0800 | [diff] [blame] | 6 | |
| 7 | ::Eigen::Matrix<double, 4, 4> A = (::Eigen::Matrix<double, 4, 4>() << 1, 2, 4, |
Philipp Schrader | 790cb54 | 2023-07-05 21:06:52 -0700 | [diff] [blame] | 8 | 1, 5, 2, 3, 4, 5, 1, 3, 2, 1, 1, 3, 7) |
| 9 | .finished(); |
Austin Schuh | a647d60 | 2018-02-18 14:05:15 -0800 | [diff] [blame] | 10 | |
| 11 | ::Eigen::Matrix<double, 4, 2> B = |
| 12 | (::Eigen::Matrix<double, 4, 2>() << 1, 1, 2, 1, 3, 2, 3, 7).finished(); |
| 13 | |
| 14 | // Function to recover A and B from. |
| 15 | ::Eigen::Matrix<double, 4, 1> AxBufn(const ::Eigen::Matrix<double, 4, 1> &X, |
| 16 | const ::Eigen::Matrix<double, 2, 1> &U) { |
| 17 | return A * X + B * U; |
| 18 | } |
| 19 | |
| 20 | // Test that we can recover A from AxBufn pretty accurately. |
| 21 | TEST(RungeKuttaTest, Ax) { |
| 22 | ::Eigen::Matrix<double, 4, 4> NewA = |
| 23 | NumericalJacobianX<4, 2>(AxBufn, ::Eigen::Matrix<double, 4, 1>::Zero(), |
| 24 | ::Eigen::Matrix<double, 2, 1>::Zero()); |
| 25 | EXPECT_TRUE(NewA.isApprox(A)); |
| 26 | } |
| 27 | |
| 28 | // Test that we can recover B from AxBufn pretty accurately. |
| 29 | TEST(RungeKuttaTest, Bu) { |
| 30 | ::Eigen::Matrix<double, 4, 2> NewB = |
| 31 | NumericalJacobianU<4, 2>(AxBufn, ::Eigen::Matrix<double, 4, 1>::Zero(), |
| 32 | ::Eigen::Matrix<double, 2, 1>::Zero()); |
| 33 | EXPECT_TRUE(NewB.isApprox(B)); |
| 34 | } |
| 35 | |
Stephan Pleines | f63bde8 | 2024-01-13 15:59:33 -0800 | [diff] [blame] | 36 | } // namespace frc971::control_loops::testing |