Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 1 | #ifndef FRC971_ZEROING_AVERAGER_H_ |
| 2 | #define FRC971_ZEROING_AVERAGER_H_ |
| 3 | |
| 4 | #include <algorithm> |
| 5 | #include <array> |
| 6 | #include <stdint.h> |
| 7 | |
James Kuszmaul | d3f9eb2 | 2020-01-12 15:02:07 -0800 | [diff] [blame] | 8 | #include "Eigen/Dense" |
| 9 | #include "glog/logging.h" |
| 10 | |
Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 11 | namespace frc971 { |
| 12 | namespace zeroing { |
| 13 | |
| 14 | // Averages a set of given numbers. Numbers are given one at a time. Once full |
| 15 | // the average may be requested. |
James Kuszmaul | d3f9eb2 | 2020-01-12 15:02:07 -0800 | [diff] [blame] | 16 | // TODO(james): Look at deduplicating this with some of the work in the |
| 17 | // MoveDetector. |
| 18 | template <typename Scalar, size_t num_samples, int rows_per_sample = 1> |
Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 19 | class Averager { |
| 20 | public: |
James Kuszmaul | d3f9eb2 | 2020-01-12 15:02:07 -0800 | [diff] [blame] | 21 | typedef Eigen::Matrix<Scalar, rows_per_sample, 1> Vector; |
Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 22 | // Adds one data point to the set of data points to be averaged. |
James Kuszmaul | d3f9eb2 | 2020-01-12 15:02:07 -0800 | [diff] [blame] | 23 | // If more than "num_samples" samples are added, they will start overwriting |
Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 24 | // the oldest ones. |
James Kuszmaul | d3f9eb2 | 2020-01-12 15:02:07 -0800 | [diff] [blame] | 25 | void AddData(Scalar data) { |
| 26 | CHECK_EQ(1, rows_per_sample); |
| 27 | AddData(Vector(data)); |
| 28 | } |
| 29 | void AddData(const Vector &data) { |
Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 30 | data_[data_point_index_] = data; |
James Kuszmaul | d3f9eb2 | 2020-01-12 15:02:07 -0800 | [diff] [blame] | 31 | num_data_points_ = std::min(num_samples, num_data_points_ + 1); |
| 32 | data_point_index_ = (data_point_index_ + 1) % num_samples; |
Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 33 | } |
| 34 | |
| 35 | // Returns the average of the data points. |
James Kuszmaul | d3f9eb2 | 2020-01-12 15:02:07 -0800 | [diff] [blame] | 36 | Vector GetAverage() const { |
Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 37 | if (num_data_points_ == 0) { |
James Kuszmaul | d3f9eb2 | 2020-01-12 15:02:07 -0800 | [diff] [blame] | 38 | return Vector::Zero(); |
Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 39 | } |
| 40 | |
James Kuszmaul | d3f9eb2 | 2020-01-12 15:02:07 -0800 | [diff] [blame] | 41 | Vector average; |
| 42 | average.setZero(); |
| 43 | for (const Vector &data : data_) { |
Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 44 | average += data; |
| 45 | } |
| 46 | return average / num_data_points_; |
| 47 | } |
| 48 | |
James Kuszmaul | d3f9eb2 | 2020-01-12 15:02:07 -0800 | [diff] [blame] | 49 | // Return the difference between the min and max values in the data buffer. |
| 50 | Scalar GetRange() const { |
| 51 | if (num_data_points_ == 0) { |
| 52 | return 0.0; |
| 53 | } |
| 54 | Vector min_value; |
| 55 | min_value.setConstant(std::numeric_limits<Scalar>::max()); |
| 56 | Vector max_value; |
| 57 | max_value.setConstant(std::numeric_limits<Scalar>::lowest()); |
| 58 | // The array will always fill up starting at zero, so we can iterate from |
| 59 | // zero safely. |
| 60 | for (size_t ii = 0; ii < num_data_points_; ++ii) { |
| 61 | const Vector &value = data_[ii]; |
| 62 | min_value = min_value.cwiseMin(value); |
| 63 | max_value = max_value.cwiseMax(value); |
| 64 | } |
| 65 | return (max_value - min_value).maxCoeff(); |
| 66 | } |
Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 67 | |
James Kuszmaul | d3f9eb2 | 2020-01-12 15:02:07 -0800 | [diff] [blame] | 68 | void Reset() { |
| 69 | num_data_points_ = 0; |
| 70 | data_point_index_ = 0; |
| 71 | } |
| 72 | |
| 73 | // Returns true when we've gathered num_samples data points. |
| 74 | bool full() const { return num_data_points_ >= num_samples; }; |
| 75 | |
| 76 | size_t size() const { return num_samples; } |
Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 77 | |
| 78 | private: |
| 79 | // Data points to be averaged. |
James Kuszmaul | d3f9eb2 | 2020-01-12 15:02:07 -0800 | [diff] [blame] | 80 | std::array<Vector, num_samples> data_; |
Philipp Schrader | 29d54f2 | 2016-04-02 22:14:48 +0000 | [diff] [blame] | 81 | // Which data point in "data_" will be filled in next. |
| 82 | size_t data_point_index_ = 0; |
| 83 | // Number of data points added via AddData(). |
| 84 | size_t num_data_points_ = 0; |
| 85 | }; |
| 86 | |
| 87 | } // namespace zeroing |
| 88 | } // namespace frc971 |
| 89 | |
| 90 | #endif // FRC971_ZEROING_AVERAGER_H_ |