Austin Schuh | acd335a | 2017-01-01 16:20:54 -0800 | [diff] [blame] | 1 | #ifndef FRC971_CONTROL_LOOPS_RUNGE_KUTTA_H_ |
| 2 | #define FRC971_CONTROL_LOOPS_RUNGE_KUTTA_H_ |
| 3 | |
| 4 | #include <Eigen/Dense> |
| 5 | |
Stephan Pleines | d99b1ee | 2024-02-02 20:56:44 -0800 | [diff] [blame^] | 6 | namespace frc971::control_loops { |
Austin Schuh | acd335a | 2017-01-01 16:20:54 -0800 | [diff] [blame] | 7 | |
| 8 | // Implements Runge Kutta integration (4th order). fn is the function to |
| 9 | // integrate. It must take 1 argument of type T. The integration starts at an |
| 10 | // initial value X, and integrates for dt. |
| 11 | template <typename F, typename T> |
| 12 | T RungeKutta(const F &fn, T X, double dt) { |
| 13 | const double half_dt = dt * 0.5; |
Austin Schuh | 92ebcbb | 2018-01-23 11:17:08 -0800 | [diff] [blame] | 14 | T k1 = fn(X); |
| 15 | T k2 = fn(X + half_dt * k1); |
| 16 | T k3 = fn(X + half_dt * k2); |
| 17 | T k4 = fn(X + dt * k3); |
Austin Schuh | acd335a | 2017-01-01 16:20:54 -0800 | [diff] [blame] | 18 | return X + dt / 6.0 * (k1 + 2.0 * k2 + 2.0 * k3 + k4); |
| 19 | } |
| 20 | |
milind-u | e53bf55 | 2021-12-11 14:42:00 -0800 | [diff] [blame] | 21 | // Implements Runge Kutta integration (4th order) split up into steps steps. fn |
| 22 | // is the function to integrate. It must take 1 argument of type T. The |
| 23 | // integration starts at an initial value X, and integrates for dt. |
| 24 | template <typename F, typename T> |
| 25 | T RungeKuttaSteps(const F &fn, T X, double dt, int steps) { |
| 26 | dt = dt / steps; |
| 27 | for (int i = 0; i < steps; ++i) { |
| 28 | X = RungeKutta(fn, X, dt); |
| 29 | } |
| 30 | return X; |
| 31 | } |
| 32 | |
Austin Schuh | f746673 | 2023-02-20 22:11:41 -0800 | [diff] [blame] | 33 | // Implements Runge Kutta integration (4th order). This integrates dy/dt = |
| 34 | // fn(t, y). It must have the call signature of fn(double t, T y). The |
Austin Schuh | ca52a24 | 2018-12-23 09:19:29 +1100 | [diff] [blame] | 35 | // integration starts at an initial value y, and integrates for dt. |
| 36 | template <typename F, typename T> |
| 37 | T RungeKutta(const F &fn, T y, double t, double dt) { |
| 38 | const double half_dt = dt * 0.5; |
| 39 | T k1 = dt * fn(t, y); |
| 40 | T k2 = dt * fn(t + half_dt, y + k1 / 2.0); |
| 41 | T k3 = dt * fn(t + half_dt, y + k2 / 2.0); |
| 42 | T k4 = dt * fn(t + dt, y + k3); |
| 43 | |
| 44 | return y + (k1 + 2.0 * k2 + 2.0 * k3 + k4) / 6.0; |
| 45 | } |
| 46 | |
Austin Schuh | f746673 | 2023-02-20 22:11:41 -0800 | [diff] [blame] | 47 | template <typename F, typename T> |
| 48 | T RungeKuttaSteps(const F &fn, T X, double t, double dt, int steps) { |
| 49 | dt = dt / steps; |
| 50 | for (int i = 0; i < steps; ++i) { |
| 51 | X = RungeKutta(fn, X, t + dt * i, dt); |
| 52 | } |
| 53 | return X; |
| 54 | } |
| 55 | |
Austin Schuh | 268a94f | 2018-02-17 17:10:19 -0800 | [diff] [blame] | 56 | // Implements Runge Kutta integration (4th order). fn is the function to |
| 57 | // integrate. It must take 1 argument of type T. The integration starts at an |
| 58 | // initial value X, and integrates for dt. |
| 59 | template <typename F, typename T, typename Tu> |
Austin Schuh | 9edb5df | 2018-12-23 09:03:15 +1100 | [diff] [blame] | 60 | T RungeKuttaU(const F &fn, T X, Tu U, double dt) { |
Austin Schuh | 268a94f | 2018-02-17 17:10:19 -0800 | [diff] [blame] | 61 | const double half_dt = dt * 0.5; |
| 62 | T k1 = fn(X, U); |
| 63 | T k2 = fn(X + half_dt * k1, U); |
| 64 | T k3 = fn(X + half_dt * k2, U); |
| 65 | T k4 = fn(X + dt * k3, U); |
| 66 | return X + dt / 6.0 * (k1 + 2.0 * k2 + 2.0 * k3 + k4); |
| 67 | } |
| 68 | |
Stephan Pleines | d99b1ee | 2024-02-02 20:56:44 -0800 | [diff] [blame^] | 69 | } // namespace frc971::control_loops |
Austin Schuh | acd335a | 2017-01-01 16:20:54 -0800 | [diff] [blame] | 70 | |
| 71 | #endif // FRC971_CONTROL_LOOPS_RUNGE_KUTTA_H_ |