2 changed files with 324 additions and 0 deletions
@ -0,0 +1,175 @@
@@ -0,0 +1,175 @@
|
||||
/****************************************************************************
|
||||
* |
||||
* Copyright (c) 2015 PX4 Development Team. All rights reserved. |
||||
* |
||||
* Redistribution and use in source and binary forms, with or without |
||||
* modification, are permitted provided that the following conditions |
||||
* are met: |
||||
* |
||||
* 1. Redistributions of source code must retain the above copyright |
||||
* notice, this list of conditions and the following disclaimer. |
||||
* 2. Redistributions in binary form must reproduce the above copyright |
||||
* notice, this list of conditions and the following disclaimer in |
||||
* the documentation and/or other materials provided with the |
||||
* distribution. |
||||
* 3. Neither the name PX4 nor the names of its contributors may be |
||||
* used to endorse or promote products derived from this software |
||||
* without specific prior written permission. |
||||
* |
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS |
||||
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE |
||||
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, |
||||
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, |
||||
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS |
||||
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED |
||||
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
||||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN |
||||
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
||||
* POSSIBILITY OF SUCH DAMAGE. |
||||
* |
||||
****************************************************************************/ |
||||
|
||||
/**
|
||||
* @file data_validator.h |
||||
* |
||||
* A data validation class to identify anomalies in data streams |
||||
* |
||||
* @author Lorenz Meier <lorenz@px4.io> |
||||
*/ |
||||
|
||||
#pragma once |
||||
|
||||
class DataValidator { |
||||
public: |
||||
DataValidator(DataValidator *prev_sibling = nullptr); |
||||
virtual ~DataValidator(); |
||||
|
||||
/**
|
||||
* Put an item into the validator. |
||||
* |
||||
* @param val Item to put |
||||
*/ |
||||
void put(uint64_t timestamp, float val[3], uint64_t error_count); |
||||
|
||||
/**
|
||||
* Get the next sibling in the group |
||||
* |
||||
* @return the next sibling |
||||
*/ |
||||
DataValidator* sibling() { return _sibling; } |
||||
|
||||
/**
|
||||
* Get the confidence of this validator |
||||
* @return the confidence between 0 and 1 |
||||
*/ |
||||
float confidence(uint64_t timestamp); |
||||
|
||||
/**
|
||||
* Get the value of this validator |
||||
* @return the stored value |
||||
*/ |
||||
float* value() { return _value; } |
||||
|
||||
/**
|
||||
* Print the validator value |
||||
* |
||||
*/ |
||||
void print(); |
||||
|
||||
private: |
||||
static const unsigned _dimensions = 3; |
||||
uint64_t _time_last; /**< last timestamp */ |
||||
uint64_t _timeout_interval; /**< interval in which the datastream times out in us */ |
||||
uint64_t _event_count; /**< total data counter */ |
||||
uint64_t _error_count; /**< error count */ |
||||
float _mean[_dimensions]; /**< mean of value */ |
||||
float _lp[3]; /**< low pass value */ |
||||
float _M2[3]; /**< RMS component value */ |
||||
float _rms[3]; /**< root mean square error */ |
||||
float _value[3]; /**< last value */ |
||||
DataValidator *_sibling; /**< sibling in the group */ |
||||
const unsigned _noreturn_errcount = 1000; /**< if the error count reaches this value, return sensor as invalid */ |
||||
|
||||
/* we don't want this class to be copied */ |
||||
DataValidator(const DataValidator&); |
||||
DataValidator operator=(const DataValidator&); |
||||
}; |
||||
|
||||
DataValidator::DataValidator(DataValidator *prev_sibling) : |
||||
_time_last(0), |
||||
_timeout_interval(50000), |
||||
_event_count(0), |
||||
_error_count(0), |
||||
_mean{0.0f}, |
||||
_lp{0.0f}, |
||||
_M2{0.0f}, |
||||
_rms{0.0f}, |
||||
_value{0.0f}, |
||||
_sibling(prev_sibling) |
||||
{ |
||||
|
||||
} |
||||
|
||||
DataValidator::~DataValidator() |
||||
{ |
||||
|
||||
} |
||||
|
||||
void |
||||
DataValidator::put(uint64_t timestamp, float val[3], uint64_t error_count) |
||||
{ |
||||
_event_count++; |
||||
_error_count = error_count; |
||||
|
||||
for (unsigned i = 0; i < _dimensions; i++) { |
||||
if (_time_last == 0) { |
||||
_mean[i] = val[i]; |
||||
_lp[i] = val[i]; |
||||
_M2[i] = 0; |
||||
} else { |
||||
float lp_val = val[i] - _lp[i]; |
||||
|
||||
float delta_val = lp_val - _mean[i]; |
||||
_mean[i] += delta_val / _event_count; |
||||
_M2[i] += delta_val * (lp_val - _mean[i]); |
||||
_rms[i] = sqrtf(_M2[i] / (_event_count - 1)); |
||||
} |
||||
|
||||
// XXX replace with better filter, make it auto-tune to update rate
|
||||
_lp[i] = _lp[i] * 0.95f + val[i] * 0.05f; |
||||
|
||||
_value[i] = val[i]; |
||||
} |
||||
|
||||
_time_last = timestamp; |
||||
} |
||||
|
||||
float |
||||
DataValidator::confidence(uint64_t timestamp) |
||||
{ |
||||
/* check error count limit */ |
||||
if (_error_count > _noreturn_errcount) { |
||||
return 0.0f; |
||||
} |
||||
|
||||
/* timed out - that's it */ |
||||
if (timestamp - _time_last > _timeout_interval) { |
||||
return 0.0f; |
||||
} |
||||
|
||||
// XXX work out scaling between confidence and RMS
|
||||
//return _rms / _mean;
|
||||
|
||||
return 1.0f; |
||||
} |
||||
|
||||
void |
||||
DataValidator::print() |
||||
{ |
||||
for (unsigned i = 0; i < _dimensions; i++) { |
||||
printf("\tmean: %8.4f lp: %8.4f RMS: %8.4f\n", |
||||
(double)(_lp[i] + _mean[i]), (double)_lp[i], (double)_rms[i]); |
||||
} |
||||
} |
@ -0,0 +1,149 @@
@@ -0,0 +1,149 @@
|
||||
/****************************************************************************
|
||||
* |
||||
* Copyright (c) 2015 PX4 Development Team. All rights reserved. |
||||
* |
||||
* Redistribution and use in source and binary forms, with or without |
||||
* modification, are permitted provided that the following conditions |
||||
* are met: |
||||
* |
||||
* 1. Redistributions of source code must retain the above copyright |
||||
* notice, this list of conditions and the following disclaimer. |
||||
* 2. Redistributions in binary form must reproduce the above copyright |
||||
* notice, this list of conditions and the following disclaimer in |
||||
* the documentation and/or other materials provided with the |
||||
* distribution. |
||||
* 3. Neither the name PX4 nor the names of its contributors may be |
||||
* used to endorse or promote products derived from this software |
||||
* without specific prior written permission. |
||||
* |
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS |
||||
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE |
||||
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, |
||||
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, |
||||
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS |
||||
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED |
||||
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
||||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN |
||||
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
||||
* POSSIBILITY OF SUCH DAMAGE. |
||||
* |
||||
****************************************************************************/ |
||||
|
||||
/**
|
||||
* @file data_validator_group.h |
||||
* |
||||
* A data validation group to identify anomalies in data streams |
||||
* |
||||
* @author Lorenz Meier <lorenz@px4.io> |
||||
*/ |
||||
|
||||
#pragma once |
||||
|
||||
#include "data_validator.h" |
||||
|
||||
class DataValidatorGroup { |
||||
public: |
||||
DataValidatorGroup(unsigned siblings); |
||||
virtual ~DataValidatorGroup(); |
||||
|
||||
/**
|
||||
* Put an item into the validator group. |
||||
* |
||||
* @param x X Item to put |
||||
* @param y Y Item to put |
||||
* @param z Z Item to put |
||||
*/ |
||||
void put(unsigned index, uint64_t timestamp, |
||||
float val[3], uint64_t error_count); |
||||
|
||||
/**
|
||||
* Get the best data triplet of the group |
||||
* |
||||
* @return pointer to the array of best values |
||||
*/ |
||||
float* get_best(uint64_t timestamp, int *index); |
||||
|
||||
/**
|
||||
* Print the validator value |
||||
* |
||||
*/ |
||||
void print(); |
||||
|
||||
private: |
||||
DataValidator *_first; /**< sibling in the group */ |
||||
|
||||
/* we don't want this class to be copied */ |
||||
DataValidatorGroup(const DataValidatorGroup&); |
||||
DataValidatorGroup operator=(const DataValidatorGroup&); |
||||
}; |
||||
|
||||
DataValidatorGroup::DataValidatorGroup(unsigned siblings) : |
||||
_first(nullptr) |
||||
{ |
||||
DataValidator *next = _first; |
||||
|
||||
for (unsigned i = 0; i < siblings; i++) { |
||||
next = new DataValidator(next); |
||||
} |
||||
} |
||||
|
||||
DataValidatorGroup::~DataValidatorGroup() |
||||
{ |
||||
|
||||
} |
||||
|
||||
void |
||||
DataValidatorGroup::put(unsigned index, uint64_t timestamp, float val[3], uint64_t error_count) |
||||
{ |
||||
DataValidator *next = _first; |
||||
unsigned i = 0; |
||||
|
||||
while (next != nullptr) { |
||||
if (i == index) { |
||||
next->put(timestamp, val, error_count); |
||||
break; |
||||
} |
||||
next = next->sibling(); |
||||
i++; |
||||
} |
||||
} |
||||
|
||||
float* |
||||
DataValidatorGroup::get_best(uint64_t timestamp, int *index) |
||||
{ |
||||
DataValidator *next = _first; |
||||
|
||||
// XXX This should eventually also include voting
|
||||
float max_confidence = 0.0f; |
||||
int max_index = -1; |
||||
DataValidator *best = nullptr; |
||||
|
||||
unsigned i = 0; |
||||
|
||||
while (next != nullptr) { |
||||
float confidence = next->confidence(timestamp); |
||||
if (confidence > max_confidence) { |
||||
max_index = i; |
||||
max_confidence = confidence; |
||||
best = next; |
||||
} |
||||
next = next->sibling(); |
||||
i++; |
||||
} |
||||
|
||||
*index = max_index; |
||||
return (best) ? best->value() : nullptr; |
||||
} |
||||
|
||||
void |
||||
DataValidatorGroup::print() |
||||
{ |
||||
DataValidator *next = _first; |
||||
|
||||
while (next != nullptr) { |
||||
next->print(); |
||||
next = next->sibling(); |
||||
} |
||||
} |
Loading…
Reference in new issue